The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A Benchmark for the Comparison of 3-D Motion Segmentation Algorithms
Abstract
Over the past few years, several methods for segmenting a scene containing multiple rigidly moving objects have been proposed. However, most existing methods have been tested on a handful of sequences only, and each method has been often tested on a different set of sequences. Therefore, the comparison of different methods has been fairly limited. In this paper, we compare four 3D motion segmentation algorithms for affine cameras on a benchmark of 155 motion sequences of checkerboard, traffic, and articulated scenes.
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
Fischler, M. A., & Bolles, R. C. (1981) · Communications of the ACM · doi:10.1145/358669.358692 · Cited by 25,893
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Generalized principal component analysis (GPCA)
Vidal, R., Ma, Y., & Sastry, S. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.244 · Cited by 1,038
Self-citationA Multibody Factorization Method for Independently Moving Objects
Costeira, J. P., & Kanade, T. (1998) · International Journal of Computer Vision · doi:10.1023/a:1008000628999 · Cited by 661
Yan, J., & Pollefeys, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11744085_8 · Cited by 489
Geometric motion segmentation and model selection
Torr, P. H. S. (1998) · Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.1998.0224 · Cited by 307
Damped Newton Algorithms for Matrix Factorization with Missing Data
Buchanan, A. M., & Fitzgibbon, A. W. (2005) · 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) · doi:10.1109/cvpr.2005.118 · Cited by 299
Two-View Multibody Structure from Motion
Vidal, R., Ma, Y., Soatto, S., et al. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-005-4839-7 · Cited by 149
Self-citationGeometric Information Criterion for Model Selection
Kanatani, K. (1998) · International Journal of Computer Vision · doi:10.1023/a:1007948927139 · Cited by 120
Perspective n-View Multibody Structure-and-Motion Through Model Selection
Konrad Schindler, B., James, U., & Wang, H. (2006) · Lecture notes in computer science · doi:10.1007/11744023_47 · Cited by 59
Cited by
Robust Recovery of Subspace Structures by Low-Rank Representation
Liu, G., Lin, Z., Yan, S., Sun, J., Yu, Y., & Ma, Y. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.88 · Cited by 3,594
Sparse Subspace Clustering: Algorithm, Theory, and Applications
Elhamifar, E., & Vidal, R. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.57 · Cited by 3,106
Self-citationA Benchmark Dataset and Evaluation Methodology for Video Object Segmentation
Perazzi, F., Pont-Tuset, J., McWilliams, B., Van Gool, L., Gross, M., & Sorkine-Hornung, A. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.85 · Cited by 1,989
Vidal, R. (2011) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.939739 · Cited by 1,126
Self-citationLinearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation
Lin, Z., Liu, R., & Su, Z. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.0367 · Cited by 992
Object Segmentation by Long Term Analysis of Point Trajectories
Brox, T., & Malik, J. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15555-0_21 · Cited by 744
Latent Low-Rank Representation for subspace segmentation and feature extraction
Liu, G., & Yan, S. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126422 · Cited by 679
Moving Object Detection by Detecting Contiguous Outliers in the Low-Rank Representation
Zhou, X., Yang, C., & Yu, W. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.132 · Cited by 648
Segmentation of Moving Objects by Long Term Video Analysis
Ochs, P., Malik, J., & Brox, T. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.242 · Cited by 585
Prasad, D. K., Rajan, D., Rachmawati, L., Rajabally, E., & Quek, C. (2017) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2016.2634580 · Cited by 487
Low rank subspace clustering (LRSC)
Vidal, R., & Favaro, P. (2014) · Pattern Recognition Letters · doi:10.1016/j.patrec.2013.08.006 · Cited by 482
Self-citationSubspace Clustering by Block Diagonal Representation
Lu, C., Feng, J., Lin, Z., Mei, T., & Yan, S. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2794348 · Cited by 472
A geometric analysis of subspace clustering with outliers
Soltanolkotabi, M., & Candés, E. J. (2012) · The Annals of Statistics · doi:10.1214/12-aos1034 · Cited by 411
Fast approximate energy minimization with label costs
Delong, A., Osokin, A., Isack, H. N., & Boykov, Y. (2010) · 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2010.5539897 · Cited by 404
Visual SLAM and Structure from Motion in Dynamic Environments: A Survey
Saputra, M. R. U., Markham, A., & Trigoni, N. (2019) · ACM Computing Surveys · doi:10.1145/3177853 · Cited by 398
Fast Approximate Energy Minimization with Label Costs
Delong, A., Osokin, A., Isack, H. N., & Boykov, Y. (2012) · International Journal of Computer Vision · doi:10.1007/s11263-011-0437-z · Cited by 381
Energy-Based Geometric Multi-model Fitting
Isack, H., & Boykov, Y. (2012) · International Journal of Computer Vision · doi:10.1007/s11263-011-0474-7 · Cited by 318
Smooth Representation Clustering
Hu, H., Lin, Z., Feng, J., & Zhou, J. (2014) · 2014 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2014.484 · Cited by 286
Learning Motion Patterns in Videos
Tokmakov, P., Alahari, K., & Schmid, C. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.64 · Cited by 267
Constructing the L2-Graph for Robust Subspace Learning and Subspace Clustering
Peng, X., Yu, Z., Yi, Z., & Tang, H. (2017) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2016.2536752 · Cited by 257
Metadata
- Authors
- Tron, R., & Vidal, R.
- Venue
- 2007 IEEE Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2007-06
- Pages
- 1-8
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2052311585
- Cited by
- 658
- References
- 10
- FWCI
- 16.15
- 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.