Abstract
This paper presents an efficient and accurate method for creating full view panoramas. A new feature points detection algorithm called Enhanced- FAST is proposed to accurately align images and a graph cuts algorithm is used to merge two adjacent images seamlessly. Based on the FAST algorithm, the Enhanced-FAST algorithm smoothes and extends the sampling area making the feature points detection more insensitive to noise. Our graph cuts algorithm uses image Laplacian to compute the edge weights which can find an optimized seam even under different lighting. Experiments and comparisons show that our method is efficient and robust to image noise and lighting changing
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Rosten, E., Porter, R., Drummond, T.: Faster and better: a machine learning approach to corner detectin. CoRR, abs/0810.2434 (2008)
Brown, M., Lowe, D.: Recongnising panoramas. In: Proceedings of the 9th International Conference on Computer Vision, Nice, France, pp. 1218–1227 (2003)
Lowe, D.G.: Distinctive Image Features from Scale-Invariant Keypoints. International Journal of Computer Vision 60(2), 91–110 (2004)
Bay, H., Tuytellaars, T., Van Gool, L.: SURF: Speeded up robust features. In: Proceedings of the European Conference on Computer Vision, pp. 404–417 (2006)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimizationvia graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(11), 1222–1239 (2001)
Levin, A., Zomet, A., Peleg, S., Weiss, Y.: Seamless image stitching in the gradient domain. In: Eighth European Conference on Computer Vision, Prague, vol. IV, pp. 377–389 (May 2004)
Shum, H., Szeliski, R.: Consruction of panoramic mosaics with global and local alignment. International Journal of Computer Vision 36(2), 101–130 (2000)
Capel, D., Zisserman, A.: Automated mosaicing with super-resolution zoom. In: Proceedings of the International Conference on Computer Vision and Pattern Recognition (CVPR 1998), pp. 885–891 (June 1998)
McLauchlan, P., Jaenicke, A.: Image mosaicing using sequential bundle adjustment. Image and Vision Computer 20(9-10), 751–759 (2002)
Boykov, Y., Kolmogorov, V.: An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision. In: 3rd. International Workshop on Energy Minimization Methods
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag GmbH Berlin Heidelberg
About this chapter
Cite this chapter
Wang, X., Sun, J., Peng, HY. (2012). Efficient Panorama Mosaicing Based on Enhanced-FAST and Graph Cuts. In: Qian, Z., Cao, L., Su, W., Wang, T., Yang, H. (eds) Recent Advances in Computer Science and Information Engineering. Lecture Notes in Electrical Engineering, vol 128. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25792-6_115
Download citation
DOI: https://doi.org/10.1007/978-3-642-25792-6_115
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25791-9
Online ISBN: 978-3-642-25792-6
eBook Packages: EngineeringEngineering (R0)