A Higher-Order CRF Model for Road Network Extraction

• Published in: 2013 IEEE Conference on Computer Vision and Pattern Recognition pp. 1698 - 1705
• Main Authors: Wegner, Jan D., Montoya-Zegarra, Javier A., Schindler, Konrad
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.06.2013
• Subjects: CRF; Data mining; graphical models; high-order potentials; Image segmentation; Junctions; Labeling; road network extraction; Roads; Tiles
• ISSN: 1063-6919; 1063-6919
• DOI: 10.1109/CVPR.2013.222

The aim of this work is to extract the road network from aerial images. What makes the problem challenging is the complex structure of the prior: roads form a connected network of smooth, thin segments which meet at junctions and crossings. This type of a-priori knowledge is more difficult to turn into a tractable model than standard smoothness or co-occurrence assumptions. We develop a novel CRF formulation for road labeling, in which the prior is represented by higher-order cliques that connect sets of super pixels along straight line segments. These long-range cliques have asymmetric P N -potentials, which express a preference to assign all rather than just some of their constituent super pixels to the road class. Thus, the road likelihood is amplified for thin chains of super pixels, while the CRF is still amenable to optimization with graph cuts. Since the number of such cliques of arbitrary length is huge, we furthermore propose a sampling scheme which concentrates on those cliques which are most relevant for the optimization. In experiments on two different databases the model significantly improves both the per-pixel accuracy and the topological correctness of the extracted roads, and outperforms both a simple smoothness prior and heuristic rule-based road completion.