Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
Greenplum
Opencv
提交
7a187e9b
O
Opencv
项目概览
Greenplum
/
Opencv
12 个月 前同步成功
通知
7
Star
0
Fork
0
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
DevOps
流水线
流水线任务
计划
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
O
Opencv
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
DevOps
DevOps
流水线
流水线任务
计划
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
流水线任务
提交
Issue看板
体验新版 GitCode,发现更多精彩内容 >>
提交
7a187e9b
编写于
6月 08, 2020
作者:
M
Maksim Shabunin
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
QRDetectMulti: refactored checkPoints method
上级
9096b1c7
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
29 addition
and
48 deletion
+29
-48
modules/objdetect/src/qrcode.cpp
modules/objdetect/src/qrcode.cpp
+29
-48
未找到文件。
modules/objdetect/src/qrcode.cpp
浏览文件 @
7a187e9b
...
...
@@ -17,6 +17,7 @@
#include <cmath>
#include <iostream>
#include <queue>
#include <limits>
namespace
cv
{
...
...
@@ -1293,7 +1294,7 @@ protected:
void
deleteUsedPoints
(
vector
<
vector
<
Point2f
>
>&
true_points_group
,
vector
<
vector
<
Point2f
>
>&
loc
,
vector
<
Point2f
>&
tmp_localization_points
);
void
fixationPoints
(
vector
<
Point2f
>
&
local_point
);
bool
checkPoints
(
const
vector
<
Point2f
>&
quadrangle_points
);
bool
checkPoints
(
vector
<
Point2f
>
quadrangle_points
);
bool
checkPointsInsideQuadrangle
(
const
vector
<
Point2f
>&
quadrangle_points
);
bool
checkPointsInsideTriangle
(
const
vector
<
Point2f
>&
triangle_points
);
...
...
@@ -1571,59 +1572,39 @@ void QRDetectMulti::fixationPoints(vector<Point2f> &local_point)
}
}
bool
QRDetectMulti
::
checkPoints
(
const
vector
<
Point2f
>&
quadrangle_points
)
class
BWCounter
{
if
(
quadrangle_points
.
size
()
!=
4
)
return
false
;
vector
<
Point2f
>
quadrangle
=
quadrangle_points
;
std
::
sort
(
quadrangle
.
begin
(),
quadrangle
.
end
(),
compareDistanse_y
());
LineIterator
it1
(
bin_barcode_fullsize
,
quadrangle
[
1
],
quadrangle
[
0
]);
LineIterator
it2
(
bin_barcode_fullsize
,
quadrangle
[
2
],
quadrangle
[
0
]);
LineIterator
it3
(
bin_barcode_fullsize
,
quadrangle
[
1
],
quadrangle
[
3
]);
LineIterator
it4
(
bin_barcode_fullsize
,
quadrangle
[
2
],
quadrangle
[
3
]);
vector
<
LineIterator
>
list_line_iter
;
list_line_iter
.
push_back
(
it1
);
list_line_iter
.
push_back
(
it2
);
list_line_iter
.
push_back
(
it3
);
list_line_iter
.
push_back
(
it4
);
int
count_w
=
0
;
int
count_b
=
0
;
for
(
int
j
=
0
;
j
<
3
;
j
+=
2
)
{
LineIterator
&
li
=
list_line_iter
[
j
];
LineIterator
&
li2
=
list_line_iter
[
j
+
1
];
for
(
int
i
=
0
;
i
<
li
.
count
;
i
++
)
size_t
white
;
size_t
black
;
public:
BWCounter
(
size_t
b
=
0
,
size_t
w
=
0
)
:
white
(
w
),
black
(
b
)
{}
BWCounter
&
operator
+=
(
const
BWCounter
&
other
)
{
black
+=
other
.
black
;
white
+=
other
.
white
;
return
*
this
;
}
void
count1
(
uchar
pixel
)
{
if
(
pixel
==
255
)
white
++
;
else
if
(
pixel
==
0
)
black
++
;
}
double
getBWFraction
()
const
{
return
white
==
0
?
std
::
numeric_limits
<
double
>::
infinity
()
:
double
(
black
)
/
double
(
white
);
}
static
BWCounter
checkOnePair
(
const
Point2f
&
tl
,
const
Point2f
&
tr
,
const
Point2f
&
bl
,
const
Point2f
&
br
,
const
Mat
&
img
)
{
BWCounter
res
;
LineIterator
li1
(
img
,
tl
,
tr
),
li2
(
img
,
bl
,
br
);
for
(
int
i
=
0
;
i
<
li1
.
count
&&
i
<
li2
.
count
;
i
++
,
li1
++
,
li2
++
)
{
Point
pt1
=
li
.
pos
();
Point
pt2
=
li2
.
pos
();
LineIterator
it0
(
bin_barcode_fullsize
,
pt1
,
pt2
);
for
(
int
r
=
0
;
r
<
it0
.
count
;
r
++
)
{
int
pixel
=
bin_barcode
.
at
<
uchar
>
(
it0
.
pos
().
y
,
it0
.
pos
().
x
);
if
(
pixel
==
255
)
{
count_w
++
;
}
if
(
pixel
==
0
)
{
count_b
++
;
}
it0
++
;
}
li
++
;
li2
++
;
LineIterator
it
(
img
,
li1
.
pos
(),
li2
.
pos
());
for
(
int
r
=
0
;
r
<
it
.
count
;
r
++
,
it
++
)
res
.
count1
(
img
.
at
<
uchar
>
(
it
.
pos
()));
}
return
res
;
}
if
(
count_w
==
0
)
return
false
;
};
double
frac
=
double
(
count_b
)
/
double
(
count_w
);
double
bottom_bound
=
0.76
;
double
upper_bound
=
1.24
;
if
((
frac
<=
bottom_bound
)
||
(
frac
>=
upper_bound
))
bool
QRDetectMulti
::
checkPoints
(
vector
<
Point2f
>
quadrangle
)
{
if
(
quadrangle
.
size
()
!=
4
)
return
false
;
return
true
;
std
::
sort
(
quadrangle
.
begin
(),
quadrangle
.
end
(),
compareDistanse_y
());
BWCounter
s
;
s
+=
BWCounter
::
checkOnePair
(
quadrangle
[
1
],
quadrangle
[
0
],
quadrangle
[
2
],
quadrangle
[
0
],
bin_barcode
);
s
+=
BWCounter
::
checkOnePair
(
quadrangle
[
1
],
quadrangle
[
3
],
quadrangle
[
2
],
quadrangle
[
3
],
bin_barcode
);
const
double
frac
=
s
.
getBWFraction
();
return
frac
>
0.76
&&
frac
<
1.24
;
}
bool
QRDetectMulti
::
checkPointsInsideQuadrangle
(
const
vector
<
Point2f
>&
quadrangle_points
)
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录