bibtype C - Conference Paper (international conference)
ARLID 0396464
utime 20240103203005.3
mtime 20131001235959.9
DOI 10.1007/978-3-642-40991-2_35
title (primary) (eng) Sparsity in Bayesian Blind Source Separation and Deconvolution
specification
page_count 16 s.
media_type P
serial
ARLID cav_un_epca*0396463
ISBN 978-3-642-40990-5
ISSN 0302-9743
title Machine Learning and Knowledge Discovery in Databases
part_title vol. 8189
page_num 548-563
publisher
place Berlin Heidelberg
name Springer
year 2013
keyword Blind Source Separation
keyword Deconvolution
keyword Sparsity
keyword Scintigraphy
author (primary)
ARLID cav_un_auth*0101207
name1 Šmídl
name2 Václav
full_dept (cz) Adaptivní systémy
full_dept (eng) Department of Adaptive Systems
department (cz) AS
department (eng) AS
institution UTIA-B
full_dept Department of Adaptive Systems
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
author
ARLID cav_un_auth*0267768
name1 Tichý
name2 Ondřej
full_dept (cz) Adaptivní systémy
full_dept Department of Adaptive Systems
department (cz) AS
department AS
institution UTIA-B
full_dept Department of Adaptive Systems
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
source
url http://library.utia.cas.cz/separaty/2013/AS/tichy-sparsity in bayesian blind source separation and deconvolution.pdf
cas_special
project
project_id GA13-29225S
agency GA ČR
ARLID cav_un_auth*0292734
abstract (eng) Blind source separation algorithms are based on various separation criteria. Differences in convolution kernels of the sources are common assumptions in audio and image processing. Since it is still an ill posed problem, any additional information is beneficial. In this contribution, we investigate the use of sparsity criteria for both the source signal and the convolution kernels. A probabilistic model of the problem is introduced and its Variational Bayesian solution derived. The sparsity of the solution is achieved by introduction of unknown variance of the prior on all elements of the convolution kernels and the mixing matrix. Properties of the model are analyzed on simulated data and compared with state of the art methods. Performance of the algorithm is demonstrated on the problem of decomposition of a sequence of medical data. Specifically, the assumption of sparseness is shown to suppress artifacts of unconstrained separation method.
action
ARLID cav_un_auth*0294334
name The European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECMLPKDD 2013)
place Praha
dates 24.09.2013-26.09.2013
country CZ
reportyear 2014
RIV BB
num_of_auth 2
presentation_type PR
permalink http://hdl.handle.net/11104/0224318
mrcbT16-q 100
mrcbT16-s 0.325
mrcbT16-y 16.75
mrcbT16-x 0.51
mrcbT16-4 Q2
mrcbT16-E Q3
arlyear 2013
mrcbU63 cav_un_epca*0396463 Machine Learning and Knowledge Discovery in Databases 978-3-642-40990-5 0302-9743 548 563 Berlin Heidelberg Springer 2013 Lecture Notes in Computer Science part II vol. 8189