2022
DOI: 10.3390/rs14030706
|View full text |Cite
|
Sign up to set email alerts
|

Mismatching Removal for Feature-Point Matching Based on Triangular Topology Probability Sampling Consensus

Abstract: Feature-point matching between two images is a fundamental process in remote-sensing applications, such as image registration. However, mismatching is inevitable, and it needs to be removed. It is difficult for existing methods to remove a high ratio of mismatches. To address this issue, a robust method, called triangular topology probability sampling consensus (TSAC), is proposed, which combines the topology network and resampling methods. The proposed method constructs the triangular topology of the feature … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
11
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(11 citation statements)
references
References 27 publications
(33 reference statements)
0
11
0
Order By: Relevance
“…At the same time, the accuracy of the algorithm in this paper is 91%, which is 14% higher than that of RANSAC. At the same time, compared with TSAC [34], FLANN [35], GMS [36], KNN [37], LPM [38], the accuracy of the algorithm in this paper is increased by 7%, 26%, 8%, 30%, and 10%, respectively. In Figure 5, the horizontal axis shows the images of fve different environment categories, and the vertical axis shows the running time.…”
Section: Experimental Results and Analysismentioning
confidence: 80%
See 1 more Smart Citation
“…At the same time, the accuracy of the algorithm in this paper is 91%, which is 14% higher than that of RANSAC. At the same time, compared with TSAC [34], FLANN [35], GMS [36], KNN [37], LPM [38], the accuracy of the algorithm in this paper is increased by 7%, 26%, 8%, 30%, and 10%, respectively. In Figure 5, the horizontal axis shows the images of fve different environment categories, and the vertical axis shows the running time.…”
Section: Experimental Results and Analysismentioning
confidence: 80%
“…In order to further verify the running speed of the algorithm in this paper, fve diferent environment images of bear, computer, desk, foor, and building in TUM are used as test images to compare the running time of the algorithm, as shown in Figure 5. In this paper, the accuracy [34] is taken as the evaluation index of algorithm accuracy. Set the slope of the matching line segment [39] between two horizontal matching feature points on the matching image as the standard slope, and then compare the slope of other matching line segments with it.…”
Section: Experimental Results and Analysismentioning
confidence: 99%
“…Based on the invariance of spatial affine transformations, reference [29] utilizes spatial angle ordering as a geometric constraint, constructs neighbourhoods through Delaunay triangulation, and eliminates incorrect correspondences via optimization algorithms. He et al [30] proposed a mismatch removal algorithm based on triangular topology probability sampling consensus. This algorithm generates candidate matches by using a probability sampling approach based on the triangular topology structure and then applies a consistency check to filter out mismatches.…”
Section: Related Workmentioning
confidence: 99%
“…He et al. [30] proposed a mismatch removal algorithm based on triangular topology probability sampling consensus. This algorithm generates candidate matches by using a probability sampling approach based on the triangular topology structure and then applies a consistency check to filter out mismatches.…”
Section: Related Workmentioning
confidence: 99%
“…The estimation accuracy of the fundamental matrix is mainly related to the extraction and matching accuracy of the feature points [14][15][16]. Among them, the extraction error is usually caused by the noise.…”
Section: Introductionmentioning
confidence: 99%