2005
DOI: 10.1016/j.csl.2004.05.008
|View full text |Cite
|
Sign up to set email alerts
|

Evaluation of BIC-based algorithms for audio segmentation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
30
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 36 publications
(30 citation statements)
references
References 12 publications
0
30
0
Order By: Relevance
“…The window repeatedly grows by N g samples until a change point is detected or its size exceeds a pre-defined upper bound N max . Here, the upper bound ensures the search efficiency [15], [13]. If a change point is detected during the window growing step, the detection process restarts at that change point with an analysis window of N ini samples.…”
Section: ) Model Selection and Bic: Given A Data Setmentioning
confidence: 99%
See 4 more Smart Citations
“…The window repeatedly grows by N g samples until a change point is detected or its size exceeds a pre-defined upper bound N max . Here, the upper bound ensures the search efficiency [15], [13]. If a change point is detected during the window growing step, the detection process restarts at that change point with an analysis window of N ini samples.…”
Section: ) Model Selection and Bic: Given A Data Setmentioning
confidence: 99%
“…whereμ,μ X , andμ Y are, respectively, the sample mean vectors of Z, X , and Y;Σ,Σ X , andΣ Y are, respectively, the sample covariance matrices of Z, X , and Y; and d is the dimension of the feature vector [13]. The larger the value of ∆BIC, the less similar the two segments will be; thus, the larger the distance between the two segments will be.…”
Section: ) Model Selection and Bic: Given A Data Setmentioning
confidence: 99%
See 3 more Smart Citations