{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:14:48Z","timestamp":1758824088524},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"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":["Pattern Recognition"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0031-3203(01)00052-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:56:44Z","timestamp":1027591004000},"page":"421-434","source":"Crossref","is-referenced-by-count":9,"title":["Moment-based methods for polygonal approximation of digitized curves"],"prefix":"10.1016","volume":"35","author":[{"given":"H.Z.","family":"Shu","sequence":"first","affiliation":[]},{"given":"L.M.","family":"Luo","sequence":"additional","affiliation":[]},{"given":"J.D.","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"X.D.","family":"Bao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0031-3203(01)00052-8_BIB1","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TC.1972.5008948","article-title":"Minimum perimeter polygons of digitized silhouettes","volume":"21","author":"Sklansky","year":"1972","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/S0031-3203(01)00052-8_BIB2","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0031-3203(80)90031-X","article-title":"Fast polygonal approximation of digitized curves","volume":"12","author":"Sklansky","year":"1980","journal-title":"Pattern Recognition"},{"issue":"8","key":"10.1016\/S0031-3203(01)00052-8_BIB3","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1109\/TC.1977.1674918","article-title":"Polygonal approximations by Newton's method","volume":"26","author":"Pavlidis","year":"1977","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0031-3203(01)00052-8_BIB4","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1016\/0146-664X(78)90055-2","article-title":"An efficient algorithm for the piecewise linear approximation of plane curves","volume":"8","author":"Williams","year":"1978","journal-title":"Comput. Graph. Image Process"},{"issue":"4","key":"10.1016\/S0031-3203(01)00052-8_BIB5","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/0146-664X(81)90047-2","article-title":"Bounded straight-line approximation of digitized planar curves and lines","volume":"16","author":"Williams","year":"1981","journal-title":"Comput. Graph. Image Process"},{"key":"10.1016\/S0031-3203(01)00052-8_BIB6","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0734-189X(85)90117-3","article-title":"A data reduction algorithm for planar curves","volume":"29","author":"Roberg\u00e9","year":"1985","journal-title":"Comput. Graph. Image Process"},{"key":"10.1016\/S0031-3203(01)00052-8_BIB7","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/S0734-189X(84)80023-7","article-title":"Afast sequential method for polygonal approximation of digitized curves","volume":"28","author":"Wall","year":"1984","journal-title":"Comput. Graph. Image Process"},{"key":"10.1016\/S0031-3203(01)00052-8_BIB8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/TPAMI.1986.4767753","article-title":"Optimum uniform piecewise linear approximation of planar curves","volume":"8","author":"Dunham","year":"1986","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"10.1016\/S0031-3203(01)00052-8_BIB9","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1016\/0031-3203(93)90106-7","article-title":"Determination of optimal polygon from digital curves using L1 norm","volume":"26","author":"Ray","year":"1993","journal-title":"Pattern Recognition"},{"issue":"2","key":"10.1016\/S0031-3203(01)00052-8_BIB10","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1006\/gmip.1997.0419","article-title":"Space-efficient outlines from image data via vertex minimization and grid constraints","volume":"59","author":"Hobby","year":"1997","journal-title":"Comput. Graph. Image Process"},{"issue":"7","key":"10.1016\/S0031-3203(01)00052-8_BIB11","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1016\/0031-3203(95)00153-0","article-title":"Equilateral polygon approximation of closed contours","volume":"29","author":"Rannou","year":"1996","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(01)00052-8_BIB12","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1016\/S0031-3203(96)00105-7","article-title":"Polygonal approximation of digital curves based on the principal of perceptual organization","volume":"30","author":"Hu","year":"1997","journal-title":"Pattern Recognition"},{"issue":"8","key":"10.1016\/S0031-3203(01)00052-8_BIB13","doi-asserted-by":"crossref","first-page":"1409","DOI":"10.1016\/S0031-3203(98)00173-3","article-title":"Polygonal approximation using genetic algorithms","volume":"32","author":"Huang","year":"1999","journal-title":"Pattern Recognition"},{"issue":"4","key":"10.1016\/S0031-3203(01)00052-8_BIB14","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/0031-3203(93)90103-4","article-title":"New polygonal approximation schemes for object shape representation","volume":"26","author":"Wu","year":"1993","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(01)00052-8_BIB15","series-title":"Digital image processing","author":"Gonzalez","year":"1992"},{"issue":"5","key":"10.1016\/S0031-3203(01)00052-8_BIB16","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1016\/1049-9652(92)90027-U","article-title":"A survey of moment-based techniques for unoccluded object representation and recognition","volume":"54","author":"Prokop","year":"1992","journal-title":"CVGIP: Graphical Models Image Process."},{"issue":"2","key":"10.1016\/S0031-3203(01)00052-8_BIB17","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0031-3203(93)90038-X","article-title":"Orthogonal moment operators for subpixel edge detection","volume":"26","author":"Ghosal","year":"1993","journal-title":"Pattern Recognition"},{"issue":"7","key":"10.1016\/S0031-3203(01)00052-8_BIB18","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1109\/10.237699","article-title":"A moment-based three-dimensional edge operator","volume":"40","author":"Luo","year":"1993","journal-title":"IEEE Trans. Biomed. Eng."},{"issue":"8","key":"10.1016\/S0031-3203(01)00052-8_BIB19","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1016\/0031-3203(91)90047-9","article-title":"Simple and fast computation of moments","volume":"24","author":"Jiang","year":"1991","journal-title":"Pattern Recognition"},{"issue":"2","key":"10.1016\/S0031-3203(01)00052-8_BIB20","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/S0031-3203(99)00044-8","article-title":"A new fast method for computing Legendre moments","volume":"33","author":"Shu","year":"2000","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(01)00052-8_BIB21","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1109\/34.9115","volume":"10","author":"Reeves","year":"1988","journal-title":"Three-dimensional shape analysis using moments and Fourier descriptors. IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320301000528?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320301000528?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T14:24:59Z","timestamp":1556893499000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320301000528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0031320301000528"],"URL":"https:\/\/doi.org\/10.1016\/s0031-3203(01)00052-8","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}