2010
DOI: 10.1016/j.patcog.2010.05.017
|View full text |Cite
|
Sign up to set email alerts
|

Two-dimensional supervised local similarity and diversity projection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
33
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 40 publications
(33 citation statements)
references
References 12 publications
0
33
0
Order By: Relevance
“…Secondly, the matrix-oriented method using structural information in feature extraction has been widely developed in recent years. To improve the traditional Two-Dimensional LPP (2DLPP), the Two-Dimensional Supervised Local Similarity and Diversity Projection (2DSLSDP) is proposed through defining two novel weighted adjacency graphs named similarity graph and diversity graph, respectively [9]. An extension of graph-based image feature extraction method named Sparse Two-Dimensional Locality Discriminant Projections (S2DLDP) is proposed to reduce the high computational cost of the traditional 2DLGEDA and 2DDLPP [15].…”
Section: Introductionmentioning
confidence: 99%
“…Secondly, the matrix-oriented method using structural information in feature extraction has been widely developed in recent years. To improve the traditional Two-Dimensional LPP (2DLPP), the Two-Dimensional Supervised Local Similarity and Diversity Projection (2DSLSDP) is proposed through defining two novel weighted adjacency graphs named similarity graph and diversity graph, respectively [9]. An extension of graph-based image feature extraction method named Sparse Two-Dimensional Locality Discriminant Projections (S2DLDP) is proposed to reduce the high computational cost of the traditional 2DLGEDA and 2DDLPP [15].…”
Section: Introductionmentioning
confidence: 99%
“…Many previous works have demonstrated that both local geometrical structure and local variation of data are very important for dimensionality reduction and image classification [5,[8][9][10][11][12]. The local geometrical structure of a training data set may be captured by an adjacency graph of data.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, they cannot guarantee that the larger the distance between nearby two points is, the farther they should be embedded in the reduced space, creating distortions in the local geometry. Moreover, the local geometrical structure preserved by them characterizes only the locality of data [8] and ignores the variation of the local neighborhoods in the reduced space [9,12].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…��D� � LDA is a supervised learning method, but some research indicates that it is ambiguous on computing because there are different ways to construct the covariance matrix in the��D� � LDA approach. The second type of method pays attention to the algorithm itself, which tries to amend 2D techniques by combining other optimal methods such as [14] and [15].These methods improve the performance of recognition by adding optimal methods to 2D techniques; at the same time, the design of algorithm complexity is also improved. Recently, some methods that hybridize different feature extraction techniques have become popular.…”
Section: Introductionmentioning
confidence: 99%