• OpenCV——PS 滤镜算法之极坐标变换到平面坐标


    // 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
    
    /*
    This program will transform from the
    polar to orthogonal coordinate.
    
    */
    
    
    #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);
        Show_Image(Img, Img_name);
    
        Mat Img_in(Img.size(), CV_32FC3);
        Img.convertTo(Img_in, CV_32FC3);
        // Show_Image(Img_in, "in");
    
        Mat Img_out(Img_in.size(), CV_32FC3);
        Img_in.convertTo(Img_out, CV_32FC3);
    
        int width=Img_in.cols;
        int height=Img_in.rows;
    
        float R;
        float e;
        float a,b;
    
        e=(float)width/(float)height;
        R=(float)height/2.0;
        a=(float)width/2.0;
        b=R;
    
        Point Center(width/2, height/2);
    
        float R1,R2,new_x, new_y;
        float p,q,x1,y1;
        float theta;
    
        for (int y=0; y<height; y++)
        {
            for (int x=0; x<width; x++)
            {
                R1=y*R/height;
                R2=R1*e;
                theta=x*2*pi/width;
    
                new_y=Center.y-R1*sin(theta);
                new_x=Center.x+R2*cos(theta);
    
                    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<Vec3f>(y, x)[k]=(1-p)*(1-q)*Img_in.at<Vec3f>(y1, x1)[k]+
                                                (p)*(1-q)*Img_in.at<Vec3f>(y1,x1+1)[k]+
                                                (1-p)*(q)*Img_in.at<Vec3f>(y1+1,x1)[k]+
                                                (p)*(q)*Img_in.at<Vec3f>(y1+1,x1+1)[k];
                }
    
            }
        }
    
        Img_out=Img_out/255.0;
        Show_Image(Img_out, "out");
    
        imwrite("Out.jpg", Img_out*255);
    
    
        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);
    
    }
    



    原图


    效果图


  • 相关阅读:
    [置顶] 十年博客行
    计算机编程语言年史
    初步认知MySQL metadata lock(MDL)
    Oracle语句优化规则(二)
    正则表达式
    sql server中的 SET NOCOUNT ON 的含义
    SQO (标准查询运算符)方法 & Linq To Object
    C# 扩展
    特性
    C#之泛型
  • 原文地址:https://www.cnblogs.com/mtcnn/p/9412579.html
Copyright © 2020-2023  润新知