annotate dsp/segmentation/cluster_melt.h @ 289:befe5aa6b450
* Refactor FFT a little bit so as to separate construction and processing
rather than have a single static method -- will make it easier to use a
different implementation
* pull in KissFFT implementation (not hooked up yet)
| author |
Chris Cannam <c.cannam@qmul.ac.uk> |
| date |
Wed, 13 May 2009 09:19:12 +0000 |
| parents |
cdfd0948a852 |
| children |
e5907ae6de17 |
| rev |
line source |
|
c@243
|
1 #ifndef _CLUSTER_MELT_H
|
|
c@243
|
2 #define _CLUSTER_MELT_H
|
|
c@243
|
3 /*
|
|
c@243
|
4 * cluster_melt.h
|
|
c@243
|
5 * cluster_melt
|
|
c@243
|
6 *
|
|
c@243
|
7 * Created by Mark Levy on 21/02/2006.
|
|
c@243
|
8 * Copyright 2006 Centre for Digital Music, Queen Mary, University of London. All rights reserved.
|
|
c@243
|
9 *
|
|
c@243
|
10 */
|
|
c@243
|
11
|
|
c@243
|
12 #include <stdlib.h>
|
|
c@243
|
13 #include <math.h>
|
|
c@243
|
14
|
|
c@245
|
15 #ifdef __cplusplus
|
|
c@245
|
16 extern "C" {
|
|
c@245
|
17 #endif
|
|
c@245
|
18
|
|
c@243
|
19 void cluster_melt(double *h, /* normalised histograms, as a vector in row major order */
|
|
c@243
|
20 int m, /* number of dimensions (i.e. histogram bins) */
|
|
c@243
|
21 int n, /* number of histograms */
|
|
c@243
|
22 double *Bsched, /* inverse temperature schedule */
|
|
c@243
|
23 int t, /* length of schedule */
|
|
c@243
|
24 int k, /* number of clusters */
|
|
c@243
|
25 int l, /* neighbourhood limit (supply zero to use default value) */
|
|
c@243
|
26 int *c /* sequence of cluster assignments */
|
|
c@243
|
27 );
|
|
c@243
|
28
|
|
c@245
|
29 #ifdef __cplusplus
|
|
c@245
|
30 }
|
|
c@245
|
31 #endif
|
|
c@245
|
32
|
|
c@245
|
33 #endif
|
