paper-with-me

홈 › Papers

The CUDA LATCH Binary Descriptor: Because Sometimes Faster Means Better

2016-09-13 · Christopher Parker, Matthew Daiter, Kareem Omar, Gil Levi, Tal Hassner

Accuracy, descriptor size, and the time required for extraction and matching are all important factors when selecting local image descriptors. To optimize over all these requirements, this paper presents a CUDA port for the recent Learned Arrangement of Three Patches (LATCH) binary descriptors to the GPU platform. The design of LATCH makes it well suited for GPU processing. Owing to its small size and binary nature, the GPU can further be used to efficiently match LATCH features. Taken together, this leads to breakneck descriptor extraction and matching speeds. We evaluate the trade off between these speeds and the quality of results in a feature matching intensive application. To this end, we use our proposed CUDA LATCH (CLATCH) to recover structure from motion (SfM), comparing 3D reconstructions and speed using different representations. Our results show that CLATCH provides high quality 3D reconstructions at fractions of the time required by other representations, with little, if any, loss of reconstruction quality.

📄 PDF Abstract BibTeX arXiv:1609.03986

Code (4)

komrad36/CLATCH
komrad36/LATCH
komrad36/UCLATCH
komrad36/ULATCH

Tasks

GPU

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Similar Papers 제목 키워드 기반

LATCH: Learned Arrangements of Three Patch Codes

2015-01-15 · Gil Levi, Tal Hassner

We present a novel means of describing local image appearances using binary strings. Binary descriptors have drawn increasing interest in recent years due to their speed and low memory footprint. A known shortcoming of t…

Performance Analysis of Keypoint Detectors and Binary Descriptors Under Varying Degrees of Photometric and Geometric Transformations

2020-12-08 · Shuvo Kumar Paul, Pourya Hoseini, Mircea Nicolescu, Monica Nicolescu

Detecting image correspondences by feature matching forms the basis of numerous computer vision applications. Several detectors and descriptors have been presented in the past, addressing the efficient generation of feat…

Content-Based Image Retrieval Based on Late Fusion of Binary and Local Descriptors

2017-03-24 · Nouman Ali, Danish Ali Mazhar, Zeshan Iqbal, Rehan Ashraf 외

One of the challenges in Content-Based Image Retrieval (CBIR) is to reduce the semantic gaps between low-level features and high-level semantic concepts. In CBIR, the images are represented in the feature space and the p…

Content-Based Image RetrievalImage RetrievalRetrievalTranslation

GPGPU Acceleration of the KAZE Image Feature Extraction Algorithm

2017-06-21 · Ramkumar B, R. S. Hegde, Rob Laber, Hristo Bojinov

The recently proposed open-source KAZE image feature detection and description algorithm offers unprecedented performance in comparison to conventional ones like SIFT and SURF as it relies on nonlinear scale spaces inste…

CPUGPU

MREAK : Morphological Retina Keypoint Descriptor

2019-01-24 · Himanshu Vaghela, Manan Oza, Sudhir Bagul

A variety of computer vision applications depend on the efficiency of image matching algorithms used. Various descriptors are designed to detect and match features in images. Deployment of this algorithms in mobile appli…