최소 단어 이상 선택하여야 합니다.
최대 10 단어까지만 선택 가능합니다.
다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기정보과학회논문지 = Journal of KIISE, v.44 no.12, 2017년, pp.1313 - 1318
이수원 (한국과학기술원 전산학부)
Aggregating local features in a single vector is a fundamental problem in an image search. In this process, the image search process can be speeded up if binary features which are extracted almost two order of magnitude faster than gradient-based features are utilized. However, in order to utilize t...
D. Lowe, “Distinctive image features from scaleinvariant keypoints,” International Journal of Computer Vision, Vol. 60, No. 2, pp. 91-110, 2004.
J. Sivic, and A. Zisserman, "Video Google: a text retrieval approach to object matching in videos," Proc. of the IEEE International Conference on Computer Vision 2003, pp. 1470-1477, 2003.
E. Rosten, and T. Drummond, "Machine learning for high-speed corner detection," Proc. of the European Conference on Computer Vision 2006, pp. 430-443, 2006.
M. Calonder, V. Lepetit, C. Strecha, and P. Fua, "BRIEF: binary robust independent elementary features," Proc. of the European Conference on Computer Vision 2010, pp. 5-11, 2010.
E. Rublee, V. Rabaud, K. Konolige, and G. Bradski, "ORB: an efficient alternative to SIFT or SURF," Proc. of the International Conference on Computer Vision 2011, pp. 2564-2571, 2011.
S. Leutenegger, M. Chli, and R. Siegwart, "BRISK: Binary robust invariant scalable keypoints," Proc. of the International Conference on Computer Vision 2011, pp. 2548-2555, 2011.
A. Alahi, R. Ortiz, and P. Vandergheynst, "FREAK: Fast Retina Keypoint," Proc. of the IEEE Conference on Computer Vision and Pattern Recognition 2012, pp. 510-517, 2012.
D. Arthur, and S. Vassilvitskii, "k-means++: the advantages of careful seeding," Proc. of the 18th annual ACM-SIAM symposium on Discrete algorithms 2007, pp. 1027-1035, 2007.
D. Nister, and H. Stewenius, "Scalable recognition with a vocabulary tree," Proc. of the IEEE Conference on Computer Vision and Pattern Recognition 2006, pp. 2161-2168, 2006.
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.