paper-with-me

홈 › Papers

Deep Shape Matching

2017-09-11 · ECCV 2018 9 · Filip Radenović, Giorgos Tolias, Ondřej Chum

We cast shape matching as metric learning with convolutional networks. We break the end-to-end process of image representation into two parts. Firstly, well established efficient methods are chosen to turn the images into edge maps. Secondly, the network is trained with edge maps of landmark images, which are automatically obtained by a structure-from-motion pipeline. The learned representation is evaluated on a range of different tasks, providing improvements on challenging cases of domain generalization, generic sketch-based image retrieval or its fine-grained counterpart. In contrast to other methods that learn a different model per task, object category, or domain, we use the same network throughout all our experiments, achieving state-of-the-art results in multiple benchmarks.

📄 PDF Abstract BibTeX arXiv:1709.03409

Code (2)

janesjanes/sketchy 공식 구현
filipradenovic/cnnimageretrieval pytorch

Tasks

Domain GeneralizationImage RetrievalMetric LearningRetrievalSketch-Based Image Retrieval

Similar Papers 제목 키워드 기반

Unsupervised Deep Multi-Shape Matching

2022-07-20 · Dongliang Cao, Florian Bernard

3D shape matching is a long-standing problem in computer vision and computer graphics. While deep neural networks were shown to lead to state-of-the-art results in shape matching, existing learning-based approaches are l…

CCuantuMM: Cycle-Consistent Quantum-Hybrid Matching of Multiple Shapes

2023-03-28 · CVPR 2023 1 · Harshil Bhatia, Edith Tretschk, Zorah Lähner, Marcel Seelbach Benkner 외

Jointly matching multiple, non-rigidly deformed 3D shapes is a challenging, $\mathcal{NP}$-hard problem. A perfect matching is necessarily cycle-consistent: Following the pairwise point correspondences along several shap…

SpiderMatch: 3D Shape Matching with Global Optimality and Geometric Consistency

2024-01-01 · CVPR 2024 1 · Paul Roetzer, Florian Bernard

Finding shortest paths on product spaces is a popular approach to tackle numerous variants of matching problems including the dynamic time warping method for matching signals the matching of curves or the matching of…

Dynamic Time Warping

Geometrically Consistent Partial Shape Matching

2023-09-10 · Viktoria Ehm, Paul Roetzer, Marvin Eisenberger, Maolin Gao 외

Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or texture transfer. An often neglected but…

Pose Transfer

Fast Globally Optimal and Geometrically Consistent 3D Shape Matching

2025-04-08 · Paul Roetzer, Florian Bernard

Geometric consistency, i.e. the preservation of neighbourhoods, is a natural and strong prior in 3D shape matching. Geometrically consistent matchings are crucial for many downstream applications, such as texture transfe…