zoukankan      html  css  js  c++  java
  • Opencv— — Pinch Filter

    
    // 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
    
    /*
    
    generate the pinch distortion
    
    */
    
    #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 angle = pi/2;
        float centreX = 0.5;
        float centreY = 0.5;
        float radius = 200;
        float amount=0.5;
    
        if (radius==0) radius=std::min(width, height)/2;
    
        float icentreX=width*centreX;
        float icentreY=height*centreY;
        float radius2=radius*radius;
    
        float dx,dy,new_x,new_y;
        float p,q,x1,y1;
        float distance;
        float a,d,t,s,c,e;
    
        for (int y=0; y<height; y++)
        {
            for (int x=0; x<width; x++)
            {
    
                 dx=x-icentreX;
                 dy=y-icentreY;
    
                 distance=dx*dx+dy*dy;
    
                 if (distance>radius2 || distance==0)
                 {
                     new_x=x;
                     new_y=y;
                 }
                 else
                 {
                    d = sqrt( distance / radius2 );
                    t = pow(sin( pi*0.5 * d ),-amount);
    
                    dx =dx* t;
                    dy =dy* t;
    
                    e = 1 - d;
                    a = angle * e * e;
    
                    s = sin( a );
                    c = cos( a );
    
                    new_x = icentreX + c*dx - s*dy;
                    new_y = icentreY + s*dx + c*dy;
                 }
    
                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");
        cout<<"All is well"<<endl;
    
       // 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);
    
    }
    
    

    图像效果可以参考:

    http://blog.csdn.net/matrix_space/article/details/46789421

  • 相关阅读:
    人工智能-球星产生式系统实验报告
    [SCOI2009]windy数
    [Atcoder Code Festival 2017 Qual A Problem D]Four Coloring
    [AtCoder Grand Contest 024 Problem E]Sequence Growing Hard
    [AtCoder Grand Contest 025 Problem D]Choosing Points
    [Atcoder Code Festival 2017 Qual B Problem F]Largest Smallest Cyclic Shift
    [CQOI2018]九连环
    [CTSC2017]吉夫特
    [HAOI2006]均分数据
    [JSOI2004]平衡点
  • 原文地址:https://www.cnblogs.com/mtcnn/p/9412520.html
Copyright © 2011-2022 走看看