The chosen solution is based on a client-server architecture and the object recognition is based on local features. The study focuses on the comparison, in terms of time and performance, of the Scale-Invariant Feature Transform (SIFT), the Speeded Up Robust Features (SURF), the Nearest Neighbor Search (NNS) match and a k-means trees based search. It was found that SIFT outperforms SURF in terms...

In this paper, the well-known SIFT detector is extended with a bivariate feature localization. This is done by using function models that assume a Gaussian feature shape for the detected features. As function models we propose (a) a bivariate Gaussian and (b) a Difference of Gaussians. The proposed detector has all properties of SIFT, but provides invariance to affine transformations and blurri...

Image Registration is an important part of computer vision. We propose a method of image registration by obtaining best similarity of local geometric figure that utilizes opposite core difference (OCD) of corresponding local figure. This method gets initial matching after describing precisely SIFT points by constructing feature subspaces based on the detection of SIFT feature points. Then we de...

In this paper, Hematoxylin and Eosin (H&E) stained liver images are classified by using both Local Binary Patterns (LBP) and one dimensional SIFT (1-D SIFT) algorithm. In order to obtain more meaningful features from the LBP histogram, a new feature vector extraction process is implemented for 1-D SIFT algorithm. LBP histograms are extracted with different approaches and concatenated with color...

Ear recognition is an emerging biometric technology. This paper proposes a new ear recognition method based on SIFT(Scale-invariant feature transform) and Harris corner detection. Firstly, Harris corner points and SIFT keypoints are detected respectively. Then taking Harris corner into the SIFT algorithm to calculate their descriptor as the image feature vectors. Finally the feature vectors are...

Texture is a powerful cue for describing structures that show a high degree of similarity in their image intensity patterns. This paper describes the use of Self-Invariant Feature Transform (SIFT), both as low-level and high-level descriptors, applied to differentiate the tissues present in breast US images. For the low-level texture descriptors case, SIFT descriptors are extracted from a regul...

The SIFT algorithm produces keypoint descriptors. This paper analyzes that the SIFT algorithm generates the number of keypoints when we increase a parameter (number of sublevels per octave). SIFT has a good hit rate for this analysis. The algorithm was tested over a specific data set, and the experiments were conducted to increase the performance of SIFT in terms of accuracy and efficiency so a...

In this paper, we consider the problem of segmenting an image into sky and non-sky regions, typically referred to as horizon line detection or skyline extraction. Specifically, we present a new approach to horizon line detection by coupling machine learning with dynamic programming. Given an image, the Canny edge detector is applied first and keeping only those edges which survive over a wide r...

In this paper, a novel framework is presented to recover the 3D shape information of a complex surface using its texture-less stereo images. First a linear and generalized Lambertian model is proposed to obtain the depth information by shape from shading (SfS) using an image from stereo pair. Then this depth data is corrected by integrating scale invariant features (SIFT) indexes. These SIFT in...

Scale Invariant Feature Transform is a widely used image descriptor, which is distinctive and robust in real-world applications. However, the high dimensionality of this descriptor causes computational inefficiency when there are a large number of points to be processed. This problem has led to several attempts at developing more compact SIFT-like descriptors, which are suitable for faster matc...