-
-
Notifications
You must be signed in to change notification settings - Fork 1k
/
FFDiag.h
82 lines (71 loc) · 2.23 KB
/
FFDiag.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
/*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 3 of the License, or
* (at your option) any later version.
*
* Written (W) 2013 Kevin Hughes
*
* Thanks to Andreas Ziehe and Cedric Gouy-Pailler
*/
#ifndef FFDIAG_H_
#define FFDIAG_H_
#include <shogun/lib/config.h>
#ifdef HAVE_EIGEN3
#include <shogun/mathematics/ajd/ApproxJointDiagonalizer.h>
#include <shogun/mathematics/Math.h>
namespace shogun
{
/** @brief Class FFDiag
*
* An Approximate Joint Diagonalizer (AJD) Implementation
*
* Ziehe, A., Laskov, P., Nolte, G., & Mueller, K. R. (2004).
* A fast algorithm for joint diagonalization with non-orthogonal transformations
* and its application to blind source separation.
* The Journal of Machine Learning Research, 5, 777-800.
*
*/
class CFFDiag : public CApproxJointDiagonalizer
{
public:
/** constructor */
CFFDiag()
{
};
/** destructor */
virtual ~CFFDiag()
{
}
/** Computes the matrix V that best diagonalizes C
* @param C the set of matrices to be diagonalized
* @param V0 an estimate of the matrix V
* @param eps machine epsilon or desired epsilon
* @param itermax maximum number of iterations
* @return V the matrix that best diagonalizes C
*/
static SGMatrix<float64_t> diagonalize(SGNDArray<float64_t> &C,
SGMatrix<float64_t> V0= SGMatrix<float64_t>(NULL,0,0),
double eps=CMath::MACHINE_EPSILON,
int itermax=200);
/** Computes the matrix V that best diagonalizes C
* @param C the set of matrices to be diagonalized
* @param V0 an estimate of the matrix V
* @param eps machine epsilon or desired epsilon
* @param itermax maximum number of iterations
* @return V the matrix that best diagonalizes C
*/
virtual SGMatrix<float64_t> compute(SGNDArray<float64_t> &C,
SGMatrix<float64_t> V0= SGMatrix<float64_t>(NULL,0,0),
double eps=CMath::MACHINE_EPSILON,
int itermax=200)
{
m_V = diagonalize(C,V0,eps,itermax);
return m_V;
}
/** @return object name */
virtual const char* get_name() const { return "FFDiag"; }
};
}
#endif //HAVE_EIGEN3
#endif //FFDIAG_H_