Stereo matching using intra- and inter-row dynamic programming
Pattern Recognition Letters
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Automatic Finding of Main Roads in Aerial Images by Using Geometric-Stochastic Models and Estimation
IEEE Transactions on Pattern Analysis and Machine Intelligence
International Journal of Computer Vision
Sub-optimal solutions to track detection problem using graph theoretic concepts
Journal of Systems Architecture: the EUROMICRO Journal
Global Minimum for Active Contour Models: A Minimal Path Approach
International Journal of Computer Vision
Regularised shortest-path extraction
Pattern Recognition Letters
Unsupervised cell nucleus segmentation with active contours
Signal Processing - Special issue on deformable models and techniques for image and signal processing
Efficient algorithms for finding the maximum number of disjoint paths in grids
Journal of Algorithms
An efficient algorithm for the k-pairwise disjoint paths problem in hypercubes
Journal of Parallel and Distributed Computing
Fast Stereo Matching Using Rectangular Subregioning and 3D Maximum-Surface Techniques
International Journal of Computer Vision
Computing Geodesics and Minimal Surfaces via Graph Cuts
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Globally Optimal Geodesic Active Contours
Journal of Mathematical Imaging and Vision
Boundary extraction of linear features using dual paths through gradient profiles
Pattern Recognition Letters
Membrane boundary extraction using circular multiple paths
Pattern Recognition
Interactive segmentation of non-star-shaped contours by dynamic programming
Pattern Recognition
| Hi-index | 0.15 |
Single shortest path extraction algorithms have been used in a number of areas such as network flow and image analysis. In image analysis, shortest path techniques can be used for object boundary detection, crack detection, or stereo disparity estimation. Sometimes one needs to find multiple paths as opposed to a single path in a network or an image where the paths must satisfy certain constraints. In this paper, we propose a new algorithm to extract multiple paths simultaneously within an image using a constrained expanded trellis (CET) for feature extraction and object segmentation. We also give a number of application examples for our multiple paths extraction algorithm.