2020
DOI: 10.1117/1.jei.29.2.023001
|View full text |Cite
|
Sign up to set email alerts
|

Robust canonical correlation analysis based on L1-norm minimization for feature learning and image recognition

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 42 publications
0
5
0
Order By: Relevance
“…21) can be accurately approximated by solving problem (Eq. 22), and the solution of l 1 -optimization problem is more convenient (Wang et al, 2020). It can be solved by the orthogonal matching pursuit (OMP) algorithm (Papadopoulos et al, 2019).…”
Section: Solution Flow Of Traditional Compressive Sensing Algorithmmentioning
confidence: 99%
“…21) can be accurately approximated by solving problem (Eq. 22), and the solution of l 1 -optimization problem is more convenient (Wang et al, 2020). It can be solved by the orthogonal matching pursuit (OMP) algorithm (Papadopoulos et al, 2019).…”
Section: Solution Flow Of Traditional Compressive Sensing Algorithmmentioning
confidence: 99%
“…When the parameters are changed, our method will obtain different results. We explore the influence of σ by varying it from 2 −5 to 2 5 and plot the clustering accuracy (ACC) of MvLRFD on the ORL dataset in Figure 5(a) with λ � 2 1 , β � 2 −4 . From equation ( 22), we know that σ has two important properties.…”
Section: Parameter Sensitivity Analysis and Convergencementioning
confidence: 99%
“…is pattern is explainable since a higher value of λ will force MvLRFD to focus more on fused information between views. for each iv ∈ [1, n v ] do (5) Computer the basis of i-th view using ( 16); (6) Computer latent representation of v-th view using ( 19); (7) Update the Dive using Dive � Dive + HY (i) (Y (i) ) T H; (8) end for (9) Update weight vector α using ( 22); (10) Update S using ( 29); (11) Compute the value of the objective function J t using ( 13); (12) if (|J t − J| < 1e − 3)‖(iter > maxIter) then (13) break; ( 14) else (15) J⟵J t ; (16) end if (17) iter⟵iter + 1; (18) end for (19) return the final representation using (8); ALGORITHM 1: e algorithm of MvLRFD. With σ � 2 2 and λ � 2 2 , our method will obtain a better performance for maintaining private information when 2 − 2 ≥ β ≥ 2 − 4 .…”
Section: Parameter Sensitivity Analysis and Convergencementioning
confidence: 99%
See 2 more Smart Citations