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

Machine Learning for Signal Processing

Sparse Modeling


Sparse Modeling in Image Processing and Deep LearningSparse approximation is a well-established theory, with a profound impact on the fields of signal and image processing. In this talk we start by presenting this model and its features, and then turn to describe two special cases of it – the convolutional sparse coding (CSC) and its multi-layered version (ML-CSC).  Amazingly, as we will carefully show, ML-CSC provides a solid theoretical foundation to … deep-learning.

Paper Details

Authors:
Michael Elad
Submitted On:
22 December 2017 - 1:26pm
Short Link:
Type:
Event:
Presenter's Name:
Document Year:
Cite

Document Files

ICIP_KeyNote_Talk_small size.pdf

(18)

Subscribe

[1] Michael Elad, "Sparse Modeling ", IEEE SigPort, 2017. [Online]. Available: http://sigport.org/2260. Accessed: May. 26, 2019.
@article{2260-17,
url = {http://sigport.org/2260},
author = {Michael Elad },
publisher = {IEEE SigPort},
title = {Sparse Modeling },
year = {2017} }
TY - EJOUR
T1 - Sparse Modeling
AU - Michael Elad
PY - 2017
PB - IEEE SigPort
UR - http://sigport.org/2260
ER -
Michael Elad. (2017). Sparse Modeling . IEEE SigPort. http://sigport.org/2260
Michael Elad, 2017. Sparse Modeling . Available at: http://sigport.org/2260.
Michael Elad. (2017). "Sparse Modeling ." Web.
1. Michael Elad. Sparse Modeling [Internet]. IEEE SigPort; 2017. Available from : http://sigport.org/2260

A History-based Stopping Criterion in Recursive Bayesian State Estimation


In dynamic state-space models, the state can be estimated through recursive computation of the posterior distribution of the state given all measurements. In scenarios where active sensing/querying is possible, a hard decision is made when the state posterior achieves a pre-set confidence threshold. This mandate to meet a hard threshold may sometimes unnecessarily require more queries. In application domains where sensing/querying cost is of concern, some potential accuracy may be sacrificed for greater gains in sensing cost.

Paper Details

Authors:
Yeganeh M. Marghi, Aziz Kocanaogullari, Murat Akcakaya, Deniz Erdomus
Submitted On:
15 May 2019 - 9:57pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

P_Marghi_Kocan_ICASSP_2019.pdf

(3)

Subscribe

[1] Yeganeh M. Marghi, Aziz Kocanaogullari, Murat Akcakaya, Deniz Erdomus, "A History-based Stopping Criterion in Recursive Bayesian State Estimation", IEEE SigPort, 2019. [Online]. Available: http://sigport.org/4536. Accessed: May. 26, 2019.
@article{4536-19,
url = {http://sigport.org/4536},
author = {Yeganeh M. Marghi; Aziz Kocanaogullari; Murat Akcakaya; Deniz Erdomus },
publisher = {IEEE SigPort},
title = {A History-based Stopping Criterion in Recursive Bayesian State Estimation},
year = {2019} }
TY - EJOUR
T1 - A History-based Stopping Criterion in Recursive Bayesian State Estimation
AU - Yeganeh M. Marghi; Aziz Kocanaogullari; Murat Akcakaya; Deniz Erdomus
PY - 2019
PB - IEEE SigPort
UR - http://sigport.org/4536
ER -
Yeganeh M. Marghi, Aziz Kocanaogullari, Murat Akcakaya, Deniz Erdomus. (2019). A History-based Stopping Criterion in Recursive Bayesian State Estimation. IEEE SigPort. http://sigport.org/4536
Yeganeh M. Marghi, Aziz Kocanaogullari, Murat Akcakaya, Deniz Erdomus, 2019. A History-based Stopping Criterion in Recursive Bayesian State Estimation. Available at: http://sigport.org/4536.
Yeganeh M. Marghi, Aziz Kocanaogullari, Murat Akcakaya, Deniz Erdomus. (2019). "A History-based Stopping Criterion in Recursive Bayesian State Estimation." Web.
1. Yeganeh M. Marghi, Aziz Kocanaogullari, Murat Akcakaya, Deniz Erdomus. A History-based Stopping Criterion in Recursive Bayesian State Estimation [Internet]. IEEE SigPort; 2019. Available from : http://sigport.org/4536

A History-based Stopping Criterion in Recursive Bayesian State Estimation


In dynamic state-space models, the state can be estimated through recursive computation of the posterior distribution of the state given all measurements. In scenarios where active sensing/querying is possible, a hard decision is made when the state posterior achieves a pre-set confidence threshold. This mandate to meet a hard threshold may sometimes unnecessarily require more queries. In application domains where sensing/querying cost is of concern, some potential accuracy may be sacrificed for greater gains in sensing cost.

Paper Details

Authors:
Yeganeh M. Marghi, Aziz Kocanaogullari, Murat Akcakaya, Deniz Erdomus
Submitted On:
15 May 2019 - 9:57pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

P_Marghi_Kocan_ICASSP_2019.pdf

(2)

Subscribe

[1] Yeganeh M. Marghi, Aziz Kocanaogullari, Murat Akcakaya, Deniz Erdomus, "A History-based Stopping Criterion in Recursive Bayesian State Estimation", IEEE SigPort, 2019. [Online]. Available: http://sigport.org/4535. Accessed: May. 26, 2019.
@article{4535-19,
url = {http://sigport.org/4535},
author = {Yeganeh M. Marghi; Aziz Kocanaogullari; Murat Akcakaya; Deniz Erdomus },
publisher = {IEEE SigPort},
title = {A History-based Stopping Criterion in Recursive Bayesian State Estimation},
year = {2019} }
TY - EJOUR
T1 - A History-based Stopping Criterion in Recursive Bayesian State Estimation
AU - Yeganeh M. Marghi; Aziz Kocanaogullari; Murat Akcakaya; Deniz Erdomus
PY - 2019
PB - IEEE SigPort
UR - http://sigport.org/4535
ER -
Yeganeh M. Marghi, Aziz Kocanaogullari, Murat Akcakaya, Deniz Erdomus. (2019). A History-based Stopping Criterion in Recursive Bayesian State Estimation. IEEE SigPort. http://sigport.org/4535
Yeganeh M. Marghi, Aziz Kocanaogullari, Murat Akcakaya, Deniz Erdomus, 2019. A History-based Stopping Criterion in Recursive Bayesian State Estimation. Available at: http://sigport.org/4535.
Yeganeh M. Marghi, Aziz Kocanaogullari, Murat Akcakaya, Deniz Erdomus. (2019). "A History-based Stopping Criterion in Recursive Bayesian State Estimation." Web.
1. Yeganeh M. Marghi, Aziz Kocanaogullari, Murat Akcakaya, Deniz Erdomus. A History-based Stopping Criterion in Recursive Bayesian State Estimation [Internet]. IEEE SigPort; 2019. Available from : http://sigport.org/4535

Estimation of Gaze Region using Two Dimensional Probabilistic Maps Constructed using Convolutional Neural Networks

Paper Details

Authors:
Sumit Jha, Carlos Busso
Submitted On:
13 May 2019 - 9:22am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

icassp-poster.pdf

(2)

Subscribe

[1] Sumit Jha, Carlos Busso, "Estimation of Gaze Region using Two Dimensional Probabilistic Maps Constructed using Convolutional Neural Networks", IEEE SigPort, 2019. [Online]. Available: http://sigport.org/4485. Accessed: May. 26, 2019.
@article{4485-19,
url = {http://sigport.org/4485},
author = {Sumit Jha; Carlos Busso },
publisher = {IEEE SigPort},
title = {Estimation of Gaze Region using Two Dimensional Probabilistic Maps Constructed using Convolutional Neural Networks},
year = {2019} }
TY - EJOUR
T1 - Estimation of Gaze Region using Two Dimensional Probabilistic Maps Constructed using Convolutional Neural Networks
AU - Sumit Jha; Carlos Busso
PY - 2019
PB - IEEE SigPort
UR - http://sigport.org/4485
ER -
Sumit Jha, Carlos Busso. (2019). Estimation of Gaze Region using Two Dimensional Probabilistic Maps Constructed using Convolutional Neural Networks. IEEE SigPort. http://sigport.org/4485
Sumit Jha, Carlos Busso, 2019. Estimation of Gaze Region using Two Dimensional Probabilistic Maps Constructed using Convolutional Neural Networks. Available at: http://sigport.org/4485.
Sumit Jha, Carlos Busso. (2019). "Estimation of Gaze Region using Two Dimensional Probabilistic Maps Constructed using Convolutional Neural Networks." Web.
1. Sumit Jha, Carlos Busso. Estimation of Gaze Region using Two Dimensional Probabilistic Maps Constructed using Convolutional Neural Networks [Internet]. IEEE SigPort; 2019. Available from : http://sigport.org/4485

Adversarial Speaker Adaptation


We propose a novel adversarial speaker adaptation (ASA) scheme, in which adversarial learning is applied to regularize the distribution of deep hidden features in a speaker-dependent (SD) deep neural network (DNN) acoustic model to be close to that of a fixed speaker-independent (SI) DNN acoustic model during adaptation. An additional discriminator network is introduced to distinguish the deep features generated by the SD model from those produced by the SI model.

Paper Details

Authors:
Zhong Meng, Jinyu Li, Yifan Gong
Submitted On:
12 May 2019 - 9:26pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

asa_oral_v3.pptx

(4)

Subscribe

[1] Zhong Meng, Jinyu Li, Yifan Gong, "Adversarial Speaker Adaptation", IEEE SigPort, 2019. [Online]. Available: http://sigport.org/4475. Accessed: May. 26, 2019.
@article{4475-19,
url = {http://sigport.org/4475},
author = {Zhong Meng; Jinyu Li; Yifan Gong },
publisher = {IEEE SigPort},
title = {Adversarial Speaker Adaptation},
year = {2019} }
TY - EJOUR
T1 - Adversarial Speaker Adaptation
AU - Zhong Meng; Jinyu Li; Yifan Gong
PY - 2019
PB - IEEE SigPort
UR - http://sigport.org/4475
ER -
Zhong Meng, Jinyu Li, Yifan Gong. (2019). Adversarial Speaker Adaptation. IEEE SigPort. http://sigport.org/4475
Zhong Meng, Jinyu Li, Yifan Gong, 2019. Adversarial Speaker Adaptation. Available at: http://sigport.org/4475.
Zhong Meng, Jinyu Li, Yifan Gong. (2019). "Adversarial Speaker Adaptation." Web.
1. Zhong Meng, Jinyu Li, Yifan Gong. Adversarial Speaker Adaptation [Internet]. IEEE SigPort; 2019. Available from : http://sigport.org/4475

Attentive Adversarial Learning for Domain-Invariant Training


Adversarial domain-invariant training (ADIT) proves to be effective in suppressing the effects of domain variability in acoustic modeling and has led to improved performance in automatic speech recognition (ASR). In ADIT, an auxiliary domain classifier takes in equally-weighted deep features from a deep neural network (DNN) acoustic model and is trained to improve their domain-invariance by optimizing an adversarial loss function.

Paper Details

Authors:
Zhong Meng, Jinyu Li, Yifan Gong
Submitted On:
12 May 2019 - 9:03pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

aadit_poster.pptx

(2)

Subscribe

[1] Zhong Meng, Jinyu Li, Yifan Gong, "Attentive Adversarial Learning for Domain-Invariant Training", IEEE SigPort, 2019. [Online]. Available: http://sigport.org/4474. Accessed: May. 26, 2019.
@article{4474-19,
url = {http://sigport.org/4474},
author = {Zhong Meng; Jinyu Li; Yifan Gong },
publisher = {IEEE SigPort},
title = {Attentive Adversarial Learning for Domain-Invariant Training},
year = {2019} }
TY - EJOUR
T1 - Attentive Adversarial Learning for Domain-Invariant Training
AU - Zhong Meng; Jinyu Li; Yifan Gong
PY - 2019
PB - IEEE SigPort
UR - http://sigport.org/4474
ER -
Zhong Meng, Jinyu Li, Yifan Gong. (2019). Attentive Adversarial Learning for Domain-Invariant Training. IEEE SigPort. http://sigport.org/4474
Zhong Meng, Jinyu Li, Yifan Gong, 2019. Attentive Adversarial Learning for Domain-Invariant Training. Available at: http://sigport.org/4474.
Zhong Meng, Jinyu Li, Yifan Gong. (2019). "Attentive Adversarial Learning for Domain-Invariant Training." Web.
1. Zhong Meng, Jinyu Li, Yifan Gong. Attentive Adversarial Learning for Domain-Invariant Training [Internet]. IEEE SigPort; 2019. Available from : http://sigport.org/4474

Adversarial Speaker Verification


The use of deep networks to extract embeddings for speaker recognition has proven successfully. However, such embeddings are susceptible to performance degradation due to the mismatches among the training, enrollment, and test conditions. In this work, we propose an adversarial speaker verification (ASV) scheme to learn the condition-invariant deep embedding via adversarial multi-task training. In ASV, a speaker classification network and a condition identification network are jointly optimized to minimize the speaker classification loss and simultaneously mini-maximize the condition loss.

Paper Details

Authors:
Zhong Meng, Yong Zhao, Jinyu Li, Yifan Gong
Submitted On:
12 May 2019 - 9:24pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

asv_poster_v3.pptx

(5)

Subscribe

[1] Zhong Meng, Yong Zhao, Jinyu Li, Yifan Gong, "Adversarial Speaker Verification", IEEE SigPort, 2019. [Online]. Available: http://sigport.org/4473. Accessed: May. 26, 2019.
@article{4473-19,
url = {http://sigport.org/4473},
author = {Zhong Meng; Yong Zhao; Jinyu Li; Yifan Gong },
publisher = {IEEE SigPort},
title = {Adversarial Speaker Verification},
year = {2019} }
TY - EJOUR
T1 - Adversarial Speaker Verification
AU - Zhong Meng; Yong Zhao; Jinyu Li; Yifan Gong
PY - 2019
PB - IEEE SigPort
UR - http://sigport.org/4473
ER -
Zhong Meng, Yong Zhao, Jinyu Li, Yifan Gong. (2019). Adversarial Speaker Verification. IEEE SigPort. http://sigport.org/4473
Zhong Meng, Yong Zhao, Jinyu Li, Yifan Gong, 2019. Adversarial Speaker Verification. Available at: http://sigport.org/4473.
Zhong Meng, Yong Zhao, Jinyu Li, Yifan Gong. (2019). "Adversarial Speaker Verification." Web.
1. Zhong Meng, Yong Zhao, Jinyu Li, Yifan Gong. Adversarial Speaker Verification [Internet]. IEEE SigPort; 2019. Available from : http://sigport.org/4473

Conditional Teacher-Student Learning


The teacher-student (T/S) learning has been shown to be effective for a variety of problems such as domain adaptation and model compression. One shortcoming of the T/S learning is that a teacher model, not always perfect, sporadically produces wrong guidance in form of posterior probabilities that misleads the student model towards a suboptimal performance.

Paper Details

Authors:
Zhong Meng, Jinyu Li, Yong Zhao, Yifan Gong
Submitted On:
12 May 2019 - 9:23pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

cts_poster.pptx

(5)

Subscribe

[1] Zhong Meng, Jinyu Li, Yong Zhao, Yifan Gong, "Conditional Teacher-Student Learning", IEEE SigPort, 2019. [Online]. Available: http://sigport.org/4472. Accessed: May. 26, 2019.
@article{4472-19,
url = {http://sigport.org/4472},
author = {Zhong Meng; Jinyu Li; Yong Zhao; Yifan Gong },
publisher = {IEEE SigPort},
title = {Conditional Teacher-Student Learning},
year = {2019} }
TY - EJOUR
T1 - Conditional Teacher-Student Learning
AU - Zhong Meng; Jinyu Li; Yong Zhao; Yifan Gong
PY - 2019
PB - IEEE SigPort
UR - http://sigport.org/4472
ER -
Zhong Meng, Jinyu Li, Yong Zhao, Yifan Gong. (2019). Conditional Teacher-Student Learning. IEEE SigPort. http://sigport.org/4472
Zhong Meng, Jinyu Li, Yong Zhao, Yifan Gong, 2019. Conditional Teacher-Student Learning. Available at: http://sigport.org/4472.
Zhong Meng, Jinyu Li, Yong Zhao, Yifan Gong. (2019). "Conditional Teacher-Student Learning." Web.
1. Zhong Meng, Jinyu Li, Yong Zhao, Yifan Gong. Conditional Teacher-Student Learning [Internet]. IEEE SigPort; 2019. Available from : http://sigport.org/4472

Deep Signal Recovery With One-Bit Quantization

Paper Details

Authors:
Shahin Khobahi, Naveed Naimipour, Mojtaba Soltanalian, Yonina C. Eldar
Submitted On:
10 May 2019 - 6:46pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

ICASSP2019.pdf

(9)

Subscribe

[1] Shahin Khobahi, Naveed Naimipour, Mojtaba Soltanalian, Yonina C. Eldar, "Deep Signal Recovery With One-Bit Quantization", IEEE SigPort, 2019. [Online]. Available: http://sigport.org/4422. Accessed: May. 26, 2019.
@article{4422-19,
url = {http://sigport.org/4422},
author = {Shahin Khobahi; Naveed Naimipour; Mojtaba Soltanalian; Yonina C. Eldar },
publisher = {IEEE SigPort},
title = {Deep Signal Recovery With One-Bit Quantization},
year = {2019} }
TY - EJOUR
T1 - Deep Signal Recovery With One-Bit Quantization
AU - Shahin Khobahi; Naveed Naimipour; Mojtaba Soltanalian; Yonina C. Eldar
PY - 2019
PB - IEEE SigPort
UR - http://sigport.org/4422
ER -
Shahin Khobahi, Naveed Naimipour, Mojtaba Soltanalian, Yonina C. Eldar. (2019). Deep Signal Recovery With One-Bit Quantization. IEEE SigPort. http://sigport.org/4422
Shahin Khobahi, Naveed Naimipour, Mojtaba Soltanalian, Yonina C. Eldar, 2019. Deep Signal Recovery With One-Bit Quantization. Available at: http://sigport.org/4422.
Shahin Khobahi, Naveed Naimipour, Mojtaba Soltanalian, Yonina C. Eldar. (2019). "Deep Signal Recovery With One-Bit Quantization." Web.
1. Shahin Khobahi, Naveed Naimipour, Mojtaba Soltanalian, Yonina C. Eldar. Deep Signal Recovery With One-Bit Quantization [Internet]. IEEE SigPort; 2019. Available from : http://sigport.org/4422

Higher-order Nonnegative CANDECOMP/PARAFAC Tensor Decomposition Using Proximal Algorithm


Tensor decomposition is a powerful tool for analyzing multiway data. Nowadays, with the fast development of multisensor technology, more and more data appear in higher-order (order >= 4) and nonnegative form. However, the decomposition of higher-order nonnegative tensor suffers from poor convergence and low speed. In this study, we propose a new nonnegative CANDECOM/PARAFAC (NCP) model using proximal algorithm. The block principal pivoting method in alternating nonnegative least squares (ANLS) framework is employed to minimize the objective function.

Paper Details

Authors:
Deqing Wang, Fengyu Cong, Tapani Ristaniemi
Submitted On:
10 May 2019 - 5:09pm
Short Link:
Type:
Event:
Document Year:
Cite

Document Files

Wang_et_al_Poster_NCP_ICASSP2019.pdf

(8)

Subscribe

[1] Deqing Wang, Fengyu Cong, Tapani Ristaniemi, "Higher-order Nonnegative CANDECOMP/PARAFAC Tensor Decomposition Using Proximal Algorithm", IEEE SigPort, 2019. [Online]. Available: http://sigport.org/4408. Accessed: May. 26, 2019.
@article{4408-19,
url = {http://sigport.org/4408},
author = {Deqing Wang; Fengyu Cong; Tapani Ristaniemi },
publisher = {IEEE SigPort},
title = {Higher-order Nonnegative CANDECOMP/PARAFAC Tensor Decomposition Using Proximal Algorithm},
year = {2019} }
TY - EJOUR
T1 - Higher-order Nonnegative CANDECOMP/PARAFAC Tensor Decomposition Using Proximal Algorithm
AU - Deqing Wang; Fengyu Cong; Tapani Ristaniemi
PY - 2019
PB - IEEE SigPort
UR - http://sigport.org/4408
ER -
Deqing Wang, Fengyu Cong, Tapani Ristaniemi. (2019). Higher-order Nonnegative CANDECOMP/PARAFAC Tensor Decomposition Using Proximal Algorithm. IEEE SigPort. http://sigport.org/4408
Deqing Wang, Fengyu Cong, Tapani Ristaniemi, 2019. Higher-order Nonnegative CANDECOMP/PARAFAC Tensor Decomposition Using Proximal Algorithm. Available at: http://sigport.org/4408.
Deqing Wang, Fengyu Cong, Tapani Ristaniemi. (2019). "Higher-order Nonnegative CANDECOMP/PARAFAC Tensor Decomposition Using Proximal Algorithm." Web.
1. Deqing Wang, Fengyu Cong, Tapani Ristaniemi. Higher-order Nonnegative CANDECOMP/PARAFAC Tensor Decomposition Using Proximal Algorithm [Internet]. IEEE SigPort; 2019. Available from : http://sigport.org/4408

Pages