All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Fast Reconstruction of Sparse Relative Impulse Responses via Second-Order Cone Programming

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24220%2F17%3A00004538" target="_blank" >RIV/46747885:24220/17:00004538 - isvavai.cz</a>

  • Result on the web

    <a href="https://asap.ite.tul.cz/wp-content/uploads/sites/3/2017/07/waspaa2017.pdf" target="_blank" >https://asap.ite.tul.cz/wp-content/uploads/sites/3/2017/07/waspaa2017.pdf</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/WASPAA.2017.8170056" target="_blank" >10.1109/WASPAA.2017.8170056</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Fast Reconstruction of Sparse Relative Impulse Responses via Second-Order Cone Programming

  • Original language description

    The paper addresses the estimation of the relative transfer function (RTF) using incomplete information. For example, an RTF estimate might be recognized as too inaccurate in a number of frequency bins. When these values are dropped, an incomplete RTF is obtained. The goal is then to reconstruct a complete RTF estimate, based on (1) the remaining values, and (2) the sparsity of the relative impulse response, which is the time-domain counter-part of the RTF. We propose two fast algorithms for the RTF reconstruction that solve a second-order cone program (SOCP), and show their advantages over the LASSO formulation previously proposed in the literature. Simulations with speech signals show that in terms of speed and accuracy, the proposed algorithms are comparable with the LASSO solution and considerably faster compared to the generic ECOS solver. The new algorithms are, moreover, easier to control through their parameters, which brings their improved stability when the number of reliable frequency bins is very low (less than 10%).

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA17-00902S" target="_blank" >GA17-00902S: Advanded Joint Blind Source Separation Methods</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2017

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    IEEE Workshop on Applications of Signal Processing to Audio and Acoustics

  • ISBN

    978-1-5386-1632-1

  • ISSN

  • e-ISSN

  • Number of pages

    5

  • Pages from-to

    364-368

  • Publisher name

    Institute of Electrical and Electronics Engineers Inc.

  • Place of publication

    New Paltz, NY, USA

  • Event location

    New Paltz, NY, USA

  • Event date

    Jan 1, 2017

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article