{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T07:09:13Z","timestamp":1742800153580},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540225706"},{"type":"electronic","value":"9783540278689"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27868-9_36","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T10:52:23Z","timestamp":1284634343000},"page":"343-351","source":"Crossref","is-referenced-by-count":31,"title":["Segmentation Graph Hierarchies"],"prefix":"10.1007","author":[{"given":"Yll","family":"Haxhimusa","sequence":"first","affiliation":[]},{"given":"Walter","family":"Kropatsch","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"9","key":"36_CR1","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/0167-8655(90)90013-R","volume":"11","author":"M. Bister","year":"1990","unstructured":"Bister, M., Cornelis, J., Rosenfeld, A.: A critical view of pyramid segmentation algorithms. PRL\u00a011(9), 605\u2013617 (1990)","journal-title":"PRL"},{"key":"36_CR2","unstructured":"Bor\u016fvka, O., jist\u00e9m, O.: Probl\u00e9mu minim\u00e1lnim. Pr\u00e1ce Mor. P\u0159\u00edrodv\u011bd. Spol. v Brn\u011b (Acta Societ. Scienc. Natur. Moravicae)\u00a0III(3), 37\u201358 (1926)"},{"key":"36_CR3","unstructured":"Cole, R., K.P.N., T.R.E.: A Linear-Work Parallel Algorithm for Finding Minimum Spanning Trees. Anual SPAA, 11\u201315 (1994)"},{"issue":"1","key":"36_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1023\/A:1008013412628","volume":"30","author":"M. Cooper","year":"1998","unstructured":"Cooper, M.: The Tractibility of Segmentation and Scene Analysis. IJCV\u00a030(1), 27\u201342 (1998)","journal-title":"IJCV"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Felzenszwalb, P.F., Huttenlocher, D.P.: Image Segmentation Using Local Variation. In: CVPR, pp. 98\u2013104 (1998)","DOI":"10.1109\/CVPR.1998.698594"},{"issue":"1","key":"36_CR6","first-page":"156","volume":"9","author":"C.-S. Fu","year":"2001","unstructured":"Fu, C.-S., Cho, W., Essig, K.: Hierarchical color image region segmentation for content-based image retrival system. IP\u00a09(1), 156\u2013162 (2001)","journal-title":"IP"},{"issue":"10","key":"36_CR7","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1109\/34.954598","volume":"23","author":"Y. Gdalyahu","year":"2001","unstructured":"Gdalyahu, Y., Weinshall, D., Werman, M.: Self-Organization in Vision: Stochastic Clustering for Image Segmentation, Perceptual Grouping, and Image Database Organization. PAMI\u00a023(10), 1053\u20131074 (2001)","journal-title":"PAMI"},{"issue":"8","key":"36_CR8","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1016\/S0167-8655(02)00252-0","volume":"24","author":"L. Guigues","year":"2003","unstructured":"Guigues, L., Herve, L.M., Cocquerez, J.-P.: The Hierarchy of the Cocoons of a Graph and its Application to Image Segmentation. PRL\u00a024(8), 1059\u20131066 (2003)","journal-title":"PRL"},{"key":"36_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-540-45243-0_44","volume-title":"Pattern Recognition","author":"Y. Haxhimusa","year":"2003","unstructured":"Haxhimusa, Y., Kropatsch, W.G.: Hierarchical Image Partitioning with Dual Graph Contraction. In: Michaelis, B., Krell, G. (eds.) DAGM 2003. LNCS, vol.\u00a02781, pp. 338\u2013345. Springer, Heidelberg (2003)"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Haxhimusa, Y., Kropatsch, W.G.: Hierarchical Image Partitioning with Dual Graph Contraction. Technical Report No.81, PRIP, Vienna University of Technology, (July 2003), http:\/\/www.prip.tuwien.ac.at\/ftp\/pub\/publications\/trs\/tr81.pdf","DOI":"10.1007\/978-3-540-45243-0_44"},{"issue":"23","key":"36_CR11","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1145\/321941.321956","volume":"2","author":"S. Horowitz","year":"1976","unstructured":"Horowitz, S., Pavlidis, T.: Picture Segmentation by a Tree Traversal Algorithm. J. Assoc. Compt. Math.\u00a02(23), 368\u2013388 (1976)","journal-title":"J. Assoc. Compt. Math."},{"key":"36_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-45783-6_15","volume-title":"Pattern Recognition","author":"Y. Haxhimusa","year":"2002","unstructured":"Haxhimusa, Y., Glantz, R., Saib, M., Langs, G., Kropatsch, W.G.: Logarithmic Tapering Graph Pyramid. In: Van Gool, L. (ed.) DAGM 2002. LNCS, vol.\u00a02449, pp. 117\u2013124. Springer, Heidelberg (2002)"},{"issue":"3","key":"36_CR13","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/1049-9660(92)90031-W","volume":"55","author":"J.-M. Jolion","year":"1992","unstructured":"Jolion, J.-M., Montanvert, A.: The adaptive pyramid, a framework for 2D image analysis. CVGIP: Im. Under.\u00a055(3), 339\u2013348 (1992)","journal-title":"CVGIP: Im. Under."},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Jolion, J.-M., Rosenfeld, A.: A Pyramid Framework for Early Vision (1994)","DOI":"10.1007\/978-1-4615-2792-3"},{"key":"36_CR15","unstructured":"Jain, K., Dubes, R.C.: Algorithms for Clustering Data (1988)"},{"key":"36_CR16","first-page":"856","volume":"1","author":"Y. Keselman","year":"2001","unstructured":"Keselman, Y., Dickinson, S.: Generic model abstraction from examples. CVPR\u00a01, 856\u2013863 (2001)","journal-title":"CVPR"},{"issue":"6","key":"36_CR17","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1049\/ip-vis:19952115","volume":"142","author":"W.G. Kropatsch","year":"1995","unstructured":"Kropatsch, W.G.: Building Irregular Pyramids by Dual Graph Contraction. IEEProc. Vis. Im and Sig. Proc.\u00a0142(6), 366\u2013374 (1995)","journal-title":"IEEProc. Vis. Im and Sig. Proc."},{"key":"36_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45986-3_1","volume-title":"Discrete Geometry for Computer Imagery","author":"W.G. Kropatsch","year":"2002","unstructured":"Kropatsch, W.G.: Abstract pyramid on discrete represtations. In: Braquelaire, A., Lachaud, J.-O., Vialard, A. (eds.) DGCI 2002. LNCS, vol.\u00a02301, pp. 1\u201321. Springer, Heidelberg (2002)"},{"key":"36_CR19","first-page":"51","volume":"9","author":"J. Lance","year":"1967","unstructured":"Lance, J., Williams, W.: A General Theory of Classificatory Sorting Strategies. Comput. J\u00a09, 51\u201360 (1967)","journal-title":"Comput. J"},{"issue":"1","key":"36_CR20","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1011174803800","volume":"43","author":"J. Malik","year":"2001","unstructured":"Malik, J., Belongie, S., Leung, T., Shi, J.: Contour and Texture Analysis for Image Segmentation. Int. J. on Com. Vis.\u00a043(1), 7\u201327 (2001)","journal-title":"Int. J. on Com. Vis."},{"issue":"3","key":"36_CR21","first-page":"269","volume":"45","author":"P. Meer","year":"1989","unstructured":"Meer, P.: Stochastic image pyramids. CVGIP\u00a045(3), 269\u2013294 (1989)","journal-title":"CVGIP"},{"key":"36_CR22","unstructured":"Meer, P., Mintz, D., Montanvert, A., Rosenfeld, A.: Consensus vision. In: AAAI 1990 Work. on Qual. Vis., pp. 111\u2013115 (1990)"},{"issue":"4","key":"36_CR23","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/34.88566","volume":"13","author":"A. Montanvert","year":"1991","unstructured":"Montanvert, A., Meer, P., Rosenfeld, A.: Hierarchical image analysis using irregular tesselations. PAMI\u00a013(4), 307\u2013316 (1991)","journal-title":"PAMI"},{"key":"36_CR24","doi-asserted-by":"crossref","unstructured":"Pavan, M., Pelillo, M.: Dominiant Sets and Hierarchical Clustering. ICCV (2003)","DOI":"10.1109\/ICCV.2003.1238367"},{"key":"36_CR25","doi-asserted-by":"crossref","unstructured":"Pavlidis, T.: Structural Pattern Recognition (1977)","DOI":"10.1007\/978-3-642-88304-0"},{"key":"36_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1007\/BFb0055696","volume-title":"Computer Vision - ECCV\u201998","author":"P. Perona","year":"1998","unstructured":"Perona, P., Freeman, W.: A Factorization Approach to Grouping. In: Burkhardt, H.-J., Neumann, B. (eds.) ECCV 1998. LNCS, vol.\u00a01406, pp. 655\u2013670. Springer, Heidelberg (1998)"},{"issue":"6","key":"36_CR27","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1109\/TSMC.1976.4309519","volume":"6","author":"A. Rosenfeld","year":"1976","unstructured":"Rosenfeld, A., Hummel, R., Zucker, S.: Scene labeling by relaxation operations. Sys. Man and Cyb.\u00a06(6), 420\u2013433 (1976)","journal-title":"Sys. Man and Cyb."},{"key":"36_CR28","doi-asserted-by":"crossref","unstructured":"Sharon, E., Brandt, A., Basri, R.: Fast multiscale image segmentation. In: CVPR, pp. 70\u201377 (2000)","DOI":"10.1109\/CVPR.2000.855801"},{"key":"36_CR29","unstructured":"Shi, J., Malik, J.: Normalized Cuts and Image Segmentation. In: CVPR, pp. 731\u2013737 (1997)"},{"issue":"3","key":"36_CR30","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0031-3203(82)90069-3","volume":"13","author":"R. Urquhart","year":"1982","unstructured":"Urquhart, R.: Graph Theoretical Clustering Based on Limited Neighborhood Sets. Patt.Rec.\u00a013(3), 173\u2013187 (1982)","journal-title":"Patt.Rec."},{"key":"36_CR31","doi-asserted-by":"crossref","unstructured":"Wu, Z., Leahy, R.: An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation. PAMI\u00a015(11), 1101\u20131113","DOI":"10.1109\/34.244673"},{"key":"36_CR32","doi-asserted-by":"crossref","unstructured":"Yu, S., Shi, J.: Segmentation with pairwise attraction and repulsion. In: ICCV, pp. 52\u201358 (2001)","DOI":"10.1109\/ICCV.2001.937498"},{"key":"36_CR33","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/T-C.1971.223083","volume":"20","author":"C. Zahn","year":"1971","unstructured":"Zahn, C.: Graph-theoretical methods for detecting and describing gestal clusters. IEEE Comput.\u00a020, 68\u201386 (1971)","journal-title":"IEEE Comput."}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27868-9_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:24:54Z","timestamp":1605759894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27868-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540225706","9783540278689"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27868-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}