Dihedral Group D<sub>4</sub>—A New Feature Extraction Algorithm
In this paper, we propose a new feature descriptor for images that is based on the dihedral group D<inline-formula> <math display="inline"> <semantics> <msub> <mrow></mrow> <mn>4</mn> </msub> </semantics> </math> </inline...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-04-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/12/4/548 |
| _version_ | 1797571469230735360 |
|---|---|
| author | Puneet Sharma |
| author_facet | Puneet Sharma |
| author_sort | Puneet Sharma |
| collection | DOAJ |
| description | In this paper, we propose a new feature descriptor for images that is based on the dihedral group D<inline-formula> <math display="inline"> <semantics> <msub> <mrow></mrow> <mn>4</mn> </msub> </semantics> </math> </inline-formula>, the symmetry group of the square. The group action of the D<inline-formula> <math display="inline"> <semantics> <msub> <mrow></mrow> <mn>4</mn> </msub> </semantics> </math> </inline-formula> elements on a square image region is used to create a vector space that forms the basis for the feature vector. For the evaluation, we employed the Error-Correcting Output Coding (ECOC) algorithm and tested our model with four diverse datasets. The results from the four databases used in this paper indicate that the feature vectors obtained from our proposed D<inline-formula> <math display="inline"> <semantics> <msub> <mrow></mrow> <mn>4</mn> </msub> </semantics> </math> </inline-formula> algorithm are comparable in performance to that of Histograms of Oriented Gradients (HOG) model. Furthermore, as the D<inline-formula> <math display="inline"> <semantics> <msub> <mrow></mrow> <mn>4</mn> </msub> </semantics> </math> </inline-formula> model encapsulates a complete set of orientations pertaining to the D<inline-formula> <math display="inline"> <semantics> <msub> <mrow></mrow> <mn>4</mn> </msub> </semantics> </math> </inline-formula> group, it enables its generalization to a wide range of image classification applications. |
| first_indexed | 2024-03-10T20:41:07Z |
| format | Article |
| id | doaj.art-83c008b915fa453f9ebc0e148b830db3 |
| institution | Directory Open Access Journal |
| issn | 2073-8994 |
| language | English |
| last_indexed | 2024-03-10T20:41:07Z |
| publishDate | 2020-04-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Symmetry |
| spelling | doaj.art-83c008b915fa453f9ebc0e148b830db32023-11-19T20:41:41ZengMDPI AGSymmetry2073-89942020-04-0112454810.3390/sym12040548Dihedral Group D<sub>4</sub>—A New Feature Extraction AlgorithmPuneet Sharma0Department of Automation and Process Engineering (IAP), UiT-The Arctic University of Norway, 9006 Tromsø, NorwayIn this paper, we propose a new feature descriptor for images that is based on the dihedral group D<inline-formula> <math display="inline"> <semantics> <msub> <mrow></mrow> <mn>4</mn> </msub> </semantics> </math> </inline-formula>, the symmetry group of the square. The group action of the D<inline-formula> <math display="inline"> <semantics> <msub> <mrow></mrow> <mn>4</mn> </msub> </semantics> </math> </inline-formula> elements on a square image region is used to create a vector space that forms the basis for the feature vector. For the evaluation, we employed the Error-Correcting Output Coding (ECOC) algorithm and tested our model with four diverse datasets. The results from the four databases used in this paper indicate that the feature vectors obtained from our proposed D<inline-formula> <math display="inline"> <semantics> <msub> <mrow></mrow> <mn>4</mn> </msub> </semantics> </math> </inline-formula> algorithm are comparable in performance to that of Histograms of Oriented Gradients (HOG) model. Furthermore, as the D<inline-formula> <math display="inline"> <semantics> <msub> <mrow></mrow> <mn>4</mn> </msub> </semantics> </math> </inline-formula> model encapsulates a complete set of orientations pertaining to the D<inline-formula> <math display="inline"> <semantics> <msub> <mrow></mrow> <mn>4</mn> </msub> </semantics> </math> </inline-formula> group, it enables its generalization to a wide range of image classification applications.https://www.mdpi.com/2073-8994/12/4/548feature extractionsymmetry |
| spellingShingle | Puneet Sharma Dihedral Group D<sub>4</sub>—A New Feature Extraction Algorithm Symmetry feature extraction symmetry |
| title | Dihedral Group D<sub>4</sub>—A New Feature Extraction Algorithm |
| title_full | Dihedral Group D<sub>4</sub>—A New Feature Extraction Algorithm |
| title_fullStr | Dihedral Group D<sub>4</sub>—A New Feature Extraction Algorithm |
| title_full_unstemmed | Dihedral Group D<sub>4</sub>—A New Feature Extraction Algorithm |
| title_short | Dihedral Group D<sub>4</sub>—A New Feature Extraction Algorithm |
| title_sort | dihedral group d sub 4 sub a new feature extraction algorithm |
| topic | feature extraction symmetry |
| url | https://www.mdpi.com/2073-8994/12/4/548 |
| work_keys_str_mv | AT puneetsharma dihedralgroupdsub4subanewfeatureextractionalgorithm |