{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T11:48:37Z","timestamp":1725623317148},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678861"},{"type":"electronic","value":"9783642598029"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/978-3-642-59802-9_52","type":"book-chapter","created":{"date-parts":[[2011,10,20]],"date-time":"2011-10-20T22:27:47Z","timestamp":1319149667000},"page":"412-419","source":"Crossref","is-referenced-by-count":1,"title":["Automatic Extraction of Relevant Frames from Videos by Polygon Simplification"],"prefix":"10.1007","author":[{"given":"Longin Jan","family":"Latecki","sequence":"first","affiliation":[]},{"given":"Daniel","family":"DeMenthon","sequence":"additional","affiliation":[]},{"given":"Azriel","family":"Rosenfeld","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"D.F. DeMenthon, V., M. Kobla, and D. Doermann. Video Summarization by Curve Simplification, ACM Multimedia 98, Bristol, England, pp. 211-218, September 1998.","key":"52_CR1","DOI":"10.1145\/290747.290773"},{"unstructured":"D.F. DeMenthon, L.J. Latecki, A. Rosenfeld, and M. Vuilleumier St\u00fcckelberg. Relevance Ranking and Smart Fast-Forward of Video Data by Polygon Simplification, Int. Conf. on Visual Information Systems, November 2000, to appear.","key":"52_CR2"},{"issue":"2","key":"52_CR3","doi-asserted-by":"crossref","first-page":"112","DOI":"10.3138\/FM57-6770-U75U-7727","volume":"10","author":"DH Douglas","year":"1973","unstructured":"D.H. Douglas and T.K. Peucker. Algorithms for the Reduction of the Number of Points Required to Represent a Line or its Caricature, The Canadian Cartographer, 10(2), pp. 112\u2013122, 1973.","journal-title":"The Canadian Cartographer"},{"doi-asserted-by":"crossref","unstructured":"J. Foote, J. Boreczky, A. Girgensohn, and L. Wilcox. An Intelligent Media Browser using Automatic Multimodal Analysis, ACM Multimedia 98, Bristol, England, pp. 375-380, September 1998.","key":"52_CR4","DOI":"10.1145\/290747.290804"},{"doi-asserted-by":"crossref","unstructured":"D. Jacobs, D. Weinshall, and Y. Gdayahu. Condensing Image Databases when Retrieval is based on Non-Metric Distances, Proc. 6th ICCV, 1998.","key":"52_CR5","DOI":"10.1109\/ICCV.1998.710778"},{"unstructured":"J. Hershberger and J. Snoeyink. Speeding up the Douglas-Peucker Line-Simplification Algorithm, http:\/\/www.cs.ubc.ca\/cgi-bin\/tr\/1992\/TR-92-07.","key":"52_CR6"},{"key":"52_CR7","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1006\/cviu.1998.0738","volume":"73","author":"LJ Latecki","year":"1999","unstructured":"L.J. Latecki and R. Lak\u00e4mper. Convexity rule for shape decomposition based on discrete contour evolution. Computer Vision and Image Under standing, 73:441\u2013454, 1999.","journal-title":"Computer Vision and Image Under standing"},{"key":"52_CR8","volume-title":"Scale-Space Theories in Computer Vision. Proc. of Int. C. on Scale-Space\u201999","author":"LJ Latecki","year":"1999","unstructured":"L.J. Latecki and R. Lak\u00e4mper. Polygon evolution by vertex deletion. In M. Nielsen, P. Johansen, O.F. Olsen, and J. Weickert, editors, Scale-Space Theories in Computer Vision. Proc. of Int. C. on Scale-Space\u201999, volume LNCS 1682, Corfu, Greece, 1999."},{"unstructured":"L.J. Latecki and R. Lak\u00e4mper. Shape Similarity Measure Based on Correspondence of Visual Parts. IEEE Trans. Pattern Analysis and Machine Intelligence, to appear.","key":"52_CR9"},{"unstructured":"W.H. Press, S.A. Teukolsky, W.T. Vettering, and B.P. Flannery. Numerical Recipes in C, Second Edition, Cambridge University Press, 1992.","key":"52_CR10"},{"key":"52_CR11","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/S0146-664X(72)80017-0","volume":"1","author":"U Ramer","year":"1972","unstructured":"U. Ramer. An Iterative Procedure for the Polygonal Approximation of Plane Curves, Computer Graphics and Image Processing 1, pp. 244\u2013256, 1972.","journal-title":"Computer Graphics and Image Processing"},{"unstructured":"M.A. Smith and T. Kanade. Video Skimming for Quick Browsing Based on Audio and Image Characterization, Proc. of CVPR, 1997.","key":"52_CR12"},{"doi-asserted-by":"crossref","unstructured":"M.M. Yeung and B.L. Yeo. Time-Constrained Clustering for Segmentation of Video into Story Units, Proc. of ICPR, 1996.","key":"52_CR13","DOI":"10.1109\/ICPR.1996.546973"},{"key":"52_CR14","first-page":"399","volume":"vol. 2417","author":"MM Yeung","year":"1995","unstructured":"M.M. Yeung, B.-L. Yeo, W. Wolf, and B. Liu. Video Browsing using Clustering and Scene Transitions on Compressed Sequences, Proc. SPIE Conf. on Multimedia Computing and Networking, vol. 2417, pp. 399\u2013413, 1995.","journal-title":"Proc. SPIE Conf. on Multimedia Computing and Networking"},{"doi-asserted-by":"crossref","unstructured":"H.J. Zhang, C.Y. Low, S.W. Smoliar, and J.H. Wu. Video Parsing, Retrieval and Browsing: An Integrated and Content-Based Solution, Proc. of ACM Multimedia, 1995.","key":"52_CR15","DOI":"10.1145\/217279.215068"}],"container-title":["Informatik aktuell","Mustererkennung 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-59802-9_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:47:32Z","timestamp":1606189652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-59802-9_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678861","9783642598029"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-59802-9_52","relation":{},"ISSN":["1431-472X"],"issn-type":[{"type":"print","value":"1431-472X"}],"subject":[],"published":{"date-parts":[[2000]]}}}