Part Discovery from Partial Correspondence
We study the problem of part discovery when partial correspondence between instances of a category are available. For visual categories that exhibit high diversity in structure such as buildings, our approach can be used to discover parts that are hard to name, but can be easily expressed as a correspondence between pairs of images. Parts naturally emerge from point-wise landmark matches across many instances within a category. We propose a learning framework for automatic discovery of parts in such weakly supervised settings, and show the utility of the rich part library learned in this way for three tasks: object detection, category-specific saliency estimation, and fine-grained image parsing.
Code (0)
등록된 구현이 없습니다.
Tasks
Diversityobject-detectionObject DetectionSaliency PredictionSimilar Papers 제목 키워드 기반
EchoMatch: Partial-to-Partial Shape Matching via Correspondence Reflection
Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics. While most research has focused on finding correspondences in settings where at least one of the shapes is complete, the…
PRNet: Self-Supervised Learning for Partial-to-Partial Registration
We present a simple, flexible, and general framework titled Partial Registration Network (PRNet), for partial-to-partial point cloud registration. Inspired by recently-proposed learning-based methods for registration, we…
Point Cloud RegistrationSelf-Supervised LearningPartial Functional Correspondence
In this paper, we propose a method for computing partial functional correspondence between non-rigid shapes. We use perturbation analysis to show how removal of shape parts changes the Laplace-Beltrami eigenfunctions, an…
Multi-Features Guidance Network for partial-to-partial point cloud registration
To eliminate the problems of large dimensional differences, big semantic gap, and mutual interference caused by hybrid features, in this paper, we propose a novel Multi-Features Guidance Network for partial-to-partial po…
Computational EfficiencyPoint Cloud RegistrationAn Integer Linear Programming Approach to Geometrically Consistent Partial-Partial Shape Matching
The task of establishing correspondences between two 3D shapes is a long-standing challenge in computer vision. While numerous studies address full-full and partial-full 3D shape matching, only a limited number of works …