Scalable Cluster-Consistency Statistics for Robust Multi-Object Matching
We develop new statistics for robustly filtering corrupted keypoint matches in the structure from motion pipeline. The statistics are based on consistency constraints that arise within the clustered structure of the graph of keypoint matches. The statistics are designed to give smaller values to corrupted matches and than uncorrupted matches. These new statistics are combined with an iterative reweighting scheme to filter keypoints, which can then be fed into any standard structure from motion pipeline. This filtering method can be efficiently implemented and scaled to massive datasets as it only requires sparse matrix multiplication. We demonstrate the efficacy of this method on synthetic and real structure from motion datasets and show that it achieves state-of-the-art accuracy and speed in these tasks.
Code (1)
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Asymptotics for The $k$-means
The $k$-means is one of the most important unsupervised learning techniques in statistics and computer science. The goal is to partition a data set into many clusters, such that observations within clusters are the most …
ClusteringSTICC: A multivariate spatial clustering method for repeated geographic pattern discovery with consideration of spatial contiguity
Spatial clustering has been widely used for spatial data mining and knowledge discovery. An ideal multivariate spatial clustering should consider both spatial contiguity and aspatial attributes. Existing spatial clusteri…
AttributeClusteringRank-Consistency Deep Hashing for Scalable Multi-Label Image Search
As hashing becomes an increasingly appealing technique for large-scale image retrieval, multi-label hashing is also attracting more attention for the ability to exploit multi-level semantic contents. In this paper, we pr…
ClusteringDeep HashingImage RetrievalRetrieval+3Deep Incomplete Multi-View Clustering via Hierarchical Imputation and Alignment
Incomplete multi-view clustering (IMVC) aims to discover shared cluster structures from multi-view data with partial observations. The core challenges lie in accurately imputing missing views without introducing bias, wh…
Incomplete multi-view clusteringContrastive Lift: 3D Object Instance Segmentation by Slow-Fast Contrastive Fusion
Instance segmentation in 3D is a challenging task due to the lack of large-scale annotated datasets. In this paper, we show that this task can be addressed effectively by leveraging instead 2D pre-trained models for inst…
ClusteringInstance SegmentationObject TrackingSemantic Segmentation