Method of optimization of the fundamental matrix by technique speeded up robust features application of different stress images

<span>The purpose of determining the fundamental matrix (F) is to define the epipolar geometry and to relate two 2D images of the same scene or video series to find the 3D scenes. The problem we address in this work is the estimation of the localization error and the processing time. We start by comparing the following feature extraction techniques: Harris, features from accelerated segment test (FAST), scale invariant feature transform (SIFT) and speed-up robust features (SURF) with respect to the number of detected points and correct matches by different changes in images. Then, we merged the best chosen by the objective function, which groups the descriptors by different regions in order to calculate ‘F’. Then, we applied the standardized eight-point algorithm which also automatically eliminates the outliers to find the optimal solution ‘F’. The test of our optimization approach is applied on the real images with different scene variations. Our simulation results provided good results in terms of accuracy and the computation time of ‘F’ does not exceed 900 ms, as well as the projection error of maximum 1 pixel, regardless of the modification.</span>

Multifactor Authentication in Automated Teller Machine

Skimming of card details is the primary problem faced by many people in today’s world. This can be done in many ways. For instance, a thief can insert a small device into the machine and steal the information. When a person swipes or inserts a card, the details will be captured and stored. This problem can be solved using biometrics. Biometrics include fingerprint, iris, face, retina scanning, etc. This paper focused on solving this issue using fingerprint and iris recognition using OpenCV and propose a suitable method for this issue. Fingerprint and iris recognition are performed by identifying the keypoints and descriptors and matching those with the test data. Keywords: Biometrics, Fingerprint recognition, Iris recognition, Scale Invariant Feature Transform, Oriented FAST and Rotated BRIEF, OpenCV

Sparse coded spatial pyramid matching and multi-kernel integrated SVM for non-linear scene classification

Support vector machine (SVM) techniques and deep learning have been prevalent in object classification for many years. However, deep learning is computation-intensive and can require a long training time. SVM is significantly faster than Convolution Neural Network (CNN). However, the SVM has limited its applications in the mid-size dataset as it requires proper tuning. Recently the parameterization of multiple kernels has shown greater flexibility in the characterization of the dataset. Therefore, this paper proposes a sparse coded multi-scale approach to reduce training complexity and tuning of SVM using a non-linear fusion of kernels for large class natural scene classification. The optimum features are obtained by parameterizing the dictionary, Scale Invariant Feature Transform (SIFT) parameters, and fusion of multiple kernels. Experiments were conducted on a large dataset to examine the multi-kernel space capability to find distinct features for better classification. The proposed approach founds to be promising than the linear multi-kernel SVM approaches achieving 91.12 % maximum accuracy.

Classification of wood knots using artificial neural networks with texture and local feature-based image descriptors

This paper describes feature-based techniques for wood knot classification. For automated classification of macroscopic wood knot images, models were established using artificial neural networks with texture and local feature descriptors, and the performances of feature extraction algorithms were compared. Classification models trained with texture descriptors, gray-level co-occurrence matrix and local binary pattern, achieved better performance than those trained with local feature descriptors, scale-invariant feature transform and dense scale-invariant feature transform. Hence, it was confirmed that wood knot classification was more appropriate for texture classification rather than an approach based on morphological classification. The gray-level co-occurrence matrix produced the highest F1 score despite representing images with relatively low-dimensional feature vectors. The scale-invariant feature transform algorithm could not detect a sufficient number of features from the knot images; hence, the histogram of oriented gradients and dense scale-invariant feature transform algorithms that describe the entire image were better for wood knot classification. The artificial neural network model provided better classification performance than the support vector machine and k-nearest neighbor models, which suggests the suitability of the nonlinear classification model for wood knot classification.

Image Copy–Move Forgery Detection Using Combination of Scale-Invariant Feature Transform and Local Binary Pattern Features

Today, manipulating, storing, and sending digital images are simple and easy because of the development of digital imaging devices from hardware and software points of view. Digital images are used in different contexts of people’s lives such as news, forensics, and so on. Therefore, the reliability of received images is a question that often occupies the viewer’s mind and the authenticity of digital images is increasingly important. Detecting a forged image as a genuine one as well as detecting a genuine image as a forged one can sometimes have irreparable consequences. For example, an image that is available from the scene of a crime can lead to a wrong decision if it is detected incorrectly. In this paper, we propose a combination method to improve the accuracy of copy–move forgery detection (CMFD) reducing the false positive rate (FPR) based on texture attributes. The proposed method uses a combination of the scale-invariant feature transform (SIFT) and local binary pattern (LBP). Consideration of texture features around the keypoints detected by the SIFT algorithm can be effective to reduce the incorrect matches and improve the accuracy of CMFD. In addition, to find more and better keypoints some pre-processing methods have been proposed. This study was evaluated on the COVERAGE, GRIP, and MICC-F220 databases. Experimental results show that the proposed method without clustering or segmentation and only with simple matching operations, has been able to earn the true positive rates of 98.75%, 95.45%, and 87% on the GRIP, MICC-F220, and COVERAGE datasets, respectively. Also, the proposed method, with FPRs from 17.75% to 3.75% on the GRIP dataset, has been able to achieve the best results.