EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
DOI10.1142/S0218195901000420zbMATH Open1074.65520OpenAlexW2116121665MaRDI QIDQ4682172FDOQ4682172
Authors: Danny Z. Chen, Naoki Katoh, Takeshi Tokuyama, 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
Recommendations
- scientific article; zbMATH DE number 871905
- IMAGE SEGMENTATION WITH ASTEROIDALITY/TUBULARITY AND SMOOTHNESS CONSTRAINTS
- An efficient algorithm for image segmentation, Markov random fields and related problems
- scientific article; zbMATH DE number 2081013
- Fast Constrained Image Segmentation Using Optimal Spanning Trees
dynamic programmingpolynomial-time algorithmapproximation schemeComputer visionfast matrix searchingregion segmentationhand probing
Numerical optimization and variational techniques (65K10) Complexity and performance of numerical algorithms (65Y20) Computing methodologies for image processing (68U10) Machine vision and scene understanding (68T45)
Cites Work
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- Geometric applications of a matrix-searching algorithm
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications
- Fractional cascading. I: A data structuring technique
- 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
Cited In (25)
- Large-Scale Integer Programs in Image Analysis
- An efficient algorithm for image segmentation, Markov random fields and related problems
- High Dimensional Consistent Digital Segments
- IMAGE SEGMENTATION WITH ASTEROIDALITY/TUBULARITY AND SMOOTHNESS CONSTRAINTS
- A note on searching line arrangements and applications
- Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays
- Title not available (Why is that?)
- Metaheuristic algorithms for image segmentation: theory and applications
- Algorithms and Computation
- A comparison of stochastic optimization techniques for image segmentation
- Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications
- Comet segmentation by theory of approximation
- Evaluating performance of image segmentation criteria and techniques
- Base-object location problems for base-monotone regions
- THE LAYERED NET SURFACE PROBLEMS IN DISCRETE GEOMETRY AND MEDICAL IMAGE SEGMENTATION
- Simultaneous Border Segmentation of Doughnut-Shaped Objects in Medical Images
- EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS
- The optimal all-partial-sums algorithm in commutative semigroups and its applications for image thresholding segmentation
- Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays
- Consistent digital rays
- Maximum weight digital regions decomposable into digital star-shaped regions
- Effect of corner information in simultaneous placement of \(k\) rectangles and tableaux
- Algorithms and Computation
- What segments are the best in representing contours?
- Computing regions decomposable into \(m\) stars
This page was built for publication: EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682172)
