[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Determination of the Optimal Seam-Lines in Image Mosaicking with the Dynamic Programming (DP) on the Converted Cost Space

  • Conference paper
Artificial Intelligence and Soft Computing – ICAISC 2006 (ICAISC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4029))

Included in the following conference series:

Abstract

A novel algorithm to determine the optimal seam-line in image mosacking is proposed to establish the best borderline among neighboring images. The algorithm is based on the utilization of the dynamic programming algorithm on the converted cost field. The converting function is created adaptively based on the distribution of the pixel difference values. The path found with this algorithm runs along the smaller cost regions regardless its length.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Du, Y., Cihlar, J., Beaubien, J., Latifovic, R.: Radiometric Normalization, Compositing, and Quality Control for Satellite High Resolution Image Mosaics over Large Areas. IEEE Trans. on Geoscience and Remote Sensing 39(3), 623–634 (2001)

    Article  Google Scholar 

  2. Uyttendaele, M., Eden, A., Szeliski, R.: Eliminating ghosting and exposure artifacts in image mosaics. In: CVPR II, pp. 1144–1154 (2001)

    Google Scholar 

  3. Adelson, E.H., Anderson, C.H., Bergen, J.R., Burt, P.J., Ogden, J.M.: Pyramid method in image processing. RCA Engineer 29(5), 33–41 (1984)

    Google Scholar 

  4. Kerschner, M.: Seamline detection in colour orthoimage mosaicking by use of twin snakes. ISPRS Journal of Photogrammetry and Remote Sensing 56, 53–64 (2001)

    Article  Google Scholar 

  5. Bellman, R.: Dynamic Programming. Princeton Univ. Press, Princeton (1957)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Spatial Information Science at the University of Tokyo, Japan

    Jaechoon Chon

  2. Division of Electronics and Information Engineering, Chonbuk National University, Republic of Korea

    Hyongsuk Kim

Authors
  1. Jaechoon Chon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hyongsuk Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Artificial Intelligence, Academy of Humanities and Economics, Poland

    Leszek Rutkowski

  2. Institute of Automatics, AGH University of Science and Technology, Al. Mickiewicza 30, PL-30-059, Kraków, Poland

    Ryszard Tadeusiewicz

  3. Department of Electrical Engineering and Computer Sciences, Berkeley Initiative in Soft Computing (BISC), University of California, 94720-1776, Berkeley, CA, USA

    Lotfi A. Zadeh

  4. Department of Electrical Engineering, University of Louisville, 40292, Louisville, KY, U.S.A

    Jacek M. Żurada

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chon, J., Kim, H. (2006). Determination of the Optimal Seam-Lines in Image Mosaicking with the Dynamic Programming (DP) on the Converted Cost Space. In: Rutkowski, L., Tadeusiewicz, R., Zadeh, L.A., Żurada, J.M. (eds) Artificial Intelligence and Soft Computing – ICAISC 2006. ICAISC 2006. Lecture Notes in Computer Science(), vol 4029. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11785231_78

Download citation

  • DOI: https://doi.org/10.1007/11785231_78

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35748-3

  • Online ISBN: 978-3-540-35750-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation