Oriented Image Foresting Transform Segmentation by Seed Competition

DOI10.1109/TIP.2013.2288867MaRDI QIDQ4591918zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Lucy A. C. Mansilla, Paulo A. V. Miranda

Publication date 20 November 2017

Published in IEEE Transactions on Image Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tip.2013.2288867

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cited in

(11)

• Path-value functions for which Dijkstra's algorithm returns optimal mapping
• Efficient hierarchical multi-object segmentation in layered graphs
• Towards interactive image segmentation by dynamic and iterative spanning forest
• Image segmentation by relaxed deep extreme cut with connected extreme points
• Optimum cuts in graphs by general fuzzy connectedness with local band constraints
• Graph-based segmentation with local band constraints
• The role of optimum connectivity in image segmentation: can the algorithm learn object information during the process?
• Seed robustness of oriented iImage foresting transform: core computation and the robustness coefficient
• Differential oriented image foresting transform and its applications to support high-level priors for object segmentation
• Graph-based image segmentation with shape priors and band constraints
• Differential oriented image foresting transform segmentation by seed competition

This page was built for publication: Oriented Image Foresting Transform Segmentation by Seed Competition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4591918)