Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

GRASP for Seam Drawing in Mosaicking of Aerial Photographic Maps

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

Commercial aerial photographic maps are often so large that it is necessary to produce one map from two or more photographs, which are combined two at a time in a process called mosaicking. The objective is to make the final map appear to be the product of a single photograph.

Commercial packages exist to do mosaicking, but they are not designed to produce the high quality maps desired by customers of modern cartographic companies. Consequently such companies typically design their own software.

Seam-drawing is the most difficult step in the mosaicking process. We model the seam-drawing process by means of several objective functions and present a Greedy Randomized Adaptive Search Procedure (GRASP) to solve the problem. Computational experiments show the merit of the proposed approach.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Feo, T. and M.G.C. Resende. (1989). “A Probabilistic Heuristic for a Computationally Difficult Set Covering Problem,” Operations Research Letters 8, 67–71.

    Google Scholar 

  • Feo, T. and M.G.C. Resende. (1995). “Greedy Randomized Adaptive Search Procedures,” Journal of Global Optimization 2, 1–27.

    Google Scholar 

  • Fernández, E., R. Garfinkel, and R. Arbiol. (1998). “Mosaicking of Aerial Photographic Maps via Seams Defined by Bottleneck Shortest Paths,” Operations Research 46(3), 293–304.

    Google Scholar 

  • Fleurent, C. and F. Glover. (1998). Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory. University of Colorado at Boulder.

  • Glover, F. (1986). “Future Paths for Integer Programming and Links to Artificial Intelligence,” Computers and Operations Research 13, 533.

    Google Scholar 

  • Glover, F. and.M. Laguna. (1997). Tabu Search. Kluwer Academic Publishers.

  • Laguna, M. and R. Martí. (1999). “Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization.” INFORMS Journal on Computing 11(1), 44–52.

    Google Scholar 

  • Milgram, D.L. (1975). “Computer methods for Creating Photomosaics,” IEEE Transactions on Computers C-24, 1113–1119.

    Google Scholar 

  • Milgram, D.L. (1977). “Adaptive Techniques for Photomosaicking,” IEEE Transactions on Computers C-26, 1175–1180.

    Google Scholar 

  • Shiren, Y., L. Li, and G. Peng. (1989). “Two-Dimensional Seam-Point Searching in Digital Image Matching,” Photogrammetric Engineering and Remote Sensing 55, 49–53.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fernández, E., Martí, R. GRASP for Seam Drawing in Mosaicking of Aerial Photographic Maps. Journal of Heuristics 5, 181–197 (1999). https://doi.org/10.1023/A:1009633811636

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009633811636

Navigation