GPU acceleration of the KAZE image feature extraction algorithm

Object recognition is a key research area in the field of image processing and computer vision, which recognizes the object in an image and provides a proper label. In the paper, three popular feature descriptor algorithms that are Scale Invariant Feature Transform (SIFT), Speeded Up Robust Feature (SURF) and Oriented Fast and Rotated BRIEF (ORB) are used for experimental work of an object recognition system. A comparison among these three descriptors is exhibited in the paper by determining them individually and with different combinations of these three methodologies. The amount of the features extracted using these feature extraction methods are further reduced using a feature selection (k-means clustering) and a dimensionality reduction method (Locality Preserving Projection). Various classifiers i.e. K-Nearest Neighbor, Naive Bayes, Decision Tree, and Random Forest are used to classify objects based on their similarity. The focus of this article is to present a study of the performance comparison among these three feature extraction methods, particularly when their combination derives in recognizing the object more efficiently. In this paper, the authors have presented a comparative analysis view among various feature descriptors algorithms and classification models for 2D object recognition. The Caltech-101 public dataset is considered in this article for experimental work. The experiment reveals that a hybridization of SIFT, SURF and ORB method with Random Forest classification model accomplishes the best results as compared to other state-of-the-art work. The comparative analysis has been presented in terms of recognition accuracy, True Positive Rate (TPR), False Positive Rate (FPR), and Area Under Curve (AUC) parameters.

The present work demonstrates the utilization of computer-aided diagnosis system for the detection of lung cancer diseases using computer tomography (CT) images, magnetic resonance images (MRI) and X-ray images. The feature extraction process in lung cancer images has been achieved by scale invariant feature transform (SIFT), speeded up robust features (SURF), and principal component analysis (PCA) techniques. In this work, a comparative investigation of different feature extraction technique such as SIFT, SURF, and PCA has been discussed in order to find the best descriptor for feature extraction of cancerous subjects to the normal subjects in terms of two parameters named as execution time and error rate. The main aspect of these learning approaches is to find the valid key points in minimum execution time with least error. The results reveal that the SURF technique has an average execution time of 0.448 s with an average error rate value of 25.704 which is least among three techniques. Hence, SURF extraction technique is best as compared to SIFT and PCA.

Feature point extraction and matching are the key modules in the front-end of visual simultaneous localization and mapping (SLAM), which determines the accuracy of locating and map Nbuilding robots. To obtain a good performance, the image extraction algorithm being applied should have high efficiency and robustness to the changes of the surrounding environment. In this paper, three widely used feature extraction algorithms, namely Scale-invariant feature transform (SIFT), speed up robust features (SURF) and oriented FAST, and rotated BRIEF (ORB), are studied. The basic concepts and details of the three algorithms are introduced. Then the execution time of the three algorithms is compared to evaluate their efficiency. Meanwhile, the key points matching rate of the three algorithms are compared under various transformations and distortions. The experiment results show that ORB has higher efficiency than SIFT and SURF. However, SIFT has better robustness to image rotation, illumination change, scaling transformation, Gaussian noise and salt-and-pepper noise. In addition, the performance of the ORB-SLAM system is tested on different datasets. It has great ability in camera trajectory estimation and map building and therefore is suitable for deploying in industry.

Indexing images represents a necessary tool for various domains related to computer vision such as video surveillance and movements analysis. Visual characteristics of image such as color, texture, shape are used to identify the content of these frames. The high increase of data (Big Data) makes us face a problem of curse of dimensionality. In this paper, we propose a cloud-based technique for images indexing images using PCA (Principal component analysis) and a binary tree. Our work consists of exploiting SIFT (Scale Invariant Feature Transform) and SURF (Speeded up Robust Features) descriptors as frames features, PCA as dimensionality reduction method of SIFT and SURF features and the binary tree representation of these images in order to accelerate the research phase and reduce the storage space. Our approach consists of developing a system based on three phases: indexing images with SIFT and SURF features, compression within the application of PCA and finally the image retrieval in the cloud.

Copy-Move forgery is the most widely used way to tamper image for creating the forged images. The meaning of the photograph is changed by forging or concealing the images. Copy move is a very common technique for image forgery; tools used for retouching are applied along with it making naked eyes difficult to detect the copy move. Hence, the verification of authenticity and integrity is very essential of the image. The copy-move forgery detection can be divided into two heads a) Block based method b) Keypoint based. In the case of blocked based method, the method is exceptionally good in detecting the forged regions with higher accuracy but uses extremely high power of computation. Speed up Robust Feature (SURF) and Scale Invariant Feature Transform (SIFT) are invariant with respect to geometrical and illumination transform. In this paper we review the different keypoint approach which is a better approach or alternate to block-based approach due to invariancy property of SURF and SIFT. The keypoint based copy-move forgery detection schemes involve, identifying and relating the localized features of the images using the algorithms like SIFT and SURF.

Feature description is a critical task in Augmented Reality Tracking. This article introduces a Convex Based Feature Descriptor (CBFD) system designed to withstand rotation, lighting, and blur variations while remaining computationally efficient. We have developed two filters capable of computing pixel intensity variations, followed by the covariance matrix of the polynomial to describe the features. The superiority of CBFD is validated through precision, recall, computation time, and feature location distance. Additionally, we provide a solution to determine the optimal block size for describing nonlinear regions, thereby enhancing resolution. The results demonstrate that CBFD achieves a average precision of 0.97 for the test image, outperforming Superpoint, Directional Intensified Tertiary Filtering (DITF), Binary Robust Independent Elementary Features (BRIEF), Binary Robust Invariant Scalable Keypoints (BRISK), Speeded Up Robust Features (SURF), and Scale Invariant Feature Transform (SIFT), which achieve scores of 0.95, 0.92, 0.72, 0.66, 0.63 and 0.50 respectively. Noteworthy is CBFD's recall value of 0.87 representing at the maximum of a 13.6% improvement over Superpoint, DITF, BRIEF, BRISK, SURF, and SIFT. Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). These results highlight the speed and robustness of CBFD across various transformations.

In recent years, Ambient Intelligence (AmI) has attracted increased attention within the advanced technology industry in an effort to modernize and develop a more intelligent and reliable information system. Technologies to detect a specific object in images are expected to further expand to wide range of applications, such as car detection functions for Intelligent Transport System (ITS) and other systems. Computer vision and pattern recognition are emerging fast and will continue to grow together with local feature detection methods. In this paper, we propose an object detection and tracking system which is based on Scale Invariant Feature Transform (SIFT) and Speed Up Robust Features (SURF) feature extraction methods. From the evaluation results, we observe that the accuracy of matched keypoints of SURF algorithm are higher than SIFT.

Nowadays, an aerial closed-circuit television provides an outsize quantity of information compared with ancient closed-circuit television. But, it suffers from unsought cameras motion that presents new challenges. This paper presents a work on video stabilization and detection of the objects which are in moving position, system supported camera motion estimation. Most effective algorithms SIFT (Scale Invariant Feature Transform) and SURF (Speeded Up Robust Features) used for feature extraction. When estimating the worldwide parameters of camera motion victimization transformation, we have a tendency to find moving object by Kalman filtering. SURF (Speeded up Robust Features) is additionally a property extraction algorithmic rule works nearly like SIFT algorithmic rule, however quicker than SIFT.

Local feature matching has become a commonly used method to compare images.For tracking and human detection, a reliable method for comparing images can constitute a key component for localization and loop closing tasks.two different types of image feature algorithms, Scale -Invariant Feature Transform (SIFT) and the more recent Speeded Up Robust Features (SURF), have been used to compare the images.In this paper, we propose the use of a rich set of feature descriptors based on SIFT and SURF in the different color spaces.

There is a growing trend for using content‐based image retrieval (CBIR) systems these days because of the constantly growing interest in digital content. Therefore, the ability of the CBIR to perform the CBIR process will depend on the feature extraction process and its basis, for the retrieval will be done on. Numerous researchers put forward various techniques for feature extraction to enhance the nature of the system. Since features play a very key role in enhancing performance, various features can be used collectively to attain the requisite goal. To retain this in mind, we present in this paper a multifeature fusion system, where three features are integrated and form one feature to improve the situation of retrieval. For this purpose, scale‐invariant feature transform (SIFT), speeded‐up robust features (SURF), and histogram of oriented gradients (HOG) features are adopted. These features are common features that deliver information about the shape of the object and for matching purposes, two techniques of distance matching such as Euclidean and Hausdrauff distance are adopted. To assess the performance of the proposed multifeature‐based CBIR approach, experiments were conducted with the usage of a MATLAB simulator. The Corel‐1000 dataset, consisting of 10,000 images in 100 semantic classes, turned into applied, with each magnificence containing 100 images. A subset of 2500 images across 50 semantic classes was used to train the system. This research aligns with industry, innovation, and infrastructure by contributing to advancements in image processing and retrieval systems. Key characteristic descriptors, along with SIFT, SURF, HOG, texture, and multicharacteristic combinations, were extracted for retrieval functions. The results display that the usage of the Hausdrauff distance as a similarity degree outperforms Euclidean distance, accomplishing retrieval accuracies of 80.02% for HOG, 77.9% for SIFT, 79. 8% for SURF, 77.2% for texture, and 84.2% for multicharacteristic combinations, surpassing Euclidean distance results via 1.7%–3.6% across capabilities. These findings underscore the effectiveness of Hausdrauff distance in enhancing retrieval precision within the CBIR framework.

This paper proposes a feature-based image registering technique for remote sensing satellite images. The system is composed of multiple steps in which various image processing techniques are used. Speed-up Robust Features (SURF) and Scale Invariant Feature Transform (SIFT) can be mounted alternatively to detect and define features on images. We also address the issues of registering multi-spectral and multi-temporal images. The effectiveness of the proposed technique has been studied by registering partially overlapping satellite mosaic images of the Marmara Sea. The images were captured by the recently-launched LandSat-8 satellite.

Geometric correction is used to correct the registration errors in remotely sensed images. These images are often compared to ground control points (GCPs) either by using an accurate map (image to map) or using another geo-referenced image (image to image) and then resampled. Accordingly, the exact locations and the appropriate pixel values can be calculated in more accurate, time-wise and effortless manner. In the traditional methods, the GCPs are manually selected and then the transformation models are applied which yield time consuming and less accurate processes. The objective of this work is to develop an automatic approach for image registration based on another geo-referenced image using five feature extraction models. They are Scale Invariant Feature Transform (SIFT), Speeded Up Robust Features (SURF), Discrete Wavelet Transforms (DWT), (SIFT & DWT), and (SURF & DWT). The GCPs were selected based on the least-squares adjustments as the basis for improving the spatial accuracy of all the linking points in both images. The obtained results showed that models have higher accuracy in image registration with Root Mean Square Error (RMSE) less than 0.5. The developed automated image registration method provides more accurate results and saves time, money and effort.

With the recent evolution of technology, the number of image archives has increased exponentially. In Content-Based Image Retrieval (CBIR), high-level visual information is represented in the form of low-level features. The semantic gap between the low-level features and the high-level image concepts is an open research problem. In this paper, we present a novel visual words integration of Scale Invariant Feature Transform (SIFT) and Speeded-Up Robust Features (SURF). The two local features representations are selected for image retrieval because SIFT is more robust to the change in scale and rotation, while SURF is robust to changes in illumination. The visual words integration of SIFT and SURF adds the robustness of both features to image retrieval. The qualitative and quantitative comparisons conducted on Corel-1000, Corel-1500, Corel-2000, Oliva and Torralba and Ground Truth image benchmarks demonstrate the effectiveness of the proposed visual words integration.

In order to improve the speed of stitching and information extraction of remote sensing images, based on the UAV (Unmanned Aerial Vehicle) image stitching algorithm, this paper proposes a UAV image matching method based on the combination of SURF (Speeded Up Robust Features) and MASC (M-Estimate Sample Consensus) algorithm. the SURF algorithm is fast, and the MASC algorithm can effectively eliminate mismatch points and has high stability. In this paper, the SIFT (Scale-invariant feature transform) algorithm, SURF algorithm, SURF and RANSAC (Random Sample Consensus) algorithm as well as SURF and MASC algorithm are used to stitch the same two images and compare them respectively. The experimental results show that the lowest image matching error rate is only 2.13% and the matching time is 4.772670s when using the combination of SURF and MASC algorithm for image stitching, which has certain advantages.

Thousands of digital images may exist of a given location, some of which may show a crime in progress. One technique for identifying suspects and witnesses is to collect images of specific crime scenes from computers, cell phones, cameras and other electronic devices, and perform image matching based on image backgrounds. This paper describes an image matching technique that is used in conjunction with feature generation methodologies, such as the Scale Invariant Feature Transform (SIFT) and the Speeded Up Robust Features (SURF) algorithms. The technique identifies keypoints in images of a given location with minor differences in viewpoint and content. After calculating keypoints for the images, the technique stores only the “good” features for each image to minimize space and matching requirements. Test results indicate that matching accuracy exceeding 80% is obtained with the SIFT and SURF algorithms.