Volume 8, Issue 1
Unsupervised Spectral Regression Learning for Pyramid HOG

Qiang Li, Zhongli Peng & Xiaomei Lin

Journal of Fiber Bioengineering & Informatics, 8 (2015), pp. 117-124.

Published online: 2015-08

Preview Full PDF 643 2388
Export citation
  • Abstract

Applying the original raw data to machine learning will bring in a poor performance, because so many features are not necessary and redundant. Extracting a small number of good features will be an important issue, and it can be solved by using dimensionality reduction techniques. However, the popular dimensionality reduction method will suffer from the eigen-decomposition of dense matrix problem which is expensive in memory and time. We adopt unsupervised (unlabeled) spectral regression method for dimensionality reduction, which well avoids the problem of dense matrix eigen-decomposition problem and can be applied on large scale data sets. Histograms of Oriented Gradients (HOG) are robust features which not only well characterize the local shape and appearance but also show a certain degree of local optical and geometry invariance. In order to characterize the local shape and appearance better, we extract a three-tier pyramid HOG descriptor vector for one sample. Then we adopt the unsupervised spectral regression method for dimensionality reduction on these descriptor vectors. Our algorithm can be applied in the library entrance guard system of university and other research fields. Several experiments on well-known face databases have shown good performance and good invariance against illumination, occlusion and local deformation, etc.

  • Keywords

Dimensionality Reduction Eigen-decomposition of Dense Matrix Three-tier Pyramid HOG

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JFBI-8-117, author = {}, title = {Unsupervised Spectral Regression Learning for Pyramid HOG}, journal = {Journal of Fiber Bioengineering and Informatics}, year = {2015}, volume = {8}, number = {1}, pages = {117--124}, abstract = {Applying the original raw data to machine learning will bring in a poor performance, because so many features are not necessary and redundant. Extracting a small number of good features will be an important issue, and it can be solved by using dimensionality reduction techniques. However, the popular dimensionality reduction method will suffer from the eigen-decomposition of dense matrix problem which is expensive in memory and time. We adopt unsupervised (unlabeled) spectral regression method for dimensionality reduction, which well avoids the problem of dense matrix eigen-decomposition problem and can be applied on large scale data sets. Histograms of Oriented Gradients (HOG) are robust features which not only well characterize the local shape and appearance but also show a certain degree of local optical and geometry invariance. In order to characterize the local shape and appearance better, we extract a three-tier pyramid HOG descriptor vector for one sample. Then we adopt the unsupervised spectral regression method for dimensionality reduction on these descriptor vectors. Our algorithm can be applied in the library entrance guard system of university and other research fields. Several experiments on well-known face databases have shown good performance and good invariance against illumination, occlusion and local deformation, etc.}, issn = {2617-8699}, doi = {https://doi.org/10.3993/jfbi03201511}, url = {http://global-sci.org/intro/article_detail/jfbi/4691.html} }
TY - JOUR T1 - Unsupervised Spectral Regression Learning for Pyramid HOG JO - Journal of Fiber Bioengineering and Informatics VL - 1 SP - 117 EP - 124 PY - 2015 DA - 2015/08 SN - 8 DO - http://doi.org/10.3993/jfbi03201511 UR - https://global-sci.org/intro/article_detail/jfbi/4691.html KW - Dimensionality Reduction KW - Eigen-decomposition of Dense Matrix KW - Three-tier Pyramid HOG AB - Applying the original raw data to machine learning will bring in a poor performance, because so many features are not necessary and redundant. Extracting a small number of good features will be an important issue, and it can be solved by using dimensionality reduction techniques. However, the popular dimensionality reduction method will suffer from the eigen-decomposition of dense matrix problem which is expensive in memory and time. We adopt unsupervised (unlabeled) spectral regression method for dimensionality reduction, which well avoids the problem of dense matrix eigen-decomposition problem and can be applied on large scale data sets. Histograms of Oriented Gradients (HOG) are robust features which not only well characterize the local shape and appearance but also show a certain degree of local optical and geometry invariance. In order to characterize the local shape and appearance better, we extract a three-tier pyramid HOG descriptor vector for one sample. Then we adopt the unsupervised spectral regression method for dimensionality reduction on these descriptor vectors. Our algorithm can be applied in the library entrance guard system of university and other research fields. Several experiments on well-known face databases have shown good performance and good invariance against illumination, occlusion and local deformation, etc.
Qiang Li, Zhongli Peng & Xiaomei Lin. (2019). Unsupervised Spectral Regression Learning for Pyramid HOG. Journal of Fiber Bioengineering and Informatics. 8 (1). 117-124. doi:10.3993/jfbi03201511
Copy to clipboard
The citation has been copied to your clipboard