{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T20:46:51Z","timestamp":1649105211753},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,7,1]],"date-time":"1988-07-01T00:00:00Z","timestamp":583718400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Vision, Graphics, and Image Processing"],"published-print":{"date-parts":[[1988,7]]},"DOI":"10.1016\/0734-189x(88)90044-8","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T03:36:05Z","timestamp":1108611365000},"page":"81-87","source":"Crossref","is-referenced-by-count":1,"title":["Gray level requantization"],"prefix":"10.1016","volume":"43","author":[{"given":"Michael","family":"Werman","sequence":"first","affiliation":[]},{"given":"Shmuel","family":"Peleg","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0734-189X(88)90044-8_BIB1","series-title":"Proceedings, Eighth International Conference on Pattern Recognition","first-page":"1114","article-title":"Halftoning as optimal quantization","author":"Werman","year":"1986"},{"key":"10.1016\/0734-189X(88)90044-8_BIB2","series-title":"Digital Picture Processing","author":"Rosenfeld","year":"1982"},{"key":"10.1016\/0734-189X(88)90044-8_BIB3","doi-asserted-by":"crossref","first-page":"1898","DOI":"10.1109\/TCOM.1981.1094946","article-title":"A survey of techniques for pictorial reproduction","volume":"Comm-29","author":"Stoffel","year":"1981","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/0734-189X(88)90044-8_BIB4","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0734-189X(85)90055-6","article-title":"A distance metric for multidimensional histograms","volume":"32","author":"Werman","year":"1985","journal-title":"Comput. Vision Graphics Image Process."},{"key":"10.1016\/0734-189X(88)90044-8_BIB5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0020-0190(84)90024-3","article-title":"A partioning algorithm for minimum weighted Euclidean matching","volume":"18","author":"Dyer","year":"1984","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0734-189X(88)90044-8_BIB6","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1137\/0212008","article-title":"Divide and conquer heuristics for minimum weighted matching","volume":"12","author":"Supowit","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0734-189X(88)90044-8_BIB7","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1137\/0212009","article-title":"The traveling salesman problem and minimum matching in the unit square for minimum weighted matching","volume":"12","author":"Supowit","year":"1983","journal-title":"SIAM J. Comput."}],"container-title":["Computer Vision, Graphics, and Image Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0734189X88900448?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0734189X88900448?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T16:25:22Z","timestamp":1548692722000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0734189X88900448"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,7]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,7]]}},"alternative-id":["0734189X88900448"],"URL":"https:\/\/doi.org\/10.1016\/0734-189x(88)90044-8","relation":{},"ISSN":["0734-189X"],"issn-type":[{"value":"0734-189X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,7]]}}}