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
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226 | /* ============================================================
*
* This file is a part of digiKam project
* https://www.digikam.org
*
* Date : 2003-01-17
* Description : Haar Database interface
*
* SPDX-FileCopyrightText: 2016-2018 by Mario Frank <mario dot frank at uni minus potsdam dot de>
* SPDX-FileCopyrightText: 2003 by Ricardo Niederberger Cabral <nieder at mail dot ru>
* SPDX-FileCopyrightText: 2009-2024 by Gilles Caulier <caulier dot gilles at gmail dot com>
* SPDX-FileCopyrightText: 2009-2013 by Marcel Wiesweg <marcel dot wiesweg at gmx dot de>
* SPDX-FileCopyrightText: 2009-2011 by Andi Clemens <andi dot clemens at gmail dot com>
*
* SPDX-License-Identifier: GPL-2.0-or-later
*
* ============================================================ */
#include "haariface_p.h"
namespace Digikam
{
void DatabaseBlob::read(const QByteArray& array, Haar::SignatureData& data)
{
QDataStream stream(array);
// check version
qint32 version;
stream >> version;
if (version != Version)
{
qCDebug(DIGIKAM_DATABASE_LOG) << "Unsupported binary version of Haar Blob in database";
return;
}
stream.setVersion(QDataStream::Qt_4_3);
// read averages
for (int i = 0 ; i < 3 ; ++i)
{
stream >> data.avg[i];
}
// read coefficients
for (int i = 0 ; i < 3 ; ++i)
{
for (int j = 0 ; j < Haar::NumberOfCoefficients ; ++j)
{
stream >> data.sig[i][j];
}
}
}
QByteArray DatabaseBlob::write(Haar::SignatureData& data)<--- Parameter 'data' can be declared as reference to const
{
QByteArray array;
array.reserve(sizeof(qint32) + 3*sizeof(double) + 3*sizeof(qint32)*Haar::NumberOfCoefficients);
QDataStream stream(&array, QIODevice::WriteOnly);
stream.setVersion(QDataStream::Qt_4_3);
// write version
stream << (qint32)Version;
// write averages
for (int i = 0 ; i < 3 ; ++i)
{
stream << data.avg[i];
}
// write coefficients
for (int i = 0 ; i < 3 ; ++i)
{
for (int j = 0 ; j < Haar::NumberOfCoefficients ; ++j)
{
stream << data.sig[i][j];
}
}
return array;
}
// -----------------------------------------------------------------------------------------------------
HaarIface::Private::Private()
: m_data(new Haar::ImageData)
{
}
void HaarIface::Private::rebuildSignatureCache(const QSet<qlonglong>& imageIds)
{
m_signatureCache.reset(new SignatureCache);
m_albumCache.reset(new AlbumCache);
// Variables for data read from DB
DatabaseBlob blob;
qlonglong imageid;
int albumid;
Haar::SignatureData targetSig;
// reference for easier access
SignatureCache& sigCache = *m_signatureCache;
AlbumCache& albCache = *m_albumCache;
DbEngineSqlQuery query = SimilarityDbAccess().backend()->prepareQuery(signatureQuery);
if (!SimilarityDbAccess().backend()->exec(query))
{
return;
}
QHash<qlonglong, QPair<int, int> > itemAlbumHash = CoreDbAccess().db()->getAllItemsWithAlbum();
// Remove all ids from the fully created itemAlbumHash that are not needed for the duplicates search.
// This is usually faster then starting a query for every single id in imageIds.
if (!imageIds.isEmpty())
{
for (auto it = itemAlbumHash.begin() ; it != itemAlbumHash.end() ; )
{
if (!imageIds.contains(it.key()))
{
it = itemAlbumHash.erase(it);
}
else
{
++it;
}
}
}
const bool filterByAlbumRoots = !m_albumRootsToSearch.isEmpty();
while (query.next())
{
imageid = query.value(0).toLongLong();
if (itemAlbumHash.contains(imageid))
{
// Pair storage of <albumroootid, albumid>
const QPair<int, int>& albumPair = itemAlbumHash.value(imageid);
if (filterByAlbumRoots)
{
if (!m_albumRootsToSearch.contains(albumPair.first))
{
continue;
}
}
blob.read(query.value(1).toByteArray(), targetSig);
albumid = albumPair.second;
sigCache[imageid] = targetSig;
albCache[imageid] = albumid;
}
}
}
bool HaarIface::Private::hasSignatureCache() const
{
return !(m_signatureCache.isNull() || m_signatureCache->isEmpty());
}
bool HaarIface::Private::retrieveSignatureFromCache(qlonglong imageId, Haar::SignatureData& data)
{
if (!hasSignatureCache())
{
return false;
}
if (m_signatureCache->contains(imageId))
{
data = m_signatureCache.data()->value(imageId);
return true;
}
return false;
}
void HaarIface::Private::setImageDataFromImage(const QImage& image)
{
m_data->fillPixelData(image);
}
void HaarIface::Private::setImageDataFromImage(const DImg& image)
{
m_data->fillPixelData(image);
}
SignatureCache* HaarIface::Private::signatureCache() const
{
return m_signatureCache.data();
}
AlbumCache* HaarIface::Private::albumCache() const
{
return m_albumCache.data();
}
Haar::ImageData* HaarIface::Private::imageData() const
{
return m_data.data();
}
void HaarIface::Private::setAlbumRootsToSearch(const QSet<int>& albumRootIds)
{
m_albumRootsToSearch = albumRootIds;
}
const QSet<int>& HaarIface::Private::albumRootsToSearch() const
{
return m_albumRootsToSearch;
}
} // namespace Digikam
|