zoukankan      html  css  js  c++  java
  • OpenCV——颜色运算(二)


    #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;
    
    
    void Show_Image(Mat&, const string &);
    
    
    #endif // PS_ALGORITHM_H_INCLUDED
    
    
    #include "PS_Algorithm.h"
    #include <time.h>
    
    using namespace std;
    using namespace cv;
    
    int main(void)
    {
        string Img_name("4.jpg");
        Mat Image_in;
        Image_in=imread(Img_name);
        Show_Image(Image_in, Img_name);
        Mat Image_out(Image_in.size(), CV_32FC3);
        Image_in.convertTo(Image_out, CV_32FC3);
    
        Mat Image_2(Image_in.size(), CV_32FC3);
        Image_in.convertTo( Image_2, CV_32FC3);
    
        Mat r(Image_in.rows, Image_in.cols, CV_32FC1);
        Mat g(Image_in.rows, Image_in.cols, CV_32FC1);
        Mat b(Image_in.rows, Image_in.cols, CV_32FC1);
    
        Mat inp[]={b, g, r};
    
        split(Image_2, inp);
    
        Mat r_new(Image_in.rows, Image_in.cols, CV_32FC1);
        Mat g_new(Image_in.rows, Image_in.cols, CV_32FC1);
        Mat b_new(Image_in.rows, Image_in.cols, CV_32FC1);
    
        cv::pow(g-b, 2, r_new);
        cv::pow(r-b, 2, g_new);
        cv::pow(r-g, 2, b_new);
    
        r_new=r_new/128;
        g_new=g_new/128;
        b_new=b_new/128;
    
        Mat out[]={b_new, g_new, r_new};
    
        merge(out,3,Image_out);
    
        Image_out=Image_out/255;
    
        Show_Image(Image_out, "out.jpg");
    
        waitKey();
        cout<<"All is well."<<endl;
    
    }
    
    
    #include "PS_Algorithm.h"
    #include <iostream>
    #include <string>
    
    using namespace std;
    using namespace cv;
    
    void Show_Image(Mat& Image, const string& str)
    {
        namedWindow(str.c_str(),CV_WINDOW_AUTOSIZE);
        imshow(str.c_str(), Image);
    
    }
    



    原图:


    效果图:


  • 相关阅读:
    算法笔记--数据结构--并查集
    帮助
    八数码难题神奇!!!
    题解 P1197 【[JSOI2008]星球大战】
    线段树1对于Pushdown的理解
    最短路问题之SPFA
    并查集(路径压缩)
    并查集(KRUSKAL算法)
    初识单调栈
    初识单调队列
  • 原文地址:https://www.cnblogs.com/mtcnn/p/9412667.html
Copyright © 2011-2022 走看看