2016
DOI: 10.1515/mathm-2016-0010
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Computation of Greyscale Path Openings

Abstract: Path openings are morphological operators that are used to preserve long, thin, and curved structures in images. They have the ability to adapt to local image structures,which allows them to detect lines that are not perfectly straight. They are applicable in extracting cracks, roads, and similar structures. Although path openings are very efficient to implement for binary images, the greyscale case is more problematic. This study provides an analysis of the main existing greyscale algorithm, and shows that al… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
5
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 17 publications
0
5
0
Order By: Relevance
“…The main differences compared to our implementation are that we chose to iterate over the grey values from high to low, and that we cannot assume that pixels outside the current upper level set do not participate. Algorithm 8 gives an overview of the most critical section of the algorithm, based on the version of Appleton and Talbot's algorithm presented by [12,26].…”
Section: Greyscale Graphsmentioning
confidence: 99%
See 1 more Smart Citation
“…The main differences compared to our implementation are that we chose to iterate over the grey values from high to low, and that we cannot assume that pixels outside the current upper level set do not participate. Algorithm 8 gives an overview of the most critical section of the algorithm, based on the version of Appleton and Talbot's algorithm presented by [12,26].…”
Section: Greyscale Graphsmentioning
confidence: 99%
“…This can be derived in more or less the same way as for normal path openings [12,26], except that now path weights do not need to be integers, resulting in an upper bound of O(min(|V |, |L|) |V |) (assuming that the grey levels can be sorted in time linear in |L| and that the graph is sparse). Here L is the set of grey levels in the image.…”
Section: Greyscale Graphsmentioning
confidence: 99%
“…High-quality road information updates are important for intelligent urban planning, sustainable urban development, vehicle management, and traffic navigation [17,18]. These algorithms require a high resolution, road curvature, and boundary conditions [19][20][21]. With the availability of increasingly rich street-view map resources [22], which provide new perspectives and research methods, researchers can supplement the details of urban perception from a human perspective [23].…”
Section: Introductionmentioning
confidence: 99%
“…These stages include the road extraction stage based on traditional methods and the road extraction stage based on deep learning. The traditional method stage mainly uses template matching approaches, knowledge-driven approaches, object-oriented approaches, path morphology approaches [2], etc. Hu [3] proposed a road extraction algorithm that consists of two steps: detection and pruning.…”
Section: Introductionmentioning
confidence: 99%