Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model

DOI10.1007/978-3-642-21073-0_8zbMath1330.68300OpenAlexW1561497405MaRDI QIDQ3003522

Alexandre Dupas, Guillaume Damiand, Jacques-Olivier Lachaud

Publication date: 27 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21073-0_8

zbMATH Keywords

deformable modeltopological mapinterpixel boundariesminimum-length polygonML-simple pointmulti-label image

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Dynamic Minimum Length Polygon

Uses Software

• BSDS

Cites Work

• Unnamed Item
• Computer graphics and connected topologies on finite ordered sets
• Active contours under topology control-genus preserving level sets
• Constraints on deformable models: Recovering 3D shape and nonrigid motion
• A geometric model for active contours in image processing
• Geodesic active contours
• A multiphase level set framework for image segmentation using the Mumford and Shah model
• Optimal approximations by piecewise smooth functions and associated variational problems
• Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
• Multi-Label Simple Points Definition for 3D Images Digital Deformable Model
• Digital Deformable Model Simulating Active Contours
• N-DIMENSIONAL GENERALIZED COMBINATORIAL MAPS AND CELLULAR QUASI-MANIFOLDS
• New Characterizations of Simple Points, Minimal Non-simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces
• A note on minimal length polygonal approximation to a digitized contour
• Minimum-Perimeter Polygons of Digitized Silhouettes

This page was built for publication: Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model