Abstract

Seamline network generation from multiple aerial images with overlapping regions is a key issue for creating seamless and large-scale digital orthophoto maps (DOMs). In this letter, an efficient algorithm is proposed that can find adequate networks from hundreds of aerial images in several minutes. It can also be ensured that the seamline passes through weakly textured regions as much as possible. The proposed algorithm consists of two steps. First, the regions overlapped by the images are triangulated into a mesh. Second, a labeling <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$l$ </tex-math></inline-formula> is computed that assigns an image <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$l_{i}$ </tex-math></inline-formula> as a texture for each triangle using a Markov random field energy function. Triangulating the overlapping area of the images can greatly improve the efficiency of the seamline network generation, and by designing a smoothing term with a divergence difference between images, the seamline network passes through the weakly textured area as much as possible. In addition, we also use a hierarchical optimization strategy to improve efficiency in large-scale scenes. The proposed method can be easily combined with other data information (e.g., a digital surface model), or other auxiliary methods (e.g., building segmentation), to generate high-quality seamline networks. Experimental results on numerous challenging datasets show that the proposed algorithm can achieve high-quality seamline networks efficiently. Moreover, it outperforms several existing methods and software.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.