Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015 (2015), Article ID 310704, 10 pages
Research Article

A New Scheme for Keypoint Detection and Description

1College of Mechanical Engineering, Jiangsu University, Zhenjiang, Jiangsu 212013, China
2Department of Mathematics, Hunan University of Humanities, Science and Technology, Loudi, Hunan 417000, China

Received 9 February 2015; Revised 17 April 2015; Accepted 4 May 2015

Academic Editor: Anders Eriksson

Copyright © 2015 Lian Yang and Zhangping Lu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


The keypoint detection and its description are two critical aspects of local keypoints matching which is vital in some computer vision and pattern recognition applications. This paper presents a new scale-invariant and rotation-invariant detector and descriptor, coined, respectively, DDoG and FBRK. At first the Hilbert curve scanning is applied to converting a two-dimensional (2D) digital image into a one-dimensional (1D) gray-level sequence. Then, based on the 1D image sequence, an approximation of DoG detector using second-order difference-of-Gaussian function is proposed. Finally, a new fast binary ratio-based keypoint descriptor is proposed. That is achieved by using the ratio-relationships of the keypoint pixel value with other pixel of values around the keypoint in scale space. Experimental results show that the proposed methods can be computed much faster and approximate or even outperform the existing methods with respect to performance.