{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T02:49:22Z","timestamp":1656298162544},"reference-count":10,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. ACM"],"published-print":{"date-parts":[[1970,7]]},"abstract":"\n A syntax-directed picture analysis system based on a formal picture description scheme is described. The system accepts a description of a set of pictures in terms of a grammar generating strings in a picture description language; the grammar is explicitly used to direct the analysis or parse, and to control the calls on pattern classification routines for primitive picture components. Pictures are represented by directed graphs with labeled edges, where the edges denote elementary picture components and the graph connectivity mirrors the picture component connectivity; blank and don't care \u201cpatterns\u201d allow the description of simple relations between visible patterns. The bulk of the paper is concerned with the picture parsing algorithm which is an\n n<\/jats:italic>\n -dimensional analog of a classical top-down string parser, and an application of an implemented system to the analysis of spark chamber film. The potential benefits of this approach, as demonstrated by the application, include ease of implementation and modification of picture processing systems, and simplification of the pattern recognition problem by automatically taking advantage of contextual information.\n <\/jats:p>","DOI":"10.1145\/321592.321597","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:26:13Z","timestamp":1027769173000},"page":"446-452","source":"Crossref","is-referenced-by-count":66,"title":["Nonlinear Regression With Linear Constraints: An Extension of the Magnified Diagonal Method"],"prefix":"10.1145","volume":"17","author":[{"given":"Richard I.","family":"Shrager","sequence":"first","affiliation":[{"name":"Department of Health, Education and Welfare, Division of Computer Research and Technology, National Institutes of Health, Bethesda, Maryland"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1090\/qam\/10666","article-title":"A method for the solution of certain non-linear problems in least squares","volume":"2","author":"LEVENBERG K","year":"1944","journal-title":"Quart. Appl. Math."},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1137\/0111030","article-title":"An algorithm for least-squares determination of non-linear parammeters","volume":"11","author":"MARQUARDT D.W","year":"1963","journal-title":"SIAM J. Appl. Math."},{"key":"e_1_2_1_4_2","series-title":"SIAM J. Appl. Math. 1~ (Sept","volume-title":"On a theorem used in non-linear least squares","author":"MEETER D.A.","year":"1966"},{"key":"e_1_2_1_5_2","first-page":"1","volume-title":"Proc. Jet Propulsion Laboratory Seminar","author":"VIORRISON D. D.","year":"1960"},{"key":"e_1_2_1_6_2","volume-title":"Nonlinear and Dynamic Programming","author":"HADLEY G.","year":"1964"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/nav.3800040113","article-title":"A quadratic programming procedure","volume":"14","author":"HILDRETH C","year":"1957","journal-title":"Nay. Res. Logistics Quart."},{"key":"e_1_2_1_8_2","volume-title":"The capacity method of quadratic programming. Econometrica ~8","author":"HOUTHAKKER H.S.","year":"1960"},{"key":"e_1_2_1_9_2","unstructured":"MARKOWITZ H. Portfolio Selection (Cowles Foundation Monograph No. 16). Wiley New York 1959. MARKOWITZ H. Portfolio Selection (Cowles Foundation Monograph No. 16). Wiley New York 1959."},{"key":"e_1_2_1_10_2","volume-title":"The simplex method for quadratic programming. Econometrica ~7","author":"WOLFE P.","year":"1959"},{"key":"e_1_2_1_11_2","unstructured":"SHRAGER R. A quadratic programming algorithm. (Submitted for publication.) SHRAGER R. A quadratic programming algorithm. (Submitted for publication.)"}],"container-title":["Journal of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/321592.321597","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T17:52:53Z","timestamp":1614707573000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/321592.321597"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1970,7]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1970,7]]}},"alternative-id":["10.1145\/321592.321597"],"URL":"http:\/\/dx.doi.org\/10.1145\/321592.321597","relation":{},"ISSN":["0004-5411","1557-735X"],"issn-type":[{"value":"0004-5411","type":"print"},{"value":"1557-735X","type":"electronic"}],"subject":["Artificial Intelligence","Hardware and Architecture","Information Systems","Control and Systems Engineering","Software"],"published":{"date-parts":[[1970,7]]}}}