ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술대회 Fast Image Retrieval with Grid-based Keypoint Detector and Binary Descriptor
Cited 1 time in scopus Download 1 time Share share facebook twitter linkedin kakaostory
저자
최수길, 한승완
발행일
201410
출처
International Conference on Information and Communication Technology Convergence (ICTC) 2014, pp.679-680
DOI
https://dx.doi.org/10.1109/ICTC.2014.6983253
협약과제
14MS2700, 스마트 단말용 스트리밍 유해 컨텐츠 차단 기술 개발, 한승완
초록
As an alternative to vector-based descriptors, such as SIFT and SURF, more computationally efficient binary descriptors, such as BRISK and ORB, have recently been proposed. These binary descriptors are usually used in combination with a novel scale-space FAST-based detector to be suitable for real-time applications, but it consumes more time than creating binary descriptors. Therefore, if accuracy can be kept similar, keypoint sampling by a grid is better than FAST-based detector because it consumes almost no time. In this paper, grid-based sampling and BRISK keypoint detector are tested for image retrieval. Experimental results demonstrate that grid-based sampling out performs keypoint detector in terms of accuracy and processing speed.
KSP 제안 키워드
Binary descriptors, Computationally Efficient, Fast image retrieval, Keypoint detector, Processing speed, Real-time application, SIFT and SURF, Scale space, grid-based sampling