-
Notifications
You must be signed in to change notification settings - Fork 71
/
TestLineMatchingAlgorithm.cpp
225 lines (191 loc) · 9.66 KB
/
TestLineMatchingAlgorithm.cpp
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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
/*IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
By downloading, copying, installing or using the software you agree to this license.
If you do not agree to this license, do not download, install,
copy or use the software.
License Agreement
For Open Source Computer Vision Library
Copyright (C) 2011-2012, Lilian Zhang, all rights reserved.
Copyright (C) 2013, Manuele Tamburrano, Stefano Fabri, all rights reserved.
Third party copyrights are property of their respective owners.
To extract edge and lines, this library implements the EDLines Algorithm and the Edge Drawing detector:
http://www.sciencedirect.com/science/article/pii/S0167865511001772
http://www.sciencedirect.com/science/article/pii/S1047320312000831
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* The name of the copyright holders may not be used to endorse or promote products
derived from this software without specific prior written permission.
This software is provided by the copyright holders and contributors "as is" and
any express or implied warranties, including, but not limited to, the implied
warranties of merchantability and fitness for a particular purpose are disclaimed.
In no event shall the Intel Corporation or contributors be liable for any direct,
indirect, incidental, special, exemplary, or consequential damages
(including, but not limited to, procurement of substitute goods or services;
loss of use, data, or profits; or business interruption) however caused
and on any theory of liability, whether in contract, strict liability,
or tort (including negligence or otherwise) arising in any way out of
the use of this software, even if advised of the possibility of such damage.
*/
#include <math.h>
#include <time.h>
#include <fstream>
#include "LineDescriptor.hh"
using namespace std;
void usage(int argc, char** argv){
cout<<"Usage: "<<argv[0]<<" image1.png"<<" image2.png"<<endl;
}
int main(int argc, char** argv)
{
int ret = -1;
if(argc<3){
usage(argc,argv);
return ret;
}
//load first image from file
std::string imageName1(argv[1]);
cv::Mat leftImage;
leftImage = imread(imageName1, cv::IMREAD_GRAYSCALE); // Read the file
if(! leftImage.data ) // Check for invalid input
{
cout << "Could not open or find the image" << std::endl ;
return -1;
}
//load second image from file
std::string imageName2(argv[2]);
cv::Mat rightImage;
rightImage = imread(imageName2, cv::IMREAD_GRAYSCALE); // Read the file
if(! rightImage.data ) // Check for invalid input
{
cout << "Could not open or find the image" << std::endl ;
return -1;
}
unsigned int imageWidth = leftImage.cols;
unsigned int imageHeight = leftImage.rows;
srand((unsigned)time(0));
int lowest=100, highest=255;
int range=(highest-lowest)+1;
unsigned int r, g, b; //the color of lines
//initial variables
cv::Mat leftColorImage(leftImage.size(), CV_8UC3);
cv::Mat rightColorImage(rightImage.size(), CV_8UC3);
cvtColor( leftImage, leftColorImage, cv::COLOR_GRAY2RGB );
cvtColor( rightImage, rightColorImage, cv::COLOR_GRAY2RGB );
///////////####################################################################
///////////####################################################################
//extract lines, compute their descriptors and match lines
LineDescriptor lineDesc;
// PairwiseLineMatching lineMatch;
ScaleLines linesInLeft;
ScaleLines linesInRight;
std::vector<unsigned int> matchResult;
lineDesc.GetLineDescriptor(leftImage,linesInLeft);
lineDesc.GetLineDescriptor(rightImage,linesInRight);
//TODO remove BIAS dependecies in PairwiseMatching
// lineMatch.LineMatching(linesInLeft,linesInRight,matchResult);
///////////####################################################################
///////////####################################################################
//draw extracted lines into images
cv::Point startPoint;
cv::Point endPoint;
cv::Point point;
for(unsigned int i=0; i<linesInLeft.size(); i++){
r = lowest+int(rand()%range);
g = lowest+int(rand()%range);
b = lowest+int(rand()%range);
startPoint = cv::Point(int(linesInLeft[i][0].startPointX),int(linesInLeft[i][0].startPointY));
endPoint = cv::Point(int(linesInLeft[i][0].endPointX), int(linesInLeft[i][0].endPointY));
cv::line( leftColorImage,startPoint,endPoint,cv::Scalar(r,g,b));
// char buf[10];
// sprintf( buf, "%d ", i);
// if(i%2){
// point = cvPoint(round(0.75*startPoint.x+0.25*endPoint.x),round(0.75*startPoint.y+0.25*endPoint.y));
// cvPutText(cvLeftColorImage,buf,point,&font,CV_RGB(r,g,b));
// }else{
// point = cvPoint(round(0.25*startPoint.x+0.75*endPoint.x),round(0.25*startPoint.y+0.75*endPoint.y));
// cvPutText(cvLeftColorImage,buf,point,&font,CV_RGB(r,g,b));
// }
}
for(unsigned int i=0; i<linesInRight.size(); i++){
r = lowest+int(rand()%range);
g = lowest+int(rand()%range);
b = lowest+int(rand()%range);
startPoint = cv::Point(int(linesInRight[i][0].startPointX),int(linesInRight[i][0].startPointY));
endPoint = cv::Point(int(linesInRight[i][0].endPointX), int(linesInRight[i][0].endPointY));
cv::line( rightColorImage,startPoint,endPoint,cv::Scalar(r,g,b));
// char buf[10];
// sprintf( buf, "%d ", i);
// if(i%2){
// point = cvPoint(round(0.75*startPoint.x+0.25*endPoint.x),round(0.75*startPoint.y+0.25*endPoint.y));
// cvPutText(cvRightColorImage,buf,point,&font,CV_RGB(r,g,b));
// }else{
// point = cvPoint(round(0.25*startPoint.x+0.75*endPoint.x),round(0.25*startPoint.y+0.75*endPoint.y));
// cvPutText(cvRightColorImage,buf,point,&font,CV_RGB(r,g,b));
// }
}
imwrite("LinesInImage1.png",leftColorImage);
imwrite("LinesInImage2.png",rightColorImage);
//TODO enable after BIAS dependecies in PairwiseMatching have been removed
// ///////////####################################################################
// ///////////####################################################################
// //store the matching results of the first and second images into a single image
// double ww1,ww2;
// int lineIDLeft;
// int lineIDRight;
// cvCvtColor( cvLeftImage, cvLeftColorImage, CV_GRAY2RGB );
// cvCvtColor( cvRightImage,cvRightColorImage, CV_GRAY2RGB );
// int lowest1=0, highest1=255;
// int range1=(highest1-lowest1)+1;
// std::vector<unsigned int> r1(matchResult.size()/2), g1(matchResult.size()/2), b1(matchResult.size()/2); //the color of lines
// for(unsigned int pair=0; pair<matchResult.size()/2;pair++){
// r1[pair] = lowest1+int(rand()%range1);
// g1[pair] = lowest1+int(rand()%range1);
// b1[pair] = 255 - r1[pair];
// ww1 = 0.2*(rand()%5);
// ww2 = 1 - ww1;
// char buf[10];
// sprintf( buf, "%d ", pair);
// lineIDLeft = matchResult[2*pair];
// lineIDRight= matchResult[2*pair+1];
// startPoint = cvPoint(int(linesInLeft[lineIDLeft][0].startPointX),int(linesInLeft[lineIDLeft][0].startPointY));
// endPoint = cvPoint(int(linesInLeft[lineIDLeft][0].endPointX), int(linesInLeft[lineIDLeft][0].endPointY));
// cvLine( cvLeftColorImage,startPoint,endPoint,CV_RGB(r1[pair],g1[pair],b1[pair]),4, CV_AA);
// startPoint = cvPoint(int(linesInRight[lineIDRight][0].startPointX),int(linesInRight[lineIDRight][0].startPointY));
// endPoint = cvPoint(int(linesInRight[lineIDRight][0].endPointX), int(linesInRight[lineIDRight][0].endPointY));
// cvLine( cvRightColorImage,startPoint,endPoint,CV_RGB(r1[pair],g1[pair],b1[pair]),4, CV_AA);
// }
//
// IplImage *cvResultColorImage1 = cvCreateImage(cvSize(imageWidth*2,imageHeight),IPL_DEPTH_8U, 3);
// IplImage *cvResultColorImage2 = cvCreateImage(cvSize(imageWidth*2,imageHeight),IPL_DEPTH_8U, 3);
// IplImage *cvResultColorImage = cvCreateImage(cvSize(imageWidth*2,imageHeight),IPL_DEPTH_8U, 3);
// cvSetImageROI(cvResultColorImage1, cvRect(0, 0, imageWidth-1, imageHeight-1));
// cvResize(cvLeftColorImage, cvResultColorImage1);
// cvResetImageROI(cvResultColorImage1);
// cvSetImageROI(cvResultColorImage1, cvRect(imageWidth, 0, imageWidth*2-1, imageHeight-1));
// cvResize(cvRightColorImage, cvResultColorImage1);
// cvResetImageROI(cvResultColorImage1);
// cvCopy(cvResultColorImage1,cvResultColorImage2);
// for(unsigned int pair=0; pair<matchResult.size()/2;pair++){
// lineIDLeft = matchResult[2*pair];
// lineIDRight= matchResult[2*pair+1];
// startPoint = cvPoint(int(linesInLeft[lineIDLeft][0].startPointX),int(linesInLeft[lineIDLeft][0].startPointY));
// endPoint = cvPoint(int(linesInRight[lineIDRight][0].startPointX+imageWidth),int(linesInRight[lineIDRight][0].startPointY));
// cvLine( cvResultColorImage2,startPoint,endPoint,CV_RGB(r1[pair],g1[pair],b1[pair]),2, CV_AA);
// }
// cvAddWeighted( cvResultColorImage1, 0.5, cvResultColorImage2, 0.5, 0.0, cvResultColorImage);
//
// cvSaveImage("LBDSG.png",cvResultColorImage);
// cvReleaseImage(&cvResultColorImage);
// cvReleaseImage(&cvResultColorImage1);
// cvReleaseImage(&cvResultColorImage2);
// cvReleaseImage(&cvLeftImage);
// cvReleaseImage(&cvRightImage);
// cvReleaseImage(&cvLeftColorImage);
// cvReleaseImage(&cvRightColorImage);
// cout<<"number of total matches = "<<matchResult.size()/2<<endl;
///////////####################################################################
///////////####################################################################
}