2012-12-06 15:07:35 +08:00
|
|
|
/*M///////////////////////////////////////////////////////////////////////////////////////
|
|
|
|
//
|
|
|
|
// IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
|
|
|
|
//
|
|
|
|
// By downloading, copying, installing or using the software you agree to this license.
|
|
|
|
// If you do not agree to this license, do not download, install,
|
|
|
|
// copy or use the software.
|
|
|
|
//
|
|
|
|
//
|
|
|
|
// License Agreement
|
|
|
|
// For Open Source Computer Vision Library
|
|
|
|
//
|
|
|
|
// Copyright (C) 2000-2008, Intel Corporation, all rights reserved.
|
|
|
|
// Copyright (C) 2008-2012, Willow Garage Inc., all rights reserved.
|
|
|
|
// Third party copyrights are property of their respective owners.
|
|
|
|
//
|
|
|
|
// Redistribution and use in source and binary forms, with or without modification,
|
|
|
|
// are permitted provided that the following conditions are met:
|
|
|
|
//
|
|
|
|
// * Redistribution's of source code must retain the above copyright notice,
|
|
|
|
// this list of conditions and the following disclaimer.
|
|
|
|
//
|
|
|
|
// * Redistribution's in binary form must reproduce the above copyright notice,
|
|
|
|
// this list of conditions and the following disclaimer in the documentation
|
|
|
|
// and/or other materials provided with the distribution.
|
|
|
|
//
|
|
|
|
// * The name of the copyright holders may not be used to endorse or promote products
|
|
|
|
// derived from this software without specific prior written permission.
|
|
|
|
//
|
|
|
|
// This software is provided by the copyright holders and contributors "as is" and
|
|
|
|
// any express or implied warranties, including, but not limited to, the implied
|
|
|
|
// warranties of merchantability and fitness for a particular purpose are disclaimed.
|
|
|
|
// In no event shall the Intel Corporation or contributors be liable for any direct,
|
|
|
|
// indirect, incidental, special, exemplary, or consequential damages
|
|
|
|
// (including, but not limited to, procurement of substitute goods or services;
|
|
|
|
// loss of use, data, or profits; or business interruption) however caused
|
|
|
|
// and on any theory of liability, whether in contract, strict liability,
|
|
|
|
// or tort (including negligence or otherwise) arising in any way out of
|
|
|
|
// the use of this software, even if advised of the possibility of such damage.
|
|
|
|
//
|
|
|
|
//M*/
|
|
|
|
|
2013-01-09 20:31:09 +08:00
|
|
|
#include <sft/fpool.hpp>
|
2012-12-06 16:19:35 +08:00
|
|
|
#include <sft/random.hpp>
|
2012-12-06 15:07:35 +08:00
|
|
|
|
2012-12-06 16:59:20 +08:00
|
|
|
#include <glob.h>
|
2012-12-12 18:20:42 +08:00
|
|
|
#include <queue>
|
|
|
|
|
2012-12-06 16:19:35 +08:00
|
|
|
// ========= FeaturePool ========= //
|
2013-01-09 18:29:14 +08:00
|
|
|
|
|
|
|
sft::ICFFeaturePool::ICFFeaturePool(cv::Size m, int n) : FeaturePool(), model(m), nfeatures(n)
|
2012-12-06 16:19:35 +08:00
|
|
|
{
|
|
|
|
CV_Assert(m != cv::Size() && n > 0);
|
|
|
|
fill(nfeatures);
|
|
|
|
}
|
|
|
|
|
2013-01-09 19:21:04 +08:00
|
|
|
void sft::ICFFeaturePool::preprocess(const Mat& frame, Mat& integrals) const
|
|
|
|
{
|
|
|
|
preprocessor.apply(frame, integrals);
|
|
|
|
}
|
|
|
|
|
2013-01-09 18:29:14 +08:00
|
|
|
float sft::ICFFeaturePool::apply(int fi, int si, const Mat& integrals) const
|
2012-12-06 20:36:35 +08:00
|
|
|
{
|
2012-12-07 17:17:55 +08:00
|
|
|
return pool[fi](integrals.row(si), model);
|
2012-12-06 20:36:35 +08:00
|
|
|
}
|
|
|
|
|
2013-01-09 18:29:14 +08:00
|
|
|
void sft::ICFFeaturePool::write( cv::FileStorage& fs, int index) const
|
2012-12-14 21:57:55 +08:00
|
|
|
{
|
|
|
|
CV_Assert((index > 0) && (index < (int)pool.size()));
|
|
|
|
fs << pool[index];
|
|
|
|
}
|
|
|
|
|
|
|
|
void sft::write(cv::FileStorage& fs, const string&, const ICF& f)
|
|
|
|
{
|
|
|
|
fs << "{" << "channel" << f.channel << "rect" << f.bb << "}";
|
|
|
|
}
|
|
|
|
|
2013-01-09 18:29:14 +08:00
|
|
|
sft::ICFFeaturePool::~ICFFeaturePool(){}
|
2012-12-06 16:19:35 +08:00
|
|
|
|
2013-01-09 18:29:14 +08:00
|
|
|
void sft::ICFFeaturePool::fill(int desired)
|
2012-12-06 16:19:35 +08:00
|
|
|
{
|
|
|
|
int mw = model.width;
|
|
|
|
int mh = model.height;
|
|
|
|
|
|
|
|
int maxPoolSize = (mw -1) * mw / 2 * (mh - 1) * mh / 2 * N_CHANNELS;
|
|
|
|
|
|
|
|
nfeatures = std::min(desired, maxPoolSize);
|
2012-12-07 21:55:58 +08:00
|
|
|
dprintf("Requeste feature pool %d max %d suggested %d\n", desired, maxPoolSize, nfeatures);
|
2012-12-06 16:19:35 +08:00
|
|
|
|
|
|
|
pool.reserve(nfeatures);
|
|
|
|
|
2012-12-12 02:42:13 +08:00
|
|
|
sft::Random::engine eng(8854342234L);
|
|
|
|
sft::Random::engine eng_ch(314152314L);
|
2012-12-06 16:19:35 +08:00
|
|
|
|
|
|
|
sft::Random::uniform chRand(0, N_CHANNELS - 1);
|
|
|
|
|
|
|
|
sft::Random::uniform xRand(0, model.width - 2);
|
|
|
|
sft::Random::uniform yRand(0, model.height - 2);
|
|
|
|
|
|
|
|
sft::Random::uniform wRand(1, model.width - 1);
|
|
|
|
sft::Random::uniform hRand(1, model.height - 1);
|
|
|
|
|
|
|
|
while (pool.size() < size_t(nfeatures))
|
|
|
|
{
|
|
|
|
int x = xRand(eng);
|
|
|
|
int y = yRand(eng);
|
|
|
|
|
|
|
|
int w = 1 + wRand(eng, model.width - x - 1);
|
|
|
|
int h = 1 + hRand(eng, model.height - y - 1);
|
|
|
|
|
|
|
|
CV_Assert(w > 0);
|
|
|
|
CV_Assert(h > 0);
|
|
|
|
|
|
|
|
CV_Assert(w + x < model.width);
|
|
|
|
CV_Assert(h + y < model.height);
|
|
|
|
|
|
|
|
int ch = chRand(eng_ch);
|
|
|
|
|
|
|
|
sft::ICF f(x, y, w, h, ch);
|
|
|
|
|
|
|
|
if (std::find(pool.begin(), pool.end(),f) == pool.end())
|
2012-12-07 21:55:58 +08:00
|
|
|
{
|
2012-12-06 16:19:35 +08:00
|
|
|
pool.push_back(f);
|
2012-12-07 21:55:58 +08:00
|
|
|
}
|
2012-12-06 16:19:35 +08:00
|
|
|
}
|
2012-12-06 16:59:20 +08:00
|
|
|
}
|
|
|
|
|
2012-12-07 21:55:58 +08:00
|
|
|
std::ostream& sft::operator<<(std::ostream& out, const sft::ICF& m)
|
|
|
|
{
|
|
|
|
out << m.channel << " " << m.bb;
|
|
|
|
return out;
|
|
|
|
}
|
|
|
|
|
2012-12-06 16:59:20 +08:00
|
|
|
// ============ Dataset ============ //
|
|
|
|
namespace {
|
|
|
|
using namespace sft;
|
|
|
|
|
|
|
|
string itoa(long i)
|
|
|
|
{
|
|
|
|
char s[65];
|
|
|
|
sprintf(s, "%ld", i);
|
|
|
|
return std::string(s);
|
|
|
|
}
|
|
|
|
|
|
|
|
void glob(const string& path, svector& ret)
|
|
|
|
{
|
|
|
|
glob_t glob_result;
|
|
|
|
glob(path.c_str(), GLOB_TILDE, 0, &glob_result);
|
|
|
|
|
|
|
|
ret.clear();
|
|
|
|
ret.reserve(glob_result.gl_pathc);
|
|
|
|
|
|
|
|
for(uint i = 0; i < glob_result.gl_pathc; ++i)
|
|
|
|
{
|
|
|
|
ret.push_back(std::string(glob_result.gl_pathv[i]));
|
2012-12-06 17:04:26 +08:00
|
|
|
dprintf("%s\n", ret[i].c_str());
|
2012-12-06 16:59:20 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
globfree(&glob_result);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// in the default case data folders should be alligned as following:
|
|
|
|
// 1. positives: <train or test path>/octave_<octave number>/pos/*.png
|
|
|
|
// 2. negatives: <train or test path>/octave_<octave number>/neg/*.png
|
2013-01-09 20:03:53 +08:00
|
|
|
ScaledDataset::ScaledDataset(const string& path, const int oct)
|
2012-12-06 16:59:20 +08:00
|
|
|
{
|
2012-12-06 17:04:26 +08:00
|
|
|
dprintf("%s\n", "get dataset file names...");
|
2012-12-06 16:59:20 +08:00
|
|
|
|
2012-12-06 17:04:26 +08:00
|
|
|
dprintf("%s\n", "Positives globbing...");
|
2012-12-06 16:59:20 +08:00
|
|
|
glob(path + "/pos/octave_" + itoa(oct) + "/*.png", pos);
|
|
|
|
|
2012-12-06 17:04:26 +08:00
|
|
|
dprintf("%s\n", "Negatives globbing...");
|
2012-12-06 16:59:20 +08:00
|
|
|
glob(path + "/neg/octave_" + itoa(oct) + "/*.png", neg);
|
|
|
|
|
|
|
|
// Check: files not empty
|
|
|
|
CV_Assert(pos.size() != size_t(0));
|
|
|
|
CV_Assert(neg.size() != size_t(0));
|
2013-01-09 19:21:04 +08:00
|
|
|
}
|
|
|
|
|
2013-01-09 20:03:53 +08:00
|
|
|
cv::Mat ScaledDataset::get(SampleType type, int idx) const
|
2013-01-09 19:21:04 +08:00
|
|
|
{
|
|
|
|
const std::string& src = (type == POSITIVE)? pos[idx]: neg[idx];
|
|
|
|
return cv::imread(src);
|
|
|
|
}
|
|
|
|
|
2013-01-09 20:03:53 +08:00
|
|
|
int ScaledDataset::available(SampleType type) const
|
2013-01-09 19:21:04 +08:00
|
|
|
{
|
|
|
|
return (int)((type == POSITIVE)? pos.size():neg.size());
|
2013-01-09 20:03:53 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
ScaledDataset::~ScaledDataset(){}
|