2018 | OriginalPaper | Chapter
Fast Iterative Reconstruction Based on Condensed Hierarchy Tree
Published in: Advances in Internetworking, Data & Web Technologies
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.