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

Author(s):  
Ahmed Chater ◽  
Hicham Benradi ◽  
Abdelali Lasfar

<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>

Author(s):  
M. B.Daneshvar

This paper presents an enhanced method for extracting invariant features from images based on Scale Invariant Feature Transform (SIFT). Although SIFT features are invariant to image scale and rotation, additive noise, and changes in illumination but we think this algorithm suffers from excess keypoints. Besides, by adding the hue feature, which is extracted from combination of hue and illumination values in HSI colour space version of the target image, the proposed algorithm can speed up the matching phase. Therefore, we proposed the Scale Invariant Feature Transform plus Hue (SIFTH) that can remove the excess keypoints based on their Euclidean distances and adding hue to feature vector to speed up the matching process which is the aim of feature extraction. In this paper we use the difference of hue features and the Mean Square Error (MSE) of orientation histograms to find the most similar keypoint to the under processing keypoint. The keypoint matching method can identify correct keypoint among clutter and occlusion robustly while achieving real-time performance and it will result a similarity factor of two keypoints. Moreover removing excess keypoint by SIFTH algorithm helps the matching algorithm to achieve this goal.


2017 ◽  
Vol 3 (4) ◽  
pp. 178
Author(s):  
Muhammad Baresi Ariel ◽  
Ratri Dwi Atmaja ◽  
Azizah Azizah

<p><em>Abstrak</em><strong> - Biometrik merupakan metode pengidentifikasian individu berdasarkan ciri fisiknya. Salah satu ciri fisik yang dapat digunakan untuk biometrik adalah telapak kaki. Ciri fisik ini dipilih karena memiliki tingkat keunikan yang tinggi, sehingga hampir tidak terdapat individu yang memiliki ciri yang sama. Metode-metode ekstraksi ciri seperti Scale Invariant Feature Transform (SIFT) dan Speed Up Robust Feature (SURF) akan sesuai jika digunakan untuk mendukung sistem identifikasi telapak kaki. Tahapan yang dilakukan untuk mendapatkan deskriptor dimulai dari scanning telapak kaki, pre-processing, ekstraksi ciri dengan menggunakan SURF dan SIFT sampai pada proses matching pada saat pengujian. Perbandingan keduanya dilihat dari aspek akurasi. Proses penentuan klasifikasi dan kelas menggunakan algoritma K-Nearest Neighbor (K- NN). Hasilnya akan menjadi data-data penelitian dalam paper ini. Diharapkan menggunakan metode SIFT dan SURF akan memberikan hasil dengan tingkat keakurasian yang tinggi.</strong></p><p><em><strong>Kata Kunci</strong> – Biometric, Footprint, SURF, SIFT, K- NN</em></p><p><em>Abstract</em><strong> - Biometric is a method used to identify indivduals using their physical features. One of the physical features that can be used for biometric is the footprint. The footprint was chosen because of having a high level of uniqueness where it is almost impossible to find two individuals that have the same footprint. Feature extraction methods such as Scale Invariant Feature Transform (SIFT) and Speed Up Robust Feature (SURF) are appropriate if used for footprint identification system. The steps used in obtaining descriptor start from scanning the footprint, pre-processing, feature extraction using SURF and SIFT and last the matching process. The comparison between the two methods will be observed by their accuracy. The K-Nearest Neighbor (K-NN) algorithm will be used for the classification process. The outputs will be used for research data in this research proposal. It will be expected that using SIFT and SURF for the feature extraction will result in high accuracy.</strong></p><p><em><strong>Keywords</strong> – Biometric, Footprint, SURF, SIFT, K- NN</em></p>


Author(s):  
X. G. Li ◽  
C. Ren ◽  
T. X. Zhang ◽  
Z. L. Zhu ◽  
Z. G. Zhang

Abstract. A UAV image matching method based on RANSAC (Random Sample Consensus) algorithm and SURF (speeded up robust features) algorithm is proposed. The SURF algorithm is integrated with fast operation and good rotation invariance, scale invariance and illumination. The brightness is invariant and the robustness is good. The RANSAC algorithm can effectively eliminate the characteristics of mismatched point pairs. The pre-verification experiment and basic verification experiment are added to the RANSAC algorithm, which improves the rejection and running speed of the algorithm. The experimental results show that compared with the SURF algorithm, SIFT (Scale Invariant Feature Transform) algorithm and ORB (Oriented FAST and Rotated BRIEF) algorithm, the proposed algorithm is superior to other algorithms in terms of matching accuracy and matching speed, and the robustness is higher.


Sign in / Sign up

Export Citation Format

Share Document