EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION

DOI10.1142/S0218195901000420zbMath1074.65520OpenAlexW2116121665MaRDI QIDQ4682172

Naoki Katoh, Takeshi Tokuyama, Danny Z. Chen, Tetsuo Asano

Publication date: 10 June 2005

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195901000420

zbMATH Keywords

dynamic programmingpolynomial-time algorithmComputer visionapproximation schemefast matrix searchingregion segmentationhand probing

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Computing methodologies for image processing (68U10) Complexity and performance of numerical algorithms (65Y20) Machine vision and scene understanding (68T45)

Related Items

High Dimensional Consistent Digital Segments, IMAGE SEGMENTATION WITH ASTEROIDALITY/TUBULARITY AND SMOOTHNESS CONSTRAINTS, Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays, A note on searching line arrangements and applications, Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays, Consistent digital rays, Base-object location problems for base-monotone regions, EFFECT OF CORNER INFORMATION IN SIMULTANEOUS PLACEMENT OF k RECTANGLES AND TABLEAUX, EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS

Cites Work

• Fractional cascading. I: A data structuring technique
• Geometric applications of a matrix-searching algorithm
• Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications
• Implementation and evaluation of decision trees with range and region splitting
• A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
• Searching and storing similar lists
• Data Structures for Retrieval on Square Grids
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
• The Rectilinear Steiner Tree Problem is $NP$-Complete