### 抄録

This paper presents an efficient algorithm to solve Lp-norm minimization problem for under-determined speech separation; that is, for the case that there are more sound sources than microphones. We employ an auxiliary function method in order to derive update rules under the assumption that the amplitude of each sound source follows generalized Gaussian distribution. Experiments reveal that our method solves the L1-norm minimization problem ten times faster than a general solver, and also solves Lp-norm minimization problem efficiently, especially when the parameter p is small; when p is not more than 0.7, it runs in real-time without loss of separation quality.

元の言語 | English |
---|---|

ホスト出版物のタイトル | Proceedings of the Annual Conference of the International Speech Communication Association, INTERSPEECH |

ページ | 1745-1748 |

ページ数 | 4 |

出版物ステータス | Published - 2011 |

外部発表 | Yes |

イベント | 12th Annual Conference of the International Speech Communication Association, INTERSPEECH 2011 - Florence, Italy 継続期間: 2011 8 27 → 2011 8 31 |

### Other

Other | 12th Annual Conference of the International Speech Communication Association, INTERSPEECH 2011 |
---|---|

国 | Italy |

市 | Florence |

期間 | 11/8/27 → 11/8/31 |

### Fingerprint

### ASJC Scopus subject areas

- Language and Linguistics
- Human-Computer Interaction
- Signal Processing
- Software
- Modelling and Simulation

### これを引用

*Proceedings of the Annual Conference of the International Speech Communication Association, INTERSPEECH*(pp. 1745-1748)

**Fast and simple iterative algorithm of Lp-norm minimization for under-determined speech separation.** / Hirasawa, Yasuharu; Yasuraoka, Naoki; Takahashi, Toru; Ogata, Tetsuya; Okuno, Hiroshi G.

研究成果: Conference contribution

*Proceedings of the Annual Conference of the International Speech Communication Association, INTERSPEECH.*pp. 1745-1748, 12th Annual Conference of the International Speech Communication Association, INTERSPEECH 2011, Florence, Italy, 11/8/27.

}

TY - GEN

T1 - Fast and simple iterative algorithm of Lp-norm minimization for under-determined speech separation

AU - Hirasawa, Yasuharu

AU - Yasuraoka, Naoki

AU - Takahashi, Toru

AU - Ogata, Tetsuya

AU - Okuno, Hiroshi G.

PY - 2011

Y1 - 2011

N2 - This paper presents an efficient algorithm to solve Lp-norm minimization problem for under-determined speech separation; that is, for the case that there are more sound sources than microphones. We employ an auxiliary function method in order to derive update rules under the assumption that the amplitude of each sound source follows generalized Gaussian distribution. Experiments reveal that our method solves the L1-norm minimization problem ten times faster than a general solver, and also solves Lp-norm minimization problem efficiently, especially when the parameter p is small; when p is not more than 0.7, it runs in real-time without loss of separation quality.

AB - This paper presents an efficient algorithm to solve Lp-norm minimization problem for under-determined speech separation; that is, for the case that there are more sound sources than microphones. We employ an auxiliary function method in order to derive update rules under the assumption that the amplitude of each sound source follows generalized Gaussian distribution. Experiments reveal that our method solves the L1-norm minimization problem ten times faster than a general solver, and also solves Lp-norm minimization problem efficiently, especially when the parameter p is small; when p is not more than 0.7, it runs in real-time without loss of separation quality.

KW - Auxiliary function method

KW - Lp-norm minimization

KW - Speech separation

KW - Under-determined condition

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

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

M3 - Conference contribution

AN - SCOPUS:84865796621

SP - 1745

EP - 1748

BT - Proceedings of the Annual Conference of the International Speech Communication Association, INTERSPEECH

ER -