Sorry, you need to enable JavaScript to visit this website.

Adaptive Signal Processing

DATA-SELECTIVE LMS-NEWTON AND LMS-QUASI-NEWTON ALGORITHMS


The huge volume of data that are available today requires data-
selective processing approaches that avoid the costs in computa-
tional complexity via appropriately treating the non-innovative data.
In this paper, extensions of the well-known adaptive filtering LMS-
Newton and LMS-Quasi-Newton Algorithms are developed that
enable data selection while also addressing the censorship of out-
liers that emerge due to high measurement errors. The proposed
solutions allow the prescription of how often the acquired data are

Paper Details

Authors:
Submitted On:
14 May 2019 - 5:42am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

presentation_tsinos.pdf

(23)

Subscribe

[1] , "DATA-SELECTIVE LMS-NEWTON AND LMS-QUASI-NEWTON ALGORITHMS", IEEE SigPort, 2019. [Online]. Available: http://sigport.org/4505. Accessed: Aug. 23, 2019.
@article{4505-19,
url = {http://sigport.org/4505},
author = { },
publisher = {IEEE SigPort},
title = {DATA-SELECTIVE LMS-NEWTON AND LMS-QUASI-NEWTON ALGORITHMS},
year = {2019} }
TY - EJOUR
T1 - DATA-SELECTIVE LMS-NEWTON AND LMS-QUASI-NEWTON ALGORITHMS
AU -
PY - 2019
PB - IEEE SigPort
UR - http://sigport.org/4505
ER -
. (2019). DATA-SELECTIVE LMS-NEWTON AND LMS-QUASI-NEWTON ALGORITHMS. IEEE SigPort. http://sigport.org/4505
, 2019. DATA-SELECTIVE LMS-NEWTON AND LMS-QUASI-NEWTON ALGORITHMS. Available at: http://sigport.org/4505.
. (2019). "DATA-SELECTIVE LMS-NEWTON AND LMS-QUASI-NEWTON ALGORITHMS." Web.
1. . DATA-SELECTIVE LMS-NEWTON AND LMS-QUASI-NEWTON ALGORITHMS [Internet]. IEEE SigPort; 2019. Available from : http://sigport.org/4505

A Characterization of Stochastic Mirror Descent Algorithms and Their Convergence Properties


Stochastic mirror descent (SMD) algorithms have recently garnered a great deal of attention in optimization, signal processing, and machine learning. They are similar to stochastic gradient descent (SGD), in that they perform updates along the negative gradient of an instantaneous (or stochastically chosen) loss function. However, rather than update the parameter (or weight) vector directly, they update it in a "mirrored" domain whose transformation is given by the gradient of a strictly convex differentiable potential function.

Paper Details

Authors:
Navid Azizan, Babak Hassibi
Submitted On:
13 May 2019 - 8:33pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

ICASSP-SMD-Poster.pdf

(29)

Subscribe

[1] Navid Azizan, Babak Hassibi, "A Characterization of Stochastic Mirror Descent Algorithms and Their Convergence Properties", IEEE SigPort, 2019. [Online]. Available: http://sigport.org/4498. Accessed: Aug. 23, 2019.
@article{4498-19,
url = {http://sigport.org/4498},
author = {Navid Azizan; Babak Hassibi },
publisher = {IEEE SigPort},
title = {A Characterization of Stochastic Mirror Descent Algorithms and Their Convergence Properties},
year = {2019} }
TY - EJOUR
T1 - A Characterization of Stochastic Mirror Descent Algorithms and Their Convergence Properties
AU - Navid Azizan; Babak Hassibi
PY - 2019
PB - IEEE SigPort
UR - http://sigport.org/4498
ER -
Navid Azizan, Babak Hassibi. (2019). A Characterization of Stochastic Mirror Descent Algorithms and Their Convergence Properties. IEEE SigPort. http://sigport.org/4498
Navid Azizan, Babak Hassibi, 2019. A Characterization of Stochastic Mirror Descent Algorithms and Their Convergence Properties. Available at: http://sigport.org/4498.
Navid Azizan, Babak Hassibi. (2019). "A Characterization of Stochastic Mirror Descent Algorithms and Their Convergence Properties." Web.
1. Navid Azizan, Babak Hassibi. A Characterization of Stochastic Mirror Descent Algorithms and Their Convergence Properties [Internet]. IEEE SigPort; 2019. Available from : http://sigport.org/4498

Analysis of Broadband GEVD-Based Blind Source Separation

Paper Details

Authors:
Jen Pestana, Soydan Redif
Submitted On:
8 May 2019 - 5:18am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

Paper2065Presentation.pdf

(32)

Subscribe

[1] Jen Pestana, Soydan Redif, "Analysis of Broadband GEVD-Based Blind Source Separation", IEEE SigPort, 2019. [Online]. Available: http://sigport.org/4055. Accessed: Aug. 23, 2019.
@article{4055-19,
url = {http://sigport.org/4055},
author = {Jen Pestana; Soydan Redif },
publisher = {IEEE SigPort},
title = {Analysis of Broadband GEVD-Based Blind Source Separation},
year = {2019} }
TY - EJOUR
T1 - Analysis of Broadband GEVD-Based Blind Source Separation
AU - Jen Pestana; Soydan Redif
PY - 2019
PB - IEEE SigPort
UR - http://sigport.org/4055
ER -
Jen Pestana, Soydan Redif. (2019). Analysis of Broadband GEVD-Based Blind Source Separation. IEEE SigPort. http://sigport.org/4055
Jen Pestana, Soydan Redif, 2019. Analysis of Broadband GEVD-Based Blind Source Separation. Available at: http://sigport.org/4055.
Jen Pestana, Soydan Redif. (2019). "Analysis of Broadband GEVD-Based Blind Source Separation." Web.
1. Jen Pestana, Soydan Redif. Analysis of Broadband GEVD-Based Blind Source Separation [Internet]. IEEE SigPort; 2019. Available from : http://sigport.org/4055

l0-norm Feature LMS Algorithms


A class of algorithms known as feature least-mean-square (FLMS) has been proposed recently to exploit hidden sparsity

Paper Details

Authors:
Hamed Yazdanpanah, José Antonio Apolinário Jr., Paulo Sergio Ramirez Diniz, Markus Vinicius Santos Lima
Submitted On:
16 November 2018 - 4:29pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

PosterGlobalSIP_2018.pdf

(80)

Subscribe

[1] Hamed Yazdanpanah, José Antonio Apolinário Jr., Paulo Sergio Ramirez Diniz, Markus Vinicius Santos Lima, "l0-norm Feature LMS Algorithms", IEEE SigPort, 2018. [Online]. Available: http://sigport.org/3671. Accessed: Aug. 23, 2019.
@article{3671-18,
url = {http://sigport.org/3671},
author = {Hamed Yazdanpanah; José Antonio Apolinário Jr.; Paulo Sergio Ramirez Diniz; Markus Vinicius Santos Lima },
publisher = {IEEE SigPort},
title = {l0-norm Feature LMS Algorithms},
year = {2018} }
TY - EJOUR
T1 - l0-norm Feature LMS Algorithms
AU - Hamed Yazdanpanah; José Antonio Apolinário Jr.; Paulo Sergio Ramirez Diniz; Markus Vinicius Santos Lima
PY - 2018
PB - IEEE SigPort
UR - http://sigport.org/3671
ER -
Hamed Yazdanpanah, José Antonio Apolinário Jr., Paulo Sergio Ramirez Diniz, Markus Vinicius Santos Lima. (2018). l0-norm Feature LMS Algorithms. IEEE SigPort. http://sigport.org/3671
Hamed Yazdanpanah, José Antonio Apolinário Jr., Paulo Sergio Ramirez Diniz, Markus Vinicius Santos Lima, 2018. l0-norm Feature LMS Algorithms. Available at: http://sigport.org/3671.
Hamed Yazdanpanah, José Antonio Apolinário Jr., Paulo Sergio Ramirez Diniz, Markus Vinicius Santos Lima. (2018). "l0-norm Feature LMS Algorithms." Web.
1. Hamed Yazdanpanah, José Antonio Apolinário Jr., Paulo Sergio Ramirez Diniz, Markus Vinicius Santos Lima. l0-norm Feature LMS Algorithms [Internet]. IEEE SigPort; 2018. Available from : http://sigport.org/3671

Distributed Inference over Multitask Graphs under Smoothness

Paper Details

Authors:
Submitted On:
23 June 2018 - 8:45am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

poster_spawc.pdf

(108)

Subscribe

[1] , "Distributed Inference over Multitask Graphs under Smoothness", IEEE SigPort, 2018. [Online]. Available: http://sigport.org/3312. Accessed: Aug. 23, 2019.
@article{3312-18,
url = {http://sigport.org/3312},
author = { },
publisher = {IEEE SigPort},
title = {Distributed Inference over Multitask Graphs under Smoothness},
year = {2018} }
TY - EJOUR
T1 - Distributed Inference over Multitask Graphs under Smoothness
AU -
PY - 2018
PB - IEEE SigPort
UR - http://sigport.org/3312
ER -
. (2018). Distributed Inference over Multitask Graphs under Smoothness. IEEE SigPort. http://sigport.org/3312
, 2018. Distributed Inference over Multitask Graphs under Smoothness. Available at: http://sigport.org/3312.
. (2018). "Distributed Inference over Multitask Graphs under Smoothness." Web.
1. . Distributed Inference over Multitask Graphs under Smoothness [Internet]. IEEE SigPort; 2018. Available from : http://sigport.org/3312

Distributed Inference over Multitask Graphs under Smoothness

Paper Details

Authors:
Submitted On:
23 June 2018 - 8:45am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

poster_spawc.pdf

(110)

Subscribe

[1] , "Distributed Inference over Multitask Graphs under Smoothness", IEEE SigPort, 2018. [Online]. Available: http://sigport.org/3311. Accessed: Aug. 23, 2019.
@article{3311-18,
url = {http://sigport.org/3311},
author = { },
publisher = {IEEE SigPort},
title = {Distributed Inference over Multitask Graphs under Smoothness},
year = {2018} }
TY - EJOUR
T1 - Distributed Inference over Multitask Graphs under Smoothness
AU -
PY - 2018
PB - IEEE SigPort
UR - http://sigport.org/3311
ER -
. (2018). Distributed Inference over Multitask Graphs under Smoothness. IEEE SigPort. http://sigport.org/3311
, 2018. Distributed Inference over Multitask Graphs under Smoothness. Available at: http://sigport.org/3311.
. (2018). "Distributed Inference over Multitask Graphs under Smoothness." Web.
1. . Distributed Inference over Multitask Graphs under Smoothness [Internet]. IEEE SigPort; 2018. Available from : http://sigport.org/3311

Identification of Bilinear Forms with the Kalman Filter

Paper Details

Authors:
Laura Dogariu, Constantin Paleologu, Silviu Ciochina, Jacob Benesty, Pablo Piantanida
Submitted On:
21 April 2018 - 12:05pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

Identification_of_Bilinear_Forms_with_the_Kalman_Filter_ICASSP_2018.pdf

(139)

Keywords

Additional Categories

Subscribe

[1] Laura Dogariu, Constantin Paleologu, Silviu Ciochina, Jacob Benesty, Pablo Piantanida, "Identification of Bilinear Forms with the Kalman Filter", IEEE SigPort, 2018. [Online]. Available: http://sigport.org/3123. Accessed: Aug. 23, 2019.
@article{3123-18,
url = {http://sigport.org/3123},
author = {Laura Dogariu; Constantin Paleologu; Silviu Ciochina; Jacob Benesty; Pablo Piantanida },
publisher = {IEEE SigPort},
title = {Identification of Bilinear Forms with the Kalman Filter},
year = {2018} }
TY - EJOUR
T1 - Identification of Bilinear Forms with the Kalman Filter
AU - Laura Dogariu; Constantin Paleologu; Silviu Ciochina; Jacob Benesty; Pablo Piantanida
PY - 2018
PB - IEEE SigPort
UR - http://sigport.org/3123
ER -
Laura Dogariu, Constantin Paleologu, Silviu Ciochina, Jacob Benesty, Pablo Piantanida. (2018). Identification of Bilinear Forms with the Kalman Filter. IEEE SigPort. http://sigport.org/3123
Laura Dogariu, Constantin Paleologu, Silviu Ciochina, Jacob Benesty, Pablo Piantanida, 2018. Identification of Bilinear Forms with the Kalman Filter. Available at: http://sigport.org/3123.
Laura Dogariu, Constantin Paleologu, Silviu Ciochina, Jacob Benesty, Pablo Piantanida. (2018). "Identification of Bilinear Forms with the Kalman Filter." Web.
1. Laura Dogariu, Constantin Paleologu, Silviu Ciochina, Jacob Benesty, Pablo Piantanida. Identification of Bilinear Forms with the Kalman Filter [Internet]. IEEE SigPort; 2018. Available from : http://sigport.org/3123

Robust Diffusion Recursive Least Squares Estimation with Side Information for Networked Agents

Paper Details

Authors:
Haiquan Zhao, Rodrigo C. de Lamare, and Yuriy Zakharov
Submitted On:
19 April 2018 - 9:42pm
Short Link:
Type:
Event:
Document Year:
Cite

Document Files

presentation file for ICASSP 2018.pdf

(30)

Subscribe

[1] Haiquan Zhao, Rodrigo C. de Lamare, and Yuriy Zakharov, "Robust Diffusion Recursive Least Squares Estimation with Side Information for Networked Agents", IEEE SigPort, 2018. [Online]. Available: http://sigport.org/3051. Accessed: Aug. 23, 2019.
@article{3051-18,
url = {http://sigport.org/3051},
author = {Haiquan Zhao; Rodrigo C. de Lamare; and Yuriy Zakharov },
publisher = {IEEE SigPort},
title = {Robust Diffusion Recursive Least Squares Estimation with Side Information for Networked Agents},
year = {2018} }
TY - EJOUR
T1 - Robust Diffusion Recursive Least Squares Estimation with Side Information for Networked Agents
AU - Haiquan Zhao; Rodrigo C. de Lamare; and Yuriy Zakharov
PY - 2018
PB - IEEE SigPort
UR - http://sigport.org/3051
ER -
Haiquan Zhao, Rodrigo C. de Lamare, and Yuriy Zakharov. (2018). Robust Diffusion Recursive Least Squares Estimation with Side Information for Networked Agents. IEEE SigPort. http://sigport.org/3051
Haiquan Zhao, Rodrigo C. de Lamare, and Yuriy Zakharov, 2018. Robust Diffusion Recursive Least Squares Estimation with Side Information for Networked Agents. Available at: http://sigport.org/3051.
Haiquan Zhao, Rodrigo C. de Lamare, and Yuriy Zakharov. (2018). "Robust Diffusion Recursive Least Squares Estimation with Side Information for Networked Agents." Web.
1. Haiquan Zhao, Rodrigo C. de Lamare, and Yuriy Zakharov. Robust Diffusion Recursive Least Squares Estimation with Side Information for Networked Agents [Internet]. IEEE SigPort; 2018. Available from : http://sigport.org/3051

Control of Graph Signals over Random Time-Varying Graphs


In this work, we jointly exploit tools from graph signal processing and control theory to drive a bandlimited graph signal that is being diffused on a random time-varying graph from a subset of nodes. As our main contribution, we rely only on the statistics of the graph to introduce the concept of controllability in the mean, and therefore drive the signal on the expected graph to a desired state.

Paper Details

Authors:
Fernando Gama, Elvin Isufi, Geert Leus and Alejandro Ribeiro
Submitted On:
19 April 2018 - 7:37pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

control-icassp18-poster.pdf

(147)

Keywords

Additional Categories

Subscribe

[1] Fernando Gama, Elvin Isufi, Geert Leus and Alejandro Ribeiro, "Control of Graph Signals over Random Time-Varying Graphs", IEEE SigPort, 2018. [Online]. Available: http://sigport.org/3041. Accessed: Aug. 23, 2019.
@article{3041-18,
url = {http://sigport.org/3041},
author = {Fernando Gama; Elvin Isufi; Geert Leus and Alejandro Ribeiro },
publisher = {IEEE SigPort},
title = {Control of Graph Signals over Random Time-Varying Graphs},
year = {2018} }
TY - EJOUR
T1 - Control of Graph Signals over Random Time-Varying Graphs
AU - Fernando Gama; Elvin Isufi; Geert Leus and Alejandro Ribeiro
PY - 2018
PB - IEEE SigPort
UR - http://sigport.org/3041
ER -
Fernando Gama, Elvin Isufi, Geert Leus and Alejandro Ribeiro. (2018). Control of Graph Signals over Random Time-Varying Graphs. IEEE SigPort. http://sigport.org/3041
Fernando Gama, Elvin Isufi, Geert Leus and Alejandro Ribeiro, 2018. Control of Graph Signals over Random Time-Varying Graphs. Available at: http://sigport.org/3041.
Fernando Gama, Elvin Isufi, Geert Leus and Alejandro Ribeiro. (2018). "Control of Graph Signals over Random Time-Varying Graphs." Web.
1. Fernando Gama, Elvin Isufi, Geert Leus and Alejandro Ribeiro. Control of Graph Signals over Random Time-Varying Graphs [Internet]. IEEE SigPort; 2018. Available from : http://sigport.org/3041

A Quaternion Kernel Minimum Error Entropy Adaptive Filter

Paper Details

Authors:
Submitted On:
15 April 2018 - 6:58pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

ICASSP_2018_Paper_3604_v12_Quat_KMEE_rev8.pdf

(236)

Subscribe

[1] , "A Quaternion Kernel Minimum Error Entropy Adaptive Filter", IEEE SigPort, 2018. [Online]. Available: http://sigport.org/2904. Accessed: Aug. 23, 2019.
@article{2904-18,
url = {http://sigport.org/2904},
author = { },
publisher = {IEEE SigPort},
title = {A Quaternion Kernel Minimum Error Entropy Adaptive Filter},
year = {2018} }
TY - EJOUR
T1 - A Quaternion Kernel Minimum Error Entropy Adaptive Filter
AU -
PY - 2018
PB - IEEE SigPort
UR - http://sigport.org/2904
ER -
. (2018). A Quaternion Kernel Minimum Error Entropy Adaptive Filter. IEEE SigPort. http://sigport.org/2904
, 2018. A Quaternion Kernel Minimum Error Entropy Adaptive Filter. Available at: http://sigport.org/2904.
. (2018). "A Quaternion Kernel Minimum Error Entropy Adaptive Filter." Web.
1. . A Quaternion Kernel Minimum Error Entropy Adaptive Filter [Internet]. IEEE SigPort; 2018. Available from : http://sigport.org/2904

Pages