Skip to main content

Fast Iterative Reconstruction Based on Condensed Hierarchy Tree

  • Conference paper
  • First Online:
Advances in Internetworking, Data & Web Technologies (EIDWT 2017)

Part of the book series: Lecture Notes on Data Engineering and Communications Technologies ((LNDECT,volume 6))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Snavely, N., Seitz, S.M., Szeliski, R.: Skeletal graphs for efficient structure from motion. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2008), Anchorage, AK (2008b)

    Google Scholar 

  2. Crandall, D., Owens, A., Snavely, N., et al.: Discrete-continuous optimization for large-scale structure from motion. In: 2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, pp. 3001–3008 (2011)

    Google Scholar 

  3. Sattler, T., Leibe, B., Kobbelt, L., et al.: Improving image-based localization by active correspondence search. In: European Conference on Computer Vision, pp. 752–765 (2012)

    Google Scholar 

  4. Fiore, P.: Efficient linear solution of exterior orientation. IEEE Trans. Pattern Anal. Mach. Intell. 23(2), 140–148 (2001)

    Article  Google Scholar 

  5. Simon, I., Snavely, N., Seitz S.M., et al.: Scene summarization for online image collections. In: International Conference on Computer Vision, pp. 1–8 (2007)

    Google Scholar 

  6. Snavely, N., Seitz, S.M., Szeliski, R., et al.: Photo tourism: exploring photo collections in 3D. In: International Conference on Computer Graphics and Interactive Techniques, vol. 25(3), pp. 835–846 (2006)

    Google Scholar 

  7. Bodisszomoru, A., Riemenschneider, H., Van Gool, L., et al.: Fast, approximate piecewise-planar modeling based on sparse structure-from-motion and superpixels. In: Computer Vision and Pattern Recognition, pp. 469–476 (2014)

    Google Scholar 

  8. Zhang, G., Liu, H., Dong, Z., et al.: Efficient non-consecutive feature tracking for robust structure-from-motion. IEEE Trans. Image Process. 25(12), 5957–5970 (2016)

    Article  MathSciNet  Google Scholar 

  9. Datar, M., Immorlica, N., Indyk, P., et al.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, pp. 253–262 ACM (2004)

    Google Scholar 

  10. Broder, A.Z., Charikar, M., Frieze, A.M., et al.: Min-wise independent permutations. J. Comput. Syst. Sci. 60(3), 630–659 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  11. Jaccard, J. (ed.): Interaction Effects in Logistic Regression, vol. 135. Sage, Thousand Oaks (2001)

    MATH  Google Scholar 

  12. Farenzena, M., Fusiello, A., Gherardi, R.: Structure-and-motion pipeline on a hierarchical cluster tree. In: 2009 IEEE 12th International Conference on Computer Vision Workshops (ICCV Workshops), pp. 1489–1496. IEEE (2009)

    Google Scholar 

  13. http://www.cs.cornell.edu/~snavely/bundler/

Download references

Acknowledgement

The work was supported by the Educational Commission of Hubei Province of China (No. D20151401) and the Green Industry Technology Leading Project of Hubei University of Technology (No. ZZTS2017006).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jin HuaZhong .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Cite this paper

Fang, W., HuaZhong, J., GuangBo, L., Ou, R. (2018). Fast Iterative Reconstruction Based on Condensed Hierarchy Tree. In: Barolli, L., Zhang, M., Wang, X. (eds) Advances in Internetworking, Data & Web Technologies. EIDWT 2017. Lecture Notes on Data Engineering and Communications Technologies, vol 6. Springer, Cham. https://doi.org/10.1007/978-3-319-59463-7_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-59463-7_39

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-59462-0

  • Online ISBN: 978-3-319-59463-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics