Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/141822
Title: SPARSITY BASED REGULARIZATION FOR SIGNAL RECOVERY AND CLUSTERING
Authors: XU GUODONG
Keywords: sparsity, regularization, blind, deblurring, clustering, recovering
Issue Date: 15-Jan-2018
Citation: XU GUODONG (2018-01-15). SPARSITY BASED REGULARIZATION FOR SIGNAL RECOVERY AND CLUSTERING. ScholarBank@NUS Repository.
Abstract: In recent years, sparsity-base regularization has seen its usage in a wide range of signal/image recovery and clustering tasks. Sparsity-based regularization is about regularizing the unknowns by prompting its sparsity in a suitable domain. Most existing works focus on the linear inverse problem. This thesis aims at studying two challenging problems in signal recovery and signal clustering which both can be formulated as some non-convex and non-linear problems. One is the non-stationary blind defocus deblurring and the other is un-supervised data clustering. This thesis consists of two parts. The first part focuses on presenting a new computational framework for non-stationary blind defocus deblurring with state-of-the-art performance. The second part focuses on present a convex relaxation for k-means clustering method, together with a rigorous analysis on its theoretical soundness.
URI: http://scholarbank.nus.edu.sg/handle/10635/141822
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
thesis_xgd_180508.pdf39.27 MBAdobe PDF

OPEN

NoneView/Download

Page view(s)

72
checked on Jul 31, 2020

Download(s)

1
checked on Jul 31, 2020

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.