Demos
Below you can find some demonstrations of my recent work.
Bases Sorting: Generalizing frequency concept to over-complete dictionary
Bases Sorting: Generalizing frequency concept to over-complete dictionary
1. Dictionary Visualization
Fig. 1 Dictionary Visualization Comparison: (a) Unsorted dictionary, (b)-(d) Sorted from low-frequency to high-frequency by BS algorithm with three different format of arrangements.
2. Data Compression via Truncation of Dictionary
Fig. 2 Image Reconstruction Comparison:
Information Theoretic Bounds for Low-Rank Matrix Completion.
Information Theoretic Bounds for Low-Rank Matrix Completion.