File: logpolar_bsm.cpp

package info (click to toggle)
opencv 2.4.9.1%2Bdfsg-1%2Bdeb8u1
  • links: PTS, VCS
  • area: main
  • in suites: jessie
  • size: 126,800 kB
  • ctags: 62,729
  • sloc: xml: 509,055; cpp: 490,794; lisp: 23,208; python: 21,174; java: 19,317; ansic: 1,038; sh: 128; makefile: 72
file content (82 lines) | stat: -rw-r--r-- 2,235 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
/*Authors
* Manuela Chessa, Fabio Solari, Fabio Tatti, Silvio P. Sabatini
*
* manuela.chessa@unige.it, fabio.solari@unige.it
*
* PSPC-lab - University of Genoa
*/

#include "opencv2/opencv.hpp"
#include <iostream>
#include <cmath>

using namespace cv;
using namespace std;

static void help()
{
    cout << "LogPolar Blind Spot Model sample.\nShortcuts:"
        "\n\tn for nearest pixel technique"
        "\n\tb for bilinear interpolation technique"
        "\n\to for overlapping circular receptive fields"
        "\n\ta for adjacent receptive fields"
        "\n\tq or ESC quit\n";
}

int main(int argc, char** argv)
{
    Mat img = imread(argc > 1 ? argv[1] : "lena.jpg",1); // open the image
    if(img.empty()) // check if we succeeded
    {
        cout << "can not load image\n";
        return 0;
    }
    help();

    Size s=img.size();
    int w=s.width, h=s.height;
    int ro0=3; //radius of the blind spot
    int R=120;  //number of rings

    //Creation of the four different objects that implement the four log-polar transformations
    //Off-line computation
    Point2i center(w/2,h/2);
    LogPolar_Interp nearest(w, h, center, R, ro0, INTER_NEAREST);
    LogPolar_Interp bilin(w,h, center,R,ro0);
    LogPolar_Overlapping overlap(w,h,center,R,ro0);
    LogPolar_Adjacent adj(w,h,center,R,ro0,0.25);

    namedWindow("Cartesian",1);
    namedWindow("retinal",1);
    namedWindow("cortical",1);
    int wk='n';
    Mat Cortical, Retinal;

    //On-line computation
    for(;;)
    {
        if(wk=='n'){
            Cortical=nearest.to_cortical(img);
            Retinal=nearest.to_cartesian(Cortical);
        }else if (wk=='b'){
            Cortical=bilin.to_cortical(img);
            Retinal=bilin.to_cartesian(Cortical);
        }else if (wk=='o'){
            Cortical=overlap.to_cortical(img);
            Retinal=overlap.to_cartesian(Cortical);
        }else if (wk=='a'){
            Cortical=adj.to_cortical(img);
            Retinal=adj.to_cartesian(Cortical);
        }

        imshow("Cartesian", img);
        imshow("cortical", Cortical);
        imshow("retinal", Retinal);

        int c=waitKey(15);
        if (c>0) wk=c;
        if(wk =='q' || (wk & 255) == 27) break;
    }

    return 0;
}