Graph-Based Segmentation with Local Band Constraints
Autor: | Paulo A. V. Miranda, Fabio A. M. Cappabianco, Caio de Moraes Braz, Krzysztof Ciesielski |
---|---|
Rok vydání: | 2019 |
Předmět: |
050101 languages & linguistics
Geodesic Image (category theory) Star (game theory) 05 social sciences Boundary (topology) 02 engineering and technology Convexity Combinatorics Constraint (information theory) 0202 electrical engineering electronic engineering information engineering Graph (abstract data type) 020201 artificial intelligence & image processing 0501 psychology and cognitive sciences Segmentation Mathematics |
Zdroj: | Discrete Geometry for Computer Imagery ISBN: 9783030140847 DGCI |
DOI: | 10.1007/978-3-030-14085-4_13 |
Popis: | Shape constraints are potentially useful high-level priors for object segmentation, allowing the customization of the segmentation to a given target object. In this work, we present a novel shape constraint, named Local Band constraint (\({{\,\mathrm{LB}\,}}\)), for the generalized graph-cut framework, which in its limit case is strongly related to the Boundary Band constraint, preventing the generated segmentation to be irregular in relation to the level sets of a given reference cost map or template of shapes. The \({{\,\mathrm{LB}\,}}\) constraint is embedded in the graph construction with additional arcs defined by a translation-variant adjacency relation, making it easy to combine with other high-level constraints. The \({{\,\mathrm{LB}\,}}\) constraint demonstrates competitive results as compared to Geodesic Star Convexity, Boundary Band, and Hedgehog Shape Prior in Oriented Image Foresting Transform (OIFT) for various scenarios involving natural and medical images, with reduced sensibility to seed positioning. |
Databáze: | OpenAIRE |
Externí odkaz: |