EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS

DOI10.1142/S0218195909002873MaRDI QIDQ3636313zbMATH OpenOpenAlexFDO

Authors Xiaodong Wu

Publication date 30 June 2009

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

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

zbMATH Keywords

algorithmsimage segmentationconvex hulldirected graphparametric searchhand probingminimum closed setoptimal-ratio region detection

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications
• EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
• scientific article; zbMATH DE number 871905
• Maximum weight digital regions decomposable into digital star-shaped regions
• THE LAYERED NET SURFACE PROBLEMS IN DISCRETE GEOMETRY AND MEDICAL IMAGE SEGMENTATION

Cites work

• scientific article; zbMATH DE number 3942804 (Why is no real title available?)
• scientific article; zbMATH DE number 3989126 (Why is no real title available?)
• A Fast Parametric Maximum Flow Algorithm and Applications
• A fast algorithm for the generalized parametric minimum cut problem and applications
• A new approach to the maximum-flow problem
• A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Data Mining with optimized two-dimensional association rules
• EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
• Maximal Closure of a Graph and Applications to Combinatorial Problems
• Shape from probing

Cited in

(8)

• The computational complexity of densest region detection
• Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
• Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem
• Efficient Algorithms for the Optimal-Ratio Region Detection Problems in Discrete Geometry with Applications
• THE LAYERED NET SURFACE PROBLEMS IN DISCRETE GEOMETRY AND MEDICAL IMAGE SEGMENTATION
• Regional surveillance of disjoint rectangles: a travelling salesman formulation
• scientific article; zbMATH DE number 5371223 (Why is no real title available?)
• Algorithms and Computation

This page was built for publication: EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS

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