Synopsis
Synopsis
A Project Synopsis
An Overwiew of Deep and Handcrafted Features with Redestrain Identification
Submitted as partial fulfilment of the requirement for the award of the Degree in
By
Musadiq Shariff
SB210365
Final year
(a) Proposal generation: This step aims to extract some candidate proposals of
pedestrians from an input image. The proposals indicate a set of bounding-boxes
which po- tentially represent the objects. Common strategies include sliding-
window methods , particle-window methods , objectness methods , and region
proposal network, The sliding-window methods (SW) adopt a greedy search strat-
egy with a fixed-sized step to scan the image from the top- left to bottom-right
region. The particle-window methods adopt the coarse-to-fine cascaded search
where the propos- als generated at current stage follow the likelihood distri-
bution of previous stage. The objectness methods typically employ a variety of
low-level features (e.g., edge and color features) to extract the proposals in a
bottom-up fashion. Recently, a region proposal network (RPN) was introduced for
proposal generation, which shares the deep features with the following proposal
classification and regression.
(b) Proposal classification: This step assigns these candi- date proposals to the
positive class (pedestrians) or the negative class (background) based on the
extracted features of these proposals. The handcrafted features based methods
adopt a shallow classifier (e.g., SVM or boosting) for classification, whereas
deep features based methods generally integrate the feature extraction and
classification into a unified framework by utilizing a soft- max (or sigmoid) layer.
Additionally, deep features based methods add regression in parallel with
classification to refine the location quality of the bounding-boxes.
(c) Post processing: As a single pedestrian may be detected by multiple
bounding-boxes after proposal
(d) classification, which is the issue of duplicate detections. The technique of
non-maximum suppression (NMS) selects the best bounding-box for each object
and suppresses other duplicate bounding-boxes. The related methods can be di-
vided into two categories: heuristic-based and learning- based methods. The
heuristic-based methods (e.g., greedy NMS, Soft-NMS , SGE-NMS , and
Adaptive NMS) combine the bounding-boxes according to classifi- cation scores,
where the overlapped bounding-boxes with lower scores are suppressed. The
learning-based methods, including Gnet and Relation Network , learn a mapping
to retain the most accurate bounding-boxes.
Literature review:
Problem formulation/Objectives:
In past decade, pedestrian detection has witnessed signifi- cant success, which has
gone from the handcrafted features to deep features based approaches. In this
paper, we first summarize these two types of methods in detail. After- wards, we
review multispectral pedestrian detection. We review popular pedestrian datasets
and a deep analysis on pedestrian detection methods. Finally, we discuss some
challenging problems (e.g., occlusion, scale variance, and domain adaptation) in
pedestrian detection. We hope that this deep survey can help the researchers to
develop new methods in the field of pedestrian detection.
HARDWARE REQUIREMENTS:
RAM : 4GB
SOFTWARE REQUIREMENTS:
Operating System : Windows 10 and above.
Tools :Anaconda,Spyder