#include <SimilarityTableSet.h>
Collaboration diagram for Impala::Core::Table::SimilarityTableSet:
Public Types | |
typedef TableTem< Column::ColumnTem< Real64 > > | SimTableType |
typedef TableTem< Column::ColumnTem< Quid > > | RankTableType |
Public Member Functions | |
SimilarityTableSet (std::vector< String > names, int tableSize) | |
virtual | ~SimilarityTableSet () |
String | GetDescription () |
void | SetDescription (String description) |
int | NrTables () const |
int | TableSize () const |
std::vector< String > | GetNames () |
String | GetName (int id) const |
int | GetIndex (String name) |
void | Rename (int id, String name) |
int | GetQuidClass () const |
QuidTable * | GetQuidTable () const |
int | FindQuid (Quid quid) |
void | ChangeQuidObject (int newObject) |
SimTableType * | GetSimTable (int id) const |
void | SetSimTable (int id, ScoreTable *scores) |
SimTableType * | GetSimTable (String name) const |
RankTableType * | GetRankTable (int id) const |
RankTableType * | GetRankTable (String name) const |
void | ComputeRank (int tableIdx, bool descending) |
void | ComputeRanks (bool descending) |
void | ComputeRanksTopN (int topN, bool descending) |
void | Append (SimilarityTableSet *simSet) |
int | Diff (SimilarityTableSet *arg, bool doDiffRank=false) const |
void | Load (CString fileBase, Util::Database *db) |
void | LoadQuids (CString fileBase, Util::Database *db) |
void | LoadSim (size_t tableIdx, CString fileBase, Util::Database *db) |
void | LoadSims (CString fileBase, Util::Database *db) |
void | LoadRank (size_t tableIdx, CString fileBase, Util::Database *db) |
void | LoadRanks (CString fileBase, Util::Database *db) |
void | Save (int tableIdx, CString fileBase, Util::Database *db, bool binary) |
void | Save (Database::RawDataSet *dataSet, CString conceptSet, CString model, CString feature, bool binary) |
void | Save (Database::RawDataSet *dataSet, String walkType, String conceptSet, CString model, CString feature, int fileOrDirId, bool binary) |
void | Save (Database::PathCreator *pathCreator, bool binary=true) |
void | Save (CString fileBase, Util::Database *db, bool binary) |
void | SaveNames (CString fileBase, Util::Database *db) |
void | SaveQuids (CString fileBase, Util::Database *db, bool binary) |
void | SaveSim (size_t tableIdx, CString fileBase, Util::Database *db, bool binary) |
void | SaveSims (CString fileBase, Util::Database *db, bool binary) |
void | SaveRank (size_t tableIdx, CString fileBase, Util::Database *db, bool binary) |
void | SaveRanks (CString fileBase, Util::Database *db, bool binary) |
void | Dump (bool doTable) |
void | DumpRanking (int from=0, int to=-1) |
virtual void | DumpRanking (Database::RawDataSet *set, int from=0, int to=-1) |
Static Public Member Functions | |
static SimilarityTableSet * | MakeFromFile (VideoSet::VideoSet *videoSet, String conceptSet, String model, String feature) |
static SimilarityTableSet * | MakeFromFile (Database::RawDataSet *dataSet, String walkType, String conceptSet, String model, String featureString, int fileOrDirId) |
static SimilarityTableSet * | MakeFromFile (ImageSet::ImageSet *is, String conceptSet, String model, String featureString) |
static SimilarityTableSet * | MakeFromFile (String path, Util::Database *db) |
static bool | Exists (Database::RawDataSet *dataSet, String walkType, String conceptSet, String model, String featureString, int fileId) |
static bool | Exists (Database::PathCreator *pathCreator) |
Private Attributes | |
String | mDescription |
QuidTable * | mQuids |
std::vector< String > | mNames |
std::vector< SimTableType * > | mSims |
std::vector< RankTableType * > | mRanks |
ILOG_VAR_DEC |
So, we have one table with quids and for each name a tuple of a name, a table with similarity values for each quid, and a table with quids ranked according to the similarity values (quid with the highest/lowest similarity is at position 0 of this table).
Definition at line 37 of file SimilarityTableSet.h.