Abstract
Histogram of Oriented Gradients (HOG) is an object detection algorithm used to detect people from an image. It involves features extraction called ‘HOG descriptor’ which are used to identify a person in the image. Several operations are involved in the feature extraction process. Hence performing numerous computations in order to obtain HOG descriptors takes some considerable amount of time. This slow computation speed limits HOG’s application in real-time systems. This paper investigates HOG with a view to improve its speed, modify the feature computation process to develop a faster version of HOG and finally evaluate against existing HOG. The technique of asymptotic notation in particular Big-O notation was applied to each stage of HOG and the complexity for the binning stage was modified. This results in a HOG version with a reduced complexity from n4 to n2 thereby having an improved speed as compared to the original HOG.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
