{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T05:06:35Z","timestamp":1737695195050,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653851"},{"type":"electronic","value":"9783540493815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49381-6_17","type":"book-chapter","created":{"date-parts":[[2007,12,3]],"date-time":"2007-12-03T06:47:50Z","timestamp":1196664470000},"page":"151-158","source":"Crossref","is-referenced-by-count":0,"title":["Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image"],"prefix":"10.1007","author":[{"given":"Tetsuo","family":"Asano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiro","family":"Ito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Souichi","family":"Kimua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shigeaki","family":"Shimazu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,3,29]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"T. Asano and S. Kimura: \u201cContour Representation of an Image with Applications,\u201d Proc. SPIE\u2019s International Symposium on Vision Geometry IV, pp. 14\u201322, San Diego, July 1995.","DOI":"10.1117\/12.216438"},{"key":"17_CR2","unstructured":"T.H. Cormen, C.E. Leiserson, and R.L. Rivest: \u201cIntroduct on to Algorithms,\u201d The MIT Press, 1990."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"L. Guibas, J. Hershberger, D. Leven, M. Sharir, and R. Tarjan: \u201cLinear time algorithm for visibility and shortest path problems nside simple polygons,\u201d Proc. 2nd ACM Symp. on Computational Geometry, pp. 1\u201313, 1986.","DOI":"10.1007\/BF01840360"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"A.N. Heran and T. Totsuka: \u201cCombining Frequencyand Spatial Domain Information for Fast Interactive Image Noise Removal,\u201d Proc. SIGGRAPH\u201996, pp. 269\u2013276, 1996.","DOI":"10.1145\/237170.237264"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49381-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T04:58:09Z","timestamp":1737608289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49381-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653851","9783540493815"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-49381-6_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}