Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005.
DOI: 10.1109/icassp.2005.1415160
|View full text |Cite
|
Sign up to set email alerts
|

Blind Change Detection for Audio Segmentation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0
1

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(12 citation statements)
references
References 4 publications
0
10
0
1
Order By: Relevance
“…In model-based approaches, Gaussian mixture models (GMM) [4], [5], Hidden Markov Models (HMM) [6], Bayesian [7], and Artificial Neural Networks (ANN) [8] have all been applied to the task of segmentation. Examples of an unsupervised audio segmentation approach can be found in [7] and [9]. These unsupervised approaches test the likelihood ratio between two hypotheses of change and no change for a given observation sequence.…”
Section: Related Workmentioning
confidence: 99%
“…In model-based approaches, Gaussian mixture models (GMM) [4], [5], Hidden Markov Models (HMM) [6], Bayesian [7], and Artificial Neural Networks (ANN) [8] have all been applied to the task of segmentation. Examples of an unsupervised audio segmentation approach can be found in [7] and [9]. These unsupervised approaches test the likelihood ratio between two hypotheses of change and no change for a given observation sequence.…”
Section: Related Workmentioning
confidence: 99%
“…More general audio segmentation frameworks employ kernel methods to compute the distance-based segmentation in a high-dimensional feature space [5], [6], and informationtheoretic methods based on entropy [7], or on test statistics such as the CUSUM algorithm [8], [9]. As discussed later, the traditional CUSUM approaches undergo approximations for parameter estimation, resulting in practical shortcomings when change points may occur rapidly such as in audio signals.…”
Section: A Backgroundmentioning
confidence: 99%
“…. , yn ≥ N ( 1, Δ1) Here parameters 0 = { 0, Δ0} are estimated from a few samples in the beginning of the observation sequence, and 1 = { 1, Δ1} from the end of the observation sequence [4]. Thus the models are only estimated once for a given observation sequence and are independent of the change point.…”
Section: Cumulative Summentioning
confidence: 99%
“…CUSUM is another segmentation algorithm used in a variety of change detection problems [4]. Under the assumption that each yi is drawn from an independent, identically distributed process, the CUSUM test has been shown to be optimal in minimizing the detection time for a given false alarm rate [7].…”
Section: Cumulative Summentioning
confidence: 99%
See 1 more Smart Citation