Picture for Cristian Rusu

Cristian Rusu

Learning Explicitly Conditioned Sparsifying Transforms

Add code
Mar 05, 2024
Figure 1 for Learning Explicitly Conditioned Sparsifying Transforms
Figure 2 for Learning Explicitly Conditioned Sparsifying Transforms
Figure 3 for Learning Explicitly Conditioned Sparsifying Transforms
Viaarxiv icon

Kernel t-distributed stochastic neighbor embedding

Add code
Jul 13, 2023
Viaarxiv icon

Multidimensional orthogonal matching pursuit: theory and application to high accuracy joint localization and communication at mmWave

Add code
Aug 24, 2022
Figure 1 for Multidimensional orthogonal matching pursuit: theory and application to high accuracy joint localization and communication at mmWave
Figure 2 for Multidimensional orthogonal matching pursuit: theory and application to high accuracy joint localization and communication at mmWave
Figure 3 for Multidimensional orthogonal matching pursuit: theory and application to high accuracy joint localization and communication at mmWave
Figure 4 for Multidimensional orthogonal matching pursuit: theory and application to high accuracy joint localization and communication at mmWave
Viaarxiv icon

Low complexity joint position and channel estimation at millimeter wave based on multidimensional orthogonal matching pursuit

Add code
Apr 07, 2022
Figure 1 for Low complexity joint position and channel estimation at millimeter wave based on multidimensional orthogonal matching pursuit
Figure 2 for Low complexity joint position and channel estimation at millimeter wave based on multidimensional orthogonal matching pursuit
Viaarxiv icon

Dictionary Learning with Uniform Sparse Representations for Anomaly Detection

Add code
Jan 11, 2022
Figure 1 for Dictionary Learning with Uniform Sparse Representations for Anomaly Detection
Figure 2 for Dictionary Learning with Uniform Sparse Representations for Anomaly Detection
Figure 3 for Dictionary Learning with Uniform Sparse Representations for Anomaly Detection
Viaarxiv icon

An iterative coordinate descent algorithm to compute sparse low-rank approximations

Add code
Jul 30, 2021
Figure 1 for An iterative coordinate descent algorithm to compute sparse low-rank approximations
Figure 2 for An iterative coordinate descent algorithm to compute sparse low-rank approximations
Viaarxiv icon

An iterative Jacobi-like algorithm to compute a few sparse eigenvalue-eigenvector pairs

Add code
Jun 08, 2021
Figure 1 for An iterative Jacobi-like algorithm to compute a few sparse eigenvalue-eigenvector pairs
Figure 2 for An iterative Jacobi-like algorithm to compute a few sparse eigenvalue-eigenvector pairs
Figure 3 for An iterative Jacobi-like algorithm to compute a few sparse eigenvalue-eigenvector pairs
Viaarxiv icon

Efficient and Parallel Separable Dictionary Learning

Add code
Jul 07, 2020
Figure 1 for Efficient and Parallel Separable Dictionary Learning
Figure 2 for Efficient and Parallel Separable Dictionary Learning
Figure 3 for Efficient and Parallel Separable Dictionary Learning
Figure 4 for Efficient and Parallel Separable Dictionary Learning
Viaarxiv icon

Constructing fast approximate eigenspaces with application to the fast graph Fourier transforms

Add code
Mar 20, 2020
Figure 1 for Constructing fast approximate eigenspaces with application to the fast graph Fourier transforms
Figure 2 for Constructing fast approximate eigenspaces with application to the fast graph Fourier transforms
Figure 3 for Constructing fast approximate eigenspaces with application to the fast graph Fourier transforms
Figure 4 for Constructing fast approximate eigenspaces with application to the fast graph Fourier transforms
Viaarxiv icon

Fast approximation of orthogonal matrices and application to PCA

Add code
Jul 18, 2019
Figure 1 for Fast approximation of orthogonal matrices and application to PCA
Figure 2 for Fast approximation of orthogonal matrices and application to PCA
Figure 3 for Fast approximation of orthogonal matrices and application to PCA
Figure 4 for Fast approximation of orthogonal matrices and application to PCA
Viaarxiv icon