Sparse low-rank matrix approximation for data compression
Low-rank matrix approximation (LRMA) is a powerful technique for signal processing and pattern analysis. However, its potential for data compression has not yet been fully investigated. In this paper, we propose sparse LRMA (SLRMA), an effective computational tool for data compression. SLRMA extends...
Saved in:
Main Authors: | Hou, Junhui, Chau, Lap-Pui, Magnenat-Thalmann, Nadia, He, Ying |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Article |
Language: | English |
Published: |
2018
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/89401 http://hdl.handle.net/10220/46229 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Low-latency compression of mocap data using learned spatial decorrelation transform
by: Hou, Junhui, et al.
Published: (2018) -
Dynamic 3-D facial compression using low rank and sparse decomposition
by: Chau, Lap-Pui, et al.
Published: (2013) -
Light field image compression based on bi-level view compensation with rate-distortion optimization
by: Hou, Junhui, et al.
Published: (2020) -
Learning nonlocal sparse and low-rank models for image compressive sensing: nonlocal sparse and low-rank modeling
by: Zha, Zhiyuan, et al.
Published: (2023) -
Light field compression with disparity-guided sparse coding based on structural key views
by: Chen, Jie, et al.
Published: (2020)