Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

Mosaicking of Aerial Photographic Maps via Seams Defined by Bottleneck Shortest Paths

Elena Fernandez, Robert Garfinkel and Roman Arbiol
Operations Research
Vol. 46, No. 3 (May - Jun., 1998), pp. 293-304
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/222823
Page Count: 12
  • Download ($30.00)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Mosaicking of Aerial Photographic Maps via Seams Defined by Bottleneck Shortest Paths
Preview not available

Abstract

The Cartographic Institute of Catalonia (ICC) produces commercial aerial photographic maps of locations in Europe and South America. These 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 by producing a seam that is invisible even to an expert cartographer. The problem and a variation are modeled via bottleneck shortest paths and cycles. Optimization algorithms are developed for both, and the first has been implemented with demonstrable impact on the company. The second represents a new class of constrained shortest cycle problems.

Page Thumbnails

  • Thumbnail: Page 
293
    293
  • Thumbnail: Page 
294
    294
  • Thumbnail: Page 
295
    295
  • Thumbnail: Page 
296
    296
  • Thumbnail: Page 
297
    297
  • Thumbnail: Page 
298
    298
  • Thumbnail: Page 
299
    299
  • Thumbnail: Page 
300
    300
  • Thumbnail: Page 
301
    301
  • Thumbnail: Page 
302
    302
  • Thumbnail: Page 
303
    303
  • Thumbnail: Page 
304
    304