Three-Dimensional Reconstruction using the Dense Correspondences from Sequence Images 


Vol. 30,  No. 8, pp. 775-782, Aug.  2005


PDF
  Abstract

In case of 3D reconstruction from dense data in uncalibrated sequence images, we encounter with the problem for searching many correspondences and the computational costs. In this paper, we propose a key frame selection method from uncalibrated images and the effective 3D reconstruction method using the key frames. Namely, it can be performed on smaller number of views in the image sequence. We extract correspondences from selected key frames in image sequences. From the extracted correspondences, camera calibration process will be done. We use the edge image to find dense correspondences between selected key frames. The method we propose to find dense correspondences can be used for recovering the 3D structure of the scene more efficiently.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

Y. Seo, S. Kim, J. Choi, "Three-Dimensional Reconstruction using the Dense Correspondences from Sequence Images," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 8, pp. 775-782, 2005. DOI: .

[ACM Style]

Yung-Ho Seo, Sang-Hoon Kim, and Jong-Soo Choi. 2005. Three-Dimensional Reconstruction using the Dense Correspondences from Sequence Images. The Journal of Korean Institute of Communications and Information Sciences, 30, 8, (2005), 775-782. DOI: .

[KICS Style]

Yung-Ho Seo, Sang-Hoon Kim, Jong-Soo Choi, "Three-Dimensional Reconstruction using the Dense Correspondences from Sequence Images," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 8, pp. 775-782, 8. 2005.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880