Path-value functions for which Dijkstra's algorithm returns optimal mapping

DOI10.1007/S10851-018-0793-1zbMath1397.05187OpenAlexW2793050634WikidataQ111288255 ScholiaQ111288255MaRDI QIDQ1799581

Paulo A. V. Miranda, Alexandre Xavier Falcão, Krzysztof Chris Ciesielski

Publication date: 19 October 2018

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10851-018-0793-1

zbMATH Keywords

connectivity functionsDijkstra's algorithmimage foresting transformgraph-search algorithms

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Paths and cycles (05C38) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (12)

A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems ⋮ Novel arc-cost functions and seed relevance estimations for compact and accurate superpixels ⋮ Differential oriented image foresting transform and its applications to support high-level priors for object segmentation ⋮ Differential oriented image foresting transform segmentation by seed competition ⋮ Optimum cuts in graphs by general fuzzy connectedness with local band constraints ⋮ Efficient hierarchical multi-object segmentation in layered graphs ⋮ Towards interactive image segmentation by dynamic and iterative spanning forest ⋮ Graph-based supervoxel computation from iterative spanning forest ⋮ Image segmentation by relaxed deep extreme cut with connected extreme points ⋮ Graph-Based Segmentation with Local Band Constraints ⋮ The Role of Optimum Connectivity in Image Segmentation: Can the Algorithm Learn Object Information During the Process? ⋮ Some theoretical links between shortest path filters and minimum spanning tree filters

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• General theory of fuzzy connectedness segmentations
• Shape feature extraction and description based on tensor scale
• Multiscale skeletons by image foresting transform and its application to neuromorphometry
• The minimum barrier distance: a summary of recent advances
• Fuzzy connectedness image segmentation in graph cut formulation: a linear-time algorithm and a comparative analysis
• Simultaneous fuzzy segmentation of multiple objects
• A survey of the all-pairs shortest paths problem and its variants in graphs
• Region-Based Segmentation: Fuzzy Connectedness, Graph Cut and Related Algorithms
• Minimum Paths in Directed Graphs
• Hybrid Approaches for Interactive Image Segmentation Using the Live Markers Paradigm
• Oriented Image Foresting Transform Segmentation by Seed Competition
• Riverbed: A Novel User-Steered Image Segmentation Method Based on Optimum Boundary Tracking

This page was built for publication: Path-value functions for which Dijkstra's algorithm returns optimal mapping