{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:48:38Z","timestamp":1742914118929,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540347118"},{"type":"electronic","value":"9783540347125"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11767978_34","type":"book-chapter","created":{"date-parts":[[2006,10,15]],"date-time":"2006-10-15T11:58:07Z","timestamp":1160913487000},"page":"369-380","source":"Crossref","is-referenced-by-count":5,"title":["Optimal Line and Arc Detection on Run-Length Representations"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Keysers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas M.","family":"Breuel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-45868-9_31","volume-title":"Graphics Recognition. Algorithms and Applications","author":"D. Elliman","year":"2002","unstructured":"Elliman, D.: Tif2vec, an algorithm for arc segmentation in engineering drawings. In: Blostein, D., Kwon, Y.-B. (eds.) GREC 2001. LNCS, vol.\u00a02390, pp. 350\u2013359. Springer, Heidelberg (2002)"},{"key":"34_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-540-25977-0_33","volume-title":"Graphics Recognition. Recent Advances and Perspectives","author":"L. Wenyin","year":"2004","unstructured":"Wenyin, L.: Report of the arc segmentation contest. In: Llad\u00f3s, J., Kwon, Y.-B. (eds.) GREC 2003. LNCS, vol.\u00a03088, pp. 364\u2013367. Springer, Heidelberg (2004)"},{"key":"34_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/3-540-45868-9_30","volume-title":"Graphics Recognition. Algorithms and Applications","author":"L. Wenyin","year":"2002","unstructured":"Wenyin, L., Zhai, J., Dori, D.: Extended summary of the arc segmentation contest. In: Blostein, D., Kwon, Y.-B. (eds.) GREC 2001. LNCS, vol.\u00a02390, pp. 343\u2013349. Springer, Heidelberg (2002)"},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/361237.361242","volume":"15","author":"R.O. Duda","year":"1972","unstructured":"Duda, R.O., Hart, P.E.: Use of the Hough transformation to detect lines and curves in pictures. Communications of the ACM\u00a015, 11\u201315 (1972)","journal-title":"Communications of the ACM"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/s100440050010","volume":"2","author":"L. Wenyin","year":"1999","unstructured":"Wenyin, L., Dori, D.: From raster to vectors: Extracting visual information from line drawings. Pattern Analysis and Applications\u00a02, 10\u201321 (1999)","journal-title":"Pattern Analysis and Applications"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/34.754586","volume":"21","author":"D. Dori","year":"1999","unstructured":"Dori, D., Wenyin, L.: Sparse pixel vectorization: An algorithm and its performance evaluation. IEEE Trans. Pattern Analysis Machine Intelligence\u00a021, 202\u2013215 (1999)","journal-title":"IEEE Trans. Pattern Analysis Machine Intelligence"},{"doi-asserted-by":"crossref","unstructured":"Dosch, P., Masini, G., Tombre, K.: Improving arc detection in graphics reognition. In: International Conference on Pattern Recongition, Barcelona, Spain, vol.\u00a02, pp. 2243\u20132246 (2000)","key":"34_CR7","DOI":"10.1109\/ICPR.2000.906058"},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/3-540-45868-9_32","volume-title":"Graphics Recognition. Algorithms and Applications","author":"X. Hilaire","year":"2002","unstructured":"Hilaire, X.: RANVEC and the arc segmentation contest. In: Blostein, D., Kwon, Y.-B. (eds.) GREC 2001. LNCS, vol.\u00a02390, pp. 359\u2013364. Springer, Heidelberg (2002)"},{"doi-asserted-by":"crossref","unstructured":"Breuel, T.M.: Fast recognition using adaptive subdivisions of transformation space. In: Proceedings IEEE Conf. on Computer Vision and Pattern Recognition, pp. 445\u2013451 (1992)","key":"34_CR9","DOI":"10.1109\/CVPR.1992.223152"},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"1375","DOI":"10.1016\/S0167-8655(02)00378-1","volume":"24","author":"T.M. Breuel","year":"2003","unstructured":"Breuel, T.M.: On the use of interval arithmetic in geometric branch-and-bound algorithms. Pattern Recognition Letters\u00a024, 1375\u20131384 (2003)","journal-title":"Pattern Recognition Letters"},{"doi-asserted-by":"crossref","unstructured":"Breuel, T.M.: Robust least square baseline finding using a branch and bound algorithm. In: Proceedings of the SPIE - The International Society for Optical Engineering, pp. 20\u201327 (2002)","key":"34_CR11","DOI":"10.1117\/12.450735"},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1023\/A:1008022116857","volume":"31","author":"M. Hagedoorn","year":"1999","unstructured":"Hagedoorn, M., Veltkamp, R.C.: Reliable and efficient pattern matching using an affine invariant metric. International Journal of Computer Vision\u00a031, 203\u2013225 (1999)","journal-title":"International Journal of Computer Vision"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1109\/34.232073","volume":"15","author":"D.P. Huttenlocher","year":"1993","unstructured":"Huttenlocher, D.P., Klanderman, G.A., Rucklidge, W.J.: Comparing images using the Hausdorff distance. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a015, 850\u2013863 (1993)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1006\/cviu.1998.0735","volume":"73","author":"F. Jurie","year":"1999","unstructured":"Jurie, F.: Solution of the simultaneous pose and correspondence problem using Gaussian error model. Computer Vision and Image Understanding\u00a073, 357\u2013373 (1999)","journal-title":"Computer Vision and Image Understanding"},{"key":"34_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0031-3203(98)00086-7","volume":"32","author":"D.M. Mount","year":"1999","unstructured":"Mount, D.M., Netanyahu, N.S., Moigne, J.L.: Efficient algorithms for robust feature matching. Pattern Recognition\u00a032, 17\u201338 (1999)","journal-title":"Pattern Recognition"},{"key":"34_CR16","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1016\/S0031-3203(00)00064-9","volume":"34","author":"C.F. Olson","year":"2001","unstructured":"Olson, C.F.: Locating geometric primitives by pruning the parameter space. Pattern Recognition\u00a034, 1247\u20131256 (2001)","journal-title":"Pattern Recognition"},{"key":"34_CR17","volume-title":"Algorithms for Graphics and Image Processing","author":"T. Pavlidis","year":"1983","unstructured":"Pavlidis, T.: Algorithms for Graphics and Image Processing. W. H. Freeman & Co., New York (1983)"},{"key":"34_CR18","volume-title":"Computer Vision: A Modern Approach","author":"D.A. Forsyth","year":"2003","unstructured":"Forsyth, D.A., Ponce, J.: Computer Vision: A Modern Approach. Prentice Hall, Upper Saddle River (2003)"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0031-3203(94)00158-8","volume":"29","author":"T.M. Breuel","year":"1996","unstructured":"Breuel, T.M.: Finding lines under bounded error. Pattern Recognition\u00a029, 167\u2013178 (1996)","journal-title":"Pattern Recognition"},{"key":"34_CR20","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1145\/502102.502106","volume":"48","author":"T.J. Hickey","year":"2001","unstructured":"Hickey, T.J., Ju, Q., van Emden, M.H.: Interval arithmetic: From principles to implementation. JACM\u00a048, 1038\u20131068 (2001)","journal-title":"JACM"},{"key":"34_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0249-6","volume-title":"Applied Interval Analysis","author":"L. Jaulin","year":"2001","unstructured":"Jaulin, L., Kieffer, M., Didrit, O., Walter, E.: Applied Interval Analysis. Springer, Berlin (2001)"},{"unstructured":"Breuel, T.M.: Representations and metrics for off-line handwriting segmentation. In: 8th International Workshop on Frontiers in Handwriting Recognition (2002)","key":"34_CR22"}],"container-title":["Lecture Notes in Computer Science","Graphics Recognition. Ten Years Review and Future Perspectives"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11767978_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T14:24:45Z","timestamp":1736605485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11767978_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540347118","9783540347125"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11767978_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}