Fast iterative reconstruction based on condensed hierarchy tree

2Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Based on the traditional iterative reconstruction workflow, a fast iterative reconstruction algorithm FIRA is proposed. First, using the image feature points extracted by SIFT algorithm, calculation of image similarity based on the minimum hash algorithm in LSH model is performed. Then, the iteration order is specified through hierarchical clustering. In the iterative process, the orientation estimation of images is carried through the clustering result coming from hierarchical tree. The optimization of parameter estimation is performed by bundle adjustment, and finally produce 3d mesh models. The experimental results show that the method could bring high efficiency and eliminate the accumulated error of adjustment calculation.

Cite

CITATION STYLE

APA

Fang, W., HuaZhong, J., GuangBo, L., & Ou, R. (2018). Fast iterative reconstruction based on condensed hierarchy tree. In Lecture Notes on Data Engineering and Communications Technologies (Vol. 6, pp. 390–399). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-319-59463-7_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free