The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
A Higher-Order CRF Model for Road Network Extraction
Abstract
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 PN-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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
Fast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988
Cited by
Computer Vision for Autonomous Vehicles: Problems, Datasets and State of the Art
Janai, J., Güney, F., Behl, A., & Geiger, A. (2020) · Foundations and Trends® in Computer Graphics and Vision · doi:10.1561/0600000079 · Cited by 643
DeepRoadMapper: Extracting Road Topology from Aerial Images
Mattyus, G., Luo, W., & Urtasun, R. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.372 · Cited by 560
associated_data_Investigating the Effectiveness of clDice Loss for Road Crack Segmentation
Pereira, V. (2025) · arXiv (Cornell University) · doi:10.5281/zenodo.15696262 · Cited by 548
Cheng, G., Wang, Y., Xu, S., Wang, H., Xiang, S., & Pan, C. (2017) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2017.2669341 · Cited by 437
RoadTracer: Automatic Extraction of Road Networks from Aerial Images
Bastani, F., He, S., Abbar, S., Alizadeh, M., Balakrishnan, H., Chawla, S., Madden, S., & DeWitt, D. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00496 · Cited by 359
SpaceNet: A Remote Sensing Dataset and Challenge Series
Etten, A. V., Lindenbaum, D., & Bacastow, T. M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.01232 · Cited by 343
Learning Aerial Image Segmentation From Online Maps
Kaiser, P., Wegner, J. D., Lucchi, A., Jaggi, M., Hofmann, T., & Schindler, K. (2017) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2017.2719738 · Cited by 290
Self-citationAbdollahi, A., Pradhan, B., Shukla, N., Chakraborty, S., & Alamri, A. (2020) · Remote Sensing · doi:10.3390/rs12091444 · Cited by 287
Beyond the Pixel-Wise Loss for Topology-Aware Delineation
Mosinska, A., Marquez-Neila, P., Kozinski, M., & Fua, P. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00331 · Cited by 258
Semantic segmentation of urban scenes by learning local class interactions
Volpi, M., & Ferrari, V. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW) · doi:10.1109/cvprw.2015.7301377 · Cited by 152
Hierarchical Recurrent Attention Networks for Structured Online Maps
Homayounfar, N., Ma, W.-C., Lakshmikanth, S. K., & Urtasun, R. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00360 · Cited by 71
clDice - a Novel Topology-Preserving Loss Function for Tubular Structure Segmentation
Shit, S., Paetzold, J. C., Sekuboyina, A., Ezhov, I., Unger, A., Zhylka, A., Pluim, J. P. W., Bauer, U., & Menze, B. H. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01629 · Cited by 60
“For non-binary geometries, existing methods applied topology and connectivity constraints onto variational and Markov random field-based methods: tree shape priors for vessel segmentation [44], graph representation priors to natural images [2], higher-order cliques which connect superpixels [53] and adversarial learni…”
Method
Metadata
- Authors
- Wegner, J. D., Montoya-Zegarra, J. A., & Schindler, K.
- Venue
- 2013 IEEE Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2013-06
- Pages
- 1698-1705
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2155226776
- Cited by
- 197
- References
- 2
- FWCI
- 19.08
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.