2014
DOI: 10.1109/tip.2014.2303647
|View full text |Cite
|
Sign up to set email alerts
|

Parsimonious Path Openings and Closings

Abstract: Path openings and closings are morphological tools used to preserve long, thin, and tortuous structures in gray level images. They explore all paths from a defined class, and filter them with a length criterion. However, most paths are redundant, making the process generally slow. Parsimonious path openings and closings are introduced in this paper to solve this problem. These operators only consider a subset of the paths considered by classical path openings, thus achieving a substantial speed-up, while obtai… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 20 publications
(19 citation statements)
references
References 30 publications
0
19
0
Order By: Relevance
“…Finally, we implemented a variant of the parsimonious path opening (PPO) [13]. The parsimonious path opening is an approximation of the path opening [6], which preselects one-dimensional paths, based on intensity, which are then opened.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Finally, we implemented a variant of the parsimonious path opening (PPO) [13]. The parsimonious path opening is an approximation of the path opening [6], which preselects one-dimensional paths, based on intensity, which are then opened.…”
Section: Resultsmentioning
confidence: 99%
“…We only use two adjacency graphs, namely the south-north, and the east-west ones [13], and therefore avoid using more extreme angles in our test images. These line segments have a varying intensity I such that the intensity values are given by…”
Section: Resultsmentioning
confidence: 99%
“…2]. It follows that α 1,l ( f ) and ρ 1,l ( f ) are just as efficient as traditional (binary) path openings, with a time complexity in O(|V | + |E|), and amenable to many of the same tweaks and adaptations [6,16,20].…”
Section: Binary Graphsmentioning
confidence: 99%
“…Note that in addition to using the algorithm above on sequences, one should also be able to use the above algorithm with the technique introduced by Morard et al [20] to compute the so-called "parsimonious path openings" on 2D images (and directed acyclic graphs in general). The idea here is to apply a 1D filter to a cleverly selected [3] subset of paths, giving an approximation to the full path-based filter.…”
Section: Hand If C(a B) < L Then We Do Know That V(b) Is Too Highmentioning
confidence: 99%
“…The path opening filter explores all the potential paths in an image, leading to low efficiency when applied to large remotely sensed imagery. To address this problem, a newly proposed parsimonious path opening (PPO) was employed in this study [53]. This operator only identifies a subset of the paths considered by the conventional path opening, thus achieving a substantial speed-up while obtaining very similar results as the complete path opening operator.…”
Section: Path Openingmentioning
confidence: 99%