Object Detection Using Keygraphs
원문 초록
We propose a new framework for object detection based on a generalization of the keypoint correspondence framework. This framework is based on replacing keypoints by keygraphs, i.e. isomorph directed graphs whose vertices are keypoints, in order to explore relative and structural information. Unlike similar works in the literature, we deal directly with graphs in the entire pipeline: we search for graph correspondences instead of searching for individual point correspondences and then building graph correspondences from them afterwards. We also estimate the pose from graph correspondences instead of falling back to point correspondences through a voting table. The contributions of this paper are the proposed framework and an implementation that properly handles its inherent issues of loss of locality and combinatorial explosion, showing its viability for real-time applications. In particular, we introduce the novel concept of keytuples to solve a running time issue. The accuracy of the implementation is shown by results of over 800 experiments with a well-known database of images. The speed is illustrated by real-time tracking with two different cameras in ordinary hardware.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Universal Fine-grained Visual Categorization by Concept Guided Learning
Integrity Assessment of Maritime Object Detection Impacted by Partial Camera Obstruction
Ensemble Fusion for Small Object Detection
Small Object Detection for Birds with Swin Transformer
Domain Generalized Object Detection for Remote Sensing Images
Context-Aware Block Net for Small Object Detection
토론
이 논문과 연결된 포럼 글이 아직 없습니다.