|| || || || || ||

---

ProjectLLC

void Impala::Core::Feature::InterestPointFeature::ProjectLLC ( CodebookVectors &  codebookVectors, String  codebookMode, Mat *  matrixDescriptors, int  imageWidth, int  imageHeight, std::vector< int > &  X, std::vector< int > &  Y, std::vector< Real64 > &  regionCounts, Util::IOBuffer *  dumpIndices = 0   ) [inline, private] Definition at line 647 of file InterestPointFeature.h. References Impala::Core::Array::Add(), Impala::Core::Array::C, Impala::Core::Table::TableTem< Col1T, Col2T, Col3T, Col4T, Col5T, Col6T, Col7T, Col8T, Col9T >::GetColumn2(), Impala::CmdOptions::GetInstance(), Impala::CmdOptions::GetInt(), ILOG_DEBUG, ILOG_INFO, Impala::Core::Matrix::MatE(), Impala::Core::Matrix::MatInverse(), Impala::Core::Matrix::MatMul(), Impala::Core::Matrix::MatNorm2DistTransposed(), Impala::Core::Matrix::MatNrCol(), Impala::Core::Matrix::MatNrRow(), Impala::Core::Matrix::MatTrace(), Impala::Core::Matrix::MatTranspose(), Impala::Max(), mCodebook, mDescriptorReduce, Impala::Min(), mPointSelector, Impala::Core::Array::MulVal(), Impala::Core::Array::SetVal(), Impala::Core::Table::Table::Size(), Impala::Timer::SplitTimeStr(), Impala::StringSplit(), and Impala::Core::Array::WriteRaw(). Referenced by ProjectOntoCodebook(). { using namespace Matrix; Timer timerProjection; if(mDescriptorReduce) { matrixDescriptors = MatMul(matrixDescriptors, mDescriptorReduce); } Mat* matrixCodebook = mCodebook->GetColumn2()->GetStorage(); ILOG_DEBUG(MatNrRow(matrixDescriptors) << " " << MatNrCol(matrixDescriptors)); ILOG_DEBUG(MatNrRow(matrixCodebook) << " " << MatNrCol(matrixCodebook)); ILOG_DEBUG("Codebook projection (init) took: " << timerProjection.SplitTimeStr()); int knn = CmdOptions::GetInstance().GetInt("codebookSigma"); Real64 beta = 1e-4; int step = Min(Int64(10000), Int64(20000000 / mCodebook->Size())); Mat* II = MatEye<Mat>(knn); MulVal(II, II, beta); Mat* onesVector = MatCreate<Mat>(knn, 1); SetVal(onesVector, 1.0); Mat* dumpedIndices = 0; if(dumpIndices) { dumpedIndices = MatCreate<Mat>(MatNrRow(matrixDescriptors), 2*knn+2); } String config = codebookMode; String absolute = StringSplit(config, '-'); String aggregationMode = StringSplit(config, '-'); String normMode = StringSplit(config, '-'); ILOG_INFO("absolute=" << absolute << "; aggregationMode=" << aggregationMode << "; normMode=" << normMode); for(int kkk = 0; kkk < MatNrRow(matrixDescriptors); kkk += step) { int s = MatNrRow(matrixDescriptors) - kkk; if(step < s) s = step; Mat* partial = MatCreate<Mat>(s, MatNrCol(matrixDescriptors), MatE(matrixDescriptors, kkk, 0), true); // result will be a (#partial-descriptors, codebook size) matrix Mat* distances = MatNorm2DistTransposed(partial, matrixCodebook); ILOG_DEBUG("Euclidean distance matrix took: " << timerProjection.SplitTimeStr()); std::vector<std::pair<Real64, int> > distancesAndIndices; // find k closest codebook elements for(int vj = 0; vj < s; vj++) { distancesAndIndices.clear(); distancesAndIndices.reserve(mCodebook->Size()); for(int i = 0; i < mCodebook->Size(); i++) { distancesAndIndices.push_back( std::make_pair(*MatE(distances, vj, i), i)); } std::nth_element(distancesAndIndices.begin(), distancesAndIndices.begin() + knn, distancesAndIndices.end()); // the first k elements are now the k smallest // idx = indices[:, descriptorIdx] // z = codebook[idx, :] - // numpy.tile(descriptors[descriptorIdx, :], (knn, 1)) Mat* z = MatCreate<Mat>(knn, MatNrCol(matrixDescriptors)); for(int kk = 0; kk < knn; kk++) { int closestCodebookIndex = distancesAndIndices[kk].second; for(int i = 0; i < MatNrCol(matrixDescriptors); i++) { *MatE(z, kk, i) = *MatE(matrixCodebook, closestCodebookIndex, i) - *MatE(partial, vj, i); } } // C = numpy.dot(z, z.transpose()); Mat* zT = MatTranspose(z); Mat* C = MatMul(z, zT); delete z; delete zT; // C = C + II * beta * numpy.trace(C); Mat* tmp = 0; MulVal(tmp, II, MatTrace(C)); Add(C, C, tmp); delete tmp; Mat* invertedC = MatInverse(C); Mat* w = MatMul(invertedC, onesVector); delete invertedC; delete C; // should we take the absolute value of w ??? TODO Real64 total = 0.0; if(absolute == "llca") { for(int kk = 0; kk < knn; kk++) total += fabs(*MatE(w, kk, 0)); for(int kk = 0; kk < knn; kk++) { *MatE(w, kk, 0) = fabs(*MatE(w, kk, 0)) / total; } } else { for(int kk = 0; kk < knn; kk++) total += *MatE(w, kk, 0); for(int kk = 0; kk < knn; kk++) { *MatE(w, kk, 0) = *MatE(w, kk, 0) / total; } } if(aggregationMode == "avg") { for(int ps = 0; ps < mPointSelector.size(); ps++) { if(mPointSelector[ps]->Accept(X[kkk+vj], Y[kkk+vj], imageWidth, imageHeight)) { for(int kk = 0; kk < knn; kk++) { int closestCodebookIndex = distancesAndIndices[kk].second; codebookVectors[ps]->Elem(closestCodebookIndex) = codebookVectors[ps]->Elem(closestCodebookIndex) + *MatE(w, kk, 0); } regionCounts[ps] = regionCounts[ps] + 1; } } } else if(aggregationMode == "max" || aggregationMode.empty()) { for(int ps = 0; ps < mPointSelector.size(); ps++) { if(mPointSelector[ps]->Accept(X[kkk+vj], Y[kkk+vj], imageWidth, imageHeight)) { for(int kk = 0; kk < knn; kk++) { int closestCodebookIndex = distancesAndIndices[kk].second; codebookVectors[ps]->Elem(closestCodebookIndex) = Max(codebookVectors[ps]->Elem(closestCodebookIndex), *MatE(w, kk, 0)); } regionCounts[ps] = 1; } } } // dump if(dumpIndices) { *MatE(dumpedIndices, kkk+vj, 0) = X[kkk+vj]; *MatE(dumpedIndices, kkk+vj, 1) = Y[kkk+vj]; for(int kk = 0; kk < knn; kk++) { int closestCodebookIndex = distancesAndIndices[kk].second; *MatE(dumpedIndices, kkk+vj, kk*2 + 2) = closestCodebookIndex; *MatE(dumpedIndices, kkk+vj, kk*2 + 3) = *MatE(w, kk, 0); } } delete w; } delete partial; delete distances; ILOG_DEBUG("Codebook projection (piece) took: " << timerProjection.SplitTimeStr() << " " << mPointSelector.size()); } delete II; delete onesVector; ILOG_INFO("Codebook projection (LLC/" << MatNrRow(matrixDescriptors) << ") took: " << timerProjection.SplitTimeStr()); if(mDescriptorReduce) { delete matrixDescriptors; } if(normMode.empty()) { // for backward compatibility for(int ps = 0; ps < mPointSelector.size(); ps++) { regionCounts[ps] = 1; } } else if(normMode == "L2") { for(int ps = 0; ps < mPointSelector.size(); ps++) { Real64 tmp = 0.0; for(int i = 0; i < mCodebook->Size(); i++) { tmp += codebookVectors[ps]->Elem(i) * codebookVectors[ps]->Elem(i); } regionCounts[ps] = sqrt(tmp); } } else if(normMode == "L2a") { Real64 tmp = 0.0; for(int ps = 0; ps < mPointSelector.size(); ps++) { for(int i = 0; i < mCodebook->Size(); i++) { tmp += codebookVectors[ps]->Elem(i) * codebookVectors[ps]->Elem(i); } } for(int ps = 0; ps < mPointSelector.size(); ps++) regionCounts[ps] = sqrt(tmp); } else if(normMode == "L1") { for(int ps = 0; ps < mPointSelector.size(); ps++) { Real64 tmp = 0.0; for(int i = 0; i < mCodebook->Size(); i++) { tmp += codebookVectors[ps]->Elem(i); } regionCounts[ps] = tmp; } } else if(normMode == "L1a") { Real64 total = 0.0; for(int ps = 0; ps < mPointSelector.size(); ps++) { Real64 tmp = 0.0; for(int i = 0; i < mCodebook->Size(); i++) { tmp += codebookVectors[ps]->Elem(i); } regionCounts[ps] = tmp; total += tmp; } for(int ps = 0; ps < mPointSelector.size(); ps++) { regionCounts[ps] = total; } } if(dumpIndices) { WriteRaw(dumpedIndices, dumpIndices, 3); delete dumpedIndices; } } Here is the call graph for this function:

---