Improved Feature Point Pair Purification Algorithm Based on SIFT During Endoscope Image Stitching
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...
Saved in:
Published in | Frontiers in neurorobotics Vol. 16; p. 840594 |
---|---|
Main Authors | , , , , , , |
Format | Journal Article |
Language | English |
Published |
Switzerland
Frontiers Research Foundation
15.02.2022
Frontiers Media S.A |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 Edited by: Hang Su, Fondazione Politecnico di Milano, Italy Reviewed by: Jing Luo, Wuhan Institute of Technology, China; Zhihui Lai, Shenzhen University, China; Ding Junhang, Qingdao University, China; Bo Jin, East China Normal University, China |
ISSN: | 1662-5218 1662-5218 |
DOI: | 10.3389/fnbot.2022.840594 |