Revisiting Binary Local Image Description for Resource Limited Devices
원문 초록
The advent of a panoply of resource limited devices opens up new challenges in the design of computer vision algorithms with a clear compromise between accuracy and computational requirements. In this paper we present new binary image descriptors that emerge from the application of triplet ranking loss, hard negative mining and anchor swapping to traditional features based on pixel differences and image gradients. These descriptors, BAD (Box Average Difference) and HashSIFT, establish new operating points in the state-of-the-art's accuracy vs.\ resources trade-off curve. In our experiments we evaluate the accuracy, execution time and energy consumption of the proposed descriptors. We show that BAD bears the fastest descriptor implementation in the literature while HashSIFT approaches in accuracy that of the top deep learning-based descriptors, being computationally more efficient. We have made the source code public.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Attributes Shape the Embedding Space of Face Recognition Models
Text-Visual Semantic Constrained AI-Generated Image Quality Assessment
Improving Large Language Model Safety with Contrastive Representation Learning
Enhancing Medical Dialogue Generation through Knowledge Refinement and Dynamic Prompt Adjustment
Boosting Vulnerability Detection of LLMs via Curriculum Preference Optimization with Synthetic Reasoning Data
MonkeyOCR: Document Parsing with a Structure-Recognition-Relation Triplet Paradigm
토론
이 논문과 연결된 포럼 글이 아직 없습니다.