FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
opencv/modules/core/src/types.cpp at master · pythonmjs/opencv · GitHub
pythonmjs
/
opencv
Public
forked from
opencv/opencv
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
opencv
/
modules
/
core
/
src
/
types.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
210 lines (181 loc) · 7.42 KB
Breadcrumbs
opencv
/
modules
/
core
/
src
/
types.cpp
Copy path
File metadata and controls
210 lines (181 loc) · 7.42 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
/*
M///////////////////////////////////////////////////////////////////////////////////////
//
// 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) 2000-2008, Intel Corporation, all rights reserved.
// Copyright (C) 2009, Willow Garage Inc., all rights reserved.
// Copyright (C) 2013, OpenCV Foundation, all rights reserved.
// Third party copyrights are property of their respective owners.
//
// Redistribution and use in source and binary forms, with or without modification,
// are permitted provided that the following conditions are met:
//
// * Redistribution's of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
//
// * Redistribution's 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.
//
//M
*/
#
include
"
precomp.hpp
"
namespace
cv
{
//
//////////////////// KeyPoint //////////////////////
size_t
KeyPoint::hash
()
const
{
size_t
_Val =
2166136261U
, scale =
16777619U
;
Cv32suf u;
u.
f
= pt.
x
; _Val = (scale * _Val) ^ u.
u
;
u.
f
= pt.
y
; _Val = (scale * _Val) ^ u.
u
;
u.
f
= size; _Val = (scale * _Val) ^ u.
u
;
u.
f
= angle; _Val = (scale * _Val) ^ u.
u
;
u.
f
= response; _Val = (scale * _Val) ^ u.
u
;
_Val = (scale * _Val) ^ ((
size_t
) octave);
_Val = (scale * _Val) ^ ((
size_t
) class_id);
return
_Val;
}
void
KeyPoint::convert
(
const
std::vector<KeyPoint>& keypoints, std::vector<Point2f>& points2f,
const
std::vector<
int
>& keypointIndexes)
{
CV_INSTRUMENT_REGION
()
if
( keypointIndexes.
empty
() )
{
points2f.
resize
( keypoints.
size
() );
for
(
size_t
i =
0
; i < keypoints.
size
(); i++ )
points2f[i] = keypoints[i].
pt
;
}
else
{
points2f.
resize
( keypointIndexes.
size
() );
for
(
size_t
i =
0
; i < keypointIndexes.
size
(); i++ )
{
int
idx = keypointIndexes[i];
if
( idx >=
0
)
points2f[i] = keypoints[idx].
pt
;
else
{
CV_Error
( CV_StsBadArg,
"
keypointIndexes has element < 0. TODO: process this case
"
);
//
points2f[i] = Point2f(-1, -1);
}
}
}
}
void
KeyPoint::convert
(
const
std::vector<Point2f>& points2f, std::vector<KeyPoint>& keypoints,
float
size,
float
response,
int
octave,
int
class_id )
{
CV_INSTRUMENT_REGION
()
keypoints.
resize
(points2f.
size
());
for
(
size_t
i =
0
; i < points2f.
size
(); i++ )
keypoints[i] =
KeyPoint
(points2f[i], size, -
1
, response, octave, class_id);
}
float
KeyPoint::overlap
(
const
KeyPoint& kp1,
const
KeyPoint& kp2 )
{
float
a = kp1.
size
*
0
.
5f
;
float
b = kp2.
size
*
0
.
5f
;
float
a_2 = a * a;
float
b_2 = b * b;
Point2f p1 = kp1.
pt
;
Point2f p2 = kp2.
pt
;
float
c = (
float
)
norm
( p1 - p2 );
float
ovrl =
0
.
f
;
//
one circle is completely encovered by the other => no intersection points!
if
(
std::min
( a, b ) + c <=
std::max
( a, b ) )
return
std::min
( a_2, b_2 ) /
std::max
( a_2, b_2 );
if
( c < a + b )
//
circles intersect
{
float
c_2 = c * c;
float
cosAlpha = ( b_2 + c_2 - a_2 ) / ( kp2.
size
* c );
float
cosBeta = ( a_2 + c_2 - b_2 ) / ( kp1.
size
* c );
float
alpha =
acos
( cosAlpha );
float
beta =
acos
( cosBeta );
float
sinAlpha =
sin
(alpha);
float
sinBeta =
sin
(beta);
float
segmentAreaA = a_2 * beta;
float
segmentAreaB = b_2 * alpha;
float
triangleAreaA = a_2 * sinBeta * cosBeta;
float
triangleAreaB = b_2 * sinAlpha * cosAlpha;
float
intersectionArea = segmentAreaA + segmentAreaB - triangleAreaA - triangleAreaB;
float
unionArea = (a_2 + b_2) * (
float
)
CV_PI
- intersectionArea;
ovrl = intersectionArea / unionArea;
}
return
ovrl;
}
//
//////////////////// RotatedRect //////////////////////
RotatedRect::RotatedRect
(
const
Point2f& _point1,
const
Point2f& _point2,
const
Point2f& _point3)
{
Point2f _center =
0
.
5f
* (_point1 + _point3);
Vec2f vecs[
2
];
vecs[
0
] =
Vec2f
(_point1 - _point2);
vecs[
1
] =
Vec2f
(_point2 - _point3);
//
check that given sides are perpendicular
CV_Assert
(
abs
(vecs[
0
].
dot
(vecs[
1
])) / (
norm
(vecs[
0
]) *
norm
(vecs[
1
])) <=
FLT_EPSILON
);
//
wd_i stores which vector (0,1) or (1,2) will make the width
//
One of them will definitely have slope within -1 to 1
int
wd_i =
0
;
if
(
abs
(vecs[
1
][
1
]) <
abs
(vecs[
1
][
0
]) ) wd_i =
1
;
int
ht_i = (wd_i +
1
) %
2
;
float
_angle =
atan
(vecs[wd_i][
1
] / vecs[wd_i][
0
]) *
180
.
0f
/ (
float
)
CV_PI
;
float
_width = (
float
)
norm
(vecs[wd_i]);
float
_height = (
float
)
norm
(vecs[ht_i]);
center = _center;
size =
Size2f
(_width, _height);
angle = _angle;
}
void
RotatedRect::points
(Point2f pt[])
const
{
double
_angle = angle*
CV_PI
/
180
.;
float
b = (
float
)
cos
(_angle)*
0
.
5f
;
float
a = (
float
)
sin
(_angle)*
0
.
5f
;
pt[
0
].
x
= center.
x
- a*size.
height
- b*size.
width
;
pt[
0
].
y
= center.
y
+ b*size.
height
- a*size.
width
;
pt[
1
].
x
= center.
x
+ a*size.
height
- b*size.
width
;
pt[
1
].
y
= center.
y
- b*size.
height
- a*size.
width
;
pt[
2
].
x
=
2
*center.
x
- pt[
0
].
x
;
pt[
2
].
y
=
2
*center.
y
- pt[
0
].
y
;
pt[
3
].
x
=
2
*center.
x
- pt[
1
].
x
;
pt[
3
].
y
=
2
*center.
y
- pt[
1
].
y
;
}
Rect
RotatedRect::boundingRect
()
const
{
Point2f pt[
4
];
points
(pt);
Rect
r
(
cvFloor
(
std::min
(
std::min
(
std::min
(pt[
0
].
x
, pt[
1
].
x
), pt[
2
].
x
), pt[
3
].
x
)),
cvFloor
(
std::min
(
std::min
(
std::min
(pt[
0
].
y
, pt[
1
].
y
), pt[
2
].
y
), pt[
3
].
y
)),
cvCeil
(
std::max
(
std::max
(
std::max
(pt[
0
].
x
, pt[
1
].
x
), pt[
2
].
x
), pt[
3
].
x
)),
cvCeil
(
std::max
(
std::max
(
std::max
(pt[
0
].
y
, pt[
1
].
y
), pt[
2
].
y
), pt[
3
].
y
)));
r.
width
-= r.
x
-
1
;
r.
height
-= r.
y
-
1
;
return
r;
}
Rect_<
float
>
RotatedRect::boundingRect2f
()
const
{
Point2f pt[
4
];
points
(pt);
Rect_<
float
>
r
(Point_<
float
>(
min
(
min
(
min
(pt[
0
].
x
, pt[
1
].
x
), pt[
2
].
x
), pt[
3
].
x
),
min
(
min
(
min
(pt[
0
].
y
, pt[
1
].
y
), pt[
2
].
y
), pt[
3
].
y
)),
Point_<
float
>(
max
(
max
(
max
(pt[
0
].
x
, pt[
1
].
x
), pt[
2
].
x
), pt[
3
].
x
),
max
(
max
(
max
(pt[
0
].
y
, pt[
1
].
y
), pt[
2
].
y
), pt[
3
].
y
)));
return
r;
}
}
//
cv
Back
|
FazBrowse Home
|
New Git URL