2020
DOI: 10.1142/s0218001420500354
|View full text |Cite
|
Sign up to set email alerts
|

Mapping Road Based on Multiple Features and B-GVF Snake

Abstract: As a significant application in aerial image, road mapping is still a difficult task since roads show complex features caused by the influence of spectral reflectance, shadows and occlusions. To achieve a satisfying result, a new method combing multiple road features and biased gradient vector flow (B-GVF) snake is studied in this paper. First, an exponential function is applied to fuse the color-based and structure-based measure for gaining the saliency maps which is viewed as the candidate region of B-GVF sn… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 19 publications
0
3
0
Order By: Relevance
“…The application of the snake algorithm is varied and has been used for segmentation, edge detection, shape modelling, and tracking motion. The active contours or snakes move under the impact of forces (both internal and external) from the curve and image data, respectively [23]. Cubic B-spline with fewer state variables provides more economical recognition of snake and are piecewise polynomial functions.…”
Section: B-spline Snakementioning
confidence: 99%
“…The application of the snake algorithm is varied and has been used for segmentation, edge detection, shape modelling, and tracking motion. The active contours or snakes move under the impact of forces (both internal and external) from the curve and image data, respectively [23]. Cubic B-spline with fewer state variables provides more economical recognition of snake and are piecewise polynomial functions.…”
Section: B-spline Snakementioning
confidence: 99%
“…Diverse road types, such as paved, unpaved, forest, or desert roads, have unique characteristics and require different mapping approaches 28 , 29 . The complexity increases when attempting to differentiate and accurately represent various road surfaces and terrains 30 . This requires sophisticated data processing methods to handle the large amount of data and numerous vertex points involved.…”
Section: Introductionmentioning
confidence: 99%
“…Due to different data collection methods and time, the spatial location of the same road section is quite different. Direct road network data matching will not only lead to large errors but also reduce the running speed of the algorithm [17,18]. Hence, a rough matching strategy is carried out to estimate the changing state of R ′ (N ′ , A ′ ), and then different fine-matching strategies are selected to improve the matching efficiency.…”
Section: Rough Matching Based On Distance Proximitymentioning
confidence: 99%