{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T05:23:29Z","timestamp":1749792209765},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290698"},{"type":"electronic","value":"9783540319382"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11559573_68","type":"book-chapter","created":{"date-parts":[[2005,10,7]],"date-time":"2005-10-07T16:49:49Z","timestamp":1128703789000},"page":"549-558","source":"Crossref","is-referenced-by-count":6,"title":["Description of Digital Images by Region-Based Contour Trees"],"prefix":"10.1007","author":[{"given":"Shinobu","family":"Mizuta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuya","family":"Matsuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"68_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1109\/83.663500","volume":"7","author":"P. Salembier","year":"1998","unstructured":"Salembier, P., Oliveras, A., Garrido, L.: Antiextensive connected operators for image and sequence processing. IEEE Trans. Image Processing\u00a07(4), 555\u2013570 (1998)","journal-title":"IEEE Trans. Image Processing"},{"issue":"4","key":"68_CR2","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1109\/34.993556","volume":"24","author":"A. Meijster","year":"2002","unstructured":"Meijster, A., Wilkinson, H.F.: A comparison of algorithms for connected set openings and closings. IEEE Trans. Pattern Analysis and Machine Intelligence\u00a024(4), 484\u2013494 (2002)","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"68_CR3","doi-asserted-by":"crossref","unstructured":"Fisher, M., Aldrige, R.: Hierarchical segmentation of images using a watershed scale-space trees. In: IEE Int. Conf. Image Processing and its Applications, pp. 522\u2013526 (1999)","DOI":"10.1049\/cp:19990377"},{"key":"68_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1007\/978-3-540-30125-7_105","volume-title":"Image Analysis and Recognition","author":"F.X. Huang","year":"2004","unstructured":"Huang, F.X., Fisher, M., Zhu, Y.: From min tree to watershed lake tree: theory and implementation. In: Campilho, A.C., Kamel, M.S. (eds.) ICIAR 2004. LNCS, vol.\u00a03211, pp. 848\u2013857. Springer, Heidelberg (2004)"},{"key":"68_CR5","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1006\/jvci.1999.0441","volume":"11","author":"P. Monasse","year":"2000","unstructured":"Monasse, P., Guichard, F.: Scale-space from a level lines tree. Journal of Visual Communication and Image Representation\u00a011, 224\u2013236 (2000)","journal-title":"Journal of Visual Communication and Image Representation"},{"key":"68_CR6","first-page":"36","volume":"63","author":"R.W. Boyell","year":"1963","unstructured":"Boyell, R.W., Ruston, H.: Hybrid techniques for real-time radar simulation. IEEE Proceedings Fall Joint Computer Conference\u00a063, 36\u201337 (1963)","journal-title":"IEEE Proceedings Fall Joint Computer Conference"},{"key":"68_CR7","unstructured":"Asano, T.: Mathematical Sciences (433), 34-40 (July 1999) (in Japanese)"},{"key":"68_CR8","first-page":"68","volume-title":"Proceedings of the 14 th ACM Symposium on Computational Geometry","author":"S.P. Tarasov","year":"1998","unstructured":"Tarasov, S.P., Vyalyi, M.N.: Construction of contour trees in 3D in O(n log n) steps. In: Proceedings of the 14 th ACM Symposium on Computational Geometry, pp. 68\u201375. ACM, New York (1998)"},{"key":"68_CR9","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/262839.269238","volume-title":"Proceedings of the 13 th ACM Symposium on Computational Geometry","author":"M. Kreveld van","year":"1997","unstructured":"van Kreveld, M., van Oostrum, R., Bajaj, C.L., Pascucci, V., Schikore, D.R.: Contour trees and small seed sets for isosurface traversal. In: Proceedings of the 13 th ACM Symposium on Computational Geometry, pp. 212\u2013220. ACM, New York (1997)"},{"key":"68_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0925-7721(02)00093-7","volume":"24","author":"H. Carr","year":"2003","unstructured":"Carr, H., Snoeyink, J., Axen, U.: Computing contour trees in all dimensions. Computational Geometry\u00a024, 73\u201394 (2003)","journal-title":"Computational Geometry"},{"key":"68_CR11","unstructured":"Carr, H.: Topological Manipulation of Isosurfaces, PhD Thesis of The University of British Columbia (April 2004)"},{"key":"68_CR12","doi-asserted-by":"crossref","unstructured":"Pascucci, V., Cole-McLaughlin, K.: Efficient Computation of the Topology of Level sets. In: Proc. IEEE Visualization 2002, pp. 187\u2013194 (2002)","DOI":"10.1109\/VISUAL.2002.1183774"}],"container-title":["Lecture Notes in Computer Science","Image Analysis and Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11559573_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T19:49:47Z","timestamp":1605642587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11559573_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290698","9783540319382"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11559573_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}