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

DOI10.1142/S0218195909002873zbMath1195.65022OpenAlexW2761701035MaRDI QIDQ3636313

Xiao Dong 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

algorithmsconvex hulldirected graphimage segmentationparametric searchhand probingminimum closed setoptimal-ratio region detection

Mathematics Subject Classification ID

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item

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