/*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) 2009-2010, 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*/ #include "precomp.hpp" #include #include #include #include using namespace cv; inline int smoothedSum(const Mat& sum, const KeyPoint& pt, int y, int x) { static const int HALF_KERNEL = BriefDescriptorExtractor::KERNEL_SIZE / 2; int img_y = (int)(pt.pt.y + 0.5) + y; int img_x = (int)(pt.pt.x + 0.5) + x; return sum.at(img_y + HALF_KERNEL + 1, img_x + HALF_KERNEL + 1) - sum.at(img_y + HALF_KERNEL + 1, img_x - HALF_KERNEL) - sum.at(img_y - HALF_KERNEL, img_x + HALF_KERNEL + 1) + sum.at(img_y - HALF_KERNEL, img_x - HALF_KERNEL); } void pixelTests16(const Mat& sum, const std::vector& keypoints, Mat& descriptors) { for (int i = 0; i < (int)keypoints.size(); ++i) { uchar* desc = descriptors.ptr(i); const KeyPoint& pt = keypoints[i]; #include "generated_16.i" } } void pixelTests32(const Mat& sum, const std::vector& keypoints, Mat& descriptors) { for (int i = 0; i < (int)keypoints.size(); ++i) { uchar* desc = descriptors.ptr(i); const KeyPoint& pt = keypoints[i]; #include "generated_32.i" } } void pixelTests64(const Mat& sum, const std::vector& keypoints, Mat& descriptors) { for (int i = 0; i < (int)keypoints.size(); ++i) { uchar* desc = descriptors.ptr(i); const KeyPoint& pt = keypoints[i]; #include "generated_64.i" } } namespace cv { BriefDescriptorExtractor::BriefDescriptorExtractor(int bytes) : bytes_(bytes), test_fn_(NULL) { switch (bytes) { case 16: test_fn_ = pixelTests16; break; case 32: test_fn_ = pixelTests32; break; case 64: test_fn_ = pixelTests64; break; default: CV_Error(CV_StsBadArg, "bytes must be 16, 32, or 64"); } } int BriefDescriptorExtractor::descriptorSize() const { return bytes_; } int BriefDescriptorExtractor::descriptorType() const { return CV_8UC1; } void BriefDescriptorExtractor::read( const FileNode& fn) { int descriptorSize = fn["descriptorSize"]; switch (descriptorSize) { case 16: test_fn_ = pixelTests16; break; case 32: test_fn_ = pixelTests32; break; case 64: test_fn_ = pixelTests64; break; default: CV_Error(CV_StsBadArg, "descriptorSize must be 16, 32, or 64"); } bytes_ = descriptorSize; } void BriefDescriptorExtractor::write( FileStorage& fs) const { fs << "descriptorSize" << bytes_; } void BriefDescriptorExtractor::computeImpl(const Mat& image, std::vector& keypoints, Mat& descriptors) const { // Construct integral image for fast smoothing (box filter) Mat sum; Mat grayImage = image; if( image.type() != CV_8U ) cvtColor( image, grayImage, CV_BGR2GRAY ); ///TODO allow the user to pass in a precomputed integral image //if(image.type() == CV_32S) // sum = image; //else integral( grayImage, sum, CV_32S); //Remove keypoints very close to the border KeyPointsFilter::runByImageBorder(keypoints, image.size(), PATCH_SIZE/2 + KERNEL_SIZE/2); descriptors = Mat::zeros((int)keypoints.size(), bytes_, CV_8U); test_fn_(sum, keypoints, descriptors); } } // namespace cv