A reliable quasi-dense corresponding points for structure from motion

  • Oh, Jangseok; 
  • Hong, Hyunggil; 
  • Cho, Yongjun; 
  • Yun, Haeyong; 
  • Seo, Kap-Ho; 
  • ... Lee, Onseok; 
  • 외 2명
Citations

WEB OF SCIENCE

3
Citations

SCOPUS

3

초록

A three-dimensional (3D) reconstruction is an important research area in computer vision. The ability to detect and match features across multiple views of a scene is a critical initial step. The tracking matrix W obtained from a 3D reconstruction can be applied to structure from motion (SFM) algorithms for 3D modeling. We often fail to generate an acceptable number of features when processing face or medical images because such images typically contain large homogeneous regions with minimal variation in intensity. In this study, we seek to locate sufficient matching points not only in general images but also in face and medical images, where it is difficult to determine the feature points. The algorithm is implemented on an adaptive threshold value, a scale invariant feature transform (SIFT), affine SIFT, speeded up robust features (SURF), and affine SURF. By applying the algorithm to face and general images and studying the geometric errors, we can achieve quasi-dense matching points that satisfy well-functioning geometric constraints. We also demonstrate a 3D reconstruction with a respectable performance by applying a column space fitting algorithm, which is an SFM algorithm.

키워드

scale-invariant feature transform; speeded up robust features; structure from motion; column space fitting; affine-model; RECONSTRUCTION
제목
A reliable quasi-dense corresponding points for structure from motion
저자
Oh, Jangseok; Hong, Hyunggil; Cho, Yongjun; Yun, Haeyong; Seo, Kap-Ho; Kim, Hochul; Kim, Mingi; Lee, Onseok
DOI
10.3837/tiis.2020.09.012
발행일
2020-09-30
유형
Article
저널명
KSII Transactions on Internet and Information Systems
권
14
호
9
페이지
3782 ~ 3796