2017
DOI: 10.1007/s00034-017-0653-z
|View full text |Cite
|
Sign up to set email alerts
|

Face Recognition Employing DMWT Followed by FastICA

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 14 publications
(11 citation statements)
references
References 40 publications
0
11
0
Order By: Relevance
“…We also use a wrapping discrete curvelet transform for face images in the non-occluded part of face images, and FastICA [20] for de-correlation and feature reduction. We refer to these processes as an FBB module.…”
Section: Frequency Domain Feature Extractionmentioning
confidence: 99%
“…We also use a wrapping discrete curvelet transform for face images in the non-occluded part of face images, and FastICA [20] for de-correlation and feature reduction. We refer to these processes as an FBB module.…”
Section: Frequency Domain Feature Extractionmentioning
confidence: 99%
“…Wavelet systems are widely used in applied mathematics for signal analysis and synthesis, compression tasks, data preprocessing and feature extraction for neural networks and so on in a large number of applications (see, for example, [1][2][3][4][5][6]). The symmetry property is among the most desirable features for wavelets.…”
Section: Introductionmentioning
confidence: 99%
“…BSS plays an increasingly important role in the field of digital signal processing and has been widely used in communication [27], speech processing [28], fault diagnosis [29,30], seismic exploration [31], biomedicine [32,33], image processing [34], radar [35], and economic data analysis [36]. In blind signal separation, the typical algorithms commonly used include the fast fixed-point algorithm [37], natural gradient algorithm [38], Equivariant Adaptive Separation via Independence (EASI) algorithm [39,40], and Joint Approximation Diagonalization of Eigen-matrices (JADE) algorithm [41,42], etc. Grotas et al [43] developed the constrained maximum likelihood (ML) estimator of the Laplacian matrix for this graph BSS problem with Gaussian-distributed states.…”
Section: Introductionmentioning
confidence: 99%