A sparse representation denoising algorithm for finger-vein image based on dictionary learning

2021 ◽  
Author(s):  
Lei Lei ◽  
Feng Xi ◽  
Shengyao Chen ◽  
Zhong Liu
Keyword(s):  
Sparse Representation ◽  
Dictionary Learning ◽  
Finger Vein

scholarly journals Illumination Normalization for Face Recognition via Jointly Optimized Dictionary-Learning and Sparse Representation

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 66632-66640
Author(s):  
Yuyao Zhang ◽  
Lihui Wang ◽  
Xiaojun Guan ◽  
Hongjiang Wei
Keyword(s):  
Face Recognition ◽  
Sparse Representation ◽  
Dictionary Learning ◽  
Illumination Normalization

scholarly journals Shift Invariant Dictionary Learning for Human Action Recognition

2019 ◽  
Vol 9 (2) ◽  
pp. 2107-2111
Keyword(s):  
Sparse Representation ◽  
Action Recognition ◽  
Dictionary Learning ◽  
Human Action Recognition ◽  
Human Action ◽  
Signal Denoising ◽  
Learning Approaches ◽  
Training Time ◽  
Initial Stage ◽  
Shift Invariance

Sparse representation is an emerging topic among researchers. The method to represent the huge volume of dense data as sparse data is much needed for various fields such as classification, compression and signal denoising. The base of the sparse representation is dictionary learning. In most of the dictionary learning approaches, the dictionary is learnt based on the input training signals which consumes more time. To solve this issue, the shift-invariant dictionary is used for action recognition in this work. Shift-Invariant Dictionary (SID) is that the dictionary is constructed in the initial stage with shift-invariance of initial atoms. The advantage of the proposed SID based action recognition method is that it requires minimum training time and achieves highest accuracy.

scholarly journals Screening of sleep movement disorders via EMG signal analysis

2021 ◽  
Author(s):  
Mehrnaz Shokrollahi
Keyword(s):  
Feature Extraction ◽  
Sparse Representation ◽  
Movement Disorders ◽  
Dictionary Learning ◽  
Signal Analysis ◽  
Compact Set ◽  
Emg Signal ◽  
Increased Risk ◽  
Non Stationary Signal ◽  
Representation Techniques

It is estimated that 50 to 70 million Americans suffer from a chronic sleep disorder, which hinders their daily life, affects their health, and incurs a significant economic burden to society. Untreated Periodic Leg Movement (PLM) or Rapid Eye Movement Behaviour Disorder (RBD) could lead to a three to four-fold increased risk of stroke and Parkinson’s disease respectively. These risks bring about the need for less costly and more available diagnostic tools that will have great potential for detection and prevention. The goal of this study is to investigate the potentially clinically relevant but under-explored relationship of the sleep-related movement disorders of PLMs and RBD with cerebrovascular diseases. Our objective is to introduce a unique and efficient way of performing non-stationary signal analysis using sparse representation techniques. To fulfill this objective, at first, we develop a novel algorithm for Electromyogram (EMG) signals in sleep based on sparse representation, and we use a generalized method based on Leave-One-Out (LOO) to perform classification for small size datasets. In the second objective, due to the long-length of these EMG signals, the need for feature extraction algorithms that can localize to events of interest increases. To fulfill this objective, we propose to use the Non-Negative Matrix Factorization (NMF) algorithm by means of sparsity and dictionary learning. This allows us to represent a variety of EMG phenomena efficiently using a very compact set of spectrum bases. Yet EMG signals pose severe challenges in terms of the analysis and extraction of discriminant features. To achieve a balance between robustness and classification performance, we aim to exploit deep learning and study the discriminant features of the EMG signals by means of dictionary learning, kernels, and sparse representation for classification. The classification performances that were achieved for detection of RBD and PLM by means of implicating these properties were 90% and 97% respectively. The theoretical properties of the proposed approaches pertaining to pattern recognition and detection are examined in this dissertation. The multi-layer feature extraction provide strong and successful characterization and classification for the EMG non-stationary signals and the proposed sparse representation techniques facilitate the adaptation to EMG signal quantification in automating the identification process.

scholarly journals Motion Estimation in Echocardiography Using Sparse Representation and Dictionary Learning

2018 ◽  
Vol 27 (1) ◽  
pp. 64-77 ◽  
Author(s):  
Nora Ouzir ◽  
Adrian Basarab ◽  
Herve Liebgott ◽  
Brahim Harbaoui ◽  
Jean-Yves Tourneret
Keyword(s):  
Motion Estimation ◽  
Sparse Representation ◽  
Dictionary Learning

scholarly journals Aiding Dictionary Learning Through Multi-Parametric Sparse Representation

Algorithms ◽  
2019 ◽  
Vol 12 (7) ◽  
pp. 131 ◽  
Author(s):  
Florin Stoican ◽  
Paul Irofti
Keyword(s):  
Constrained Optimization ◽  
Sparse Representation ◽  
Dictionary Learning ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Parameter Vector ◽  
Constrained Optimization Problems ◽  
Piecewise Affine ◽  
Current Vector ◽  
Learning Procedure

The ℓ 1 relaxations of the sparse and cosparse representation problems which appear in the dictionary learning procedure are usually solved repeatedly (varying only the parameter vector), thus making them well-suited to a multi-parametric interpretation. The associated constrained optimization problems differ only through an affine term from one iteration to the next (i.e., the problem’s structure remains the same while only the current vector, which is to be (co)sparsely represented, changes). We exploit this fact by providing an explicit, piecewise affine with a polyhedral support, representation of the solution. Consequently, at runtime, the optimal solution (the (co)sparse representation) is obtained through a simple enumeration throughout the non-overlapping regions of the polyhedral partition and the application of an affine law. We show that, for a suitably large number of parameter instances, the explicit approach outperforms the classical implementation.

Sign in / Sign up

Export Citation Format

Share Document