Abstract
Optical image dense matching is a crucial step in the process of generating digital surface models (DSMs). Many existing dense matching methods have adopted pixelwise matching strategy and have achieved precise matching results; however, the methods are time consuming and have limited efficiency in high surveying and mapping production. We introduce a bridge probability relaxation matching method for automatic DSM generation. The method adopts a coarse-to-fine hierarchical strategy and achieves high matching accuracy and fast processing speed simultaneously. This method builds a self-adaptive disparity surface model in a local area and constrains the disparity surface using the spatial relationship between feature points and adjacent pixels. Finally, the disparity is optimized by calculating the increment of the relaxation iteration probability. Experiments are based on different areas with different textures and terrain types. Compared with the DSMs derived from semi-global matching, our proposed approach achieves high levels of accuracy and efficiency in automatic DSM generation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.