{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T10:43:16Z","timestamp":1749724996840},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"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":[[1995,3]]},"DOI":"10.1016\/0031-3203(94)00101-q","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T22:21:32Z","timestamp":1052778092000},"page":"361-372","source":"Crossref","is-referenced-by-count":12,"title":["Chain code probabilities and optimal length estimators for digitized three-dimensional curves"],"prefix":"10.1016","volume":"28","author":[{"given":"Nahum","family":"Kiryati","sequence":"first","affiliation":[]},{"given":"Olaf","family":"K\u00fcbler","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0031-3203(94)00101-Q_BIB1","doi-asserted-by":"crossref","first-page":"1623","DOI":"10.1016\/0031-3203(93)90018-R","article-title":"Estimating shortest paths and minimal distances on digitized three-dimensional surfaces","volume":"26","author":"Kiryati","year":"1993","journal-title":"Pattern Recognition"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1145\/356625.356627","article-title":"Computer processing of line-drawing images","volume":"6","author":"Freeman","year":"1974","journal-title":"Comput. Surveys"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB3","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1109\/TPAMI.1981.4767075","article-title":"On the performance of chain codes for quantization of line drawings","volume":"3","author":"Koplowitz","year":"1981","journal-title":"IEEE Trans. Pattern Analysis Machine Intelligence"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB4","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1109\/TSSC.1969.300247","article-title":"On the quantization of line drawing data","volume":"5","author":"Freeman","year":"1969","journal-title":"IEEE Trans. System Science and Cybernetics"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0167-8655(90)90007-O","article-title":"Estimation of length for digitized straight lines in three dimensions","volume":"11","author":"Amarunnishad","year":"1990","journal-title":"Pattern Recognition Letters"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB6","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/0031-3203(92)90032-E","article-title":"Estimation of the original length of a straight line segment from its digitization in three dimensions","volume":"25","author":"Chattopadhyay","year":"1992","journal-title":"Pattern Recognition"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB7_1","article-title":"On chain code probabilities and length estimators for digitized three dimensional curves","author":"Kiryati","year":"1991"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB7_2","series-title":"Proc. 11th ICPR","first-page":"259","article-title":"On chain code probabilities and length estimators for digitized three dimensional curves","author":"Kiryati","year":"1992"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB8","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1109\/34.24795","article-title":"Design of perimeter estimators for digitized planar shapes","volume":"11","author":"Koplowitz","year":"1989","journal-title":"IEEE Trans. Pattern Analysis Machine Intelligence"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB9","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/S0146-664X(78)80005-7","article-title":"Freeman-code probabilities of object boundary quantized contours","volume":"7","author":"Groen","year":"1978","journal-title":"Computer Graphics Image Processing"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB10","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/S0146-664X(77)80021-X","article-title":"Area and perimeter of blobs in discrete binary pictures","volume":"6","author":"Kulpa","year":"1977","journal-title":"Computer Graphics Image Processing"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB11","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/S0146-664X(79)80041-6","article-title":"Metrication errors and coding efficiency of chain-encoding schemes for the representation of lines and edges","volume":"10","author":"Proflitt","year":"1979","journal-title":"Computer Graphics Image Processing"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB12","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0146-664X(82)90057-0","article-title":"Vectors code probability and metrication error in the representation of straight lines of finite length","volume":"20","author":"Vossepoel","year":"1982","journal-title":"Computer Graphics Image Processing"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB13","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0734-189X(87)80145-7","article-title":"Length estimators for digitized contours","volume":"40","author":"Dorst","year":"1987","journal-title":"Computer Vision Graphics Image Processing"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB14","doi-asserted-by":"crossref","DOI":"10.1090\/conm\/119\/1113896","article-title":"Self-similarity properties of digital straight lines","volume":"119","author":"Bruckstein","year":"1991","journal-title":"Contemporary Mathematics"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB15","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0146-664X(81)90015-0","article-title":"A new and fast algorithm for estimating the perimeter of objects for industrial vision tasks","volume":"17","author":"Wechsler","year":"1981","journal-title":"Computer Graphics Image Processing"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB16","series-title":"Proceedings of the 2nd International Workshop on Visual Form","article-title":"Digital representation of 3-D curves: survey and analysis","author":"Jonas","year":"1994"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB17","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/0167-8655(91)90004-6","article-title":"Local distances for distance transformations in two and three dimensions","volume":"12","author":"Verwer","year":"1991","journal-title":"Pattern Recognition Letters"},{"key":"10.1016\/0031-3203(94)00101-Q_BIB18","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/1049-9660(92)90027-Z","article-title":"Optimization of length measurements for isotropic distance transformations in three dimensions","volume":"55","author":"Beckers","year":"1992","journal-title":"CVGIP: Image Understanding"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:003132039400101Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:003132039400101Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T16:56:14Z","timestamp":1557075374000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/003132039400101Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["003132039400101Q"],"URL":"https:\/\/doi.org\/10.1016\/0031-3203(94)00101-q","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}