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

References

• Ahuja R. K. , et al. Faster algorithms for the shortest path problem. J. Assoc. Comput. Machinery (1990) 37 213 223 Crossref, Google Scholar
• Berman O. , Handler G. Y. Optimal minimax path of a single service unit on a network to nonservice destinations. Transportation Sci. (1987) 21 115 122 Link, Google Scholar
• Dijkstra E. W. A note on two problems in connexion with graphs. Numerische Mathematik (1959) 1 165 175 Crossref, Google Scholar
• Edmonds J. , Fulkerson D. R. Bottleneck extrema. (1968) (The Rand Corporation, Santa Monica, CA) . RM-5375-PR Google Scholar
• (1996) (Erdas, Inc., Atlanta, GA) . Erdas Imagina Google Scholar
• Fernandez E. , Garfinkel R. , Arbiol R. Mosaicking of aerial photographic maps via seams defined by bottleneck shortest paths. (1996) . Working paper DR 96/13, Department of Statistics and Operations Research, Polytechnic University of Catalonia, Spain Google Scholar
• Garfinkel R. , Neebe A. , Rao M. R. The m-center problem: Minimax facility location. Management Sci. (1977) 23 1133 1142 Link, Google Scholar
• Jensen J. R. Introductory Digital Image Processing (1986) (Prentice-Hall, New York) Google Scholar
• Milgram D. L. Computer methods for creating photomosaics. IEEE Trans. Comput. (1975) C-24 1113 1119 Crossref, Google Scholar
• Milgram D. L. Adaptive techniques for photomosaicking. IEEE Trans. Comput. (1977) C-26 1175 1180 Crossref, Google Scholar
• Shiren Y. , Li L. , Peng G. Two-dimensional seam-point searching in digital image matching. Photogrammetric Engrg. Remote Sensing (1989) 55 49 53 Google Scholar
• Soofi K. A. , Smith R. S. U. , Siregard R. A planimetrically accurate SPOT image mosaic of button island. Photogrammetric Engrg. Remote Sensing (1991) 57 1217 1220 Google Scholar