/usr/include/libGIFTAcInvertedFile/include/CComparisonResults.h is in libgnuift0-dev 0.1.14-12.1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /* -*- 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
*/
/***************************************
*
* CCOMPARISONRESULTS
*
****************************************
*
* modification history:
*
* HM 090399 created the documentation
*
****************************************
*
* compiler defines used:
*
*
****************************************/
#ifndef _CCOMPARISONRESULTS
#define _CCOMPARISONRESULTS
#include "libGIFTAcInvertedFile/include/uses-declarations.h"
#include <list>
#include <set>
#include "libMRML/include/CRelevanceLevel.h"
#include "libGIFTQuInvertedFile/include/CWeightingFunctionPointerHash.h"
#include "libGIFTAcInvertedFile/include/CDocumentFrequencyElement.h"
//#include "CBitVector.h"
class CIFQPicHunter;
class CRelevanceLevel;
class CDocumentFrequencyList;
/**
The general scheme of implementing a PicHunter like algorithm
in GIFT uses the following scheme:
If you want a suggestion of <em>n<\em> elements
get <em>2n<\em> elements. Call them the s_i.
For the same <em>dbSize/10 (or something)</em> elements (which we will
call the e_i) calculate the distance (s_i,d_j) for all i and j possible.
(Leading to something like 500 comparisons in our case).
For each s_i the delta_{ij} will be stored in a structure of the type
CComparisonResults
*/
class CComparisonResults{
///
typedef CIFQPicHunter lCContainerType;
///
CWeightingFunctionPointerHash mWeighters;
///
lCContainerType& mContainer;
///
typedef set<CDocumentFrequencyElement,CSortByID_DFE> lCScoreSet;
///
mutable lCScoreSet mScores;
///
CRelevanceLevel mQueryImage;
///
TID mID;
/**For giving non-temporary references back: I think this is a workaround,
but maybe also due to bad understanding*/
mutable CBitVector mReturnSet;
public:
/***************************************
*
*
*
***************************************/
///
CComparisonResults(lCContainerType& inContainer,
const CWeightingFunction& inPrototype,
TID inID,
const CRelevanceLevel& inQuery);
/***************************************
*
*
*
***************************************/
///
double calculateImageScore(TID inDID,
const CDocumentFrequencyList& inList)const;
/***************************************
*
*
*
***************************************/
///
double addImageScore(TID inDID,
const CDocumentFrequencyList& inList)const;
/***************************************
*
*
*
***************************************/
///
CBitVector compare(const CComparisonResults& inResults)const;
///
double getAsymmetry(const CComparisonResults& inResults)const;
///
CWeightingFunctionPointerHash& getWeighters();
///
void setRelevanceLevel(double);
///
TID getID()const;
///
CRelevanceLevel const& getQuery()const;
};
#endif
|