The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Contextual classification with functional Max-Margin Markov Networks
Open accessAbstract
We address the problem of label assignment in computer vision: given a novel 3D or 2D scene, we wish to assign a unique label to every site (voxel, pixel, superpixel, etc.). To this end, the Markov Random Field framework has proven to be a model of choice as it uses contextual information to yield improved classification results over locally independent classifiers. In this work we adapt a functional gradient approach for learning high-dimensional parameters of random fields in order to perform discrete, multi-label classification. With this approach we can learn robust models involving high-order interactions better than the previously used learning method. We validate the approach in the context of point cloud classification and improve the state of the art. In addition, we successfully demonstrate the generality of the approach on the challenging vision problem of recovering 3-D geometric surfaces from images.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Greedy function approximation: A gradient boosting machine
Friedman, J. H. (2001) · The Annals of Statistics · doi:10.1214/aos/1013203451 · Cited by 30,731
Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data
Lafferty, J., McCallum, A., & Pereira, F. C. N. (2001) · ScholarlyCommons (University of Pennsylvania) · Cited by 12,935
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
An efficient k-means clustering algorithm: analysis and implementation
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017616 · Cited by 5,660
Make3D: Learning 3D Scene Structure from a Single Still Image
Saxena, A., Sun, M., & Ng, A. Y. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.132 · Cited by 1,736
Taskar, B., Guestrin, C., & Koller, D. (2003) · Cited by 1,206
Robust Higher Order Potentials for Enforcing Label Consistency
Kohli, P., Ladický, L., & Torr, P. H. S. (2009) · International Journal of Computer Vision · doi:10.1007/s11263-008-0202-0 · Cited by 853
Recovering Surface Layout from an Image
Hoiem, D., Efros, A. A., & Hebert, M. (2007) · International Journal of Computer Vision · doi:10.1007/s11263-006-0031-y · Cited by 674
Self-citationKumar, S., & Hebert, M. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-006-7007-9 · Cited by 392
Self-citationA Comparative Study of Energy Minimization Methods for Markov Random Fields
Szeliski, R., Zabih, R., Scharstein, D., Veksler, O., Kolmogorov, V., Agarwala, A., Tappen, M., & Rother, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744047_2 · Cited by 386
Discriminative Learning of Markov Random Fields for Segmentation of 3D Scan Data
Anguelov, D., Taskar, B., Chatalbashev, V., Koller, D., Gupta, D., Heitz, G., & Ng, A. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.133 · Cited by 356
Contextual models for object detection using boosted random fields
Torralba, A. B., Murphy, K. P., & Freeman, W. T. (2004) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 301
Learning CRFs Using Graph Cuts
Szummer, M., Kohli, P., & Hoiem, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88688-4_43 · Cited by 243
P3 & Beyond: Solving Energies with Higher Order Cliques
Kohli, P., Kumar, M. P., & Torr, P. H. S. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383204 · Cited by 223
Robust higher order potentials for enforcing label consistency
Kohli, P., Ladicky, L., & Torr, P. H. S. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587417 · Cited by 201
Learning associative Markov networks
Taskar, B., Chatalbashev, V., & Koller, D. (2004) · Twenty-first international conference on Machine learning - ICML '04 · doi:10.1145/1015330.1015444 · Cited by 171
Volume under the ROC Surface for Multi-class Problems
Ferri, C., Hernández-Orallo, J., & Salido, M. A. (2003) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-39857-8_12 · Cited by 162
Onboard contextual classification of 3-D point clouds with learned high-order Markov Random Fields
Munoz, D., Vandapel, N., & Hebert, M. (2009) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2009.5152856 · Cited by 141
Self-citation(Online) Subgradient Methods for Structured Prediction
Ratliff, N., Bagnell, J. A., & Zinkevich, M. (2018) · doi:10.1184/r1/6549506 · Cited by 136
Self-citationBoosting Structured Prediction for Imitation Learning
Ratliff, N., Bradley, D., Bagnell, J. A., & Chestnutt, J. E. (2018) · Figshare · doi:10.1184/r1/6552212 · Cited by 122
Self-citationTraining conditional random fields via gradient tree boosting
Dietterich, T. G., Ashenfelter, A., & Bulatov, Y. (2004) · International Conference on Machine Learning · doi:10.1145/1015330.1015428 · Cited by 120
Imitation learning for locomotion and manipulation
Ratliff, N., Bagnell, J. A., & Srinivasa, S. S. (2007) · IEEE-RAS International Conference on Humanoid Robots (Humanoids) · doi:10.1109/ichr.2007.4813899 · Cited by 100
Self-citationDirectional Associative Markov Network for 3-D Point Cloud Classification
Munoz, D., Vandapel, N., & Hebert, M. (2018) · KiltHub Repository · doi:10.1184/r1/6552644 · Cited by 97
Self-citationHigh Performance Outdoor Navigation from Overhead Data using Imitation Learning
Silver, D., Bagnell, J. A., & Stentz, A. (2008) · Robotics: Science and Systems · doi:10.15607/rss.2008.iv.034 · Cited by 63
Self-citationA PAC-Bayesian Margin Bound for Linear Classifiers: Why SVMs work
Herbrich, R., & Graepel, T. (2000) · Cited by 57
Instance-based AMN classification for improved object recognition in 2D and 3D laser range data
Triebel, R., Schmidt, R. K., Mozos, Ó. M., & Burgard, W. (2007) · Lincoln Repository (University of Lincoln) · Cited by 54
Exploiting Inference for Approximate Parameter Learning in Discriminative Fields: An Empirical Study
Kumar, S., August, J., & Hebert, M. (2005) · Lecture notes in computer science · doi:10.1007/11585978_11 · Cited by 47
Self-citationTraining conditional random fields using virtual evidence boosting
Liao, L., Choudhury, T., Fox, D., et al. (2007) · Cited by 37
Scene understanding with discriminative structured prediction
Yuan, J., Li, J., & Zhang, B. (2008) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.2008.4587602 · Cited by 8
Cited by
Deep Learning for 3D Point Clouds: A Survey
Guo, Y., Wang, H., Hu, Q., Liu, H., Liu, L., & Bennamoun, M. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.3005434 · Cited by 2,398
SemanticKITTI: A Dataset for Semantic Scene Understanding of LiDAR Sequences
Behley, J., Garbade, M., Milioto, A., Quenzel, J., Behnke, S., Stachniss, C., & Gall, J. (2019) · 2019 IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2019.00939 · Cited by 2,294
Large-Scale Point Cloud Semantic Segmentation with Superpoint Graphs
Landrieu, L., & Simonovsky, M. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00479 · Cited by 1,543
SEMANTIC3D.NET: A NEW LARGE-SCALE POINT CLOUD CLASSIFICATION BENCHMARK
Hackel, T., Savinov, N., Ladicky, L., Wegner, J. D., Schindler, K., & Pollefeys, M. (2017) · ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences · doi:10.5194/isprs-annals-iv-1-w1-91-2017 · Cited by 812
Weinmann, M., Jutzi, B., Hinz, S., & Mallet, C. (2015) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2015.01.016 · Cited by 709
Metadata
- Authors
- Munoz, D., Bagnell, J. A., Vandapel, N., & Hebert, M.
- Venue
- 2009 IEEE Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2009-06
- Pages
- 975-982
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2159213092
- Cited by
- 306
- References
- 29
- FWCI
- 30.64
- Type
- conference paper
- Language
- en
- Open access
- green
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.