A Convex Max-Flow Approach to Distribution-Based Figure-Ground Separation

DOI10.1137/110850372zbMath1255.68264OpenAlexW2041197198WikidataQ62109066 ScholiaQ62109066MaRDI QIDQ4902164

Jing Yuan, Shuo Li, Yuri Boykov, Ismail Ben Ayed, Kumaradevan Punithakumar

Publication date: 25 January 2013

Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ab3baf12ce8316ae495fc7679ba34c5f704934cc

zbMATH Keywords

convex optimizationiterative methodsimage segmentationmax-flow min-cutdistribution matchingBhattacharyya measure

Mathematics Subject Classification ID

Convex programming (90C25) Computing methodologies for image processing (68U10)

Related Items (4)

Variational multiplicative noise removal by DC programming ⋮ Convex histogram-based joint image segmentation with regularized optimal transport cost ⋮ Sequential Convex Programming for Computing Information-Theoretic Minimal Partitions: Nonconvex Nonsmooth Optimization ⋮ New Splitting Algorithms for Multiplicative Noise Removal Based on Aubert-Aujol Model

This page was built for publication: A Convex Max-Flow Approach to Distribution-Based Figure-Ground Separation