OpenCV——PS 图层混合算法 （二）「建议收藏」

大家好，又见面了，我是全栈君。

详细的算法原理能够參考

PS图层混合算法之二（线性加深，线性减淡，变亮，变暗）

// 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 Linear_Burn(Mat& src1, Mat& src2, Mat& dst); void Linear_Dodge(Mat& src1, Mat& src2, Mat& dst); void Lighten(Mat& src1, Mat& src2, Mat& dst); void Darken(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);

//Linear_Burn(Image_up, Image_down, Image_mix); //Linear_Dodge(Image_up, Image_down, Image_mix); //Lighten(Image_up, Image_down, Image_mix); //Darken(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; }

// linear Burn

void Linear_Burn(Mat& src1, Mat& src2, Mat& dst) { 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++) dst.at<Vec3f>(index_row, index_col)[index_c]=max( src1.at<Vec3f>(index_row, index_col)[index_c]+ src2.at<Vec3f>(index_row, index_col)[index_c]-1, (float)0.0); } } }

// linear dodge void Linear_Dodge(Mat& src1, Mat& src2, Mat& dst) { 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++) dst.at<Vec3f>(index_row, index_col)[index_c]=min( src1.at<Vec3f>(index_row, index_col)[index_c]+ src2.at<Vec3f>(index_row, index_col)[index_c], (float)1.0); } } }

// Lighten void Lighten(Mat& src1, Mat& src2, Mat& dst) { 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++) dst.at<Vec3f>(index_row, index_col)[index_c]=max( src1.at<Vec3f>(index_row, index_col)[index_c], src2.at<Vec3f>(index_row, index_col)[index_c]); } } }

// Darken void Darken(Mat& src1, Mat& src2, Mat& dst) { 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++) dst.at<Vec3f>(index_row, index_col)[index_c]=min( src1.at<Vec3f>(index_row, index_col)[index_c], src2.at<Vec3f>(index_row, index_col)[index_c]); } }

发布者：全栈程序员栈长，转载请注明出处：https://javaforall.cn/115338.html原文链接：https://javaforall.cn