{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T09:59:25Z","timestamp":1760954365902},"reference-count":20,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"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 Letters"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1016\/s0167-8655(98)00082-8","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T08:06:40Z","timestamp":1051258000000},"page":"1017-1026","source":"Crossref","is-referenced-by-count":47,"title":["A new method for polygonal approximation using genetic algorithms"],"prefix":"10.1016","volume":"19","author":[{"given":"Peng-Yeng","family":"Yin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8655(98)00082-8_BIB1","doi-asserted-by":"crossref","unstructured":"Ansari, N., Delp, E.J., 1991. On detection dominant points. Pattern Recognition 24, 441\u2013450","DOI":"10.1016\/0031-3203(91)90057-C"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB2","doi-asserted-by":"crossref","unstructured":"Gen, M., Cheng, R., 1997. Genetic Algorithms and Engineering Design. Wiley, New York","DOI":"10.1002\/9780470172254"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB3","unstructured":"Goldberg, D.E., 1989. Genetic Algorithms: Search, Optimization and Machine Learning. Addison-Wesley, Reading, MA"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB4","doi-asserted-by":"crossref","unstructured":"Kurozumi, Y., Davis W.A., 1982. Polygonal approximation by the minimax method. Computer Graphics and Image Processing 19, 248\u2013264","DOI":"10.1016\/0146-664X(82)90011-9"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB5","doi-asserted-by":"crossref","unstructured":"Leu, J.-G., Chen, L., 1988. Polygonal approximation of 2-D shapes through boundary merging. Pattern Recognition Letters 7, 231\u2013238","DOI":"10.1016\/0167-8655(88)90107-9"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB6","doi-asserted-by":"crossref","unstructured":"Loncaric, S., Dhawan, A.P., 1995. Near-optimal MST-based shape description using genetic algorithm. Pattern Recognition 28, 571\u2013579","DOI":"10.1016\/0031-3203(94)00121-2"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB7","doi-asserted-by":"crossref","unstructured":"Murthy, C.A., Chowdhury, N., 1996. In search of optimal clusters using genetic algorithms. Pattern Recognition Letters 17, 825\u2013832","DOI":"10.1016\/0167-8655(96)00043-8"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB8","doi-asserted-by":"crossref","unstructured":"Pal, N.R., Nandi, S., Kundu, M.K., 1998. Self crossover: a new genetic operator and its application to feature selection. Internat. J. Systems Sci. 29, 207\u2013212","DOI":"10.1080\/00207729808929513"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB9","doi-asserted-by":"crossref","unstructured":"Pal, S.K., Bhandari, D., Kundu, M.K., 1994. Genetic algorithms for optimal image enhancement. Pattern Recognition Letters 15, 261\u2013271","DOI":"10.1016\/0167-8655(94)90058-2"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB10","doi-asserted-by":"crossref","unstructured":"Phanendra Babu, G., Narashima Murty, M., 1993. A near-optimal initial seed value selection in K-means algorithm using a genetic algorithm. Pattern Recognition Letters 14, 763\u2013769","DOI":"10.1016\/0167-8655(93)90058-L"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB11","doi-asserted-by":"crossref","unstructured":"Phillips, T.-Y., Rosenfeld, A., 1988. An ISODATA algorithm for straight line fitting. Pattern Recognition Letters 7, 291\u2013297","DOI":"10.1016\/0167-8655(88)90069-4"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB12","doi-asserted-by":"crossref","unstructured":"Ray, B.K., Ray, K.S., 1992. An algorithm for detection of dominant points and polygonal approximation of digitized curves. Pattern Recognition Letters 13, 849\u2013856","DOI":"10.1016\/0167-8655(92)90084-D"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB13","doi-asserted-by":"crossref","unstructured":"Ray, B.K., Ray, K.S., 1993. Determination of optimal polygon from digital curve using L1 norm. Pattern Recognition 26, 505\u2013509","DOI":"10.1016\/0031-3203(93)90106-7"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB14","doi-asserted-by":"crossref","unstructured":"Singh, M., Chatterjee, A., Chaudhury, S., 1997. Matching structural shape descriptions using genetic algorithms. Pattern Recognition 30, 1451\u20131462","DOI":"10.1016\/S0031-3203(96)00181-1"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB15","doi-asserted-by":"crossref","unstructured":"Sklansky, J., Gonzalez, V., 1980. Fast polygonal approximation of digitized curves. Pattern Recognition 12, 327\u2013331","DOI":"10.1016\/0031-3203(80)90031-X"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB16","doi-asserted-by":"crossref","unstructured":"Teh, C.H., Chin, R.T., 1989. On the detection of dominant points on digital curves. IEEE Trans. Pattern Anal. Machine Intell. 11, 859\u2013872","DOI":"10.1109\/34.31447"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB17","doi-asserted-by":"crossref","unstructured":"Wall, K., Danielsson, P.E., 1984. A fast sequential method for polygonal approximation of digitized curves. Computer Vision, Graphics, and Image Processing 28, 220\u2013227","DOI":"10.1016\/S0734-189X(84)80023-7"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB18","doi-asserted-by":"crossref","unstructured":"Wu, J.S., Leou, J.J., 1993. New polygonal approximation schemes for object shape representation. Pattern Recognition 26, 471\u2013484","DOI":"10.1016\/0031-3203(93)90103-4"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB19","doi-asserted-by":"crossref","unstructured":"Wu, W.Y., Wang, M.J., 1993. Detecting the dominant points by the curvature-based polygonal approximation. CVGIP: Graphical Models and Image Processing 55, 79\u201388","DOI":"10.1006\/cgip.1993.1006"},{"key":"10.1016\/S0167-8655(98)00082-8_BIB20","doi-asserted-by":"crossref","unstructured":"Yin, P.-Y., 1998. Algorithms for straight line fitting using K-means. Pattern Recognition Letters 19, 31\u201341","DOI":"10.1016\/S0167-8655(97)00154-2"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865598000828?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865598000828?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T05:01:44Z","timestamp":1580274104000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865598000828"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":20,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0167865598000828"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8655(98)00082-8","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}