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
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
|
// -*- 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
*/
/***************************************
*
* CInvertedFileChunk
*
****************************************
*
* modification history:
*
* HM 090399 created the documentation
*
****************************************
*
* compiler defines used:
* _CDocumentFrequencyListIsVector is the document frequency list a vector?
*
*
****************************************/
#include <cassert>
#include "FeatureExtraction/gift_features.h"
#include "libGIFTAcInvertedFile/include/CInvertedFileChunk.h"
#include <algorithm>
/***************************************
*
* addElement
*
****************************************
*
* modification history
*
*
*
****************************************/
void CInvertedFileChunk::addElement(TID inDocumentID,
double inDocumentFrequency){
//cout << "a" << flush;
insert(make_pair(inDocumentID,inDocumentFrequency));
};
/***************************************
*
* getCollectionFrequency - returns the percentage of documents which contain this one feature
*
****************************************
*
* modification history
*
*
*
****************************************/
double CInvertedFileChunk::getCollectionFrequency(size_t inSize)const{
return double(size())/inSize;
}
/***************************************
*
* writeBinary - writes the binary block for one feature into the file
*
****************************************
*
* modification history
*
*
*
****************************************/
bool CInvertedFileChunk::writeBinary(ostream& outStream,
TID inFeatureID,
size_t inSize)const{
bool lRetVal=true;
{
TID lFeatureID(inFeatureID);
lRetVal = lRetVal && outStream.write((char*)&lFeatureID,
sizeof(lFeatureID));
}
{
float lCollectionFrequency=(float(size())
/inSize);
if((lCollectionFrequency >1)
||
(lCollectionFrequency < 0)){
cout << "The collection frequency is: "
<< lCollectionFrequency
<< endl;
assert(!"collection frequency out of range");
}
lRetVal = lRetVal && outStream.write((char*)&lCollectionFrequency,
sizeof(lCollectionFrequency));
}
int lSize(size());
{
// writing this twice means: there is
// no space left in this list
lRetVal = lRetVal && outStream.write((char*)&lSize,
sizeof(lSize));
// writing this twice means: there is
// no space left in this list
lRetVal = lRetVal && outStream.write((char*)&lSize,
sizeof(lSize));
cout << "writing chunk of size " << lSize <<endl;
}
CDocumentFrequencyList lList(lSize);
#ifndef _CDocumentFrequencyListIsList
CDocumentFrequencyList::iterator j=lList.begin();
#endif
for(const_iterator i=begin();
i!=end();
i++){
#ifndef _CDocumentFrequencyListIsList
*(j++)=CDocumentFrequencyElement((*i).first,
(*i).second);
#else
lList.push_back(CDocumentFrequencyElement((*i).first,
(*i).second)
);
#endif
}
#ifdef _CDocumentFrequencyListIsArray
//lList.setEnd(j);// superfluous, because lList.begin()+lSize==j anyway
assert(j==lList.begin()+lSize);
#endif
#ifndef _CDocumentFrequencyListIsList
sort(lList.begin(),
lList.end(),
CSortByDocumentFrequency_DFE());
#else
lList.sort(CSortByDocumentFrequency_DFE());
#endif
for(CDocumentFrequencyList::const_iterator i=lList.begin();
i!=lList.end();
i++){
lRetVal=lRetVal && i->writeBinary(outStream);
}
return lRetVal;
}
|
