2014
DOI: 10.1016/j.jvcir.2014.03.007
|View full text |Cite
|
Sign up to set email alerts
|

Image recognition via two-dimensional random projection and nearest constrained subspace

Abstract: We consider the problem of image recognition via two-dimensional random projection and nearest constrained subspace. First, image features are extracted by a two-dimensional random projection. The two-dimensional random projection for feature extraction is an extension of the 1D compressive sampling technique to 2D and is computationally more efficient than its 1D counterpart and 2D reconstruction is guaranteed. Second, we design a new classifier called NCSC (Nearest Constrained Subspace Classifier) and apply … Show more

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
2020
2020

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 60 publications
0
3
0
Order By: Relevance
“…It is difficult for a monocular imaging system to recover the three-dimensional information of an object; the two-dimensional image acquired by the binocular imaging system from two angles can effectively recover the original three-dimensional information of the object [12]. Therefore, this study is based on binocular imaging.…”
Section: Methodsmentioning
confidence: 99%
“…It is difficult for a monocular imaging system to recover the three-dimensional information of an object; the two-dimensional image acquired by the binocular imaging system from two angles can effectively recover the original three-dimensional information of the object [12]. Therefore, this study is based on binocular imaging.…”
Section: Methodsmentioning
confidence: 99%
“…Equation 15 is a typical problem of combination optimization. To avoid such a N-P hard problem, we offer a greedy algorithm called COMP (Constrained Orthogonal Matching Pursuit) for approximately solving for ® ¤ in equation 15.…”
Section: B Global Ncsc and Compmentioning
confidence: 99%
“…In our previous works [14], [15], we have proposed a generalized classifier framework called NCSC (Nearest Constrained Subspace Classifier), which classifies a vector y as follows.…”
mentioning
confidence: 99%