Improved Feature Point Pair Purification Algorithm Based on SIFT During Endoscope Image Stitching.

Uloženo v:
Podrobná bibliografie
Název: Improved Feature Point Pair Purification Algorithm Based on SIFT During Endoscope Image Stitching.
Autoři: Liu, Yan, Tian, Jiawei, Hu, Rongrong, Yang, Bo, Liu, Shan, Yin, Lirong, Zheng, Wenfeng
Zdroj: Frontiers in Neurorobotics; 2/15/2022, Vol. 16, p1-14, 14p
Témata: ALGORITHMS, PROBLEM solving, STATISTICAL sampling
Abstrakt: Endoscopic imaging plays a very important role in the diagnosis and treatment of lesions. However, the imaging range of endoscopes is small, which may affect the doctors' judgment on the scope and details of lesions. Image mosaic technology can solve the problem well. In this paper, an improved feature-point pair purification algorithm based on SIFT (Scale invariant feature transform) is proposed. Firstly, the K-nearest neighbor-based feature point matching algorithm is used for rough matching. Then RANSAC (Random Sample Consensus) method is used for robustness tests to eliminate mismatched point pairs. The mismatching rate is greatly reduced by combining the two methods. Then, the image transformation matrix is estimated, and the image is determined. The seamless mosaic of endoscopic images is completed by matching the relationship. Finally, the proposed algorithm is verified by real endoscopic image and has a good effect. [ABSTRACT FROM AUTHOR]
Copyright of Frontiers in Neurorobotics is the property of Frontiers Media S.A. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Databáze: Biomedical Index
Buďte první, kdo okomentuje tento záznam!
Nejprve se musíte přihlásit.