Combining topological maps, multi-label simple points, and minimum-length polygons for efficient digital partition model

DOI10.1007/978-3-642-21073-0_8MaRDI QIDQ3003522zbMATH OpenOpenAlexFDO

Authors Guillaume Damiand, Alexandre Dupas, 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

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

Recommendations

• Digital Deformable Model Simulating Active Contours
• Multi-Label Simple Points Definition for 3D Images Digital Deformable Model
• scientific article; zbMATH DE number 1746665
• scientific article; zbMATH DE number 1222897
• scientific article; zbMATH DE number 2062628

Cites work

• scientific article; zbMATH DE number 1222897 (Why is no real title available?)
• A geometric model for active contours in image processing
• A multiphase level set framework for image segmentation using the Mumford and Shah model
• A note on minimal length polygonal approximation to a digitized contour
• Active contours under topology control-genus preserving level sets
• Computer graphics and connected topologies on finite ordered sets
• Constraints on deformable models: Recovering 3D shape and nonrigid motion
• Digital Deformable Model Simulating Active Contours
• Geodesic active contours
• Minimum-Perimeter Polygons of Digitized Silhouettes
• Multi-Label Simple Points Definition for 3D Images Digital Deformable Model
• 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
• Optimal approximations by piecewise smooth functions and associated variational problems
• Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour

Cited in

(2)

• scientific article; zbMATH DE number 1746665 (Why is no real title available?)
• Dynamic minimum length polygon

Describes a project that uses

Uses Software

• BSDS

This page was built for publication: Combining topological maps, multi-label simple points, and minimum-length polygons for efficient digital partition model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003522)