Local Descriptor by Zernike Moments for Real-time Keypoint Matching

This paper presents a real-time keypoint matching algorithm using a local descriptor derived by Zernike moments. From an input image, we find a set of keypoints by using an existing corner detection algorithm. At each keypoint we extract a fixed size image patch and compute a local descriptor derived by Zernike moments. The proposed local descriptor is invariant to rotation and illumination changes. In order to speed up the computation of Zernike moments, we compute the Zernike basis functions in advance and store them in a set of lookup tables. The matching is performed with an Approximate Nearest Neighbor (ANN) method and refined by a RANSAC algorithm. In the experiments we confirmed that videos of frame size 320×240 with the scale, rotation, illumination and even 3D viewpoint changes are processed at 25~30Hz using the proposed method. Unlike existing keypoint matching algorithms, our approach also works in realtime for registering a reference image

A comparative evaluation of interest point detectors and local descriptors for visual SLAM

Abstract In this paper we compare the behavior of different interest points detectors and descriptors under the conditions needed to be used as landmarks in vision-based simultaneous localization and mapping (SLAM). We evaluate the repeatability of the detectors, as well as the invariance and distinctiveness of the descriptors, under different perceptual conditions using sequences of images representing planar objects as well as 3D scenes. We believe that this information will be useful when selecting an appropriat

Local descriptors for visual SLAM

We present a comparison of several local image descriptors in the context of visual Simultaneous Localization and Mapping (SLAM). In visual SLAM a set of points in the environment are extracted from images and used as landmarks. The points are represented by local descriptors used to resolve the association between landmarks. In this paper, we study the class separability of several descriptors under changes in viewpoint and scale. Several experiments were carried out using sequences of images in 2D and 3D scenes

Copy-move forgery detection using convolutional neural network and K-mean clustering

Copying and pasting a patch of an image to hide or exaggerate something in a digital image is known as a copy-move forgery. Copy-move forgery detection (CMFD) is hard to detect because the copied part image from a scene has similar properties with the other parts of the image in terms of texture, light illumination, and objective. The CMFD is still a challenging issue in some attacks such as rotation, scaling, blurring, and noise. In this paper, an approach using the convolutional neural network (CNN) and k-mean clustering is for CMFD. To identify cloned parts candidates, a patch of an image is extracted using corner detection. Next, similar patches are detected using a pre-trained network inspired by the Siamese network. If two similar patches are not evidence of the CMFD, the post-process is performed using k-means clustering. Experimental analyses are done on MICC-F2000, MICC-F600, and MICC-F8 databases. The results showed that using the proposed algorithm we can receive a 94.13% and 96.98% precision and F1 score, respectively, which are the highest among all state-of-the-art algorithms