Thresholding-based online algorithms of complexity comparable to sparse LMS methods

Yannis Kopsinis; Konstantinos Slavakis; Sergios Theodoridis; Stephen McLaughlin

doi:10.1109/ISCAS.2013.6571893

Thresholding-based online algorithms of complexity comparable to sparse LMS methods

Yannis Kopsinis, Konstantinos Slavakis, Sergios Theodoridis, Stephen McLaughlin

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

6 Citations (Scopus)

Abstract

This paper deals with a novel class of set-theoretic adaptive sparsity promoting algorithms of linear computational complexity. Sparsity is induced via generalized thersholding operators, which correspond to nonconvex penalties such as those used in a number of sparse LMS based schemes. The results demonstrate the significant performance gain of our approach, at comparable computational cost.

Original language	English
Title of host publication	Proceedings - IEEE International Symposium on Circuits and Systems
Pages	513-516
Number of pages	4
DOIs	https://doi.org/10.1109/ISCAS.2013.6571893
Publication status	Published - 2013
Event	2013 IEEE International Symposium on Circuits and Systems - Beijing, China Duration: 19 May 2013 → 23 May 2013

Conference

Conference	2013 IEEE International Symposium on Circuits and Systems
Abbreviated title	ISCAS 2013
Country/Territory	China
City	Beijing
Period	19/05/13 → 23/05/13

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1109/ISCAS.2013.6571893

Cite this

@inproceedings{b470386ed91743408cc3e18293b1ddee,

title = "Thresholding-based online algorithms of complexity comparable to sparse LMS methods",

abstract = "This paper deals with a novel class of set-theoretic adaptive sparsity promoting algorithms of linear computational complexity. Sparsity is induced via generalized thersholding operators, which correspond to nonconvex penalties such as those used in a number of sparse LMS based schemes. The results demonstrate the significant performance gain of our approach, at comparable computational cost.",

author = "Yannis Kopsinis and Konstantinos Slavakis and Sergios Theodoridis and Stephen McLaughlin",

year = "2013",

doi = "10.1109/ISCAS.2013.6571893",

language = "English",

isbn = "9781467357609",

pages = "513--516",

booktitle = "Proceedings - IEEE International Symposium on Circuits and Systems",

note = "2013 IEEE International Symposium on Circuits and Systems, ISCAS 2013 ; Conference date: 19-05-2013 Through 23-05-2013",

}

TY - GEN

T1 - Thresholding-based online algorithms of complexity comparable to sparse LMS methods

AU - Kopsinis, Yannis

AU - Slavakis, Konstantinos

AU - Theodoridis, Sergios

AU - McLaughlin, Stephen

PY - 2013

Y1 - 2013

N2 - This paper deals with a novel class of set-theoretic adaptive sparsity promoting algorithms of linear computational complexity. Sparsity is induced via generalized thersholding operators, which correspond to nonconvex penalties such as those used in a number of sparse LMS based schemes. The results demonstrate the significant performance gain of our approach, at comparable computational cost.

AB - This paper deals with a novel class of set-theoretic adaptive sparsity promoting algorithms of linear computational complexity. Sparsity is induced via generalized thersholding operators, which correspond to nonconvex penalties such as those used in a number of sparse LMS based schemes. The results demonstrate the significant performance gain of our approach, at comparable computational cost.

UR - http://www.scopus.com/inward/record.url?scp=84883368131&partnerID=8YFLogxK

U2 - 10.1109/ISCAS.2013.6571893

DO - 10.1109/ISCAS.2013.6571893

M3 - Conference contribution

AN - SCOPUS:84883368131

SN - 9781467357609

SP - 513

EP - 516

BT - Proceedings - IEEE International Symposium on Circuits and Systems

T2 - 2013 IEEE International Symposium on Circuits and Systems

Y2 - 19 May 2013 through 23 May 2013

ER -

Thresholding-based online algorithms of complexity comparable to sparse LMS methods

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this