Blind deconvolution with sparse priors on the deconvolution filters

Hyung Min Park, Jong-Hwan Lee, Sang Hoon Oh, Soo Young Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In performing blind deconvolution to remove reverberation from speech signal, most acoustic deconvolution filters need a great many number of taps, and acoustic environments are often time-varying. Therefore, deconvolution filter coefficients should find their desired values with limited data, but conventional methods need lots of data to converge the coefficients. In this paper, we use sparse priors on the acoustic deconvolution filters to speed up the convergence and obtain better performance. In order to derive a learning algorithm which includes priors on the deconvolution filters, we discuss that a deconvolution algorithm can be obtained by the joint probability density of observed signal and the algorithm includes prior information through the posterior probability density. Simulation results show that sparseness on the acoustic deconvolution filters can be successfully used for adaptation of the filters by improving convergence and performance.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages658-665
Number of pages8
Volume3889 LNCS
DOIs
Publication statusPublished - 2006 Jul 11
Externally publishedYes
Event6th International Conference on Independent Component Analysis and Blind Signal Separation, ICA 2006 - Charleston, SC, United States
Duration: 2006 Mar 52006 Mar 8

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3889 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other6th International Conference on Independent Component Analysis and Blind Signal Separation, ICA 2006
CountryUnited States
CityCharleston, SC
Period06/3/506/3/8

Fingerprint

Blind Deconvolution
Deconvolution
Acoustics
Filter
Probability Density
Speech Signal
Posterior Probability
Learning
Prior Information
Coefficient
Reverberation
Learning Algorithm
Time-varying
Speedup
Learning algorithms
Converge
Simulation

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Park, H. M., Lee, J-H., Oh, S. H., & Lee, S. Y. (2006). Blind deconvolution with sparse priors on the deconvolution filters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3889 LNCS, pp. 658-665). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3889 LNCS). https://doi.org/10.1007/11679363_82

Blind deconvolution with sparse priors on the deconvolution filters. / Park, Hyung Min; Lee, Jong-Hwan; Oh, Sang Hoon; Lee, Soo Young.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3889 LNCS 2006. p. 658-665 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3889 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Park, HM, Lee, J-H, Oh, SH & Lee, SY 2006, Blind deconvolution with sparse priors on the deconvolution filters. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3889 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3889 LNCS, pp. 658-665, 6th International Conference on Independent Component Analysis and Blind Signal Separation, ICA 2006, Charleston, SC, United States, 06/3/5. https://doi.org/10.1007/11679363_82
Park HM, Lee J-H, Oh SH, Lee SY. Blind deconvolution with sparse priors on the deconvolution filters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3889 LNCS. 2006. p. 658-665. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/11679363_82
Park, Hyung Min ; Lee, Jong-Hwan ; Oh, Sang Hoon ; Lee, Soo Young. / Blind deconvolution with sparse priors on the deconvolution filters. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3889 LNCS 2006. pp. 658-665 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{522db30929094bf89cc8f2e4f265a03b,
title = "Blind deconvolution with sparse priors on the deconvolution filters",
abstract = "In performing blind deconvolution to remove reverberation from speech signal, most acoustic deconvolution filters need a great many number of taps, and acoustic environments are often time-varying. Therefore, deconvolution filter coefficients should find their desired values with limited data, but conventional methods need lots of data to converge the coefficients. In this paper, we use sparse priors on the acoustic deconvolution filters to speed up the convergence and obtain better performance. In order to derive a learning algorithm which includes priors on the deconvolution filters, we discuss that a deconvolution algorithm can be obtained by the joint probability density of observed signal and the algorithm includes prior information through the posterior probability density. Simulation results show that sparseness on the acoustic deconvolution filters can be successfully used for adaptation of the filters by improving convergence and performance.",
author = "Park, {Hyung Min} and Jong-Hwan Lee and Oh, {Sang Hoon} and Lee, {Soo Young}",
year = "2006",
month = "7",
day = "11",
doi = "10.1007/11679363_82",
language = "English",
isbn = "3540326308",
volume = "3889 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "658--665",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Blind deconvolution with sparse priors on the deconvolution filters

AU - Park, Hyung Min

AU - Lee, Jong-Hwan

AU - Oh, Sang Hoon

AU - Lee, Soo Young

PY - 2006/7/11

Y1 - 2006/7/11

N2 - In performing blind deconvolution to remove reverberation from speech signal, most acoustic deconvolution filters need a great many number of taps, and acoustic environments are often time-varying. Therefore, deconvolution filter coefficients should find their desired values with limited data, but conventional methods need lots of data to converge the coefficients. In this paper, we use sparse priors on the acoustic deconvolution filters to speed up the convergence and obtain better performance. In order to derive a learning algorithm which includes priors on the deconvolution filters, we discuss that a deconvolution algorithm can be obtained by the joint probability density of observed signal and the algorithm includes prior information through the posterior probability density. Simulation results show that sparseness on the acoustic deconvolution filters can be successfully used for adaptation of the filters by improving convergence and performance.

AB - In performing blind deconvolution to remove reverberation from speech signal, most acoustic deconvolution filters need a great many number of taps, and acoustic environments are often time-varying. Therefore, deconvolution filter coefficients should find their desired values with limited data, but conventional methods need lots of data to converge the coefficients. In this paper, we use sparse priors on the acoustic deconvolution filters to speed up the convergence and obtain better performance. In order to derive a learning algorithm which includes priors on the deconvolution filters, we discuss that a deconvolution algorithm can be obtained by the joint probability density of observed signal and the algorithm includes prior information through the posterior probability density. Simulation results show that sparseness on the acoustic deconvolution filters can be successfully used for adaptation of the filters by improving convergence and performance.

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

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

U2 - 10.1007/11679363_82

DO - 10.1007/11679363_82

M3 - Conference contribution

SN - 3540326308

SN - 9783540326304

VL - 3889 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 658

EP - 665

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -