lbp Namespace Reference

Original code by philipp <bytefish[at]gmx[dot]de> More...

Functions
template<typename _Tp >
void	histogram_ (const cv::Mat &src, cv::Mat &hist, int numPatterns)
	Original code by philipp <bytefish[at]gmx[dot]de> More...
template<typename _Tp >
double	chi_square_ (const cv::Mat &histogram0, const cv::Mat &histogram1)
void	spatial_histogram (const cv::Mat &src, cv::Mat &spatialhist, int numPatterns, const cv::Size &window, int overlap=0)
void	spatial_histogram (const cv::Mat &src, cv::Mat &spatialhist, int numPatterns, int gridx=8, int gridy=8, int overlap=0)
void	histogram (const cv::Mat &src, cv::Mat &hist, int numPatterns)
double	chi_square (const cv::Mat &histogram0, const cv::Mat &histogram1)
cv::Mat	histogram (const cv::Mat &src, int numPatterns)
cv::Mat	spatial_histogram (const cv::Mat &src, int numPatterns, const cv::Size &window, int overlap=0)
cv::Mat	spatial_histogram (const cv::Mat &src, int numPatterns, int gridx=8, int gridy=8, int overlap=0)
template<typename _Tp >
void	OLBP_ (const cv::Mat &src, cv::Mat &dst)
	Original code by philipp <bytefish[at]gmx[dot]de> More...
template<typename _Tp >
void	ELBP_ (const cv::Mat &src, cv::Mat &dst, int radius=1, int neighbors=8)
template<typename _Tp >
void	VARLBP_ (const cv::Mat &src, cv::Mat &dst, int radius=1, int neighbors=8)
void	OLBP (const cv::Mat &src, cv::Mat &dst)
void	ELBP (const cv::Mat &src, cv::Mat &dst, int radius=1, int neighbors=8)
void	VARLBP (const cv::Mat &src, cv::Mat &dst, int radius=1, int neighbors=8)
cv::Mat	OLBP (const cv::Mat &src)
cv::Mat	ELBP (const cv::Mat &src, int radius=1, int neighbors=8)
cv::Mat	VARLBP (const cv::Mat &src, int radius=1, int neighbors=8)

Detailed Description

Original code by philipp <bytefish[at]gmx[dot]de>

Copyright

BSD, see LICENSE.

Function Documentation

histogram_()

template<typename _Tp >

void lbp::histogram_	(	const cv::Mat &	src,
		cv::Mat &	hist,
		int	numPatterns
	)

Original code by philipp <bytefish[at]gmx[dot]de>

Copyright

BSD, see LICENSE.

Definition at line 28 of file histogram.cpp.

                                                                   {
    hist = cv::Mat::zeros(1, numPatterns, CV_32SC1);
    for(int i = 0; i < src.rows; i++) {
        for(int j = 0; j < src.cols; j++) {
            int bin = src.at<_Tp>(i,j);
            hist.at<int>(0,bin) += 1;
        }
    }
}

OLBP_()

template<typename _Tp >

void lbp::OLBP_	(	const cv::Mat &	src,
		cv::Mat &	dst
	)

Original code by philipp <bytefish[at]gmx[dot]de>

Copyright

BSD, see LICENSE.

Definition at line 27 of file lbp.cpp.

                                            {
    
    dst = cv::Mat::zeros(src.rows-2, src.cols-2, CV_8UC1);
    for(int i=1;i<src.rows-1;i++) {
        for(int j=1;j<src.cols-1;j++) {
            _Tp center = src.at<_Tp>(i,j);
            unsigned char code = 0;
            code |= (src.at<_Tp>(i-1,j-1) > center) << 7;
            code |= (src.at<_Tp>(i-1,j) > center) << 6;
            code |= (src.at<_Tp>(i-1,j+1) > center) << 5;
            code |= (src.at<_Tp>(i,j+1) > center) << 4;
            code |= (src.at<_Tp>(i+1,j+1) > center) << 3;
            code |= (src.at<_Tp>(i+1,j) > center) << 2;
            code |= (src.at<_Tp>(i+1,j-1) > center) << 1;
            code |= (src.at<_Tp>(i,j-1) > center) << 0;
            dst.at<unsigned char>(i-1,j-1) = code;
        }
    }
}

VARLBP_()

template<typename _Tp >

void lbp::VARLBP_	(	const cv::Mat &	src,
		cv::Mat &	dst,
		int	radius = 1,
		int	neighbors = 8
	)

result

Definition at line 83 of file lbp.cpp.

                                                                         {
    
    std::max(std::min(neighbors,31),1); // set bounds
    dst = cv::Mat::zeros(src.rows-2*radius, src.cols-2*radius, CV_32FC1); 
    // allocate some memory for temporary on-line variance calculations
    cv::Mat _mean = cv::Mat::zeros(src.rows, src.cols, CV_32FC1);
    cv::Mat _delta = cv::Mat::zeros(src.rows, src.cols, CV_32FC1);
    cv::Mat _m2 = cv::Mat::zeros(src.rows, src.cols, CV_32FC1);
    for(int n=0; n<neighbors; n++) {
        // sample points
        float x = static_cast<float>(radius) * cos(2.0*M_PI*n/static_cast<float>(neighbors));
        float y = static_cast<float>(radius) * -sin(2.0*M_PI*n/static_cast<float>(neighbors));
        // relative indices
        int fx = static_cast<int>(floor(x));
        int fy = static_cast<int>(floor(y));
        int cx = static_cast<int>(ceil(x));
        int cy = static_cast<int>(ceil(y));
        // fractional part
        float ty = y - fy;
        float tx = x - fx;
        // set interpolation weights
        float w1 = (1 - tx) * (1 - ty);
        float w2 =      tx  * (1 - ty);
        float w3 = (1 - tx) *      ty;
        float w4 =      tx  *      ty;
        // iterate through your data
        for(int i=radius; i < src.rows-radius;i++) {
            for(int j=radius;j < src.cols-radius;j++) {
                float t = w1*src.at<_Tp>(i+fy,j+fx) + w2*src.at<_Tp>(i+fy,j+cx) + w3*src.at<_Tp>(i+cy,j+fx) + w4*src.at<_Tp>(i+cy,j+cx);
                _delta.at<float>(i,j) = t - _mean.at<float>(i,j);
                _mean.at<float>(i,j) = (_mean.at<float>(i,j) + (_delta.at<float>(i,j) / (1.0*(n+1)))); // i am a bit paranoid
                _m2.at<float>(i,j) = _m2.at<float>(i,j) + _delta.at<float>(i,j) * (t - _mean.at<float>(i,j));
            }
        }
    }
    // calculate result
    for(int i = radius; i < src.rows-radius; i++) {
        for(int j = radius; j < src.cols-radius; j++) {
            dst.at<float>(i-radius, j-radius) = _m2.at<float>(i,j) / (1.0*(neighbors-1));
        }
    }
}