思量许久，把这个版权属于自己的工作开源出来，耗4，5天写的一个基于多尺度ORB（orbslam2里面的orb）图像对齐，及金字塔多帧融合去噪的工作，配套PPT 源码 及实验图像。
适当修改应该够水一篇中文核心了，想发论文的同学请联系我qq:591883385 给我署名就好。
本作者保留此idea和源码的所有权，未经许可发论文有风险。
参考文献：
1，Ghost Removal in Exposure Fusion by Temporal Consistency Assessment
2，Reference-guided exposure fusion in dynamic scenes
3，Tom Mertens 的 Exposure Fusion
4，https://github.com/raulmur/ORB_SLAM2
依赖环境
opencv342 X64 Release版本 VS2019
opencv3 vs各版本下载地址： 链接: https://pan.baidu.com/s/1f5oAFqs-u15vkD5LNTcxtw 提取码: 2qj9
上面的百度网盘应该没有opencv版本 VS2019_release_X64_opencv342，可以加QQ群去群文件找:539308722
keywords：
金字塔融合 图像配准 多尺度ORB orb图像配准 去鬼影 图像融合 图像配齐 图像校正 orb特征的匹配 图像融合去鬼影 image fusion 多帧图像去噪 image alignment
工作内容ppt介绍：
四个文件的源码：
ORBextractor.h：
#ifndef ORBEXTRACTOR_H
#define ORBEXTRACTOR_H
#include <vector>
#include <list>
#include <opencv/cv.h>
namespace ORB_pyramid
{
class ExtractorNode
{
public:
ExtractorNode() :bNoMore(false) {}
void DivideNode(ExtractorNode& n1, ExtractorNode& n2, ExtractorNode& n3, ExtractorNode& n4);
std::vector<cv::KeyPoint> vKeys;
cv::Point2i UL, UR, BL, BR;
std::list<ExtractorNode>::iterator lit;
bool bNoMore;
};
class ORBextractor
{
public:
enum { HARRIS_SCORE = 0, FAST_SCORE = 1 };
ORBextractor(int nfeatures, float scaleFactor, int nlevels,
int iniThFAST, int minThFAST);
~ORBextractor() {}
// Compute the ORB features and descriptors on an image.
// ORB are dispersed on the image using an octree.
// Mask is ignored in the current implementation.
void operator()(cv::InputArray image, cv::InputArray mask,
std::vector<cv::KeyPoint>& keypoints,
cv::OutputArray descriptors);
int inline GetLevels() {
return nlevels;
}
float inline GetScaleFactor() {
return scaleFactor;
}
std::vector<float> inline GetScaleFactors() {
return mvScaleFactor;
}
std::vector<float> inline GetInverseScaleFactors() {
return mvInvScaleFactor;
}
std::vector<float> inline GetScaleSigmaSquares() {
return mvLevelSigma2;
}
std::vector<float> inline GetInverseScaleSigmaSquares() {
return mvInvLevelSigma2;
}
std::vector<cv::Mat> mvImagePyramid;
protected:
void ComputePyramid(cv::Mat image);
void ComputeKeyPointsOctTree(std::vector<std::vector<cv::KeyPoint> >& allKeypoints);
std::vector<cv::KeyPoint> DistributeOctTree(const std::vector<cv::KeyPoint>& vToDistributeKeys, const int& minX,
const int& maxX, const int& minY, const int& maxY, const int& nFeatures, const int& level);
void ComputeKeyPointsOld(std::vector<std::vector<cv::KeyPoint> >& allKeypoints);
std::vector<cv::Point> pattern;
int nfeatures;
double scaleFactor;
int nlevels;
int iniThFAST;
int minThFAST;
std::vector<int> mnFeaturesPerLevel;
std::vector<int> umax;
std::vector<float> mvScaleFactor;
std::vector<float> mvInvScaleFactor;
std::vector<float> mvLevelSigma2;
std::vector<float> mvInvLevelSigma2;
};
} //namespace ORB_pyramid
#endif
ORBextractor.cpp ：
#include <opencv2/core/core.hpp>
#include <opencv2/highgui/highgui.hpp>
#include <opencv2/features2d/features2d.hpp>
#include <opencv2/imgproc/imgproc.hpp>
#include <vector>
#include "ORBextractor.h"
using namespace cv;
using namespace std;
namespace ORB_pyramid
{
const int PATCH_SIZE = 31;
const int HALF_PATCH_SIZE = 15;
const int EDGE_THRESHOLD = 19;
static float IC_Angle(const Mat& image, Point2f pt, const vector<int>& u_max)
{
int m_01 = 0, m_10 = 0;
const uchar* center = &image.at<uchar>(cvRound(pt.y), cvRound(pt.x));
// Treat the center line differently, v=0
for (int u = -HALF_PATCH_SIZE; u <= HALF_PATCH_SIZE; ++u)
m_10 += u * center[u];
// Go line by line in the circuI853lar patch
int step = (int)image.step1();
for (int v = 1; v <= HALF_PATCH_SIZE; ++v)
{
// Proceed over the two lines
int v_sum = 0;
int d = u_max[v];
for (int u = -d; u <= d; ++u)
{
int val_plus = center[u + v * step], val_minus = center[u - v * step];
v_sum += (val_plus - val_minus);
m_10 += u * (val_plus + val_minus);
}
m_01 += v * v_sum;
}
return fastAtan2((float)m_01, (float)m_10);
}
const float factorPI = (float)(CV_PI / 180.f);
static void computeOrbDescriptor(const KeyPoint& kpt,
const Mat& img, const Point* pattern,
uchar* desc)
{
float angle = (float)kpt.angle * factorPI;
float a = (float)cos(angle), b = (float)sin(angle);
const uchar* center = &img.at<uchar>(cvRound(kpt.pt.y), cvRound(kpt.pt.x));
const int step = (int)img.step;
#define GET_VALUE(idx) center[cvRound(pattern[idx].x * b + pattern[idx].y * a) * step + cvRound(pattern[idx].x * a - pattern[idx].y * b)]
for (int i = 0; i < 32; ++i, pattern += 16)
{
int t0, t1, val;
t0 = GET_VALUE(0); t1 = GET_VALUE(1);
val = t0 < t1;
t0 = GET_VALUE(2); t1 = GET_VALUE(3);
val |= (t0 < t1) << 1;
t0 = GET_VALUE(4); t1 = GET_VALUE(5);
val |= (t0 < t1) << 2;
t0 = GET_VALUE(6); t1 = GET_VALUE(7);
val |= (t0 < t1) << 3;
t0 = GET_VALUE(8); t1 = GET_VALUE(9);
val |= (t0 < t1) << 4;
t0 = GET_VALUE(10); t1 = GET_VALUE(11);
val |= (t0 < t1) << 5;
t0 = GET_VALUE(12); t1 = GET_VALUE(13);
val |= (t0 < t1) << 6;
t0 = GET_VALUE(14); t1 = GET_VALUE(15);
val |= (t0 < t1) << 7;
desc[i] = (uchar)val;
}
#undef GET_VALUE
}
static int bit_pattern_31_[256 * 4] =
{
8,-3, 9,5,
4,2, 7,-12,
-11,9, -8,2,
7,-12, 12,-13,
2,-13, 2,12,
1,-7, 1,6,
-2,-10, -2,-4,
-13,-13, -11,-8,
-13,-3, -12,-9,
10,4, 11,9,
-13,-8, -8,-9,
-11,7, -9,12,
7,7, 12,6,
-4,-5, -3,0,
-13,2, -12,-3,
-9,0, -7,5,
12,-6, 12,-1,
-3,6, -2,12,
-6,-13, -4,-8,
11,-13, 12,-8,
4,7, 5,1,
5,-3, 10,-3,
3,-7, 6,12,
-8,-7, -6,-2,
-2,11, -1,-10,
-13,12, -8,10,
-7,3, -5,-3,
-4,2, -3,7,
-10,-12, -6,11,
5,-12, 6,-7,
5,-6, 7,-1,
1,0, 4,-5,
9,11, 11,-13,
4,7, 4,12,
2,-1, 4,4,
-4,-12, -2,7,
-8,-5, -7,-10,
4,11, 9,12,
0,-8, 1,-13,
-13,-2, -8,2,
-3,-2, -2,3,
-6,9, -4,-9,
8,12, 10,7,
0,9, 1,3,
7,-5, 11,-10,
-13,-6, -11,0,
10,7, 12,1,
-6,-3, -6,12,
10,-9, 12,-4,
-13,8, -8,-12,
-13,0, -8,-4,
3,3, 7,8,
5,7, 10,-7,
-1,7, 1,-12,
3,-10, 5,6,
2,-4, 3,-10,
-13,0, -13,5,
-13,-7, -12,12,
-13,3, -11,8,
-7,12, -4,7,
6,-10, 12,8,
-9,-1, -7,-6,
-2,-5, 0,12,
-12,5, -7,5,
3,-10, 8,-13,
-7,-7, -4,5,
-3,-2, -1,-7,
2,9, 5,-11,
-11,-13, -5,-13,
-1,6, 0,-1,
5,-3, 5,2,
-4,-13, -4,12,
-9,-6, -9,6,
-12,-10, -8,-4,
10,2, 12,-3,
7,12, 12,12,
-7,-13, -6,5,
-4,9, -3,4,
7,-1, 12,2,
-7,6, -5,1,
-13,11, -12,5,
-3,7, -2,-6,
7,-8, 12,-7,
-13,-7, -11,-12,
1,-3, 12,12,
2,-6, 3,0,
-4,3, -2,-13,
-1,-13, 1,9,
7,1, 8,-6,
1,-1, 3,12,
9,1, 12,6,
-1,-9, -1,3,
-13,-13, -10,5,
7,7, 10,12,
12,-5, 12,9,
6,3, 7,11,
5,-13, 6,10,
2,-12, 2,3,
3,8, 4,-6,
2,6, 12,-13,
9,-12, 10,3,
-8,4, -7,9,
-11,12, -4,-6,
1,12, 2,-8,
6,-9, 7,-4,
2,3, 3,-2,
6,3, 11,0,
3,-3, 8,-8,
7,8, 9,3,
-11,-5, -6,-4,
-10,11, -5,10,
-5,-8, -3,12,
-10,5, -9,0,
8,-1, 12,-6,
4,-6, 6,-11,
-10,12, -8,7,
4,-2, 6,7,
-2,0, -2,12,
-5,-8, -5,2,
7,-6, 10,12,
-9,-13, -8,-8,
-5,-13, -5,-2,
8,-8, 9,-13,
-9,-11, -9,0,
1,-8, 1,-2,
7,-4, 9,1,
-2,1, -1,-4,
11,-6, 12,-11,
-12,-9, -6,4,
3,7, 7,12,
5,5, 10,8,
0,-4, 2,8,
-9,12, -5,-13,
0,7, 2,12,
-1,2, 1,7,
5,11, 7,-9,
3,5, 6,-8,
-13,-4, -8,9,
-5,9, -3,-3,
-4,-7, -3,-12,
6,5, 8,0,
-7,6, -6,12,
-13,6, -5,-2,
1,-10, 3,10,
4,1, 8,-4,
-2,-2, 2,-13,
2,-12, 12,12,
-2,-13, 0,-6,
4,1, 9,3,
-6,-10, -3,-5,
-3,-13, -1,1,
7,5, 12,-11,
4,-2, 5,-7,
-13,9, -9,-5,
7,1, 8,6,
7,-8, 7,6,
-7,-4, -7,1,
-8,11, -7,-8,
-13,6, -12,-8,
2,4, 3,9,
10,-5, 12,3,
-6,-5, -6,7,
8,-3, 9,-8,
2,-12, 2,8,
-11,-2, -10,3,
-12,-13, -7,-9,
-11,0, -10,-5,
5,-3, 11,8,
-2,-13, -1,12,
-1,-8, 0,9,
-13,-11, -12,-5,
-10,-2, -10,11,
-3,9, -2,-13,
2,-3, 3,2,
-9,-13, -4,0,
-4,6, -3,-10,
-4,12, -2,-7,
-6,-11, -4,9,
6,-3, 6,11,
-13,11, -5,5,
11,11, 12,6,
7,-5, 12,-2,
-1,12, 0,7,
-4,-8, -3,-2,
-7,1, -6,7,
-13,-12, -8,-13,
-7,-2, -6,-8,
-8,5, -6,-9,
-5,-1, -4,5,
-13,7, -8,10,
1,5, 5,-13,
1,0, 10,-13,
9,12, 10,-1,
5,-8, 10,-9,
-1,11, 1,-13,
-9,-3, -6,2,
-1,-10, 1,12,
-13,1, -8,-10,
8,-11, 10,-6,
2,-13, 3,-6,
7,-13, 12,-9,
-10,-10, -5,-7,
-10,-8, -8,-13,
4,-6, 8,5,
3,12, 8,-13,
-4,2, -3,-3,
5,-13, 10,-12,
4,-13, 5,-1,
-9,9, -4,3,
0,3, 3,-9,
-12,1, -6,1,
3,2, 4,-8,
-10,-10, -10,9,
8,-13, 12,12,
-8,-12, -6,-5,
2,2, 3,7,
10,6, 11,-8,
6,8, 8,-12,
-7,10, -6,5,
-3,-9, -3,9,
-1,-13, -1,5,
-3,-7, -3,4,
-8,-2, -8,3,
4,2, 12,12,
2,-5, 3,11,
6,-9, 11,-13,
3,-1, 7,12,
11,-1, 12,4,
-3,0, -3,6,
4,-11, 4,12,
2,-4, 2,1,
-10,-6, -8,1,
-13,7, -11,1,
-13,12, -11,-13,
6,0, 11,-13,
0,-1, 1,4,
-13,3, -9,-2,
-9,8, -6,-3,
-13,-6, -8,-2,
5,-9, 8,10,
2,7, 3,-9,
-1,-6, -1,-1,
9,5, 11,-2,
11,-3, 12,-8,
3,0, 3,5,
-1,4, 0,10,
3,-6, 4,5,
-13,0, -10,5,
5,8, 12,11,
8,9, 9,-6,
7,-4, 8,-12,
-10,4, -10,9,
7,3, 12,4,
9,-7, 10,-2,
7,0, 12,-2,
-1,-6, 0,-11
};
ORBextractor::ORBextractor(int _nfeatures, float _scaleFactor, int _nlevels,
int _iniThFAST, int _minThFAST) :
nfeatures(_nfeatures), scaleFactor(_scaleFactor), nlevels(_nlevels),
iniThFAST(_iniThFAST), minThFAST(_minThFAST)
{
mvScaleFactor.resize(nlevels);
mvLevelSigma2.resize(nlevels);
mvScaleFactor[0] = 1.0f;
mvLevelSigma2[0] = 1.0f;
for (int i = 1; i < nlevels; i++)
{
mvScaleFactor[i] = mvScaleFactor[i - 1] * scaleFactor;
mvLevelSigma2[i] = mvScaleFactor[i] * mvScaleFactor[i];
}
mvInvScaleFactor.resize(nlevels);
mvInvLevelSigma2.resize(nlevels);
for (int i = 0; i < nlevels; i++)
{
mvInvScaleFactor[i] = 1.0f / mvScaleFactor[i];
mvInvLevelSigma2[i] = 1.0f / mvLevelSigma2[i];
}
mvImagePyramid.resize(nlevels);
mnFeaturesPerLevel.resize(nlevels);
float factor = 1.0f / scaleFactor;
float nDesiredFeaturesPerScale = nfeatures * (1 - factor) / (1 - (float)pow((double)factor, (double)nlevels));
int sumFeatures = 0;
for (int level = 0; level < nlevels - 1; level++)
{
mnFeaturesPerLevel[level] = cvRound(nDesiredFeaturesPerScale);
sumFeatures += mnFeaturesPerLevel[level];
nDesiredFeaturesPerScale *= factor;
}
mnFeaturesPerLevel[nlevels - 1] = std::max(nfeatures - sumFeatures, 0);
const int npoints = 512;
const Point* pattern0 = (const Point*)bit_pattern_31_;
std::copy(pattern0, pattern0 + npoints, std::back_inserter(pattern));
//This is for orientation
// pre-compute the end of a row in a circular patch
umax.resize(HALF_PATCH_SIZE + 1);
int v, v0, vmax = cvFloor(HALF_PATCH_SIZE * sqrt(2.f) / 2 + 1);
int vmin = cvCeil(HALF_PATCH_SIZE * sqrt(2.f) / 2);
const double hp2 = HALF_PATCH_SIZE * HALF_PATCH_SIZE;
for (v = 0; v <= vmax; ++v)
umax[v] = cvRound(sqrt(hp2 - v * v));
// Make sure we are symmetric
for (v = HALF_PATCH_SIZE, v0 = 0; v >= vmin; --v)
{
while (umax[v0] == umax[v0 + 1])
++v0;
umax[v] = v0;
++v0;
}
}
static void computeOrientation(const Mat& image, vector<KeyPoint>& keypoints, const vector<int>& umax)
{
for (vector<KeyPoint>::iterator keypoint = keypoints.begin(),
keypointEnd = keypoints.end(); keypoint != keypointEnd; ++keypoint)
{
keypoint->angle = IC_Angle(image, keypoint->pt, umax);
}
}
void ExtractorNode::DivideNode(ExtractorNode& n1, ExtractorNode& n2, ExtractorNode& n3, ExtractorNode& n4)
{
const int halfX = ceil(static_cast<float>(UR.x - UL.x) / 2);
const int halfY = ceil(static_cast<float>(BR.y - UL.y) / 2);
//Define boundaries of childs
n1.UL = UL;
n1.UR = cv::Point2i(UL.x + halfX, UL.y);
n1.BL = cv::Point2i(UL.x, UL.y + halfY);
n1.BR = cv::Point2i(UL.x + halfX, UL.y + halfY);
n1.vKeys.reserve(vKeys.size());
n2.UL = n1.UR;
n2.UR = UR;
n2.BL = n1.BR;
n2.BR = cv::Point2i(UR.x, UL.y + halfY);
n2.vKeys.reserve(vKeys.size());
n3.UL = n1.BL;
n3.UR = n1.BR;
n3.BL = BL;
n3.BR = cv::Point2i(n1.BR.x, BL.y);
n3.vKeys.reserve(vKeys.size());
n4.UL = n3.UR;
n4.UR = n2.BR;
n4.BL = n3.BR;
n4.BR = BR;
n4.vKeys.reserve(vKeys.size());
//Associate points to childs
for (size_t i = 0; i < vKeys.size(); i++)
{
const cv::KeyPoint& kp = vKeys[i];
if (kp.pt.x < n1.UR.x)
{
if (kp.pt.y < n1.BR.y)
n1.vKeys.push_back(kp);
else
n3.vKeys.push_back(kp);
}
else if (kp.pt.y < n1.BR.y)
n2.vKeys.push_back(kp);
else
n4.vKeys.push_back(kp);
}
if (n1.vKeys.size() == 1)
n1.bNoMore = true;
if (n2.vKeys.size() == 1)
n2.bNoMore = true;
if (n3.vKeys.size() == 1)
n3.bNoMore = true;
if (n4.vKeys.size() == 1)
n4.bNoMore = true;
}
vector<cv::KeyPoint> ORBextractor::DistributeOctTree(const vector<cv::KeyPoint>& vToDistributeKeys, const int& minX,
const int& maxX, const int& minY, const int& maxY, const int& N, const int& level)
{
// Compute how many initial nodes
const int nIni = round(static_cast<float>(maxX - minX) / (maxY - minY));
const float hX = static_cast<float>(maxX - minX) / nIni;
list<ExtractorNode> lNodes;
vector<ExtractorNode*> vpIniNodes;
vpIniNodes.resize(nIni);
for (int i = 0; i < nIni; i++)
{
ExtractorNode ni;
ni.UL = cv::Point2i(hX * static_cast<float>(i), 0);
ni.UR = cv::Point2i(hX * static_cast<float>(i + 1), 0);
ni.BL = cv::Point2i(ni.UL.x, maxY - minY);
ni.BR = cv::Point2i(ni.UR.x, maxY - minY);
ni.vKeys.reserve(vToDistributeKeys.size());
lNodes.push_back(ni);
vpIniNodes[i] = &lNodes.back();
}
//Associate points to childs
for (size_t i = 0; i < vToDistributeKeys.size(); i++)
{
const cv::KeyPoint& kp = vToDistributeKeys[i];
vpIniNodes[kp.pt.x / hX]->vKeys.push_back(kp);
}
list<ExtractorNode>::iterator lit = lNodes.begin();
while (lit != lNodes.end())
{
if (lit->vKeys.size() == 1)
{
lit->bNoMore = true;
lit++;
}
else if (lit->vKeys.empty())
lit = lNodes.erase(lit);
else
lit++;
}
bool bFinish = false;
int iteration = 0;
vector<pair<int, ExtractorNode*> > vSizeAndPointerToNode;
vSizeAndPointerToNode.reserve(lNodes.size() * 4);
while (!bFinish)
{
iteration++;
int prevSize = lNodes.size();
lit = lNodes.begin();
int nToExpand = 0;
vSizeAndPointerToNode.clear();
while (lit != lNodes.end())
{
if (lit->bNoMore)
{
// If node only contains one point do not subdivide and continue
lit++;
continue;
}
else
{
// If more than one point, subdivide
ExtractorNode n1, n2, n3, n4;
lit->DivideNode(n1, n2, n3, n4);
// Add childs if they contain points
if (n1.vKeys.size() > 0)
{
lNodes.push_front(n1);
if (n1.vKeys.size() > 1)
{
nToExpand++;
vSizeAndPointerToNode.push_back(make_pair(n1.vKeys.size(), &lNodes.front()));
lNodes.front().lit = lNodes.begin();
}
}
if (n2.vKeys.size() > 0)
{
lNodes.push_front(n2);
if (n2.vKeys.size() > 1)
{
nToExpand++;
vSizeAndPointerToNode.push_back(make_pair(n2.vKeys.size(), &lNodes.front()));
lNodes.front().lit = lNodes.begin();
}
}
if (n3.vKeys.size() > 0)
{
lNodes.push_front(n3);
if (n3.vKeys.size() > 1)
{
nToExpand++;
vSizeAndPointerToNode.push_back(make_pair(n3.vKeys.size(), &lNodes.front()));
lNodes.front().lit = lNodes.begin();
}
}
if (n4.vKeys.size() > 0)
{
lNodes.push_front(n4);
if (n4.vKeys.size() > 1)
{
nToExpand++;
vSizeAndPointerToNode.push_back(make_pair(n4.vKeys.size(), &lNodes.front()));
lNodes.front().lit = lNodes.begin();
}
}
lit = lNodes.erase(lit);
continue;
}
}
// Finish if there are more nodes than required features
// or all nodes contain just one point
if ((int)lNodes.size() >= N || (int)lNodes.size() == prevSize)
{
bFinish = true;
}
else if (((int)lNodes.size() + nToExpand * 3) > N)
{
while (!bFinish)
{
prevSize = lNodes.size();
vector<pair<int, ExtractorNode*> > vPrevSizeAndPointerToNode = vSizeAndPointerToNode;
vSizeAndPointerToNode.clear();
sort(vPrevSizeAndPointerToNode.begin(), vPrevSizeAndPointerToNode.end());
for (int j = vPrevSizeAndPointerToNode.size() - 1; j >= 0; j--)
{
ExtractorNode n1, n2, n3, n4;
vPrevSizeAndPointerToNode[j].second->DivideNode(n1, n2, n3, n4);
// Add childs if they contain points
if (n1.vKeys.size() > 0)
{
lNodes.push_front(n1);
if (n1.vKeys.size() > 1)
{
vSizeAndPointerToNode.push_back(make_pair(n1.vKeys.size(), &lNodes.front()));
lNodes.front().lit = lNodes.begin();
}
}
if (n2.vKeys.size() > 0)
{
lNodes.push_front(n2);
if (n2.vKeys.size() > 1)
{
vSizeAndPointerToNode.push_back(make_pair(n2.vKeys.size(), &lNodes.front()));
lNodes.front().lit = lNodes.begin();
}
}
if (n3.vKeys.size() > 0)
{
lNodes.push_front(n3);
if (n3.vKeys.size() > 1)
{
vSizeAndPointerToNode.push_back(make_pair(n3.vKeys.size(), &lNodes.front()));
lNodes.front().lit = lNodes.begin();
}
}
if (n4.vKeys.size() > 0)
{
lNodes.push_front(n4);
if (n4.vKeys.size() > 1)
{
vSizeAndPointerToNode.push_back(make_pair(n4.vKeys.size(), &lNodes.front()));
lNodes.front().lit = lNodes.begin();
}
}
lNodes.erase(vPrevSizeAndPointerToNode[j].second->lit);
if ((int)lNodes.size() >= N)
break;
}
if ((int)lNodes.size() >= N || (int)lNodes.size() == prevSize)
bFinish = true;
}
}
}
// Retain the best point in each node
vector<cv::KeyPoint> vResultKeys;
vResultKeys.reserve(nfeatures);
for (list<ExtractorNode>::iterator lit = lNodes.begin(); lit != lNodes.end(); lit++)
{
vector<cv::KeyPoint>& vNodeKeys = lit->vKeys;
cv::KeyPoint* pKP = &vNodeKeys[0];
float maxResponse = pKP->response;
for (size_t k = 1; k < vNodeKeys.size(); k++)
{
if (vNodeKeys[k].response > maxResponse)
{
pKP = &vNodeKeys[k];
maxResponse = vNodeKeys[k].response;
}
}
vResultKeys.push_back(*pKP);
}
return vResultKeys;
}
void ORBextractor::ComputeKeyPointsOctTree(vector<vector<KeyPoint> >& allKeypoints)
{
allKeypoints.resize(nlevels);
const float W = 30;
for (int level = 0; level < nlevels; ++level)
{
const int minBorderX = EDGE_THRESHOLD - 3;
const int minBorderY = minBorderX;
const int maxBorderX = mvImagePyramid[level].cols - EDGE_THRESHOLD + 3;
const int maxBorderY = mvImagePyramid[level].rows - EDGE_THRESHOLD + 3;
vector<cv::KeyPoint> vToDistributeKeys;
vToDistributeKeys.reserve(nfeatures * 10);
const float width = (maxBorderX - minBorderX);
const float height = (maxBorderY - minBorderY);
const int nCols = width / W;
const int nRows = height / W;
const int wCell = ceil(width / nCols);
const int hCell = ceil(height / nRows);
for (int i = 0; i < nRows; i++)
{
const float iniY = minBorderY + i * hCell;
float maxY = iniY + hCell + 6;
if (iniY >= maxBorderY - 3)
continue;
if (maxY > maxBorderY)
maxY = maxBorderY;
for (int j = 0; j < nCols; j++)
{
const float iniX = minBorderX + j * wCell;
float maxX = iniX + wCell + 6;
if (iniX >= maxBorderX - 6)
continue;
if (maxX > maxBorderX)
maxX = maxBorderX;
vector<cv::KeyPoint> vKeysCell;
FAST(mvImagePyramid[level].rowRange(iniY, maxY).colRange(iniX, maxX),
vKeysCell, iniThFAST, true);
if (vKeysCell.empty())
{
FAST(mvImagePyramid[level].rowRange(iniY, maxY).colRange(iniX, maxX),
vKeysCell, minThFAST, true);
}
if (!vKeysCell.empty())
{
for (vector<cv::KeyPoint>::iterator vit = vKeysCell.begin(); vit != vKeysCell.end(); vit++)
{
(*vit).pt.x += j * wCell;
(*vit).pt.y += i * hCell;
vToDistributeKeys.push_back(*vit);
}
}
}
}
vector<KeyPoint>& keypoints = allKeypoints[level];
keypoints.reserve(nfeatures);
keypoints = DistributeOctTree(vToDistributeKeys, minBorderX, maxBorderX,
minBorderY, maxBorderY, mnFeaturesPerLevel[level], level);
const int scaledPatchSize = PATCH_SIZE * mvScaleFactor[level];
// Add border to coordinates and scale information
const int nkps = keypoints.size();
for (int i = 0; i < nkps; i++)
{
keypoints[i].pt.x += minBorderX;
keypoints[i].pt.y += minBorderY;
keypoints[i].octave = level;
keypoints[i].size = scaledPatchSize;
}
}
// compute orientations
for (int level = 0; level < nlevels; ++level)
computeOrientation(mvImagePyramid[level], allKeypoints[level], umax);
}
void ORBextractor::ComputeKeyPointsOld(std::vector<std::vector<KeyPoint> >& allKeypoints)
{
allKeypoints.resize(nlevels);
float imageRatio = (float)mvImagePyramid[0].cols / mvImagePyramid[0].rows;
for (int level = 0; level < nlevels; ++level)
{
const int nDesiredFeatures = mnFeaturesPerLevel[level];
const int levelCols = sqrt((float)nDesiredFeatures / (5 * imageRatio));
const int levelRows = imageRatio * levelCols;
const int minBorderX = EDGE_THRESHOLD;
const int minBorderY = minBorderX;
const int maxBorderX = mvImagePyramid[level].cols - EDGE_THRESHOLD;
const int maxBorderY = mvImagePyramid[level].rows - EDGE_THRESHOLD;
const int W = maxBorderX - minBorderX;
const int H = maxBorderY - minBorderY;
const int cellW = ceil((float)W / levelCols);
const int cellH = ceil((float)H / levelRows);
const int nCells = levelRows * levelCols;
const int nfeaturesCell = ceil((float)nDesiredFeatures / nCells);
vector<vector<vector<KeyPoint> > > cellKeyPoints(levelRows, vector<vector<KeyPoint> >(levelCols));
vector<vector<int> > nToRetain(levelRows, vector<int>(levelCols, 0));
vector<vector<int> > nTotal(levelRows, vector<int>(levelCols, 0));
vector<vector<bool> > bNoMore(levelRows, vector<bool>(levelCols, false));
vector<int> iniXCol(levelCols);
vector<int> iniYRow(levelRows);
int nNoMore = 0;
int nToDistribute = 0;
float hY = cellH + 6;
for (int i = 0; i < levelRows; i++)
{
const float iniY = minBorderY + i * cellH - 3;
iniYRow[i] = iniY;
if (i == levelRows - 1)
{
hY = maxBorderY + 3 - iniY;
if (hY <= 0)
continue;
}
float hX = cellW + 6;
for (int j = 0; j < levelCols; j++)
{
float iniX;
if (i == 0)
{
iniX = minBorderX + j * cellW - 3;
iniXCol[j] = iniX;
}
else
{
iniX = iniXCol[j];
}
if (j == levelCols - 1)
{
hX = maxBorderX + 3 - iniX;
if (hX <= 0)
continue;
}
Mat cellImage = mvImagePyramid[level].rowRange(iniY, iniY + hY).colRange(iniX, iniX + hX);
cellKeyPoints[i][j].reserve(nfeaturesCell * 5);
FAST(cellImage, cellKeyPoints[i][j], iniThFAST, true);
if (cellKeyPoints[i][j].size() <= 3)
{
cellKeyPoints[i][j].clear();
FAST(cellImage, cellKeyPoints[i][j], minThFAST, true);
}
const int nKeys = cellKeyPoints[i][j].size();
nTotal[i][j] = nKeys;
if (nKeys > nfeaturesCell)
{
nToRetain[i][j] = nfeaturesCell;
bNoMore[i][j] = false;
}
else
{
nToRetain[i][j] = nKeys;
nToDistribute += nfeaturesCell - nKeys;
bNoMore[i][j] = true;
nNoMore++;
}
}
}
// Retain by score
while (nToDistribute > 0 && nNoMore < nCells)
{
int nNewFeaturesCell = nfeaturesCell + ceil((float)nToDistribute / (nCells - nNoMore));
nToDistribute = 0;
for (int i = 0; i < levelRows; i++)
{
for (int j = 0; j < levelCols; j++)
{
if (!bNoMore[i][j])
{
if (nTotal[i][j] > nNewFeaturesCell)
{
nToRetain[i][j] = nNewFeaturesCell;
bNoMore[i][j] = false;
}
else
{
nToRetain[i][j] = nTotal[i][j];
nToDistribute += nNewFeaturesCell - nTotal[i][j];
bNoMore[i][j] = true;
nNoMore++;
}
}
}
}
}
vector<KeyPoint>& keypoints = allKeypoints[level];
keypoints.reserve(nDesiredFeatures * 2);
const int scaledPatchSize = PATCH_SIZE * mvScaleFactor[level];
// Retain by score and transform coordinates
for (int i = 0; i < levelRows; i++)
{
for (int j = 0; j < levelCols; j++)
{
vector<KeyPoint>& keysCell = cellKeyPoints[i][j];
KeyPointsFilter::retainBest(keysCell, nToRetain[i][j]);
if ((int)keysCell.size() > nToRetain[i][j])
keysCell.resize(nToRetain[i][j]);
for (size_t k = 0, kend = keysCell.size(); k < kend; k++)
{
keysCell[k].pt.x += iniXCol[j];
keysCell[k].pt.y += iniYRow[i];
keysCell[k].octave = level;
keysCell[k].size = scaledPatchSize;
keypoints.push_back(keysCell[k]);
}
}
}
if ((int)keypoints.size() > nDesiredFeatures)
{
KeyPointsFilter::retainBest(keypoints, nDesiredFeatures);
keypoints.resize(nDesiredFeatures);
}
}
// and compute orientations
for (int level = 0; level < nlevels; ++level)
computeOrientation(mvImagePyramid[level], allKeypoints[level], umax);
}
static void computeDescriptors(const Mat& image, vector<KeyPoint>& keypoints, Mat& descriptors,
const vector<Point>& pattern)
{
descriptors = Mat::zeros((int)keypoints.size(), 32, CV_8UC1);
for (size_t i = 0; i < keypoints.size(); i++)
computeOrbDescriptor(keypoints[i], image, &pattern[0], descriptors.ptr((int)i));
}
void ORBextractor::operator()(InputArray _image, InputArray _mask, vector<KeyPoint>& _keypoints,
OutputArray _descriptors)
{
if (_image.empty())
return;
Mat image = _image.getMat();
assert(image.type() == CV_8UC1);
// Pre-compute the scale pyramid
ComputePyramid(image);
vector < vector<KeyPoint> > allKeypoints;
ComputeKeyPointsOctTree(allKeypoints);
//ComputeKeyPointsOld(allKeypoints);
Mat descriptors;
int nkeypoints = 0;
for (int level = 0; level < nlevels; ++level)
nkeypoints += (int)allKeypoints[level].size();
if (nkeypoints == 0)
_descriptors.release();
else
{
_descriptors.create(nkeypoints, 32, CV_8U);
descriptors = _descriptors.getMat();
}
_keypoints.clear();
_keypoints.reserve(nkeypoints);
int offset = 0;
for (int level = 0; level < nlevels; ++level)
{
vector<KeyPoint>& keypoints = allKeypoints[level];
int nkeypointsLevel = (int)keypoints.size();
if (nkeypointsLevel == 0)
continue;
// preprocess the resized image
Mat workingMat = mvImagePyramid[level].clone();
GaussianBlur(workingMat, workingMat, Size(7, 7), 2, 2, BORDER_REFLECT_101);
// Compute the descriptors
Mat desc = descriptors.rowRange(offset, offset + nkeypointsLevel);
computeDescriptors(workingMat, keypoints, desc, pattern);
offset += nkeypointsLevel;
// Scale keypoint coordinates
if (level != 0)
{
float scale = mvScaleFactor[level]; //getScale(level, firstLevel, scaleFactor);
for (vector<KeyPoint>::iterator keypoint = keypoints.begin(),
keypointEnd = keypoints.end(); keypoint != keypointEnd; ++keypoint)
keypoint->pt *= scale;
}
// And add the keypoints to the output
_keypoints.insert(_keypoints.end(), keypoints.begin(), keypoints.end());
}
}
void ORBextractor::ComputePyramid(cv::Mat image)
{
for (int level = 0; level < nlevels; ++level)
{
float scale = mvInvScaleFactor[level];
Size sz(cvRound((float)image.cols * scale), cvRound((float)image.rows * scale));
Size wholeSize(sz.width + EDGE_THRESHOLD * 2, sz.height + EDGE_THRESHOLD * 2);
Mat temp(wholeSize, image.type()), masktemp;
mvImagePyramid[level] = temp(Rect(EDGE_THRESHOLD, EDGE_THRESHOLD, sz.width, sz.height));
// Compute the resized image
if (level != 0)
{
resize(mvImagePyramid[level - 1], mvImagePyramid[level], sz, 0, 0, INTER_LINEAR);
copyMakeBorder(mvImagePyramid[level], temp, EDGE_THRESHOLD, EDGE_THRESHOLD, EDGE_THRESHOLD, EDGE_THRESHOLD,
BORDER_REFLECT_101 + BORDER_ISOLATED);
}
else
{
copyMakeBorder(image, temp, EDGE_THRESHOLD, EDGE_THRESHOLD, EDGE_THRESHOLD, EDGE_THRESHOLD,
BORDER_REFLECT_101);
}
}
}
} //namespace ORB_SLAM
LaplacianBlending.h
#ifndef _LAPLACIANBLENDING_H_
#define _LAPLACIANBLENDING_H_
#include<iostream>
#include<opencv2/core/core.hpp>
#include<opencv2/highgui/highgui.hpp>
#include<opencv2/imgproc.hpp>
using namespace cv;
using namespace std;
class LaplacianBlending {
private:
Mat_<Vec3f> under;
Mat_<Vec3f> mid;
Mat_<Vec3f> over;
Mat_<Vec3f> over4;
Mat_<Vec3f> over5;
Mat_<Vec3f> over6;//图像
Mat_<float> under_blendweight_;
Mat_<float> mid_blendweight_;
Mat_<float> over_blendweight_;
Mat_<float> over4_blendweight_;
Mat_<float> over5_blendweight_;
Mat_<float> over6_blendweight_;//6个图像对应的权重
vector<Mat_<Vec3f> > underLapPyr, midLapPyr, overLapPyr, over4LapPyr, over5LapPyr, over6LapPyr, resultLapPyr;//Laplacian 金字塔
Mat underHighestLevel, midHighestLevel, overHighestLevel, over4HighestLevel, over5HighestLevel, over6HighestLevel, resultHighestLevel;
vector<Mat_<Vec3f> > under_weight_GaussianPyramid, mid_weight_GaussianPyramid, over_weight_GaussianPyramid, over4_weight_GaussianPyramid, over5_weight_GaussianPyramid, over6_weight_GaussianPyramid; ; //weight_s are 3-channels for easier multiplication with RGB
int levels;
void buildPyramids() {
buildLaplacianPyramid(under, underLapPyr, underHighestLevel);
buildLaplacianPyramid(mid, midLapPyr, midHighestLevel);
buildLaplacianPyramid(over, overLapPyr, overHighestLevel);
buildLaplacianPyramid(over4, over4LapPyr, over4HighestLevel);
buildLaplacianPyramid(over5, over5LapPyr, over5HighestLevel);
buildLaplacianPyramid(over6, over6LapPyr, over5HighestLevel);
build_under_GaussianPyramid();
build_mid_GaussianPyramid();
build_over_GaussianPyramid();
build_over4_GaussianPyramid();
build_over5_GaussianPyramid();
build_over6_GaussianPyramid();
}
void build_under_GaussianPyramid() {//第一张图像的金字塔
assert(underLapPyr.size() > 0);
under_weight_GaussianPyramid.clear();
Mat currentImg;
cvtColor(under_blendweight_, currentImg, CV_GRAY2BGR);//权重金字塔
under_weight_GaussianPyramid.push_back(currentImg);
currentImg = under_blendweight_;
for (int l = 1; l < levels + 1; l++) {
Mat _down;
if (underLapPyr.size() > l)
pyrDown(currentImg, _down, underLapPyr[l].size());
else
pyrDown(currentImg, _down, underHighestLevel.size());
Mat down;
cvtColor(_down, down, CV_GRAY2BGR);
under_weight_GaussianPyramid.push_back(down);//权重
currentImg = _down;
}
}
void build_mid_GaussianPyramid() {
assert(underLapPyr.size() > 0);
mid_weight_GaussianPyramid.clear();
Mat currentImg;
cvtColor(mid_blendweight_, currentImg, CV_GRAY2BGR);
mid_weight_GaussianPyramid.push_back(currentImg);
currentImg = mid_blendweight_;
for (int l = 1; l < levels + 1; l++) {
Mat _down;
if (underLapPyr.size() > l)
pyrDown(currentImg, _down, underLapPyr[l].size());
else
pyrDown(currentImg, _down, underHighestLevel.size());
Mat down;
cvtColor(_down, down, CV_GRAY2BGR);
mid_weight_GaussianPyramid.push_back(down);
currentImg = _down;
}
}
void build_over_GaussianPyramid() {
assert(underLapPyr.size() > 0);
over_weight_GaussianPyramid.clear();
Mat currentImg;
cvtColor(over_blendweight_, currentImg, CV_GRAY2BGR);
over_weight_GaussianPyramid.push_back(currentImg);
currentImg = over_blendweight_;
for (int l = 1; l < levels + 1; l++) {
Mat _down;
if (underLapPyr.size() > l)
pyrDown(currentImg, _down, underLapPyr[l].size());
else
pyrDown(currentImg, _down, underHighestLevel.size());
Mat down;
cvtColor(_down, down, CV_GRAY2BGR);
over_weight_GaussianPyramid.push_back(down);//权重扩展至3通道在三通道加权
currentImg = _down;
}
}
//
void build_over4_GaussianPyramid() {
assert(underLapPyr.size() > 0);
over4_weight_GaussianPyramid.clear();
Mat currentImg;
cvtColor(over4_blendweight_, currentImg, CV_GRAY2BGR);
over4_weight_GaussianPyramid.push_back(currentImg);
currentImg = over4_blendweight_;
for (int l = 1; l < levels + 1; l++) {
Mat _down;
if (underLapPyr.size() > l)
pyrDown(currentImg, _down, underLapPyr[l].size());
else
pyrDown(currentImg, _down, underHighestLevel.size());
Mat down;
cvtColor(_down, down, CV_GRAY2BGR);
over4_weight_GaussianPyramid.push_back(down);
currentImg = _down;
}
}
//
void build_over5_GaussianPyramid() {
assert(underLapPyr.size() > 0);
over5_weight_GaussianPyramid.clear();
Mat currentImg;
cvtColor(over5_blendweight_, currentImg, CV_GRAY2BGR);
over5_weight_GaussianPyramid.push_back(currentImg);
currentImg = over5_blendweight_;
for (int l = 1; l < levels + 1; l++) {
Mat _down;
if (underLapPyr.size() > l)
pyrDown(currentImg, _down, underLapPyr[l].size());
else
pyrDown(currentImg, _down, underHighestLevel.size());
Mat down;
cvtColor(_down, down, CV_GRAY2BGR);
over5_weight_GaussianPyramid.push_back(down);
currentImg = _down;
}
}
void build_over6_GaussianPyramid() {
assert(underLapPyr.size() > 0);
over6_weight_GaussianPyramid.clear();
Mat currentImg;
cvtColor(over6_blendweight_, currentImg, CV_GRAY2BGR);
over6_weight_GaussianPyramid.push_back(currentImg);
currentImg = over6_blendweight_;
for (int l = 1; l < levels + 1; l++) {
Mat _down;
if (underLapPyr.size() > l)
pyrDown(currentImg, _down, underLapPyr[l].size());
else
pyrDown(currentImg, _down, underHighestLevel.size());
Mat down;
cvtColor(_down, down, CV_GRAY2BGR);
over6_weight_GaussianPyramid.push_back(down);
currentImg = _down;
}
}
void buildLaplacianPyramid(const Mat& img, vector<Mat_<Vec3f> >& lapPyr, Mat& HighestLevel) {
lapPyr.clear();
Mat currentImg = img;
for (int l = 0; l < levels; l++) {
Mat down, up;
pyrDown(currentImg, down);
pyrUp(down, up, currentImg.size());
Mat lap = currentImg - up;
lapPyr.push_back(lap);
currentImg = down;
}
currentImg.copyTo(HighestLevel);
}
Mat_<Vec3f> reconstructImgFromLapPyramid() {
//用金字塔重建上采样
Mat currentImg = resultHighestLevel;
for (int l = levels - 1; l >= 0; l--) {
Mat up;
pyrUp(currentImg, up, resultLapPyr[l].size());
currentImg = up + resultLapPyr[l];
}
return currentImg;
}
void blendLapPyrs() {
Mat w1 = under_weight_GaussianPyramid.back();
Mat w2 = mid_weight_GaussianPyramid.back();
Mat w3 = over_weight_GaussianPyramid.back();
Mat w4 = over4_weight_GaussianPyramid.back();
Mat w5 = over5_weight_GaussianPyramid.back();
Mat w6 = over5_weight_GaussianPyramid.back();
resultHighestLevel = (underHighestLevel.mul(w1) + midHighestLevel.mul(w2) + overHighestLevel.mul(w3) + over4HighestLevel.mul(w4) + over5HighestLevel.mul(w5) + over5HighestLevel.mul(w6)) / (w1 + w2 + w3 + w4 + w5 + w6 + 1e-10);
for (int l = 0; l < levels; l++) {
Mat A = underLapPyr[l].mul(under_weight_GaussianPyramid[l]);
Mat B = midLapPyr[l].mul(mid_weight_GaussianPyramid[l]);
Mat C = overLapPyr[l].mul(over_weight_GaussianPyramid[l]);
Mat D = over4LapPyr[l].mul(over4_weight_GaussianPyramid[l]);
Mat E = over5LapPyr[l].mul(over5_weight_GaussianPyramid[l]);
Mat F = over6LapPyr[l].mul(over6_weight_GaussianPyramid[l]);
Mat W = under_weight_GaussianPyramid[l] + mid_weight_GaussianPyramid[l] + over_weight_GaussianPyramid[l] + over4_weight_GaussianPyramid[l] + over5_weight_GaussianPyramid[l] + over6_weight_GaussianPyramid[l] + 1e-10;
Mat_<Vec3f> blendedLevel = (A + B + C + D + E + F) / W;
resultLapPyr.push_back(blendedLevel);
}
}
public:
LaplacianBlending(const Mat_<Vec3f>& _under, const Mat_<Vec3f>& _mid, const Mat_<Vec3f>& _over, const Mat_<Vec3f>& _over4, const Mat_<Vec3f>& _over5, const Mat_<Vec3f>& _over6, const Mat_<float>& _under_blendweight_, const Mat_<float>& _mid_blendweight_, const Mat_<float>& _over_blendweight_, const Mat_<float>& _over4_blendweight_, const Mat_<float>& _over5_blendweight_, const Mat_<float>& _over6_blendweight_, int _levels) :
under(_under), mid(_mid), over(_over), over4(_over4), over5(_over5), over6(_over6), under_blendweight_(_under_blendweight_), mid_blendweight_(_mid_blendweight_), over_blendweight_(_over_blendweight_), over4_blendweight_(_over4_blendweight_), over5_blendweight_(_over5_blendweight_), over6_blendweight_(_over6_blendweight_), levels(_levels)
{
assert(_under.size() == _over.size());
assert(_under.size() == _under_blendweight_.size());
buildPyramids();
blendLapPyrs();
};
Mat_<Vec3f> blend() {
return reconstructImgFromLapPyramid();
}
};
#endif
Main.cpp:
#include<opencv2/features2d/features2d.hpp>
#include<opencv2/opencv.hpp>
#include<opencv2/xfeatures2d/nonfree.hpp>
#include<iostream>
#include<string>
#include <thread>
#include "ORBextractor.h"
#include"LaplacianBlending.h"
#include <mutex>
using namespace std;
using namespace cv;
//宏
#define GhostFree 1
#define PYRAMIDBLENDING 1
#define NFEATURES 1000
#define FSCALEFACTOR 1.2
#define NLEVELS 9
#define FINITHFAST 25
#define FMINTHFAST 15
//#define COLS 4208
//#define ROWS 3120
#define COLS_MINI 842
#define COLS_MINI 624
#define COLS 842
#define ROWS 624
mutex mu_;
Mat_<Vec3f> LaplacianBlend(const Mat_<Vec3f>&, const Mat_<Vec3f>& , const Mat_<Vec3f>& ,
const Mat_<Vec3f>& , const Mat_<Vec3f>& , const Mat_<Vec3f>& ,
const Mat_<float>& , const Mat_<float>& , const Mat_<float>& ,
const Mat_<float>& , const Mat_<float>& , const Mat_<float>& );
void ImageReader(Mat*, Mat*, const int&);
void ImageRegistration(Mat*, Mat*, Mat*, Mat*,vector<KeyPoint>*,Mat* );
void GradAngleCalculation(Mat*, Mat*, Mat*, Mat*);
void Fake_BaseLine_GradAngle_Generator(Mat* , const int& ,
Mat* , Mat* , Mat* , Mat* , Mat* , Mat* );
void Weight_Generator(Mat*, Mat*, Mat*);
void Weight_Normalize(const int&,Mat*, Mat*, Mat*, Mat*, Mat*, Mat*);
void Weight_Fusion(const int&, Mat*, Mat*, Mat*, Mat*, Mat*, Mat*, Mat*, Mat*, Mat*, Mat*, Mat*, Mat*, Mat*);
void MBBP_Generator(Mat*, Mat* , Mat*);
void Weight_Generator_GHOST(Mat* ,Mat* , Mat* , Mat* );
int main()
{
vector<thread> CodeThread;
Mat image1_BGR;
Mat image1_G;
Mat image2_BGR;
Mat image2_G;
Mat image3_BGR;
Mat image3_G;
Mat image5_BGR;
Mat image5_G;
Mat image6_BGR;
Mat image6_G;
Mat BaseLine;
Mat BaseLineG;
CodeThread.push_back(thread(ImageReader, &image1_BGR, &image1_G, 1));
CodeThread.push_back(thread(ImageReader, &image2_BGR, &image2_G, 2));
CodeThread.push_back(thread(ImageReader, &image3_BGR, &image3_G, 3));
CodeThread.push_back(thread(ImageReader, &image5_BGR, &image5_G, 5));
CodeThread.push_back(thread(ImageReader, &image6_BGR, &image6_G, 6));
ImageReader(&BaseLine, &BaseLineG, 4);
ORB_pyramid::ORBextractor* Pyramid_ORBextractor_BaseLine;
Pyramid_ORBextractor_BaseLine = new ORB_pyramid::ORBextractor(NFEATURES, FSCALEFACTOR, NLEVELS, FINITHFAST, FMINTHFAST);
vector<KeyPoint> key_points_BaseLine;
Mat descriptors_BaseLine;
(*Pyramid_ORBextractor_BaseLine)(BaseLineG, Mat(), key_points_BaseLine, descriptors_BaseLine);
Mat Registration_1;
Mat Registration_2;
Mat Registration_3;
Mat Registration_5;
Mat Registration_6;
Mat RegistrationGray_1(ROWS, COLS, CV_32FC1, Scalar(0));
Mat RegistrationGray_2(ROWS, COLS, CV_32FC1, Scalar(0));
Mat RegistrationGray_3(ROWS, COLS, CV_32FC1, Scalar(0));
Mat RegistrationGray_4(ROWS, COLS, CV_32FC1, Scalar(0));
Mat RegistrationGray_5(ROWS, COLS, CV_32FC1, Scalar(0));
Mat RegistrationGray_6(ROWS, COLS, CV_32FC1, Scalar(0));
for (auto& ite : CodeThread)
{
ite.join();
}
CodeThread.clear();
// DWORD k = ::GetTickCount();
CodeThread.push_back(thread(ImageRegistration, &image2_BGR, &image2_G, &Registration_2, &RegistrationGray_2, &key_points_BaseLine, &descriptors_BaseLine));
CodeThread.push_back(thread(ImageRegistration, &image3_BGR, &image3_G, &Registration_3, &RegistrationGray_3, &key_points_BaseLine, &descriptors_BaseLine));
CodeThread.push_back(thread(ImageRegistration, &image5_BGR, &image5_G, &Registration_5, &RegistrationGray_5, &key_points_BaseLine, &descriptors_BaseLine));
CodeThread.push_back(thread(ImageRegistration, &image6_BGR, &image6_G, &Registration_6, &RegistrationGray_6, &key_points_BaseLine, &descriptors_BaseLine));
ImageRegistration(&image1_BGR, &image1_G, &Registration_1, &RegistrationGray_1, &key_points_BaseLine, &descriptors_BaseLine);
Mat BaseLineG_32F(ROWS, COLS, CV_32FC1, Scalar(0));;
for (int i = 0; i < ROWS; ++i)
{
for (int j = 0; j < COLS; ++j)
{
BaseLineG_32F.at<float>(i, j) = (float)(BaseLineG.at<uchar>(i, j)) / 255.0;
}
}
// cout << ::GetTickCount() - k << endl;
float xfilter_mat[] = {
0.0116601 , 0.0861571 , 0.0116601,
0.0 , 0.0 , 0.0,
-0.0116601 , -0.0861571 , -0.0116601
};
Mat xfilter = Mat(3, 3, CV_32FC1, xfilter_mat);
float yfilter_mat[] = {
0.0116601 , 0.0 , -0.0116601,
0.0861571 , 0.0 , -0.0861571,
0.0116601 , 0.0 , -0.0116601
};
Mat yfilter = Mat(3, 3, CV_32FC1, yfilter_mat);
Mat GradAngle1(ROWS, COLS, CV_32FC1, Scalar(0));
Mat GradAngle2(ROWS, COLS, CV_32FC1, Scalar(0));
Mat GradAngle3(ROWS, COLS, CV_32FC1, Scalar(0));
Mat GradAngle5(ROWS, COLS, CV_32FC1, Scalar(0));
Mat GradAngle6(ROWS, COLS, CV_32FC1, Scalar(0));
Mat GradAngleBaseLine(ROWS, COLS, CV_32FC1, Scalar(0));
for (auto& ite : CodeThread)
{
ite.join();
}
CodeThread.clear();
//imwrite("./image/test/Registration_2.bmp", Registration_2);
//imwrite("./image/test/Registration_1.bmp", Registration_1);
//imwrite("./image/test/Registration_3.bmp", Registration_3);
//imwrite("./image/test/Registration_5.bmp", Registration_5);
//imwrite("./image/test/Registration_6.bmp", Registration_6);
//void GradAngleCalculation(Mat * xfilter, Mat * yfilter, Mat * Registration_images_Gray_Cur, Mat * grad_angle)
CodeThread.push_back(thread(GradAngleCalculation, &xfilter, &yfilter, &RegistrationGray_1, &GradAngle1));
CodeThread.push_back(thread(GradAngleCalculation, &xfilter, &yfilter, &RegistrationGray_2, &GradAngle2));
CodeThread.push_back(thread(GradAngleCalculation, &xfilter, &yfilter, &RegistrationGray_3, &GradAngle3));
CodeThread.push_back(thread(GradAngleCalculation, &xfilter, &yfilter, &RegistrationGray_5, &GradAngle5));
CodeThread.push_back(thread(GradAngleCalculation, &xfilter, &yfilter, &RegistrationGray_6, &GradAngle6));
GradAngleCalculation(&xfilter, &yfilter, &BaseLineG_32F,&GradAngleBaseLine);
Mat Fake_BaseLine_GradAngle(ROWS, COLS, CV_32FC1, Scalar(0));//参考梯度方向
Mat Weight1(ROWS, COLS, CV_32FC1, Scalar(0));
Mat Weight2(ROWS, COLS, CV_32FC1, Scalar(0));
Mat Weight3(ROWS, COLS, CV_32FC1, Scalar(0));
Mat Weight5(ROWS, COLS, CV_32FC1, Scalar(0));
Mat Weight6(ROWS, COLS, CV_32FC1, Scalar(0));
Mat WeightBaseLine(ROWS, COLS, CV_32FC1, Scalar(0));
for (auto& ite : CodeThread)
{
ite.join();
}
CodeThread.clear();
if (GhostFree == 0) {
CodeThread.push_back(thread(Fake_BaseLine_GradAngle_Generator, &Fake_BaseLine_GradAngle, 0,
&GradAngle1, &GradAngle2, &GradAngle3, &GradAngleBaseLine,&GradAngle5, &GradAngle6));
Fake_BaseLine_GradAngle_Generator(&Fake_BaseLine_GradAngle, 1,
&GradAngle1, &GradAngle2, &GradAngle3, &GradAngleBaseLine, &GradAngle5, &GradAngle6);
for (auto& ite : CodeThread)
{
ite.join();
}
CodeThread.clear();
CodeThread.push_back(thread(Weight_Generator, &Fake_BaseLine_GradAngle,&GradAngle1,&Weight1));
CodeThread.push_back(thread(Weight_Generator, &Fake_BaseLine_GradAngle, &GradAngle2, &Weight2));
CodeThread.push_back(thread(Weight_Generator, &Fake_BaseLine_GradAngle, &GradAngle3, &Weight3));
CodeThread.push_back(thread(Weight_Generator, &Fake_BaseLine_GradAngle, &GradAngle5, &Weight5));
CodeThread.push_back(thread(Weight_Generator, &Fake_BaseLine_GradAngle, &GradAngle6, &Weight6));
Weight_Generator(&Fake_BaseLine_GradAngle, &GradAngleBaseLine, &WeightBaseLine);
for (auto& ite : CodeThread)
{
ite.join();
}
CodeThread.clear();
CodeThread.push_back(thread(Weight_Normalize, 0, &Weight1, &Weight2, &Weight3, &Weight5, &Weight6, &WeightBaseLine));
Weight_Normalize(1, &Weight1, &Weight2, &Weight3, &Weight5, &Weight6, &WeightBaseLine);
for (auto& ite : CodeThread)
{
ite.join();
}
CodeThread.clear();
}
if (GhostFree == 1) {
//分两块处理，一般图像都是偶数分辨率不考虑为奇数的极端
Mat Binary_TH1(ROWS, COLS, CV_32FC1, Scalar(0));
Mat Binary_TH2(ROWS, COLS, CV_32FC1, Scalar(0));
Mat Binary_TH3(ROWS, COLS, CV_32FC1, Scalar(0));
Mat Binary_THBaseLine(ROWS, COLS, CV_32FC1, Scalar(1));
Mat Binary_TH5(ROWS, COLS, CV_32FC1, Scalar(0));
Mat Binary_TH6(ROWS, COLS, CV_32FC1, Scalar(0));
CodeThread.push_back(thread(MBBP_Generator, &RegistrationGray_1, &BaseLineG_32F, &Binary_TH1));
CodeThread.push_back(thread(MBBP_Generator, &RegistrationGray_2, &BaseLineG_32F, &Binary_TH2));
CodeThread.push_back(thread(MBBP_Generator, &RegistrationGray_3, &BaseLineG_32F, &Binary_TH3));
CodeThread.push_back(thread(MBBP_Generator, &RegistrationGray_5, &BaseLineG_32F, &Binary_TH5));
MBBP_Generator(&RegistrationGray_5, &BaseLineG_32F, &Binary_TH6);
for (auto& ite : CodeThread)
{
ite.join();
}
CodeThread.clear();
CodeThread.push_back(thread(Weight_Generator_GHOST, &GradAngleBaseLine, &GradAngle1, &Weight1, &Binary_TH1));
CodeThread.push_back(thread(Weight_Generator_GHOST, &GradAngleBaseLine, &GradAngle2, &Weight2, &Binary_TH2));
CodeThread.push_back(thread(Weight_Generator_GHOST, &GradAngleBaseLine, &GradAngle3, &Weight3, &Binary_TH3));
CodeThread.push_back(thread(Weight_Generator_GHOST, &GradAngleBaseLine, &GradAngle5, &Weight5, &Binary_TH5));
WeightBaseLine = 1- WeightBaseLine;
Weight_Generator_GHOST(&GradAngleBaseLine, &GradAngle6, &Weight6, &Binary_TH6);
for (auto& ite : CodeThread)
{
ite.join();
}
CodeThread.clear();
CodeThread.push_back(thread(Weight_Normalize, 0, &Weight1, &Weight2, &Weight3, &Weight5, &Weight6, &WeightBaseLine));
Weight_Normalize(1, &Weight1, &Weight2, &Weight3, &Weight5, &Weight6, &WeightBaseLine);
for (auto& ite : CodeThread)
{
ite.join();
}
CodeThread.clear();
}
if (PYRAMIDBLENDING == 0)
{
Mat newMat(ROWS, COLS, CV_32FC3, Scalar(0));
CodeThread.push_back(thread(Weight_Fusion, 0, &newMat,&Weight1, &Weight2, &Weight3, &Weight5, &Weight6, &WeightBaseLine,
&Registration_1, &Registration_2, &Registration_3, &Registration_5, &Registration_6, &BaseLine));
Weight_Fusion(1, &newMat, &Weight1, &Weight2, &Weight3, &Weight5, &Weight6, &WeightBaseLine,
& Registration_1, &Registration_2, &Registration_3, &Registration_5, &Registration_6, &BaseLine);
for (auto& ite : CodeThread)
{
ite.join();
}
imshow("./image/test/r.bmp", newMat/255);
waitKey();
imwrite("./image/test/r.bmp", newMat);
}
else if (PYRAMIDBLENDING == 1)
{
Mat_<Vec3f> newMat = LaplacianBlend(Registration_1, Registration_2, Registration_3, Registration_5, Registration_6, BaseLine, Weight1, Weight2, Weight3, Weight5, Weight6, WeightBaseLine);
imshow("./image/test/r_pyr.bmp", newMat/255);
waitKey();
imwrite("./image/test/r_pyr.bmp", newMat);
}
return 0;
}
Mat_<Vec3f> LaplacianBlend(const Mat_<Vec3f>& under, const Mat_<Vec3f>& mid, const Mat_<Vec3f>& over, const Mat_<Vec3f>& over4, const Mat_<Vec3f>& over5, const Mat_<Vec3f>& over6, const Mat_<float>& W_under, const Mat_<float>& W_mid, const Mat_<float>& W_over, const Mat_<float>& W_over4, const Mat_<float>& W_over5, const Mat_<float>& W_over6)
{
LaplacianBlending lb(under, mid, over, over4, over5, over6, W_under, W_mid, W_over, W_over4, W_over5, W_over6, 7);
return lb.blend();
}
void ImageReader(Mat* Image_BGR, Mat* Image_G, const int& num)
{
int NUM_INT;
NUM_INT = num;
string image_path = "./image/Img3s/" + to_string(NUM_INT) + ".bmp";
*Image_BGR = imread(image_path, 1);
*Image_G = imread(image_path, 0);
}
void ImageRegistration(Mat* image_BGR, Mat* IMG_proG, Mat* Registration, Mat* RegistrationGray, vector<KeyPoint>* key_points_BaseLine, Mat* descriptors_1)
{
//金字塔ORB检测和特征点匹配
ORB_pyramid::ORBextractor* Pyramid_ORBextractor_;
Pyramid_ORBextractor_ = new ORB_pyramid::ORBextractor(NFEATURES, FSCALEFACTOR, NLEVELS, FINITHFAST, FMINTHFAST);
vector<KeyPoint> key_points_2;
Mat descriptors_2;
(*Pyramid_ORBextractor_)((*IMG_proG), Mat(), key_points_2, descriptors_2);
Ptr<DescriptorMatcher> matcher = DescriptorMatcher::create("BruteForce-Hamming");
vector<DMatch> mach;
matcher->match(*descriptors_1, descriptors_2, mach);
//删除错误匹配的特征点
vector<DMatch> InlierMatches;
vector<Point2f> p1, p2;
int MACHSIZE = mach.size();
for (int i = 0; i < MACHSIZE; i++)
{
p1.push_back((*key_points_BaseLine)[mach[i].queryIdx].pt);
p2.push_back(key_points_2[mach[i].trainIdx].pt);
}
vector<uchar> RANSACStatus;
findFundamentalMat(p1, p2, RANSACStatus, CV_FM_RANSAC);
for (int i = 0; i < MACHSIZE; i++)
{
if (RANSACStatus[i] != 0)
{
InlierMatches.push_back(mach[i]);
}
}
vector<Point2f> IMG_pro_point, Ref_point;
for (int i = 0; i < InlierMatches.size(); i++)
{
IMG_pro_point.push_back((*key_points_BaseLine)[InlierMatches[i].queryIdx].pt);
Ref_point.push_back(key_points_2[InlierMatches[i].trainIdx].pt);
}
//图像配准
Mat Homography = cv::findHomography(Ref_point, IMG_pro_point, CV_RANSAC); //计算单映性矩阵
warpPerspective(*image_BGR, *Registration, Homography, cv::Size(COLS, ROWS));//透视
for (int i = 0; i < ROWS; ++i)
{
for (int j = 0; j < COLS; ++j)
{
RegistrationGray->at<float>(i, j) = (float)(Registration->at<Vec3b>(i, j)[0] * 0.2989 + Registration->at<Vec3b>(i, j)[1] * 0.5870 + Registration->at<Vec3b>(i, j)[2] * 0.1140) / 255.0;
}
}
}
void GradAngleCalculation(Mat* xfilter, Mat* yfilter, Mat* Registration_images_Gray_Cur,Mat* grad_angle)
{
Mat xgrad;//x梯度
filter2D((*Registration_images_Gray_Cur), xgrad, -1, *xfilter);
xgrad = xgrad + 1e-10;//防止分母为0
Mat ygrad;//y梯度
filter2D(*Registration_images_Gray_Cur, ygrad, -1, *yfilter);
//Mat grad_angle(ROWS, COLS, CV_32FC1, Scalar(0));
for (int i = 0; i < ROWS; ++i)
{
for (int j = 0; j < COLS; ++j)
{
grad_angle->at<float>(i, j) = (float)atan2(ygrad.at<float>(i, j), xgrad.at<float>(i, j));
}
}
}
void Fake_BaseLine_GradAngle_Generator(Mat* Fake_BaseLine_GradAngle_Half, const int& type,
Mat* GradAngle_1, Mat* GradAngle_2, Mat* GradAngle_3, Mat* GradAngle_4, Mat* GradAngle_5, Mat* GradAngle_6)
{
if (type == 0)
{
for (int i = 0; i < ROWS / 2; ++i)
{
for (int j = 0; j < COLS; ++j)
{
float Mid_value_[6];
Mid_value_[0] = GradAngle_1->at<float>(i, j);
Mid_value_[1] = GradAngle_2->at<float>(i, j);
Mid_value_[2] = GradAngle_3->at<float>(i, j);
Mid_value_[3] = GradAngle_4->at<float>(i, j);
Mid_value_[4] = GradAngle_5->at<float>(i, j);
Mid_value_[5] = GradAngle_6->at<float>(i, j);
sort(Mid_value_, Mid_value_ + 6);
//mu.lock();
Fake_BaseLine_GradAngle_Half->at<float>(i, j) = Mid_value_[2];
//mu.unlock();
}
}
}
else
{
for (int i = ROWS / 2; i < ROWS; ++i)
{
for (int j = 0; j < COLS; ++j)
{
float Mid_value_[6];
Mid_value_[0] = GradAngle_1->at<float>(i, j);
Mid_value_[1] = GradAngle_2->at<float>(i, j);
Mid_value_[2] = GradAngle_3->at<float>(i, j);
Mid_value_[3] = GradAngle_4->at<float>(i, j);
Mid_value_[4] = GradAngle_5->at<float>(i, j);
Mid_value_[5] = GradAngle_6->at<float>(i, j);
sort(Mid_value_, Mid_value_ + 6);
//mu.lock();
Fake_BaseLine_GradAngle_Half->at<float>(i, j) = Mid_value_[2];
//mu.unlock();
}
}
}
}
void Weight_Generator(Mat* Fake_BaseLine_GradAngle,
Mat* GradAngle,Mat* Weight_element) {
for (int i = 0; i < ROWS; ++i)
{
for (int j = 0; j < COLS; ++j)
{
float difference;
if (abs(GradAngle->at<float>(i, j) - Fake_BaseLine_GradAngle->at<float>(i, j)) > CV_PI)
difference = 2 * CV_PI - abs(GradAngle->at<float>(i, j) - Fake_BaseLine_GradAngle->at<float>(i, j));
else
{
difference = abs(GradAngle->at<float>(i, j) - Fake_BaseLine_GradAngle->at<float>(i, j));
}
Weight_element->at<float>(i, j) = exp((-difference * difference) / (2.0));
}
}
}
void Weight_Normalize(const int& type,Mat* GradAngle_1, Mat* GradAngle_2, Mat* GradAngle_3, Mat* GradAngle_4, Mat* GradAngle_5, Mat* GradAngle_6) {
if (type == 0)
{
for (int i = 0; i < ROWS / 2; ++i)
{
for (int j = 0; j < COLS; ++j)
{
float weight1 = GradAngle_1->at<float>(i, j);
float weight2 = GradAngle_2->at<float>(i, j);
float weight3 = GradAngle_3->at<float>(i, j);
float weight4 = GradAngle_4->at<float>(i, j);
float weight5 = GradAngle_5->at<float>(i, j);
float weight6 = GradAngle_6->at<float>(i, j);
float sum1 = weight1 + weight2 + weight3 + weight4 + weight5 + weight6;
GradAngle_1->at<float>(i, j) = weight1 / sum1;
GradAngle_2->at<float>(i, j) = weight2 / sum1;
GradAngle_3->at<float>(i, j) = weight3 / sum1;
GradAngle_4->at<float>(i, j) = weight4 / sum1;
GradAngle_5->at<float>(i, j) = weight5 / sum1;
GradAngle_6->at<float>(i, j) = weight6 / sum1;
}
}
}
else
{
for (int i = ROWS / 2; i < ROWS; ++i)
{
for (int j = 0; j < COLS; ++j)
{
float weight1 = GradAngle_1->at<float>(i, j);
float weight2 = GradAngle_2->at<float>(i, j);
float weight3 = GradAngle_3->at<float>(i, j);
float weight4 = GradAngle_4->at<float>(i, j);
float weight5 = GradAngle_5->at<float>(i, j);
float weight6 = GradAngle_6->at<float>(i, j);
float sum1 = weight1 + weight2 + weight3 + weight4 + weight5 + weight6;
GradAngle_1->at<float>(i, j) = weight1 / sum1;
GradAngle_2->at<float>(i, j) = weight2 / sum1;
GradAngle_3->at<float>(i, j) = weight3 / sum1;
GradAngle_4->at<float>(i, j) = weight4 / sum1;
GradAngle_5->at<float>(i, j) = weight5 / sum1;
GradAngle_6->at<float>(i, j) = weight6 / sum1;
}
}
}
}
void Weight_Fusion(const int& type, Mat* new1, Mat* W1, Mat* W2, Mat* W3, Mat* W4, Mat* W5, Mat* W6, Mat* A, Mat* B, Mat* C, Mat* D, Mat* E, Mat* F) {
if (type == 0)
{
for (int i = 0; i < ROWS / 2; ++i)
{
for (int j = 0; j < COLS; ++j)
{
new1->at<Vec3f>(i, j)[0] = W1->at<float>(i, j) * A->at<Vec3b>(i, j)[0]
+ W2->at<float>(i, j) * B->at<Vec3b>(i, j)[0]
+ W3->at<float>(i, j) * C->at<Vec3b>(i, j)[0]
+ W4->at<float>(i, j) * D->at<Vec3b>(i, j)[0]
+ W5->at<float>(i, j) * E->at<Vec3b>(i, j)[0]
+ W6->at<float>(i, j) * E->at<Vec3b>(i, j)[0];
new1->at<Vec3f>(i, j)[1] = W1->at<float>(i, j) * A->at<Vec3b>(i, j)[1]
+ W2->at<float>(i, j) * B->at<Vec3b>(i, j)[1]
+ W3->at<float>(i, j) * C->at<Vec3b>(i, j)[1]
+ W4->at<float>(i, j) * D->at<Vec3b>(i, j)[1]
+ W5->at<float>(i, j) * E->at<Vec3b>(i, j)[1]
+ W6->at<float>(i, j) * E->at<Vec3b>(i, j)[1];
new1->at<Vec3f>(i, j)[2] = W1->at<float>(i, j) * A->at<Vec3b>(i, j)[2]
+ W2->at<float>(i, j) * B->at<Vec3b>(i, j)[2]
+ W3->at<float>(i, j) * C->at<Vec3b>(i, j)[2]
+ W4->at<float>(i, j) * D->at<Vec3b>(i, j)[2]
+ W5->at<float>(i, j) * E->at<Vec3b>(i, j)[2]
+ W6->at<float>(i, j) * E->at<Vec3b>(i, j)[2];
}
}
}
else
{
for (int i = ROWS / 2; i < ROWS; ++i)
{
for (int j = 0; j < COLS; ++j)
{
new1->at<Vec3f>(i, j)[0] = W1->at<float>(i, j) * A->at<Vec3b>(i, j)[0]
+ W2->at<float>(i, j) * B->at<Vec3b>(i, j)[0]
+ W3->at<float>(i, j) * C->at<Vec3b>(i, j)[0]
+ W4->at<float>(i, j) * D->at<Vec3b>(i, j)[0]
+ W5->at<float>(i, j) * E->at<Vec3b>(i, j)[0]
+ W6->at<float>(i, j) * E->at<Vec3b>(i, j)[0];
new1->at<Vec3f>(i, j)[1] = W1->at<float>(i, j) * A->at<Vec3b>(i, j)[1]
+ W2->at<float>(i, j) * B->at<Vec3b>(i, j)[1]
+ W3->at<float>(i, j) * C->at<Vec3b>(i, j)[1]
+ W4->at<float>(i, j) * D->at<Vec3b>(i, j)[1]
+ W5->at<float>(i, j) * E->at<Vec3b>(i, j)[1]
+ W6->at<float>(i, j) * E->at<Vec3b>(i, j)[1];
new1->at<Vec3f>(i, j)[2] = W1->at<float>(i, j) * A->at<Vec3b>(i, j)[2]
+ W2->at<float>(i, j) * B->at<Vec3b>(i, j)[2]
+ W3->at<float>(i, j) * C->at<Vec3b>(i, j)[2]
+ W4->at<float>(i, j) * D->at<Vec3b>(i, j)[2]
+ W5->at<float>(i, j) * E->at<Vec3b>(i, j)[2]
+ W6->at<float>(i, j) * E->at<Vec3b>(i, j)[2];
}
}
}
}
void MBBP_Generator(Mat* Registration_images_Gray, Mat* BaseLineGray ,Mat* differ) {
Mat kernel = getStructuringElement(MORPH_CROSS, Size(3, 3), Point(-1, -1));
for (float TH = 0.05; TH < 1; TH = TH + 0.1)
{
Mat BMap;
Mat BaseLineBmap;
cv::threshold((*Registration_images_Gray), BMap, TH, 1.0, THRESH_BINARY);
cv::threshold((*BaseLineGray), BaseLineBmap, TH, 1.0, THRESH_BINARY);
*differ = BMap - BaseLineBmap + (*differ);
}
cv::threshold(*differ, *differ, 0.5, 1.0, THRESH_BINARY);
cv::erode(*differ, *differ, kernel);
Mat kernel1 = getStructuringElement(MORPH_CROSS, Size(5, 5), Point(-1, -1));
cv::dilate(*differ, *differ, kernel1);
*differ = 1 - *differ;
}
void Weight_Generator_GHOST(Mat* Fake_BaseLine_GradAngle,
Mat* GradAngle, Mat* Weight_element, Mat* BTMAP) {
for (int i = 0; i < ROWS; ++i)
{
for (int j = 0; j < COLS; ++j)
{
float difference;
if (abs(GradAngle->at<float>(i, j) - Fake_BaseLine_GradAngle->at<float>(i, j)) > CV_PI)
difference = 2 * CV_PI - abs(GradAngle->at<float>(i, j) - Fake_BaseLine_GradAngle->at<float>(i, j));
else
{
difference = abs(GradAngle->at<float>(i, j) - Fake_BaseLine_GradAngle->at<float>(i, j));
}
Weight_element->at<float>(i, j) = exp((-difference * difference) / (2.0))* BTMAP->at<float>(i, j);
}
}
}
结果图：
输入 图像序列1：
结果图：
输入图像序列2：
结果图：
