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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
|
// -*- mode: c++ -*-
/*
GIFT, a flexible content based image retrieval system.
Copyright (C) 1998, 1999, 2000, 2001, 2002, CUI University of Geneva
Copyright (C) 2003, 2004 Bayreuth University
2005 Bamberg University
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 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#include <functional>
#include <algorithm>
#include "libGIFTAcDistanceMatrix/include/CProbabilityCombiner.h"
CProbabilityCombiner::CProbabilityCombiner(){
setBelief();
mNumberOfElements=1;
};
void CProbabilityCombiner::setBelief(double inBelief){
mBelief=inBelief;
};
CProbabilityCombiner* CProbabilityCombiner::clone()const{
if(this)
return subClone();
else
return 0;
};
void CProbabilityCombiner::setNumberOfElements(int inNumberOfElements){
mNumberOfElements=inNumberOfElements;
};
double CProbabilityCombiner::operator()(double inFirst,double inSecond)const{
return
(perform(inFirst,
inSecond)*mBelief)+(1-mBelief)/mNumberOfElements;
};
CProbabilityCombiner* CPCMaximum::subClone()const{
return new CPCMaximum(*this);
};
double CPCMaximum::perform(double inFirst,double inSecond)const{
return max(inFirst,inSecond);
};
double CPCMinimum::perform(double inFirst,double inSecond)const{
return min(inFirst,inSecond);
};
CProbabilityCombiner* CPCMinimum::subClone()const{
return new CPCMinimum(*this);
};
double CPCProduct::perform(double inFirst,double inSecond)const{
return inFirst*inSecond;
};
CProbabilityCombiner* CPCProduct::subClone()const{
return new CPCProduct(*this);
};
double CPCDiscrete::perform(double inFirst,double inSecond)const{
if((inFirst*inSecond)>lThreshold){
return inFirst*inSecond;
}else{
return 0;
}
};
CProbabilityCombiner* CPCDiscrete::subClone()const{
return new CPCDiscrete(*this);
};
|
