Skip to main content

Learning-Based Image Registration Approach Using View Synthesis Framework (LIRVS)

  • Conference paper
  • First Online:
Proceedings of International Conference on Computational Intelligence and Data Engineering

Abstract

Image registration is a fundamental preprocessing step in varied image processing and computer vision applications, which rely on accurate spatial transformation between source and the reference image. Registration using iterative view synthesis algorithm is experimentally shown to solve a wide range of registration problems, albeit at the cost of additional memory and time to be spent on the generation of views and feature extraction across all the views. Hence, we have approached the problem by building a decision-maker model which could predetermine the possibility of registering the given input image pairs and also predict the iteration at which the image pair will be registered. The proposed approach incorporates a decision-maker (trained classifier model) into the registration pipeline. In order to ensure that the gain in time is considerable, the classifier model is designed using the registration parameters obtained from reference and source image. The trained classifier model can predetermine the possibility of registering the input image pairs and also the minimum number of synthetic views or iteration necessary to register the input image pair. Hence, for the images that have been registered, an additional time required for the proposed approach is tolerable. However, for the images that are not registered, the gain in time because of classifier model is extremely significant.

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 219.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 279.99
Price excludes VAT (USA)
  • Durable hardcover 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. Brown LG (1992) A survey of image registration techniques. ACM Comput Surv 24:325–376

    Google Scholar 

  2. Fonseca LMG, Manjunath BS (1996) Registration techniques for multisensor remotely sensed images. Photogramm Eng Remote Sens 1049–1056

    Google Scholar 

  3. Zitová B, Flusser J (2003) Image registration methods: a survey. Image Vis Comput 21(11):977–1000

    Google Scholar 

  4. Capel D, Zisserman A (2003) Computer vision applied to super resolution. IEEE Signal Process Mag 20(3):75-86. https://doi.org/10.1109/MSP.2003.1203211.

  5. Eastman RD, Netanyahu NS, LeMoigne J (2011) Survey of image registration methods in image registration for remote sensing. Image registration for remote sensing

    Google Scholar 

  6. Lepetit V, Fua P (2006) Keypoint recognition using randomized trees. IEEE Trans Pattern Anal Mach Intell 28(9):1465–1479. https://doi.org/10.1109/TPAMI.2006.188

  7. Morel J-M, Guoshen Y (2009) ASIFT: a new framework for fully affine invariant image comparison. SIAM J Imaging Sci 2(2):438–469

    Article  MathSciNet  Google Scholar 

  8. Pang Y, Li W, Yuan Y, Pan J (2012) Fully affine invariant surf for image matching. Neurocomputing 85:610. https://doi.org/10.1016/j.neucom.2011.12.006

    Article  Google Scholar 

  9. Lowe DG (2004) Distinctive image features from scale-invariant keypoints. Int J Comput Vis 60:91–110

    Google Scholar 

  10. Bay H, Ess A, Tuytelaars T, Gool LV (2008) Speeded-up robust features (SURF). Comput Vis Image Underst 110:346–359

    Google Scholar 

  11. Mishkin D, Perdoch M, Matas J (2013) Two-view matching with view synthesis revisited. IVCNZ 2013:436–441

    Google Scholar 

  12. Mishkin D, Matas J, Perdoch M (2015) Mods: fast and robust method for two-view matching. CoRR abs/1503.02619

    Google Scholar 

  13. Mikolajczyk K, Schmid C (2004) Scale and affine invariant interest point detectors. Int J Comput Vis 60(1):63–86

    Google Scholar 

  14. Arandjelovic R, Zisserman A (2012) Three things everyone should know to improve object retrieval. In: Proceedings of CVPR

    Google Scholar 

  15. Mishkin D, Matas J, Perdoch M, Lenc K (2015) WxBS: wide baseline stereo generalizations. In: Proceedings of the British machine vision conference, BMVA

    Google Scholar 

  16. Matas J, Chum O, Urban M, Pajdla T (2002) Robust wide baseline stereo from maximally stable extrema regions. In: BMVC, pp 384–393

    Google Scholar 

  17. Kelman A, Sofka M, Stewart CV (2007) Keypoint descriptors for matching across multiple image modalities and non-linear intensity variations. In: Proceedings of CVPR

    Google Scholar 

  18. Lebeda K, Matas J, Chum O (2012) Fixing the locally optimized RANSAC. In: Proceedings of BMVC

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to B. Sirisha .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sirisha, B., Sandhya, B., Prasanna Kumar, J., Paidimarry, C.S. (2021). Learning-Based Image Registration Approach Using View Synthesis Framework (LIRVS). In: Chaki, N., Pejas, J., Devarakonda, N., Rao Kovvur, R.M. (eds) Proceedings of International Conference on Computational Intelligence and Data Engineering. Lecture Notes on Data Engineering and Communications Technologies, vol 56. Springer, Singapore. https://doi.org/10.1007/978-981-15-8767-2_15

Download citation

Publish with us

Policies and ethics