2012
DOI: 10.1016/j.proeng.2012.01.894
|View full text |Cite
|
Sign up to set email alerts
|

Singular Value Decomposition based Features for Vehicle Classification under Cluttered Background and Mild Occlusion

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 10 publications
0
3
0
Order By: Relevance
“…The diagonal elements of matrix S are called the singular values of X which are used to create the feature vectors [ 16 ]. If the input image size is 256 × 256, the singular value size will be 1 × 256.…”
Section: Texture Featuresmentioning
confidence: 99%
“…The diagonal elements of matrix S are called the singular values of X which are used to create the feature vectors [ 16 ]. If the input image size is 256 × 256, the singular value size will be 1 × 256.…”
Section: Texture Featuresmentioning
confidence: 99%
“…Vehicle identification and classification are necessary components in an artificially intelligent traffic monitoring system. Vehicle identification plays a major role in applications such as vehicle security system, traffic monitoring system, etc [1][2][3]. It is expected that these artificially intelligent traffic monitoring system venture onto the street of the world, thus requiring identification and classification of car objects commonly found on the road side.…”
Section: Introductionmentioning
confidence: 99%
“…In the present study, singular value decomposition is utilized to convert the input image of size 200×200 pixels into a spatial domain feature vector composed of singular values of size 1×200. In it, the singular values are ranked in a descending order, whereas the first entries of the singular value matrix contain the most substantial information while the last entries at the vector contain the least significant information(Nagarajan and Devendran, 2012;Jha et al, 2014). With respect to the frequency domain features, DWT-based feature extraction exhibits three levels of decomposition, whereas N levels of decomposition result in (3 × N) + 1 sub-…”
mentioning
confidence: 99%