{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:16:37Z","timestamp":1726060597569},"publisher-location":"Singapore","reference-count":10,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811501838"},{"type":"electronic","value":"9789811501845"}],"license":[{"start":{"date-parts":[[2019,11,28]],"date-time":"2019-11-28T00:00:00Z","timestamp":1574899200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-15-0184-5_25","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T12:04:06Z","timestamp":1574856246000},"page":"285-291","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Demonstration on Initial Segmentation Step on Closed Digital Planar Curve"],"prefix":"10.1007","author":[{"given":"R.","family":"Mangayarkarasi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Vanitha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"issue":"8","key":"25_CR1","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1109\/34.31447","volume":"11","author":"CH Teh","year":"1989","unstructured":"Teh, C.H., Chin, R.T.: On the detection of dominant points on digital curves. IEEE Trans. Pattern Anal. Mach. Intell. 11(8), 859\u2013872 (1989)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0167-8655(97)00154-2","volume":"19","author":"PY Yin","year":"1998","unstructured":"Yin, P.Y.: Algorithms for straight line fitting using k-means. Pattern Recogn. Lett. 19(1), 31\u201341 (1998)","journal-title":"Pattern Recogn. Lett."},{"issue":"4","key":"25_CR3","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1016\/j.patcog.2006.09.002","volume":"40","author":"A Kolesnikov","year":"2007","unstructured":"Kolesnikov, A., Fr\u00e4nti, P.: Polygonal approximation of closed discrete curves. Pattern Recogn. 40(4), 1282\u20131293 (2007)","journal-title":"Pattern Recogn."},{"unstructured":"Kumar, M.P., Goyal, S., Jawahar, C.V., Narayanan, P.J.: Polygonal approximation of closed curves across multiple views. In: ICVGIP (2002)","key":"25_CR4"},{"unstructured":"Semyonov, P.A.: Optimized unjoined linear approximation and its application for Eog-biosignal processing. In: Engineering in Medicine and Biology Society, 1990., Proceedings of the Twelfth Annual International Conference of the IEEE\u00a0(pp. 779\u2013780). IEEE (1990, November)","key":"25_CR5"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.cam.2017.03.030","volume":"322","author":"M Zygmunt","year":"2017","unstructured":"Zygmunt, M.: Circular arc approximation using polygons. J. Comput. Appl. Math. 322, 81\u201385 (2017)","journal-title":"J. Comput. Appl. Math."},{"issue":"8","key":"25_CR7","doi-asserted-by":"publisher","first-page":"1905","DOI":"10.1016\/j.jvcir.2014.09.012","volume":"25","author":"EJ Aguilera-Aguilera","year":"2014","unstructured":"Aguilera-Aguilera, E.J., Carmona-Poyato, A., Madrid-Cuevas, F.J., Medina-Carnicer, R.: The computation of polygonal approximations for 2D contours based on a concavity tree. J. Vis. Commun. Image Represent. 25(8), 1905\u20131917 (2014)","journal-title":"J. Vis. Commun. Image Represent."},{"issue":"2","key":"25_CR8","first-page":"264","volume":"10","author":"H Freeman","year":"1961","unstructured":"Freeman, H.: On the encoding of arbitrary geometric configurations. IEEE Trans. Electron. Comput. 10(2), 264\u2013268 (1961)","journal-title":"IEEE Trans. Electron. Comput."},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.patcog.2009.06.010","volume":"43","author":"A Carmona-Poyato","year":"2010","unstructured":"Carmona-Poyato, A., Madrid-Cuevas, F.J., Medina-Carnicer, R., Mu\u00f1oz-Salinas, R.: Polygonal approximation of digital planar curves through break point suppression. Pattern Recogn. 43(1), 14\u201325 (2010)","journal-title":"Pattern Recogn."},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.jvcir.2016.05.021","volume":"39","author":"FJ Madrid-Cuevas","year":"2016","unstructured":"Madrid-Cuevas, F.J., Aguilera-Aguilera, E.J., Carmona-Poyato, A., Mu\u00f1oz-Salinas, R., Medina-Carnicer, R., Fern\u00e1ndez-Garc\u00eda, N.L.: An efficient unsupervised method for obtaining polygonal approximations of closed digital planar curves. J. Vis. Commun. Image Represent. 39, 152\u2013163 (2016)","journal-title":"J. Vis. Commun. Image Represent."}],"container-title":["Advances in Intelligent Systems and Computing","Soft Computing for Problem Solving"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-0184-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T12:25:08Z","timestamp":1574857508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-0184-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,28]]},"ISBN":["9789811501838","9789811501845"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-0184-5_25","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,11,28]]},"assertion":[{"value":"28 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}