[8fd2db]: src / matchpoint / main.cpp Maximize Restore History

Download this file

main.cpp    176 lines (141 with data), 5.2 kB

  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
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
/***************************************************************************
* Copyright (C) 2007 by Zoran Mesec *
* zoran.mesec@gmail.com *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
* This program is distributed in the hope that it will be useful, *
* but WITHOUT ANY WARRANTY; without even the implied warranty of *
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
* GNU General Public License for more details. *
* *
* You should have received a copy of the GNU General Public License *
* along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *
***************************************************************************/
//#define USE_OPENCV
//#define USE_QT
#define USE_VIGRA
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <stdio.h>
#include <iostream>
#include <stdlib.h>
#include <math.h>
#include <ctime>
#include <algorithm>
#include <string>
#include "APImage.h"
#include "HessianDetector.h"
#include "Descriptor.h"
#include <limits>
using namespace std;
double getDistance(vector<double>* d1,vector<double>* d2) {
double dist=0;
for(int i=0; i<DESCRIPTOR_SIZE;i++) {
dist+=pow((*d1)[i]-(*d2)[i],2);
}
return dist;
}
int main(int argc, char *argv[])
{
clock_t start,finish;
double time;
int nrPoints=250;
if(argc!=3) {
cout << "Usage: ./main img1 img2 " << "\n";
return 0;
}
//APImage im1("trees/img1.ppm");
APImage im1(argv[1]);
if(!im1.open()) {
cout<< "Error! APImage can not be opened"<<"\n";
return 0;
}
APImage im2(argv[2]);
if(!im2.open()) {
cout<< "Error! APImage can not be opened"<<"\n";
return 0;
}
//need to integrate the image before the detection process(only if using box filter approximation)
im1.integrate();
im2.integrate();
start = clock();
HessianDetector hd1(&im1,nrPoints, HD_BOX_FILTERS,1);
if(!hd1.detect()) {
cout << "Detection of points failed!";
return 1;
}
//print points and display image with the detected points(debugging only)
//hd1.printPoints(cout);
finish = clock();
time = (double(finish)-double(start))/CLOCKS_PER_SEC;
cout << "Measured time:"<<time<<"\n";
vector<vector<int> >* interestPoints1=hd1.getPoints();
Descriptor d1(&im1,&hd1);
d1.setPoints(interestPoints1);
//d.orientate();
d1.createDescriptors();
//d1.generateAutopanoXML("test3.xml");
/*d1.printDescriptors(cout);
return 0;*/
HessianDetector hd2(&im2,nrPoints, HD_BOX_FILTERS,1);
if(!hd2.detect()) {
cout << "Detection of points failed!";
return 1;
}
//print points and display image with the detected points(debugging only)
//hd2.printPoints();
vector<vector<int> >* interestPoints2=hd2.getPoints();
Descriptor d2(&im2,&hd2);
d2.setPoints(interestPoints2);
//d.orientate();
d2.createDescriptors();
/*d2.generateAutopanoXML("test4.xml");
return 0;*/
vector<vector<double> >* descriptors1=d1.getDescriptors();
vector<vector<double> >::iterator iter1 = (*descriptors1).begin();
vector<vector<double> >* descriptors2=d2.getDescriptors();
int pointCount=0;
int max;
int maxId; //position int the vector of the nearest neighbour
while( iter1 != (*descriptors1).end()) {
vector<double> current1 = *iter1;
vector<vector<double> >::iterator iter2 =(*descriptors2).begin();
max=1;
maxId=0;
vector<double> current2 = *iter2;
double distance=getDistance(&current1,&current2);
iter2++;
double diff=distance; //nearest neighbour
double diff2=std::numeric_limits<double>::max(); //second nearest neighbour
while( iter2 != (*descriptors2).end()) {
current2 = *iter2;
distance=getDistance(&current1,&current2);
if(distance<diff) {
diff2=diff;
diff=distance;
maxId=max;
} else if(distance<diff2) {
//set the new second nearest neighbour
diff2=distance;
}
max++;
iter2++;
}
if(diff<(0.5*diff2)) {
im1.drawCircle((*interestPoints1)[pointCount][1],(*interestPoints1)[pointCount][0],10);
im2.drawCircle((*interestPoints2)[maxId][1],(*interestPoints2)[maxId][0],10);
}
iter1++;
pointCount++;
}
im1.show();
im2.show();
return EXIT_SUCCESS;
}