• OpenCV——PS滤镜算法之 Ellipsoid (凹陷)


    // define head function
    #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"
    #include "math.h"
    
    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;
    
    #define pi 3.1415926
    
    int main()
    {
        string Img_name("4.jpg");
        Mat Img;
        Img=imread(Img_name);
    
        Mat Img_out(Img.size(), CV_8UC3);
        Img.copyTo(Img_out);
    
        int width=Img.cols;
        int height=Img.rows;
    
        float e;
        float a,b, a0, b0, a1,b1;
        float alpha=1.0;
        float K=pi/2;
    
        a=width/2; b=height/2;
        e=(float)width/(float)height;
    
        Point2i Center(width/2, height/2);
    
        float new_x, new_y;
        float p,q,x1,y1,x0,y0;
        float theta;
    
        for (int y=0; y<height; y++)
        {
            for (int x=0; x<width; x++)
            {
                y0=Center.y-y;
                x0=x-Center.x;
    
    
                theta=atan(y0*e/(x0+0.0001));
                if(x0<0)   theta=theta+pi;
    
                a0=x0/cos(theta);
                b0=y0/sin(theta+0.0001);
    
                if(a0>a || b0>b)  continue;
    
                a1=a*sin(a0/a*K);
                b1=b*sin(b0/b*K);
    
                a1=(a1-a0)*(alpha)+a0;
                b1=(b1-b0)*(alpha)+b0;
    
                new_x=a1*cos(theta);
                new_y=b1*sin(theta);
    
                new_x=Center.x+new_x;
                new_y=Center.y-new_y;
    
                if(new_x<0)         new_x=0;
                if(new_x>=width-1)  new_x=width-2;
                if(new_y<0)         new_y=0;
                if(new_y>=height-1) new_y=height-2;
    
                x1=(int)new_x;
                y1=(int)new_y;
    
                p=new_x-x1;
                q=new_y-y1;
    
    
                for (int k=0; k<3; k++)
                {
                    Img_out.at<Vec3b>(y, x)[k]=(1-p)*(1-q)*Img.at<Vec3b>(y1, x1)[k]+
                                                (p)*(1-q)*Img.at<Vec3b>(y1,x1+1)[k]+
                                                (1-p)*(q)*Img.at<Vec3b>(y1+1,x1)[k]+
                                                (p)*(q)*Img.at<Vec3b>(y1+1,x1+1)[k];
    
                }
    
    
            }
        }
    
       Show_Image(Img_out, "out");
       imwrite("Out.jpg", Img_out);
    
       waitKey();
    
    }
    
    
    // define the show image
    #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);
    
    }
    


    原图 


    效果图


  • 相关阅读:
    js三种存储方式区别
    利用split方法计算字符串中出现字母最多的次数
    图片预加载的三个方法
    页面有大量图片,优化图片的加载方法
    USB通信协议——深入理解
    C/C++回调函数
    显卡工作原理
    include包含头文件的语句中,双引号和尖括号的区别是什么?
    华为2015校园招聘 上机试题
    位操作基础篇之位操作全面总结
  • 原文地址:https://www.cnblogs.com/mtcnn/p/9412472.html
Copyright © 2020-2023  润新知