Melola Discovery

← Melola Discovery

Open access Journal SINTA 1

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

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 12 No. 2 (2022)

DOI
10.11591/ijece.v12i2.pp1429-1436
ISSN
2722-2578, 2088-8708
Published
2022-04-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

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.

Collaboration network of the authors

11 authors · 26 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Mohammed V University
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Adil SalbiMohammed V University2
Maryem Ait MoulayMohammed V University2
Issam BouganssaMohammed V University2
Abdelhadi Eloudrhiri HassaniMohammed V University1
Mohamed Amine GadiMohammed V University1
Tarik BouganssaMohammed V University1
Mohamed-Salim MasmoudiAffiliation unknown1
Ayoub AarabiMohammed V University1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Oct 2026, last seen 15 Nov 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Method of optimization of the fundamental matrix by technique speeded up robust features application of different stress images</dc:title><dc:creator>Chater, Ahmed</dc:creator><dc:creator>Benradi, Hicham</dc:creator><dc:creator>Lasfar, Abdelali</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;span&amp;gt;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.&amp;lt;/span&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2022-04-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v12i2.pp1429-1436</dc:identifier><dc:identifier>10.11591/ijece.v12i2.pp1429-1436</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 12 No 2 (2022); 1429</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/25098/15488</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>