paper-with-me

홈 › Papers

Feature Fusion for Robust Patch Matching With Compact Binary Descriptors

2019-01-11 · Andrea Migliorati, Attilio Fiandrotti, Gianluca Francini, Skjalg Lepsoy, Riccardo Leonardi

This work addresses the problem of learning compact yet discriminative patch descriptors within a deep learning framework. We observe that features extracted by convolutional layers in the pixel domain are largely complementary to features extracted in a transformed domain. We propose a convolutional network framework for learning binary patch descriptors where pixel domain features are fused with features extracted from the transformed domain. In our framework, while convolutional and transformed features are distinctly extracted, they are fused and provided to a single classifier which thus jointly operates on convolutional and transformed features. We experiment at matching patches from three different datasets, showing that our feature fusion approach outperforms multiple state-of-the-art approaches in terms of accuracy, rate, and complexity.

📄 PDF Abstract BibTeX arXiv:1901.03547

Code (0)

등록된 구현이 없습니다.

Tasks

Patch Matching

Similar Papers 제목 키워드 기반

Learning Deep Binary Descriptor With Multi-Quantization

2017-07-01 · CVPR 2017 7 · Yueqi Duan, Jiwen Lu, Ziwei Wang, Jianjiang Feng 외

In this paper, we propose an unsupervised feature learning method called deep binary descriptor with multi-quantization (DBD-MQ) for visual matching. Existing learning-based binary descriptors such as compact binary face…

BinarizationImage RetrievalQuantizationRetrieval

Identifying Corresponding Patches in SAR and Optical Images with a Pseudo-Siamese CNN

2018-01-25 · Lloyd H. Hughes, Michael Schmitt, Lichao Mou, Yuanyuan Wang 외

In this letter, we propose a pseudo-siamese convolutional neural network (CNN) architecture that enables to solve the task of identifying corresponding patches in very-high-resolution (VHR) optical and synthetic aperture…

Key Point Matching

Boosting Binary Keypoint Descriptors

2013-06-01 · CVPR 2013 6 · Tomasz Trzcinski, Mario Christoudias, Pascal Fua, Vincent Lepetit

Binary keypoint descriptors provide an efficient alternative to their floating-point competitors as they enable faster processing while requiring less memory. In this paper, we propose a novel framework to learn an extre…

BinGAN: Learning Compact Binary Descriptors with a Regularized GAN

2018-06-18 · NeurIPS 2018 12 · Maciej Zieba, Piotr Semberecki, Tarek El-Gaaly, Tomasz Trzcinski

In this paper, we propose a novel regularization method for Generative Adversarial Networks, which allows the model to learn discriminative yet compact binary representations of image patches (image descriptors). We empl…

Dimensionality ReductionRetrieval

BitDance: Scaling Autoregressive Generative Models with Binary Tokens

2026-02-15 · Yuang Ai, Jiaming Han, Shaobin Zhuang, Weijia Mao 외 arxiv

We present BitDance, a scalable autoregressive (AR) image generator that predicts binary visual tokens instead of codebook indices. With high-entropy binary latents, BitDance lets each token represent up to $2^{256}$ sta…

Text-to-Image Generation