EFFICIENT ALGORITHMS FOR THE OPTIMAL-RATIO REGION DETECTION PROBLEMS IN DISCRETE GEOMETRY WITH APPLICATIONS
From MaRDI portal
Publication:3636313
DOI10.1142/S0218195909002873zbMath1195.65022MaRDI QIDQ3636313
Publication date: 30 June 2009
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
algorithms; convex hull; directed graph; image segmentation; parametric search; hand probing; minimum closed set; optimal-ratio region detection
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
94A08: Image processing (compression, reconstruction, etc.) in information and communication theory
05C20: Directed graphs (digraphs), tournaments
Cites Work
- Unnamed Item
- Unnamed Item
- A fast algorithm for the generalized parametric minimum cut problem and applications
- A new?old algorithm for minimum-cut and maximum-flow in closure graphs
- Data Mining with optimized two-dimensional association rules
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Shape from probing
- A new approach to the maximum-flow problem
- Maximal Closure of a Graph and Applications to Combinatorial Problems
- EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
- A Fast Parametric Maximum Flow Algorithm and Applications