{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:33:13Z","timestamp":1743010393394,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642210723"},{"type":"electronic","value":"9783642210730"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21073-0_8","type":"book-chapter","created":{"date-parts":[[2011,5,14]],"date-time":"2011-05-14T06:52:18Z","timestamp":1305355938000},"page":"56-69","source":"Crossref","is-referenced-by-count":2,"title":["Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model"],"prefix":"10.1007","author":[{"given":"Guillaume","family":"Damiand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Dupas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques-Olivier","family":"Lachaud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"11","key":"8_CR1","doi-asserted-by":"publisher","first-page":"1222","DOI":"10.1109\/34.969114","volume":"23","author":"Y. Boykov","year":"2001","unstructured":"Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. Pattern Anal. Mach. Intell.\u00a023(11), 1222\u20131239 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"doi-asserted-by":"crossref","unstructured":"Brun, L., Domenger, J.-P., Braquelaire, J.-P.: Discrete maps: a framework for region segmentation algorithms. In: Proc. GBR, pp. 83\u201392 (1997)","key":"8_CR2","DOI":"10.1007\/978-3-7091-6487-7_9"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01385685","volume":"66","author":"V. Caselles","year":"1993","unstructured":"Caselles, V., Catte, F., Coll, T., Dibos, F.: A geometric model for active contours. Numerische Mathematik\u00a066, 1\u201331 (1993)","journal-title":"Numerische Mathematik"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1023\/A:1007979827043","volume":"22","author":"V. Caselles","year":"1997","unstructured":"Caselles, V., Kimmel, R., Sapiro, G.: Geodesic active contours. Int. J. Comput. Vision\u00a022(1), 61\u201379 (1997)","journal-title":"Int. J. Comput. Vision"},{"key":"8_CR5","first-page":"731","volume-title":"Proc. ICCV","author":"C. Couprie","year":"2009","unstructured":"Couprie, C., Grady, L., Najman, L., Talbot, H.: Power watersheds: A new image segmentation framework extending graph cuts, random walker and optimal spanning forest. In: Proc. ICCV, pp. 731\u2013738. IEEE, Los Alamitos (2009)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-79126-3_11","volume-title":"Discrete Geometry for Computer Imagery","author":"M. Couprie","year":"2008","unstructured":"Couprie, M., Bertrand, G.: New characterizations of simple points, minimal non-simple sets and P-simple points in 2D, 3D and 4D discrete spaces. In: Coeurjolly, D., Sivignon, I., Tougne, L., Dupont, F. (eds.) DGCI 2008. LNCS, vol.\u00a04992, pp. 105\u2013116. Springer, Heidelberg (2008)"},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.cviu.2007.09.007","volume":"109","author":"G. Damiand","year":"2008","unstructured":"Damiand, G.: Topological model for 3d image representation: Definition and incremental extraction algorithm. Computer Vision and Image Understanding\u00a0109(3), 260\u2013289 (2008)","journal-title":"Computer Vision and Image Understanding"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.cviu.2003.09.001","volume":"93","author":"G. Damiand","year":"2004","unstructured":"Damiand, G., Bertrand, Y., Fiorio, C.: Topological model for two-dimensional image representation: Definition and optimal extraction algorithm. Computer Vision and Image Understanding\u00a093(2), 111\u2013154 (2004)","journal-title":"Computer Vision and Image Understanding"},{"doi-asserted-by":"crossref","unstructured":"Damiand, G., Dupas, A., Lachaud, J.-O.: Fully deformable 3d digital partition model with topological control. Pattern Recognition Letters (to appear 2011)","key":"8_CR9","DOI":"10.1016\/j.patrec.2010.09.005"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-642-04397-0_18","volume-title":"Discrete Geometry for Computer Imagery","author":"F. Vieilleville de","year":"2009","unstructured":"de Vieilleville, F., Lachaud, J.-O.: Digital Deformable Model Simulating Active Contours. In: Brlek, S., Reutenauer, C., Proven\u00e7al, X. (eds.) DGCI 2009. LNCS, vol.\u00a05810, pp. 203\u2013216. Springer, Heidelberg (2009)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-04397-0_14","volume-title":"Discrete Geometry for Computer Imagery","author":"A. Dupas","year":"2009","unstructured":"Dupas, A., Damiand, G., Lachaud, J.-O.: Multi-label simple points definition for 3D\u00a0images digital deformable model. In: Brlek, S., Reutenauer, C., Proven\u00e7al, X. (eds.) DGCI 2009. LNCS, vol.\u00a05810, pp. 156\u2013167. Springer, Heidelberg (2009)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/3-540-62005-2_13","volume-title":"Discrete Geometry for Computer Imagery","author":"C. Fiorio","year":"1996","unstructured":"Fiorio, C.: A topologically consistent representation for image analysis: the frontiers topological graph. In: Miguet, S., Ub\u00e9da, S., Montanvert, A. (eds.) DGCI 1996. LNCS, vol.\u00a01176, pp. 151\u2013162. Springer, Heidelberg (1996)"},{"issue":"4","key":"8_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF00133570","volume":"1","author":"M. Kass","year":"1988","unstructured":"Kass, M., Witkin, A., Terzopoulos, D.: Snakes: Active contour models. Int. J. Comput. Vision\u00a01(4), 321\u2013331 (1988)","journal-title":"Int. J. Comput. Vision"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-8641(90)90031-V","volume":"36","author":"E. Khalimsky","year":"1990","unstructured":"Khalimsky, E., Kopperman, R., Meyer, P.R.: Computer graphics and connected topologies on finite ordered sets. Topology and its Applications\u00a036, 1\u201317 (1990)","journal-title":"Topology and its Applications"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1142\/S0218195994000173","volume":"4","author":"P. Lienhardt","year":"1994","unstructured":"Lienhardt, P.: N-dimensional generalized combinatorial maps and cellular quasi-manifolds. Int. J. Comput. Geom. Ap.\u00a04(3), 275\u2013324 (1994)","journal-title":"Int. J. Comput. Geom. Ap."},{"doi-asserted-by":"crossref","unstructured":"Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proc. ICCV, vol.\u00a02, pp. 416\u2013423 (2001)","key":"8_CR16","DOI":"10.1109\/ICCV.2001.937655"},{"doi-asserted-by":"crossref","unstructured":"Meltzer, T., Yanover, C., Weiss, Y.: Globally optimal solutions for energy minimization in stereo vision using reweighted belief propagation. In: Proc. ICCV, vol.\u00a01, pp. 428\u2013435 (2005)","key":"8_CR17","DOI":"10.1109\/ICCV.2005.110"},{"issue":"1","key":"8_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/361953.361967","volume":"13","author":"U. Montanari","year":"1970","unstructured":"Montanari, U.: A note on minimal length polygonal approximation to a digitized contour. Communications of the ACM\u00a013(1), 41\u201347 (1970)","journal-title":"Communications of the ACM"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1002\/cpa.3160420503","volume":"42","author":"D. Mumford","year":"1989","unstructured":"Mumford, D., Shah, J.: Optimal approximations by piecewise smooth functions and associated variational problems. Comm. Pure Appl. Math.\u00a042, 577\u2013684 (1989)","journal-title":"Comm. Pure Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Pock, T., Chambolle, A., Cremers, D., Bischof, H.: A convex relaxation approach for computing minimal partitions. In: Proc. CVPR, pp. 810\u2013817 (2009)","key":"8_CR20","DOI":"10.1109\/CVPR.2009.5206604"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-04397-0_10","volume-title":"Discrete Geometry for Computer Imagery","author":"X. Proven\u00e7al","year":"2009","unstructured":"Proven\u00e7al, X., Lachaud, J.-O.: Two linear-time algorithms for computing the minimum length polygon of a digital contour. In: Brlek, S., Reutenauer, C., Proven\u00e7al, X. (eds.) DGCI 2009. LNCS, vol.\u00a05810, pp. 104\u2013117. Springer, Heidelberg (2009)"},{"key":"8_CR22","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s11263-007-0102-8","volume":"79","author":"F. S\u00e9gonne","year":"2008","unstructured":"S\u00e9gonne, F.: Active contours under topology control - genus preserving level sets. Int. Journal of Computer Vision\u00a079, 107\u2013117 (2008)","journal-title":"Int. Journal of Computer Vision"},{"issue":"3","key":"8_CR23","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TC.1972.5008948","volume":"21","author":"J. Sklansky","year":"1972","unstructured":"Sklansky, J., Chazin, R.L., Hansen, B.J.: Minimum perimeter polygons of digitized silhouettes. IEEE Trans. Computers\u00a021(3), 260\u2013268 (1972)","journal-title":"IEEE Trans. Computers"},{"issue":"6","key":"8_CR24","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1109\/TPAMI.2007.70844","volume":"30","author":"R. Szeliski","year":"2008","unstructured":"Szeliski, R., et al.: A comparative study of energy minimization methods for Markov random fields with smoothness-based priors. IEEE Trans. Pattern Anal. Mach. Intell.\u00a030(6), 1068\u20131080 (2008)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"3","key":"8_CR25","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1023\/A:1020874308076","volume":"50","author":"L.A. Vese","year":"2002","unstructured":"Vese, L.A., Chan, T.F.: A multiphase level set framework for image segmentation using the Mumford and Shah model. Int. J. Comput. Vision\u00a050(3), 271\u2013293 (2002)","journal-title":"Int. J. Comput. Vision"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Image Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21073-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T14:54:19Z","timestamp":1741186459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21073-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642210723","9783642210730"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21073-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}