Improving the efficiency of histogram of oriented gradient feature for human detection

dc.contributor.authorLai Chi Qin
dc.date.accessioned2021-04-14T03:00:01Z
dc.date.available2021-04-14T03:00:01Z
dc.date.issued2016-09-01
dc.description.abstractHistogram of Oriented Gradient (HOG) feature which was originally proposed by Dalal and Triggs is widely used in vision-based human detection. However, HOG feature extraction method produced a large feature pool which is computationally intensive and very time consuming, causing it not so suitable for real time application. This research proposed a method to reduce the HOG feature extraction time without affecting too much on its detection performance. The proposed method performs feature extraction using selective number of histogram bins. Higher number of histogram bins which can extract more detailed orientation information is applied on the regions of image that may contain human figure. The rest of the regions in the image are extracted using lower number of histogram bins. This will reduce the feature size without compromising too much on the performance. To further reduce the feature size, Principal Component Analysis (PCA) is used to rank the features and select only the representative features. A linear Support Vector Machine (SVM) classifier is used to evaluate the performance of the proposed method. Experiment was conducted using the INRIA human dataset. The test results show that the proposed method is able to reduce the feature extraction time by 2.6 times compared to the original HOG,7 times compared to the LBP method and 2.5 times faster than the integral image HOG while providing comparable detection performance.en_US
dc.identifier.urihttp://hdl.handle.net/123456789/12805
dc.language.isoenen_US
dc.titleImproving the efficiency of histogram of oriented gradient feature for human detectionen_US
dc.typeThesisen_US
Files
License bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: