Novel techniques for sparse representation problems
Sparse representations have been used in solving many problems in computer science. Two issues that need to be addressed in formulating such a representation are: the problem design; and the optimization technique. Many optimization problems contain one/multiple non-smooth terms in the objective f...
Main Author: | Chai, Woon Huei |
---|---|
Other Authors: | Quek Hiok Chai |
Format: | Thesis-Doctor of Philosophy |
Language: | English |
Published: |
Nanyang Technological University
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/146392 |
Similar Items
-
Spatiotemporal saliency detection via sparse representation
by: Ren, Zhixiang, et al.
Published: (2013) -
Optimized GPU algorithms for sparse data problems
by: Pham, Nguyen Quang Anh
Published: (2017) -
Structured sparse representations for supervised and unsupervised learning
by: Zeng, Yijie
Published: (2020) -
A Novel Discrete Filled Function Algorithm in Solving Discrete Optimization Problems (S/O: 12408)
by: Woon, Siew Fang, et al.
Published: (2016) -
On Stone's representation theorem
by: Loo, Dong Lin
Published: (2022)