Optimal eigenvectors of spectral datasets: sequential selection from one set vs a collection from two sets |
| |
| Authors: | Morteza Maali Amiri Seyed Hossein Amirshahi |
| |
| Affiliation: | Department of Textile Engineering, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran |
| |
| Abstract: | In this paper, the influence of spectral datasets and the method of selection of the corresponding feature vectors on the compression and reconstruction of data is scrutinised. To fulfil this aim, two different sets of reflectance data with the least spectral similarity are selected from different sets of spectral databases and the most optimal eigenvectors are chosen using different strategies. Six and 12 arrangements of eigenvectors obtained from different individual or combined databases are then used for the compression of reflectance spectra of learning sets, as well as those that have not been used in extraction of eigenvectors. The validity of the desired reduced subspaces is assessed by computing the spectral errors between the actual and the reconstructed spectra of samples of learning sets. Moreover, the efficiencies of designed compressed subspaces are evaluated through the numbers of out‐of‐range reconstructed spectra, as well as the spectral and colorimetric deviations between the actual and compressed‐reconstructed reflectance spectra of samples of datasets that were not employed in learning sequence. The results show that in the restricted subspaces, i.e. six‐dimensional subspace, the most effective results are achieved when the reduced subspace is created from a collection of two separate sets of eigenvectors of two different datasets with the maximum degree of dissimilarity, and the reduced spaces that have been made from six eigenvectors of individual datasets lead to higher errors. |
| |
| Keywords: | |
|
|
