Review of serial and parallel min-cut/max-flow algorithms for computer vision
Minimum cut/maximum flow (min-cut/max-flow) algorithms solve a variety of problems in
computer vision and thus significant effort has been put into developing fast min-cut/max …
computer vision and thus significant effort has been put into developing fast min-cut/max …
[HTML][HTML] Performance evaluation of salient object detection techniques
K Ahmed, MA Gad, AE Aboutabl - Multimedia Tools and Applications, 2022 - Springer
Recently, the detection and segmentation of salient objects that attract the attention of
human visual in images is determined by using salient object detection (SOD) techniques …
human visual in images is determined by using salient object detection (SOD) techniques …
Quasi-stable coloring for graph compression: Approximating max-flow, linear programs, and centrality
We propose quasi-stable coloring, an approximate version of stable coloring. Stable
coloring, also called color refinement, is a well-studied technique in graph theory for …
coloring, also called color refinement, is a well-studied technique in graph theory for …
Bidirectional pruned tree-based efficient minimum cut acceleration in dense graph
W Wei, H Li, Q Zhang - Chaos, Solitons & Fractals, 2023 - Elsevier
The minimum cut (min-cut) problem has been extensively investigated, and the
corresponding algorithms have been used in many related problems. The recently proposed …
corresponding algorithms have been used in many related problems. The recently proposed …