具体的算法原理可以参考
// PS_Algorithm.h
#ifndef PS_ALGORITHM_H_INCLUDED
#define PS_ALGORITHM_H_INCLUDED
#include <iostream>
#include <string>
#include "cv.h"
#include "highgui.h"
#include "cxmat.hpp"
#include "cxcore.hpp"
using namespace std;
using namespace cv;
#endif // PS_ALGORITHM_H_INCLUDED
// main function
#include "PS_Algorithm.h"
void Vivid_Lighten(Mat& src1, Mat& src2, Mat& dst);
void Pin_Lighten(Mat& src1, Mat& src2, Mat& dst);
void Linear_Lighten(Mat& src1, Mat& src2, Mat& dst);
void Hard_mix(Mat& src1, Mat& src2, Mat& dst);
int main(void)
{
Mat Origin_Image1;
Mat Origin_Image2;
Origin_Image1=imread("2.jpg");
Origin_Image2=imread("3.jpg");
Mat Image_up(Origin_Image1.size(),CV_32FC3);
Mat Image_down(Origin_Image2.size(), CV_32FC3);
Origin_Image1.convertTo(Image_up,CV_32FC3);
Origin_Image2.convertTo(Image_down,CV_32FC3);
Image_up=Image_up/255;
Image_down=Image_down/255;
Mat Image_mix(Image_up);
//Vivid_Lighten(Image_up, Image_down, Image_mix);
//Pin_Lighten(Image_up, Image_down, Image_mix);
//Linear_Lighten(Image_up, Image_down, Image_mix);
//Hard_mix(Image_up, Image_down, Image_mix);
namedWindow("Img", CV_WINDOW_AUTOSIZE);
imshow("Img",Image_mix);
waitKey();
cvDestroyWindow("Img");
cout<<"All is well."<<endl;
return 0;
}
//Vivid Lighten
void Vivid_Lighten(Mat& src1, Mat& src2, Mat& dst)
{
float a=0;
float b=0;
for(int index_row=0; index_row<src1.rows; index_row++)
{
for(int index_col=0; index_col<src1.cols; index_col++)
{
for(int index_c=0; index_c<3; index_c++)
{
a=src1.at<Vec3f>(index_row, index_col)[index_c];
b=src2.at<Vec3f>(index_row, index_col)[index_c];
if(a<=0.5)
{
dst.at<Vec3f>(index_row, index_col)[index_c]=1-(1-b)/(2*a);
}
else
{
dst.at<Vec3f>(index_row, index_col)[index_c]=b/(2*(1-a));
}
}
}
}
}
// Pin lighten
void Pin_Lighten(Mat& src1, Mat& src2, Mat& dst)
{
float a=0;
float b=0;
for(int index_row=0; index_row<src1.rows; index_row++)
{
for(int index_col=0; index_col<src1.cols; index_col++)
{
for(int index_c=0; index_c<3; index_c++)
{
a=src1.at<Vec3f>(index_row, index_col)[index_c];
b=src2.at<Vec3f>(index_row, index_col)[index_c];
if(b<=2*a-1)
{
dst.at<Vec3f>(index_row, index_col)[index_c]=2*a-1;
}
else if(b<=2*a)
{
dst.at<Vec3f>(index_row, index_col)[index_c]=b;
}
else
{
dst.at<Vec3f>(index_row, index_col)[index_c]=2*a;
}
}
}
}
}
// Linear Lighten
void Linear_Lighten(Mat& src1, Mat& src2, Mat& dst)
{
dst=src2+2*src1-1;
}
// Hard mix
void Hard_mix(Mat& src1, Mat& src2, Mat& dst)
{
float a=0;
float b=0;
for(int index_row=0; index_row<src1.rows; index_row++)
{
for(int index_col=0; index_col<src1.cols; index_col++)
{
for(int index_c=0; index_c<3; index_c++)
{
a=src1.at<Vec3f>(index_row, index_col)[index_c];
b=src2.at<Vec3f>(index_row, index_col)[index_c];
if(a<1-b)
{
dst.at<Vec3f>(index_row, index_col)[index_c]=0.0;
}
else
{
dst.at<Vec3f>(index_row, index_col)[index_c]=1.0;
}
}
}
}
}
OpenCV——PS 图层混合算法 （四）,布布扣,bubuko.com