ssd_mobilenet_v2_coco_2018_03_29
#9
by SavyaSanchi - opened
This view is limited to 50 files because it contains too many changes. See the raw diff here.
- .gitignore +0 -3
- east_text_detection/LICENSE +0 -674
- east_text_detection/README.md +0 -67
- east_text_detection/convert_to_onnx.py +0 -44
- east_text_detection/demo.cpp +0 -49
- east_text_detection/demo.py +0 -39
- east_text_detection/east_text_detection_2026jul.onnx +0 -3
- east_text_detection/example_outputs/input_image.png +0 -3
- east_text_detection/example_outputs/output_image.png +0 -3
- efficientdet-d0/LICENSE +0 -203
- efficientdet-d0/README.md +0 -62
- efficientdet-d0/convert_to_onnx.py +0 -41
- efficientdet-d0/demo.cpp +0 -127
- efficientdet-d0/demo.py +0 -105
- efficientdet-d0/efficientdet-d0_2026jul.onnx +0 -3
- efficientdet-d0/example_outputs/input_image.png +0 -3
- efficientdet-d0/example_outputs/output_image.png +0 -3
- faster_rcnn_inception_v2_coco_2018_01_28/LICENSE +0 -203
- faster_rcnn_inception_v2_coco_2018_01_28/README.md +0 -49
- faster_rcnn_inception_v2_coco_2018_01_28/convert_to_onnx.py +0 -40
- faster_rcnn_inception_v2_coco_2018_01_28/demo.cpp +0 -83
- faster_rcnn_inception_v2_coco_2018_01_28/demo.py +0 -51
- faster_rcnn_inception_v2_coco_2018_01_28/example_outputs/input_image.png +0 -3
- faster_rcnn_inception_v2_coco_2018_01_28/example_outputs/output_image.png +0 -3
- faster_rcnn_inception_v2_coco_2018_01_28/faster_rcnn_inception_v2_coco_2018_01_28_2026jul.onnx +0 -3
- faster_rcnn_resnet50_coco_2018_01_28/LICENSE +0 -203
- faster_rcnn_resnet50_coco_2018_01_28/README.md +0 -49
- faster_rcnn_resnet50_coco_2018_01_28/convert_to_onnx.py +0 -40
- faster_rcnn_resnet50_coco_2018_01_28/demo.cpp +0 -83
- faster_rcnn_resnet50_coco_2018_01_28/demo.py +0 -51
- faster_rcnn_resnet50_coco_2018_01_28/example_outputs/input_image.png +0 -3
- faster_rcnn_resnet50_coco_2018_01_28/example_outputs/output_image.png +0 -3
- faster_rcnn_resnet50_coco_2018_01_28/faster_rcnn_resnet50_coco_2018_01_28_2026jul.onnx +0 -3
- human_parsing_jppnet/LICENSE +0 -21
- human_parsing_jppnet/README.md +0 -127
- human_parsing_jppnet/convert_to_onnx.py +0 -131
- human_parsing_jppnet/demo.cpp +0 -143
- human_parsing_jppnet/demo.py +0 -99
- human_parsing_jppnet/example_outputs/input_image.png +0 -3
- human_parsing_jppnet/example_outputs/output_image.png +0 -3
- human_parsing_jppnet/human_parsing_jppnet_2026sep.onnx +0 -3
- lapsrn/LICENSE +0 -202
- lapsrn/README.md +0 -128
- lapsrn/convert_to_onnx.py +0 -134
- lapsrn/demo.cpp +0 -83
- lapsrn/demo.py +0 -60
- lapsrn/example_outputs/input_image.png +0 -3
- lapsrn/example_outputs/output_image_2x.png +0 -3
- lapsrn/example_outputs/output_image_4x.png +0 -3
- lapsrn/lapsrn_x4_2026sep.onnx +0 -3
.gitignore
DELETED
|
@@ -1,3 +0,0 @@
|
|
| 1 |
-
ssd_mobilenet_v2_coco_2018_03_29/demo
|
| 2 |
-
|
| 3 |
-
**/demo
|
|
|
|
|
|
|
|
|
|
|
|
east_text_detection/LICENSE
DELETED
|
@@ -1,674 +0,0 @@
|
|
| 1 |
-
GNU GENERAL PUBLIC LICENSE
|
| 2 |
-
Version 3, 29 June 2007
|
| 3 |
-
|
| 4 |
-
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
| 5 |
-
Everyone is permitted to copy and distribute verbatim copies
|
| 6 |
-
of this license document, but changing it is not allowed.
|
| 7 |
-
|
| 8 |
-
Preamble
|
| 9 |
-
|
| 10 |
-
The GNU General Public License is a free, copyleft license for
|
| 11 |
-
software and other kinds of works.
|
| 12 |
-
|
| 13 |
-
The licenses for most software and other practical works are designed
|
| 14 |
-
to take away your freedom to share and change the works. By contrast,
|
| 15 |
-
the GNU General Public License is intended to guarantee your freedom to
|
| 16 |
-
share and change all versions of a program--to make sure it remains free
|
| 17 |
-
software for all its users. We, the Free Software Foundation, use the
|
| 18 |
-
GNU General Public License for most of our software; it applies also to
|
| 19 |
-
any other work released this way by its authors. You can apply it to
|
| 20 |
-
your programs, too.
|
| 21 |
-
|
| 22 |
-
When we speak of free software, we are referring to freedom, not
|
| 23 |
-
price. Our General Public Licenses are designed to make sure that you
|
| 24 |
-
have the freedom to distribute copies of free software (and charge for
|
| 25 |
-
them if you wish), that you receive source code or can get it if you
|
| 26 |
-
want it, that you can change the software or use pieces of it in new
|
| 27 |
-
free programs, and that you know you can do these things.
|
| 28 |
-
|
| 29 |
-
To protect your rights, we need to prevent others from denying you
|
| 30 |
-
these rights or asking you to surrender the rights. Therefore, you have
|
| 31 |
-
certain responsibilities if you distribute copies of the software, or if
|
| 32 |
-
you modify it: responsibilities to respect the freedom of others.
|
| 33 |
-
|
| 34 |
-
For example, if you distribute copies of such a program, whether
|
| 35 |
-
gratis or for a fee, you must pass on to the recipients the same
|
| 36 |
-
freedoms that you received. You must make sure that they, too, receive
|
| 37 |
-
or can get the source code. And you must show them these terms so they
|
| 38 |
-
know their rights.
|
| 39 |
-
|
| 40 |
-
Developers that use the GNU GPL protect your rights with two steps:
|
| 41 |
-
(1) assert copyright on the software, and (2) offer you this License
|
| 42 |
-
giving you legal permission to copy, distribute and/or modify it.
|
| 43 |
-
|
| 44 |
-
For the developers' and authors' protection, the GPL clearly explains
|
| 45 |
-
that there is no warranty for this free software. For both users' and
|
| 46 |
-
authors' sake, the GPL requires that modified versions be marked as
|
| 47 |
-
changed, so that their problems will not be attributed erroneously to
|
| 48 |
-
authors of previous versions.
|
| 49 |
-
|
| 50 |
-
Some devices are designed to deny users access to install or run
|
| 51 |
-
modified versions of the software inside them, although the manufacturer
|
| 52 |
-
can do so. This is fundamentally incompatible with the aim of
|
| 53 |
-
protecting users' freedom to change the software. The systematic
|
| 54 |
-
pattern of such abuse occurs in the area of products for individuals to
|
| 55 |
-
use, which is precisely where it is most unacceptable. Therefore, we
|
| 56 |
-
have designed this version of the GPL to prohibit the practice for those
|
| 57 |
-
products. If such problems arise substantially in other domains, we
|
| 58 |
-
stand ready to extend this provision to those domains in future versions
|
| 59 |
-
of the GPL, as needed to protect the freedom of users.
|
| 60 |
-
|
| 61 |
-
Finally, every program is threatened constantly by software patents.
|
| 62 |
-
States should not allow patents to restrict development and use of
|
| 63 |
-
software on general-purpose computers, but in those that do, we wish to
|
| 64 |
-
avoid the special danger that patents applied to a free program could
|
| 65 |
-
make it effectively proprietary. To prevent this, the GPL assures that
|
| 66 |
-
patents cannot be used to render the program non-free.
|
| 67 |
-
|
| 68 |
-
The precise terms and conditions for copying, distribution and
|
| 69 |
-
modification follow.
|
| 70 |
-
|
| 71 |
-
TERMS AND CONDITIONS
|
| 72 |
-
|
| 73 |
-
0. Definitions.
|
| 74 |
-
|
| 75 |
-
"This License" refers to version 3 of the GNU General Public License.
|
| 76 |
-
|
| 77 |
-
"Copyright" also means copyright-like laws that apply to other kinds of
|
| 78 |
-
works, such as semiconductor masks.
|
| 79 |
-
|
| 80 |
-
"The Program" refers to any copyrightable work licensed under this
|
| 81 |
-
License. Each licensee is addressed as "you". "Licensees" and
|
| 82 |
-
"recipients" may be individuals or organizations.
|
| 83 |
-
|
| 84 |
-
To "modify" a work means to copy from or adapt all or part of the work
|
| 85 |
-
in a fashion requiring copyright permission, other than the making of an
|
| 86 |
-
exact copy. The resulting work is called a "modified version" of the
|
| 87 |
-
earlier work or a work "based on" the earlier work.
|
| 88 |
-
|
| 89 |
-
A "covered work" means either the unmodified Program or a work based
|
| 90 |
-
on the Program.
|
| 91 |
-
|
| 92 |
-
To "propagate" a work means to do anything with it that, without
|
| 93 |
-
permission, would make you directly or secondarily liable for
|
| 94 |
-
infringement under applicable copyright law, except executing it on a
|
| 95 |
-
computer or modifying a private copy. Propagation includes copying,
|
| 96 |
-
distribution (with or without modification), making available to the
|
| 97 |
-
public, and in some countries other activities as well.
|
| 98 |
-
|
| 99 |
-
To "convey" a work means any kind of propagation that enables other
|
| 100 |
-
parties to make or receive copies. Mere interaction with a user through
|
| 101 |
-
a computer network, with no transfer of a copy, is not conveying.
|
| 102 |
-
|
| 103 |
-
An interactive user interface displays "Appropriate Legal Notices"
|
| 104 |
-
to the extent that it includes a convenient and prominently visible
|
| 105 |
-
feature that (1) displays an appropriate copyright notice, and (2)
|
| 106 |
-
tells the user that there is no warranty for the work (except to the
|
| 107 |
-
extent that warranties are provided), that licensees may convey the
|
| 108 |
-
work under this License, and how to view a copy of this License. If
|
| 109 |
-
the interface presents a list of user commands or options, such as a
|
| 110 |
-
menu, a prominent item in the list meets this criterion.
|
| 111 |
-
|
| 112 |
-
1. Source Code.
|
| 113 |
-
|
| 114 |
-
The "source code" for a work means the preferred form of the work
|
| 115 |
-
for making modifications to it. "Object code" means any non-source
|
| 116 |
-
form of a work.
|
| 117 |
-
|
| 118 |
-
A "Standard Interface" means an interface that either is an official
|
| 119 |
-
standard defined by a recognized standards body, or, in the case of
|
| 120 |
-
interfaces specified for a particular programming language, one that
|
| 121 |
-
is widely used among developers working in that language.
|
| 122 |
-
|
| 123 |
-
The "System Libraries" of an executable work include anything, other
|
| 124 |
-
than the work as a whole, that (a) is included in the normal form of
|
| 125 |
-
packaging a Major Component, but which is not part of that Major
|
| 126 |
-
Component, and (b) serves only to enable use of the work with that
|
| 127 |
-
Major Component, or to implement a Standard Interface for which an
|
| 128 |
-
implementation is available to the public in source code form. A
|
| 129 |
-
"Major Component", in this context, means a major essential component
|
| 130 |
-
(kernel, window system, and so on) of the specific operating system
|
| 131 |
-
(if any) on which the executable work runs, or a compiler used to
|
| 132 |
-
produce the work, or an object code interpreter used to run it.
|
| 133 |
-
|
| 134 |
-
The "Corresponding Source" for a work in object code form means all
|
| 135 |
-
the source code needed to generate, install, and (for an executable
|
| 136 |
-
work) run the object code and to modify the work, including scripts to
|
| 137 |
-
control those activities. However, it does not include the work's
|
| 138 |
-
System Libraries, or general-purpose tools or generally available free
|
| 139 |
-
programs which are used unmodified in performing those activities but
|
| 140 |
-
which are not part of the work. For example, Corresponding Source
|
| 141 |
-
includes interface definition files associated with source files for
|
| 142 |
-
the work, and the source code for shared libraries and dynamically
|
| 143 |
-
linked subprograms that the work is specifically designed to require,
|
| 144 |
-
such as by intimate data communication or control flow between those
|
| 145 |
-
subprograms and other parts of the work.
|
| 146 |
-
|
| 147 |
-
The Corresponding Source need not include anything that users
|
| 148 |
-
can regenerate automatically from other parts of the Corresponding
|
| 149 |
-
Source.
|
| 150 |
-
|
| 151 |
-
The Corresponding Source for a work in source code form is that
|
| 152 |
-
same work.
|
| 153 |
-
|
| 154 |
-
2. Basic Permissions.
|
| 155 |
-
|
| 156 |
-
All rights granted under this License are granted for the term of
|
| 157 |
-
copyright on the Program, and are irrevocable provided the stated
|
| 158 |
-
conditions are met. This License explicitly affirms your unlimited
|
| 159 |
-
permission to run the unmodified Program. The output from running a
|
| 160 |
-
covered work is covered by this License only if the output, given its
|
| 161 |
-
content, constitutes a covered work. This License acknowledges your
|
| 162 |
-
rights of fair use or other equivalent, as provided by copyright law.
|
| 163 |
-
|
| 164 |
-
You may make, run and propagate covered works that you do not
|
| 165 |
-
convey, without conditions so long as your license otherwise remains
|
| 166 |
-
in force. You may convey covered works to others for the sole purpose
|
| 167 |
-
of having them make modifications exclusively for you, or provide you
|
| 168 |
-
with facilities for running those works, provided that you comply with
|
| 169 |
-
the terms of this License in conveying all material for which you do
|
| 170 |
-
not control copyright. Those thus making or running the covered works
|
| 171 |
-
for you must do so exclusively on your behalf, under your direction
|
| 172 |
-
and control, on terms that prohibit them from making any copies of
|
| 173 |
-
your copyrighted material outside their relationship with you.
|
| 174 |
-
|
| 175 |
-
Conveying under any other circumstances is permitted solely under
|
| 176 |
-
the conditions stated below. Sublicensing is not allowed; section 10
|
| 177 |
-
makes it unnecessary.
|
| 178 |
-
|
| 179 |
-
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
| 180 |
-
|
| 181 |
-
No covered work shall be deemed part of an effective technological
|
| 182 |
-
measure under any applicable law fulfilling obligations under article
|
| 183 |
-
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
| 184 |
-
similar laws prohibiting or restricting circumvention of such
|
| 185 |
-
measures.
|
| 186 |
-
|
| 187 |
-
When you convey a covered work, you waive any legal power to forbid
|
| 188 |
-
circumvention of technological measures to the extent such circumvention
|
| 189 |
-
is effected by exercising rights under this License with respect to
|
| 190 |
-
the covered work, and you disclaim any intention to limit operation or
|
| 191 |
-
modification of the work as a means of enforcing, against the work's
|
| 192 |
-
users, your or third parties' legal rights to forbid circumvention of
|
| 193 |
-
technological measures.
|
| 194 |
-
|
| 195 |
-
4. Conveying Verbatim Copies.
|
| 196 |
-
|
| 197 |
-
You may convey verbatim copies of the Program's source code as you
|
| 198 |
-
receive it, in any medium, provided that you conspicuously and
|
| 199 |
-
appropriately publish on each copy an appropriate copyright notice;
|
| 200 |
-
keep intact all notices stating that this License and any
|
| 201 |
-
non-permissive terms added in accord with section 7 apply to the code;
|
| 202 |
-
keep intact all notices of the absence of any warranty; and give all
|
| 203 |
-
recipients a copy of this License along with the Program.
|
| 204 |
-
|
| 205 |
-
You may charge any price or no price for each copy that you convey,
|
| 206 |
-
and you may offer support or warranty protection for a fee.
|
| 207 |
-
|
| 208 |
-
5. Conveying Modified Source Versions.
|
| 209 |
-
|
| 210 |
-
You may convey a work based on the Program, or the modifications to
|
| 211 |
-
produce it from the Program, in the form of source code under the
|
| 212 |
-
terms of section 4, provided that you also meet all of these conditions:
|
| 213 |
-
|
| 214 |
-
a) The work must carry prominent notices stating that you modified
|
| 215 |
-
it, and giving a relevant date.
|
| 216 |
-
|
| 217 |
-
b) The work must carry prominent notices stating that it is
|
| 218 |
-
released under this License and any conditions added under section
|
| 219 |
-
7. This requirement modifies the requirement in section 4 to
|
| 220 |
-
"keep intact all notices".
|
| 221 |
-
|
| 222 |
-
c) You must license the entire work, as a whole, under this
|
| 223 |
-
License to anyone who comes into possession of a copy. This
|
| 224 |
-
License will therefore apply, along with any applicable section 7
|
| 225 |
-
additional terms, to the whole of the work, and all its parts,
|
| 226 |
-
regardless of how they are packaged. This License gives no
|
| 227 |
-
permission to license the work in any other way, but it does not
|
| 228 |
-
invalidate such permission if you have separately received it.
|
| 229 |
-
|
| 230 |
-
d) If the work has interactive user interfaces, each must display
|
| 231 |
-
Appropriate Legal Notices; however, if the Program has interactive
|
| 232 |
-
interfaces that do not display Appropriate Legal Notices, your
|
| 233 |
-
work need not make them do so.
|
| 234 |
-
|
| 235 |
-
A compilation of a covered work with other separate and independent
|
| 236 |
-
works, which are not by their nature extensions of the covered work,
|
| 237 |
-
and which are not combined with it such as to form a larger program,
|
| 238 |
-
in or on a volume of a storage or distribution medium, is called an
|
| 239 |
-
"aggregate" if the compilation and its resulting copyright are not
|
| 240 |
-
used to limit the access or legal rights of the compilation's users
|
| 241 |
-
beyond what the individual works permit. Inclusion of a covered work
|
| 242 |
-
in an aggregate does not cause this License to apply to the other
|
| 243 |
-
parts of the aggregate.
|
| 244 |
-
|
| 245 |
-
6. Conveying Non-Source Forms.
|
| 246 |
-
|
| 247 |
-
You may convey a covered work in object code form under the terms
|
| 248 |
-
of sections 4 and 5, provided that you also convey the
|
| 249 |
-
machine-readable Corresponding Source under the terms of this License,
|
| 250 |
-
in one of these ways:
|
| 251 |
-
|
| 252 |
-
a) Convey the object code in, or embodied in, a physical product
|
| 253 |
-
(including a physical distribution medium), accompanied by the
|
| 254 |
-
Corresponding Source fixed on a durable physical medium
|
| 255 |
-
customarily used for software interchange.
|
| 256 |
-
|
| 257 |
-
b) Convey the object code in, or embodied in, a physical product
|
| 258 |
-
(including a physical distribution medium), accompanied by a
|
| 259 |
-
written offer, valid for at least three years and valid for as
|
| 260 |
-
long as you offer spare parts or customer support for that product
|
| 261 |
-
model, to give anyone who possesses the object code either (1) a
|
| 262 |
-
copy of the Corresponding Source for all the software in the
|
| 263 |
-
product that is covered by this License, on a durable physical
|
| 264 |
-
medium customarily used for software interchange, for a price no
|
| 265 |
-
more than your reasonable cost of physically performing this
|
| 266 |
-
conveying of source, or (2) access to copy the
|
| 267 |
-
Corresponding Source from a network server at no charge.
|
| 268 |
-
|
| 269 |
-
c) Convey individual copies of the object code with a copy of the
|
| 270 |
-
written offer to provide the Corresponding Source. This
|
| 271 |
-
alternative is allowed only occasionally and noncommercially, and
|
| 272 |
-
only if you received the object code with such an offer, in accord
|
| 273 |
-
with subsection 6b.
|
| 274 |
-
|
| 275 |
-
d) Convey the object code by offering access from a designated
|
| 276 |
-
place (gratis or for a charge), and offer equivalent access to the
|
| 277 |
-
Corresponding Source in the same way through the same place at no
|
| 278 |
-
further charge. You need not require recipients to copy the
|
| 279 |
-
Corresponding Source along with the object code. If the place to
|
| 280 |
-
copy the object code is a network server, the Corresponding Source
|
| 281 |
-
may be on a different server (operated by you or a third party)
|
| 282 |
-
that supports equivalent copying facilities, provided you maintain
|
| 283 |
-
clear directions next to the object code saying where to find the
|
| 284 |
-
Corresponding Source. Regardless of what server hosts the
|
| 285 |
-
Corresponding Source, you remain obligated to ensure that it is
|
| 286 |
-
available for as long as needed to satisfy these requirements.
|
| 287 |
-
|
| 288 |
-
e) Convey the object code using peer-to-peer transmission, provided
|
| 289 |
-
you inform other peers where the object code and Corresponding
|
| 290 |
-
Source of the work are being offered to the general public at no
|
| 291 |
-
charge under subsection 6d.
|
| 292 |
-
|
| 293 |
-
A separable portion of the object code, whose source code is excluded
|
| 294 |
-
from the Corresponding Source as a System Library, need not be
|
| 295 |
-
included in conveying the object code work.
|
| 296 |
-
|
| 297 |
-
A "User Product" is either (1) a "consumer product", which means any
|
| 298 |
-
tangible personal property which is normally used for personal, family,
|
| 299 |
-
or household purposes, or (2) anything designed or sold for incorporation
|
| 300 |
-
into a dwelling. In determining whether a product is a consumer product,
|
| 301 |
-
doubtful cases shall be resolved in favor of coverage. For a particular
|
| 302 |
-
product received by a particular user, "normally used" refers to a
|
| 303 |
-
typical or common use of that class of product, regardless of the status
|
| 304 |
-
of the particular user or of the way in which the particular user
|
| 305 |
-
actually uses, or expects or is expected to use, the product. A product
|
| 306 |
-
is a consumer product regardless of whether the product has substantial
|
| 307 |
-
commercial, industrial or non-consumer uses, unless such uses represent
|
| 308 |
-
the only significant mode of use of the product.
|
| 309 |
-
|
| 310 |
-
"Installation Information" for a User Product means any methods,
|
| 311 |
-
procedures, authorization keys, or other information required to install
|
| 312 |
-
and execute modified versions of a covered work in that User Product from
|
| 313 |
-
a modified version of its Corresponding Source. The information must
|
| 314 |
-
suffice to ensure that the continued functioning of the modified object
|
| 315 |
-
code is in no case prevented or interfered with solely because
|
| 316 |
-
modification has been made.
|
| 317 |
-
|
| 318 |
-
If you convey an object code work under this section in, or with, or
|
| 319 |
-
specifically for use in, a User Product, and the conveying occurs as
|
| 320 |
-
part of a transaction in which the right of possession and use of the
|
| 321 |
-
User Product is transferred to the recipient in perpetuity or for a
|
| 322 |
-
fixed term (regardless of how the transaction is characterized), the
|
| 323 |
-
Corresponding Source conveyed under this section must be accompanied
|
| 324 |
-
by the Installation Information. But this requirement does not apply
|
| 325 |
-
if neither you nor any third party retains the ability to install
|
| 326 |
-
modified object code on the User Product (for example, the work has
|
| 327 |
-
been installed in ROM).
|
| 328 |
-
|
| 329 |
-
The requirement to provide Installation Information does not include a
|
| 330 |
-
requirement to continue to provide support service, warranty, or updates
|
| 331 |
-
for a work that has been modified or installed by the recipient, or for
|
| 332 |
-
the User Product in which it has been modified or installed. Access to a
|
| 333 |
-
network may be denied when the modification itself materially and
|
| 334 |
-
adversely affects the operation of the network or violates the rules and
|
| 335 |
-
protocols for communication across the network.
|
| 336 |
-
|
| 337 |
-
Corresponding Source conveyed, and Installation Information provided,
|
| 338 |
-
in accord with this section must be in a format that is publicly
|
| 339 |
-
documented (and with an implementation available to the public in
|
| 340 |
-
source code form), and must require no special password or key for
|
| 341 |
-
unpacking, reading or copying.
|
| 342 |
-
|
| 343 |
-
7. Additional Terms.
|
| 344 |
-
|
| 345 |
-
"Additional permissions" are terms that supplement the terms of this
|
| 346 |
-
License by making exceptions from one or more of its conditions.
|
| 347 |
-
Additional permissions that are applicable to the entire Program shall
|
| 348 |
-
be treated as though they were included in this License, to the extent
|
| 349 |
-
that they are valid under applicable law. If additional permissions
|
| 350 |
-
apply only to part of the Program, that part may be used separately
|
| 351 |
-
under those permissions, but the entire Program remains governed by
|
| 352 |
-
this License without regard to the additional permissions.
|
| 353 |
-
|
| 354 |
-
When you convey a copy of a covered work, you may at your option
|
| 355 |
-
remove any additional permissions from that copy, or from any part of
|
| 356 |
-
it. (Additional permissions may be written to require their own
|
| 357 |
-
removal in certain cases when you modify the work.) You may place
|
| 358 |
-
additional permissions on material, added by you to a covered work,
|
| 359 |
-
for which you have or can give appropriate copyright permission.
|
| 360 |
-
|
| 361 |
-
Notwithstanding any other provision of this License, for material you
|
| 362 |
-
add to a covered work, you may (if authorized by the copyright holders of
|
| 363 |
-
that material) supplement the terms of this License with terms:
|
| 364 |
-
|
| 365 |
-
a) Disclaiming warranty or limiting liability differently from the
|
| 366 |
-
terms of sections 15 and 16 of this License; or
|
| 367 |
-
|
| 368 |
-
b) Requiring preservation of specified reasonable legal notices or
|
| 369 |
-
author attributions in that material or in the Appropriate Legal
|
| 370 |
-
Notices displayed by works containing it; or
|
| 371 |
-
|
| 372 |
-
c) Prohibiting misrepresentation of the origin of that material, or
|
| 373 |
-
requiring that modified versions of such material be marked in
|
| 374 |
-
reasonable ways as different from the original version; or
|
| 375 |
-
|
| 376 |
-
d) Limiting the use for publicity purposes of names of licensors or
|
| 377 |
-
authors of the material; or
|
| 378 |
-
|
| 379 |
-
e) Declining to grant rights under trademark law for use of some
|
| 380 |
-
trade names, trademarks, or service marks; or
|
| 381 |
-
|
| 382 |
-
f) Requiring indemnification of licensors and authors of that
|
| 383 |
-
material by anyone who conveys the material (or modified versions of
|
| 384 |
-
it) with contractual assumptions of liability to the recipient, for
|
| 385 |
-
any liability that these contractual assumptions directly impose on
|
| 386 |
-
those licensors and authors.
|
| 387 |
-
|
| 388 |
-
All other non-permissive additional terms are considered "further
|
| 389 |
-
restrictions" within the meaning of section 10. If the Program as you
|
| 390 |
-
received it, or any part of it, contains a notice stating that it is
|
| 391 |
-
governed by this License along with a term that is a further
|
| 392 |
-
restriction, you may remove that term. If a license document contains
|
| 393 |
-
a further restriction but permits relicensing or conveying under this
|
| 394 |
-
License, you may add to a covered work material governed by the terms
|
| 395 |
-
of that license document, provided that the further restriction does
|
| 396 |
-
not survive such relicensing or conveying.
|
| 397 |
-
|
| 398 |
-
If you add terms to a covered work in accord with this section, you
|
| 399 |
-
must place, in the relevant source files, a statement of the
|
| 400 |
-
additional terms that apply to those files, or a notice indicating
|
| 401 |
-
where to find the applicable terms.
|
| 402 |
-
|
| 403 |
-
Additional terms, permissive or non-permissive, may be stated in the
|
| 404 |
-
form of a separately written license, or stated as exceptions;
|
| 405 |
-
the above requirements apply either way.
|
| 406 |
-
|
| 407 |
-
8. Termination.
|
| 408 |
-
|
| 409 |
-
You may not propagate or modify a covered work except as expressly
|
| 410 |
-
provided under this License. Any attempt otherwise to propagate or
|
| 411 |
-
modify it is void, and will automatically terminate your rights under
|
| 412 |
-
this License (including any patent licenses granted under the third
|
| 413 |
-
paragraph of section 11).
|
| 414 |
-
|
| 415 |
-
However, if you cease all violation of this License, then your
|
| 416 |
-
license from a particular copyright holder is reinstated (a)
|
| 417 |
-
provisionally, unless and until the copyright holder explicitly and
|
| 418 |
-
finally terminates your license, and (b) permanently, if the copyright
|
| 419 |
-
holder fails to notify you of the violation by some reasonable means
|
| 420 |
-
prior to 60 days after the cessation.
|
| 421 |
-
|
| 422 |
-
Moreover, your license from a particular copyright holder is
|
| 423 |
-
reinstated permanently if the copyright holder notifies you of the
|
| 424 |
-
violation by some reasonable means, this is the first time you have
|
| 425 |
-
received notice of violation of this License (for any work) from that
|
| 426 |
-
copyright holder, and you cure the violation prior to 30 days after
|
| 427 |
-
your receipt of the notice.
|
| 428 |
-
|
| 429 |
-
Termination of your rights under this section does not terminate the
|
| 430 |
-
licenses of parties who have received copies or rights from you under
|
| 431 |
-
this License. If your rights have been terminated and not permanently
|
| 432 |
-
reinstated, you do not qualify to receive new licenses for the same
|
| 433 |
-
material under section 10.
|
| 434 |
-
|
| 435 |
-
9. Acceptance Not Required for Having Copies.
|
| 436 |
-
|
| 437 |
-
You are not required to accept this License in order to receive or
|
| 438 |
-
run a copy of the Program. Ancillary propagation of a covered work
|
| 439 |
-
occurring solely as a consequence of using peer-to-peer transmission
|
| 440 |
-
to receive a copy likewise does not require acceptance. However,
|
| 441 |
-
nothing other than this License grants you permission to propagate or
|
| 442 |
-
modify any covered work. These actions infringe copyright if you do
|
| 443 |
-
not accept this License. Therefore, by modifying or propagating a
|
| 444 |
-
covered work, you indicate your acceptance of this License to do so.
|
| 445 |
-
|
| 446 |
-
10. Automatic Licensing of Downstream Recipients.
|
| 447 |
-
|
| 448 |
-
Each time you convey a covered work, the recipient automatically
|
| 449 |
-
receives a license from the original licensors, to run, modify and
|
| 450 |
-
propagate that work, subject to this License. You are not responsible
|
| 451 |
-
for enforcing compliance by third parties with this License.
|
| 452 |
-
|
| 453 |
-
An "entity transaction" is a transaction transferring control of an
|
| 454 |
-
organization, or substantially all assets of one, or subdividing an
|
| 455 |
-
organization, or merging organizations. If propagation of a covered
|
| 456 |
-
work results from an entity transaction, each party to that
|
| 457 |
-
transaction who receives a copy of the work also receives whatever
|
| 458 |
-
licenses to the work the party's predecessor in interest had or could
|
| 459 |
-
give under the previous paragraph, plus a right to possession of the
|
| 460 |
-
Corresponding Source of the work from the predecessor in interest, if
|
| 461 |
-
the predecessor has it or can get it with reasonable efforts.
|
| 462 |
-
|
| 463 |
-
You may not impose any further restrictions on the exercise of the
|
| 464 |
-
rights granted or affirmed under this License. For example, you may
|
| 465 |
-
not impose a license fee, royalty, or other charge for exercise of
|
| 466 |
-
rights granted under this License, and you may not initiate litigation
|
| 467 |
-
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
| 468 |
-
any patent claim is infringed by making, using, selling, offering for
|
| 469 |
-
sale, or importing the Program or any portion of it.
|
| 470 |
-
|
| 471 |
-
11. Patents.
|
| 472 |
-
|
| 473 |
-
A "contributor" is a copyright holder who authorizes use under this
|
| 474 |
-
License of the Program or a work on which the Program is based. The
|
| 475 |
-
work thus licensed is called the contributor's "contributor version".
|
| 476 |
-
|
| 477 |
-
A contributor's "essential patent claims" are all patent claims
|
| 478 |
-
owned or controlled by the contributor, whether already acquired or
|
| 479 |
-
hereafter acquired, that would be infringed by some manner, permitted
|
| 480 |
-
by this License, of making, using, or selling its contributor version,
|
| 481 |
-
but do not include claims that would be infringed only as a
|
| 482 |
-
consequence of further modification of the contributor version. For
|
| 483 |
-
purposes of this definition, "control" includes the right to grant
|
| 484 |
-
patent sublicenses in a manner consistent with the requirements of
|
| 485 |
-
this License.
|
| 486 |
-
|
| 487 |
-
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
| 488 |
-
patent license under the contributor's essential patent claims, to
|
| 489 |
-
make, use, sell, offer for sale, import and otherwise run, modify and
|
| 490 |
-
propagate the contents of its contributor version.
|
| 491 |
-
|
| 492 |
-
In the following three paragraphs, a "patent license" is any express
|
| 493 |
-
agreement or commitment, however denominated, not to enforce a patent
|
| 494 |
-
(such as an express permission to practice a patent or covenant not to
|
| 495 |
-
sue for patent infringement). To "grant" such a patent license to a
|
| 496 |
-
party means to make such an agreement or commitment not to enforce a
|
| 497 |
-
patent against the party.
|
| 498 |
-
|
| 499 |
-
If you convey a covered work, knowingly relying on a patent license,
|
| 500 |
-
and the Corresponding Source of the work is not available for anyone
|
| 501 |
-
to copy, free of charge and under the terms of this License, through a
|
| 502 |
-
publicly available network server or other readily accessible means,
|
| 503 |
-
then you must either (1) cause the Corresponding Source to be so
|
| 504 |
-
available, or (2) arrange to deprive yourself of the benefit of the
|
| 505 |
-
patent license for this particular work, or (3) arrange, in a manner
|
| 506 |
-
consistent with the requirements of this License, to extend the patent
|
| 507 |
-
license to downstream recipients. "Knowingly relying" means you have
|
| 508 |
-
actual knowledge that, but for the patent license, your conveying the
|
| 509 |
-
covered work in a country, or your recipient's use of the covered work
|
| 510 |
-
in a country, would infringe one or more identifiable patents in that
|
| 511 |
-
country that you have reason to believe are valid.
|
| 512 |
-
|
| 513 |
-
If, pursuant to or in connection with a single transaction or
|
| 514 |
-
arrangement, you convey, or propagate by procuring conveyance of, a
|
| 515 |
-
covered work, and grant a patent license to some of the parties
|
| 516 |
-
receiving the covered work authorizing them to use, propagate, modify
|
| 517 |
-
or convey a specific copy of the covered work, then the patent license
|
| 518 |
-
you grant is automatically extended to all recipients of the covered
|
| 519 |
-
work and works based on it.
|
| 520 |
-
|
| 521 |
-
A patent license is "discriminatory" if it does not include within
|
| 522 |
-
the scope of its coverage, prohibits the exercise of, or is
|
| 523 |
-
conditioned on the non-exercise of one or more of the rights that are
|
| 524 |
-
specifically granted under this License. You may not convey a covered
|
| 525 |
-
work if you are a party to an arrangement with a third party that is
|
| 526 |
-
in the business of distributing software, under which you make payment
|
| 527 |
-
to the third party based on the extent of your activity of conveying
|
| 528 |
-
the work, and under which the third party grants, to any of the
|
| 529 |
-
parties who would receive the covered work from you, a discriminatory
|
| 530 |
-
patent license (a) in connection with copies of the covered work
|
| 531 |
-
conveyed by you (or copies made from those copies), or (b) primarily
|
| 532 |
-
for and in connection with specific products or compilations that
|
| 533 |
-
contain the covered work, unless you entered into that arrangement,
|
| 534 |
-
or that patent license was granted, prior to 28 March 2007.
|
| 535 |
-
|
| 536 |
-
Nothing in this License shall be construed as excluding or limiting
|
| 537 |
-
any implied license or other defenses to infringement that may
|
| 538 |
-
otherwise be available to you under applicable patent law.
|
| 539 |
-
|
| 540 |
-
12. No Surrender of Others' Freedom.
|
| 541 |
-
|
| 542 |
-
If conditions are imposed on you (whether by court order, agreement or
|
| 543 |
-
otherwise) that contradict the conditions of this License, they do not
|
| 544 |
-
excuse you from the conditions of this License. If you cannot convey a
|
| 545 |
-
covered work so as to satisfy simultaneously your obligations under this
|
| 546 |
-
License and any other pertinent obligations, then as a consequence you may
|
| 547 |
-
not convey it at all. For example, if you agree to terms that obligate you
|
| 548 |
-
to collect a royalty for further conveying from those to whom you convey
|
| 549 |
-
the Program, the only way you could satisfy both those terms and this
|
| 550 |
-
License would be to refrain entirely from conveying the Program.
|
| 551 |
-
|
| 552 |
-
13. Use with the GNU Affero General Public License.
|
| 553 |
-
|
| 554 |
-
Notwithstanding any other provision of this License, you have
|
| 555 |
-
permission to link or combine any covered work with a work licensed
|
| 556 |
-
under version 3 of the GNU Affero General Public License into a single
|
| 557 |
-
combined work, and to convey the resulting work. The terms of this
|
| 558 |
-
License will continue to apply to the part which is the covered work,
|
| 559 |
-
but the special requirements of the GNU Affero General Public License,
|
| 560 |
-
section 13, concerning interaction through a network will apply to the
|
| 561 |
-
combination as such.
|
| 562 |
-
|
| 563 |
-
14. Revised Versions of this License.
|
| 564 |
-
|
| 565 |
-
The Free Software Foundation may publish revised and/or new versions of
|
| 566 |
-
the GNU General Public License from time to time. Such new versions will
|
| 567 |
-
be similar in spirit to the present version, but may differ in detail to
|
| 568 |
-
address new problems or concerns.
|
| 569 |
-
|
| 570 |
-
Each version is given a distinguishing version number. If the
|
| 571 |
-
Program specifies that a certain numbered version of the GNU General
|
| 572 |
-
Public License "or any later version" applies to it, you have the
|
| 573 |
-
option of following the terms and conditions either of that numbered
|
| 574 |
-
version or of any later version published by the Free Software
|
| 575 |
-
Foundation. If the Program does not specify a version number of the
|
| 576 |
-
GNU General Public License, you may choose any version ever published
|
| 577 |
-
by the Free Software Foundation.
|
| 578 |
-
|
| 579 |
-
If the Program specifies that a proxy can decide which future
|
| 580 |
-
versions of the GNU General Public License can be used, that proxy's
|
| 581 |
-
public statement of acceptance of a version permanently authorizes you
|
| 582 |
-
to choose that version for the Program.
|
| 583 |
-
|
| 584 |
-
Later license versions may give you additional or different
|
| 585 |
-
permissions. However, no additional obligations are imposed on any
|
| 586 |
-
author or copyright holder as a result of your choosing to follow a
|
| 587 |
-
later version.
|
| 588 |
-
|
| 589 |
-
15. Disclaimer of Warranty.
|
| 590 |
-
|
| 591 |
-
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
| 592 |
-
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
| 593 |
-
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
| 594 |
-
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
| 595 |
-
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
| 596 |
-
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
| 597 |
-
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
| 598 |
-
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
| 599 |
-
|
| 600 |
-
16. Limitation of Liability.
|
| 601 |
-
|
| 602 |
-
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
| 603 |
-
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
| 604 |
-
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
| 605 |
-
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
| 606 |
-
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
| 607 |
-
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
| 608 |
-
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
| 609 |
-
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
| 610 |
-
SUCH DAMAGES.
|
| 611 |
-
|
| 612 |
-
17. Interpretation of Sections 15 and 16.
|
| 613 |
-
|
| 614 |
-
If the disclaimer of warranty and limitation of liability provided
|
| 615 |
-
above cannot be given local legal effect according to their terms,
|
| 616 |
-
reviewing courts shall apply local law that most closely approximates
|
| 617 |
-
an absolute waiver of all civil liability in connection with the
|
| 618 |
-
Program, unless a warranty or assumption of liability accompanies a
|
| 619 |
-
copy of the Program in return for a fee.
|
| 620 |
-
|
| 621 |
-
END OF TERMS AND CONDITIONS
|
| 622 |
-
|
| 623 |
-
How to Apply These Terms to Your New Programs
|
| 624 |
-
|
| 625 |
-
If you develop a new program, and you want it to be of the greatest
|
| 626 |
-
possible use to the public, the best way to achieve this is to make it
|
| 627 |
-
free software which everyone can redistribute and change under these terms.
|
| 628 |
-
|
| 629 |
-
To do so, attach the following notices to the program. It is safest
|
| 630 |
-
to attach them to the start of each source file to most effectively
|
| 631 |
-
state the exclusion of warranty; and each file should have at least
|
| 632 |
-
the "copyright" line and a pointer to where the full notice is found.
|
| 633 |
-
|
| 634 |
-
<one line to give the program's name and a brief idea of what it does.>
|
| 635 |
-
Copyright (C) <year> <name of author>
|
| 636 |
-
|
| 637 |
-
This program is free software: you can redistribute it and/or modify
|
| 638 |
-
it under the terms of the GNU General Public License as published by
|
| 639 |
-
the Free Software Foundation, either version 3 of the License, or
|
| 640 |
-
(at your option) any later version.
|
| 641 |
-
|
| 642 |
-
This program is distributed in the hope that it will be useful,
|
| 643 |
-
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| 644 |
-
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
| 645 |
-
GNU General Public License for more details.
|
| 646 |
-
|
| 647 |
-
You should have received a copy of the GNU General Public License
|
| 648 |
-
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
| 649 |
-
|
| 650 |
-
Also add information on how to contact you by electronic and paper mail.
|
| 651 |
-
|
| 652 |
-
If the program does terminal interaction, make it output a short
|
| 653 |
-
notice like this when it starts in an interactive mode:
|
| 654 |
-
|
| 655 |
-
<program> Copyright (C) <year> <name of author>
|
| 656 |
-
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
| 657 |
-
This is free software, and you are welcome to redistribute it
|
| 658 |
-
under certain conditions; type `show c' for details.
|
| 659 |
-
|
| 660 |
-
The hypothetical commands `show w' and `show c' should show the appropriate
|
| 661 |
-
parts of the General Public License. Of course, your program's commands
|
| 662 |
-
might be different; for a GUI interface, you would use an "about box".
|
| 663 |
-
|
| 664 |
-
You should also get your employer (if you work as a programmer) or school,
|
| 665 |
-
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
| 666 |
-
For more information on this, and how to apply and follow the GNU GPL, see
|
| 667 |
-
<https://www.gnu.org/licenses/>.
|
| 668 |
-
|
| 669 |
-
The GNU General Public License does not permit incorporating your program
|
| 670 |
-
into proprietary programs. If your program is a subroutine library, you
|
| 671 |
-
may consider it more useful to permit linking proprietary applications with
|
| 672 |
-
the library. If this is what you want to do, use the GNU Lesser General
|
| 673 |
-
Public License instead of this License. But first, please read
|
| 674 |
-
<https://www.gnu.org/licenses/why-not-lgpl.html>.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
east_text_detection/README.md
DELETED
|
@@ -1,67 +0,0 @@
|
|
| 1 |
-
# EAST Text Detection
|
| 2 |
-
|
| 3 |
-
Scene-text detection with the EAST (Efficient and Accurate Scene Text) detector.
|
| 4 |
-
The model was originally distributed as a frozen TensorFlow graph
|
| 5 |
-
(`frozen_east_text_detection.pb`) and converted to ONNX for use with OpenCV's DNN module.
|
| 6 |
-
|
| 7 |
-
## Model Details
|
| 8 |
-
- **Architecture**: EAST with a ResNet-50 backbone and a feature-fusion head
|
| 9 |
-
- **Input**: RGB image, 320×320, raw 0–255 float, mean `(123.68, 116.78, 103.94)`, swapRB,
|
| 10 |
-
NCHW layout (`input_images:0`, shape `[1, 3, 320, 320]`)
|
| 11 |
-
- **Outputs**:
|
| 12 |
-
- `feature_fusion/Conv_7/Sigmoid:0` — score map, shape `[1, 1, 80, 80]`
|
| 13 |
-
- `feature_fusion/concat_3:0` — RBOX geometry, shape `[1, 5, 80, 80]`
|
| 14 |
-
- **Post-processing**: OpenCV's `TextDetectionModel_EAST` decodes the score/geometry maps
|
| 15 |
-
into rotated boxes (confidence threshold + rotated-NMS)
|
| 16 |
-
- **Framework**: ONNX (converted from the TensorFlow frozen graph via tf2onnx, opset 15)
|
| 17 |
-
- **Original weights**: https://github.com/argman/EAST
|
| 18 |
-
|
| 19 |
-
Both input and outputs are emitted in NCHW so OpenCV consumes them directly.
|
| 20 |
-
|
| 21 |
-
## Usage
|
| 22 |
-
|
| 23 |
-
### Python
|
| 24 |
-
```bash
|
| 25 |
-
python demo.py --model east_text_detection_2026jul.onnx --image example_outputs/input_image.png --output example_outputs/output_image.png
|
| 26 |
-
```
|
| 27 |
-
|
| 28 |
-
Or import directly:
|
| 29 |
-
```python
|
| 30 |
-
import cv2
|
| 31 |
-
|
| 32 |
-
model = cv2.dnn.TextDetectionModel_EAST("east_text_detection_2026jul.onnx")
|
| 33 |
-
# see demo.py for the full inference pipeline
|
| 34 |
-
```
|
| 35 |
-
|
| 36 |
-
### C++
|
| 37 |
-
The C++ demo runs inference with OpenCV's DNN module (default engine — no ONNX Runtime
|
| 38 |
-
needed). Adjust the OpenCV paths to your setup:
|
| 39 |
-
```bash
|
| 40 |
-
OCV=/path/to/opencv # OpenCV source tree
|
| 41 |
-
OCVBUILD=/path/to/opencv/build # OpenCV build directory (generated headers + libs)
|
| 42 |
-
g++ -std=c++17 demo.cpp -o demo \
|
| 43 |
-
-I$OCV/include \
|
| 44 |
-
-I$OCV/modules/core/include \
|
| 45 |
-
-I$OCV/modules/dnn/include \
|
| 46 |
-
-I$OCV/modules/imgproc/include \
|
| 47 |
-
-I$OCV/modules/imgcodecs/include \
|
| 48 |
-
-I$OCVBUILD \
|
| 49 |
-
-L$OCVBUILD/lib -Wl,-rpath,$OCVBUILD/lib -lopencv_dnn -lopencv_imgcodecs -lopencv_imgproc -lopencv_core
|
| 50 |
-
./demo --model east_text_detection_2026jul.onnx --image example_outputs/input_image.png
|
| 51 |
-
```
|
| 52 |
-
|
| 53 |
-
## Conversion
|
| 54 |
-
The ONNX model was exported from the frozen TensorFlow graph with tf2onnx (opset 15)
|
| 55 |
-
via [convert_to_onnx.py](./convert_to_onnx.py) — input `input_images:0`, outputs
|
| 56 |
-
`feature_fusion/Conv_7/Sigmoid:0` and `feature_fusion/concat_3:0`. Both the input and the
|
| 57 |
-
outputs are forced to NCHW (`inputs_as_nchw` / `outputs_as_nchw`) so the tensors match
|
| 58 |
-
OpenCV's layout; without `outputs_as_nchw` the score/geometry maps come out as NHWC and the
|
| 59 |
-
EAST decoder rejects them. Requires `tensorflow`, `tf2onnx`, and `onnx`.
|
| 60 |
-
|
| 61 |
-
```bash
|
| 62 |
-
python convert_to_onnx.py --pb ../pb/frozen_east_text_detection.pb
|
| 63 |
-
```
|
| 64 |
-
|
| 65 |
-
## License
|
| 66 |
-
See [LICENSE](./LICENSE) — the model originates from [argman/EAST](https://github.com/argman/EAST),
|
| 67 |
-
released under the GNU General Public License v3.0.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
east_text_detection/convert_to_onnx.py
DELETED
|
@@ -1,44 +0,0 @@
|
|
| 1 |
-
import argparse
|
| 2 |
-
import datetime
|
| 3 |
-
|
| 4 |
-
import onnx
|
| 5 |
-
import tensorflow as tf
|
| 6 |
-
import tf2onnx
|
| 7 |
-
|
| 8 |
-
|
| 9 |
-
def load_graph_def(pb_path):
|
| 10 |
-
with tf.io.gfile.GFile(pb_path, "rb") as f:
|
| 11 |
-
graph_def = tf.compat.v1.GraphDef()
|
| 12 |
-
graph_def.ParseFromString(f.read())
|
| 13 |
-
return graph_def
|
| 14 |
-
|
| 15 |
-
|
| 16 |
-
def main():
|
| 17 |
-
parser = argparse.ArgumentParser(description="Export frozen_east_text_detection.pb to ONNX")
|
| 18 |
-
parser.add_argument("--pb", default="../pb/frozen_east_text_detection.pb")
|
| 19 |
-
parser.add_argument("--opset", type=int, default=15)
|
| 20 |
-
args = parser.parse_args()
|
| 21 |
-
|
| 22 |
-
graph_def = load_graph_def(args.pb)
|
| 23 |
-
|
| 24 |
-
outputs = ["feature_fusion/Conv_7/Sigmoid:0", "feature_fusion/concat_3:0"]
|
| 25 |
-
model_proto, _ = tf2onnx.convert.from_graph_def(
|
| 26 |
-
graph_def,
|
| 27 |
-
input_names=["input_images:0"],
|
| 28 |
-
output_names=outputs,
|
| 29 |
-
inputs_as_nchw=["input_images:0"],
|
| 30 |
-
outputs_as_nchw=outputs,
|
| 31 |
-
opset=args.opset,
|
| 32 |
-
shape_override={"input_images:0": [1, 320, 320, 3]},
|
| 33 |
-
)
|
| 34 |
-
onnx.checker.check_model(model_proto)
|
| 35 |
-
|
| 36 |
-
stamp = datetime.datetime.now().strftime("%Y%b").lower()
|
| 37 |
-
onnx_path = "east_text_detection_%s.onnx" % stamp
|
| 38 |
-
with open(onnx_path, "wb") as f:
|
| 39 |
-
f.write(model_proto.SerializeToString())
|
| 40 |
-
print("wrote", onnx_path)
|
| 41 |
-
|
| 42 |
-
|
| 43 |
-
if __name__ == "__main__":
|
| 44 |
-
main()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
east_text_detection/demo.cpp
DELETED
|
@@ -1,49 +0,0 @@
|
|
| 1 |
-
#include <opencv2/dnn.hpp>
|
| 2 |
-
#include <opencv2/imgproc.hpp>
|
| 3 |
-
#include <opencv2/imgcodecs.hpp>
|
| 4 |
-
#include <iostream>
|
| 5 |
-
#include <string>
|
| 6 |
-
#include <vector>
|
| 7 |
-
|
| 8 |
-
static std::string argVal(int argc, char** argv, const std::string& key, const std::string& def)
|
| 9 |
-
{
|
| 10 |
-
for (int i = 1; i + 1 < argc; ++i)
|
| 11 |
-
if (key == argv[i]) return argv[i + 1];
|
| 12 |
-
return def;
|
| 13 |
-
}
|
| 14 |
-
|
| 15 |
-
int main(int argc, char** argv)
|
| 16 |
-
{
|
| 17 |
-
std::string model = argVal(argc, argv, "--model", "east_text_detection_2026jul.onnx");
|
| 18 |
-
std::string image = argVal(argc, argv, "--image", "example_outputs/input_image.png");
|
| 19 |
-
std::string output = argVal(argc, argv, "--output", "example_outputs/output_image.png");
|
| 20 |
-
|
| 21 |
-
cv::Mat img = cv::imread(image);
|
| 22 |
-
if (img.empty())
|
| 23 |
-
{
|
| 24 |
-
std::cerr << "could not read image: " << image << std::endl;
|
| 25 |
-
return 1;
|
| 26 |
-
}
|
| 27 |
-
|
| 28 |
-
cv::dnn::TextDetectionModel_EAST east(model);
|
| 29 |
-
east.setConfidenceThreshold(0.5f).setNMSThreshold(0.4f);
|
| 30 |
-
east.setInputParams(1.0, cv::Size(320, 320), cv::Scalar(123.68, 116.78, 103.94), true, false);
|
| 31 |
-
|
| 32 |
-
std::vector<cv::RotatedRect> boxes;
|
| 33 |
-
east.detectTextRectangles(img, boxes);
|
| 34 |
-
std::cout << "detections " << boxes.size() << std::endl;
|
| 35 |
-
|
| 36 |
-
cv::Mat out = img.clone();
|
| 37 |
-
for (const cv::RotatedRect& box : boxes)
|
| 38 |
-
{
|
| 39 |
-
cv::Mat pts;
|
| 40 |
-
cv::boxPoints(box, pts);
|
| 41 |
-
std::vector<cv::Point> poly(4);
|
| 42 |
-
for (int i = 0; i < 4; ++i)
|
| 43 |
-
poly[i] = cv::Point(cvRound(pts.at<float>(i, 0)), cvRound(pts.at<float>(i, 1)));
|
| 44 |
-
cv::polylines(out, poly, true, cv::Scalar(0, 255, 0), 2);
|
| 45 |
-
}
|
| 46 |
-
cv::imwrite(output, out);
|
| 47 |
-
std::cout << "wrote " << output << std::endl;
|
| 48 |
-
return 0;
|
| 49 |
-
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
east_text_detection/demo.py
DELETED
|
@@ -1,39 +0,0 @@
|
|
| 1 |
-
import argparse
|
| 2 |
-
import os
|
| 3 |
-
|
| 4 |
-
import cv2 as cv
|
| 5 |
-
import numpy as np
|
| 6 |
-
|
| 7 |
-
here = os.path.dirname(os.path.abspath(__file__))
|
| 8 |
-
|
| 9 |
-
|
| 10 |
-
def main():
|
| 11 |
-
parser = argparse.ArgumentParser(description="EAST scene-text detection (ONNX) demo")
|
| 12 |
-
parser.add_argument("--model", default=os.path.join(here, "east_text_detection_2026jul.onnx"))
|
| 13 |
-
parser.add_argument("--image", default=os.path.join(here, "example_outputs", "input_image.png"))
|
| 14 |
-
parser.add_argument("--output", default=os.path.join(here, "example_outputs", "output_image.png"))
|
| 15 |
-
parser.add_argument("--conf", type=float, default=0.5, help="confidence threshold")
|
| 16 |
-
parser.add_argument("--nms", type=float, default=0.4, help="NMS threshold")
|
| 17 |
-
args = parser.parse_args()
|
| 18 |
-
|
| 19 |
-
img = cv.imread(args.image)
|
| 20 |
-
if img is None:
|
| 21 |
-
raise SystemExit("could not read image: %s" % args.image)
|
| 22 |
-
|
| 23 |
-
model = cv.dnn.TextDetectionModel_EAST(args.model)
|
| 24 |
-
model.setConfidenceThreshold(args.conf).setNMSThreshold(args.nms)
|
| 25 |
-
model.setInputParams(1.0, (320, 320), (123.68, 116.78, 103.94), True, False)
|
| 26 |
-
|
| 27 |
-
boxes, confidences = model.detectTextRectangles(img)
|
| 28 |
-
print("detections", len(boxes))
|
| 29 |
-
|
| 30 |
-
out = img.copy()
|
| 31 |
-
for box in boxes:
|
| 32 |
-
pts = cv.boxPoints(box).astype(np.int32)
|
| 33 |
-
cv.polylines(out, [pts], True, (0, 255, 0), 2)
|
| 34 |
-
cv.imwrite(args.output, out)
|
| 35 |
-
print("wrote", args.output)
|
| 36 |
-
|
| 37 |
-
|
| 38 |
-
if __name__ == "__main__":
|
| 39 |
-
main()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
east_text_detection/east_text_detection_2026jul.onnx
DELETED
|
@@ -1,3 +0,0 @@
|
|
| 1 |
-
version https://git-lfs.github.com/spec/v1
|
| 2 |
-
oid sha256:63f96881e90b81f3f0e7fd79dc705ead31276da70d3c7dca008ca28d3554883a
|
| 3 |
-
size 96217443
|
|
|
|
|
|
|
|
|
|
|
|
east_text_detection/example_outputs/input_image.png
DELETED
Git LFS Details
|
east_text_detection/example_outputs/output_image.png
DELETED
Git LFS Details
|
efficientdet-d0/LICENSE
DELETED
|
@@ -1,203 +0,0 @@
|
|
| 1 |
-
Copyright 2020 Google Research. All rights reserved.
|
| 2 |
-
|
| 3 |
-
Apache License
|
| 4 |
-
Version 2.0, January 2004
|
| 5 |
-
http://www.apache.org/licenses/
|
| 6 |
-
|
| 7 |
-
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
|
| 8 |
-
|
| 9 |
-
1. Definitions.
|
| 10 |
-
|
| 11 |
-
"License" shall mean the terms and conditions for use, reproduction,
|
| 12 |
-
and distribution as defined by Sections 1 through 9 of this document.
|
| 13 |
-
|
| 14 |
-
"Licensor" shall mean the copyright owner or entity authorized by
|
| 15 |
-
the copyright owner that is granting the License.
|
| 16 |
-
|
| 17 |
-
"Legal Entity" shall mean the union of the acting entity and all
|
| 18 |
-
other entities that control, are controlled by, or are under common
|
| 19 |
-
control with that entity. For the purposes of this definition,
|
| 20 |
-
"control" means (i) the power, direct or indirect, to cause the
|
| 21 |
-
direction or management of such entity, whether by contract or
|
| 22 |
-
otherwise, or (ii) ownership of fifty percent (50%) or more of the
|
| 23 |
-
outstanding shares, or (iii) beneficial ownership of such entity.
|
| 24 |
-
|
| 25 |
-
"You" (or "Your") shall mean an individual or Legal Entity
|
| 26 |
-
exercising permissions granted by this License.
|
| 27 |
-
|
| 28 |
-
"Source" form shall mean the preferred form for making modifications,
|
| 29 |
-
including but not limited to software source code, documentation
|
| 30 |
-
source, and configuration files.
|
| 31 |
-
|
| 32 |
-
"Object" form shall mean any form resulting from mechanical
|
| 33 |
-
transformation or translation of a Source form, including but
|
| 34 |
-
not limited to compiled object code, generated documentation,
|
| 35 |
-
and conversions to other media types.
|
| 36 |
-
|
| 37 |
-
"Work" shall mean the work of authorship, whether in Source or
|
| 38 |
-
Object form, made available under the License, as indicated by a
|
| 39 |
-
copyright notice that is included in or attached to the work
|
| 40 |
-
(an example is provided in the Appendix below).
|
| 41 |
-
|
| 42 |
-
"Derivative Works" shall mean any work, whether in Source or Object
|
| 43 |
-
form, that is based on (or derived from) the Work and for which the
|
| 44 |
-
editorial revisions, annotations, elaborations, or other modifications
|
| 45 |
-
represent, as a whole, an original work of authorship. For the purposes
|
| 46 |
-
of this License, Derivative Works shall not include works that remain
|
| 47 |
-
separable from, or merely link (or bind by name) to the interfaces of,
|
| 48 |
-
the Work and Derivative Works thereof.
|
| 49 |
-
|
| 50 |
-
"Contribution" shall mean any work of authorship, including
|
| 51 |
-
the original version of the Work and any modifications or additions
|
| 52 |
-
to that Work or Derivative Works thereof, that is intentionally
|
| 53 |
-
submitted to Licensor for inclusion in the Work by the copyright owner
|
| 54 |
-
or by an individual or Legal Entity authorized to submit on behalf of
|
| 55 |
-
the copyright owner. For the purposes of this definition, "submitted"
|
| 56 |
-
means any form of electronic, verbal, or written communication sent
|
| 57 |
-
to the Licensor or its representatives, including but not limited to
|
| 58 |
-
communication on electronic mailing lists, source code control systems,
|
| 59 |
-
and issue tracking systems that are managed by, or on behalf of, the
|
| 60 |
-
Licensor for the purpose of discussing and improving the Work, but
|
| 61 |
-
excluding communication that is conspicuously marked or otherwise
|
| 62 |
-
designated in writing by the copyright owner as "Not a Contribution."
|
| 63 |
-
|
| 64 |
-
"Contributor" shall mean Licensor and any individual or Legal Entity
|
| 65 |
-
on behalf of whom a Contribution has been received by Licensor and
|
| 66 |
-
subsequently incorporated within the Work.
|
| 67 |
-
|
| 68 |
-
2. Grant of Copyright License. Subject to the terms and conditions of
|
| 69 |
-
this License, each Contributor hereby grants to You a perpetual,
|
| 70 |
-
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
| 71 |
-
copyright license to reproduce, prepare Derivative Works of,
|
| 72 |
-
publicly display, publicly perform, sublicense, and distribute the
|
| 73 |
-
Work and such Derivative Works in Source or Object form.
|
| 74 |
-
|
| 75 |
-
3. Grant of Patent License. Subject to the terms and conditions of
|
| 76 |
-
this License, each Contributor hereby grants to You a perpetual,
|
| 77 |
-
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
| 78 |
-
(except as stated in this section) patent license to make, have made,
|
| 79 |
-
use, offer to sell, sell, import, and otherwise transfer the Work,
|
| 80 |
-
where such license applies only to those patent claims licensable
|
| 81 |
-
by such Contributor that are necessarily infringed by their
|
| 82 |
-
Contribution(s) alone or by combination of their Contribution(s)
|
| 83 |
-
with the Work to which such Contribution(s) was submitted. If You
|
| 84 |
-
institute patent litigation against any entity (including a
|
| 85 |
-
cross-claim or counterclaim in a lawsuit) alleging that the Work
|
| 86 |
-
or a Contribution incorporated within the Work constitutes direct
|
| 87 |
-
or contributory patent infringement, then any patent licenses
|
| 88 |
-
granted to You under this License for that Work shall terminate
|
| 89 |
-
as of the date such litigation is filed.
|
| 90 |
-
|
| 91 |
-
4. Redistribution. You may reproduce and distribute copies of the
|
| 92 |
-
Work or Derivative Works thereof in any medium, with or without
|
| 93 |
-
modifications, and in Source or Object form, provided that You
|
| 94 |
-
meet the following conditions:
|
| 95 |
-
|
| 96 |
-
(a) You must give any other recipients of the Work or
|
| 97 |
-
Derivative Works a copy of this License; and
|
| 98 |
-
|
| 99 |
-
(b) You must cause any modified files to carry prominent notices
|
| 100 |
-
stating that You changed the files; and
|
| 101 |
-
|
| 102 |
-
(c) You must retain, in the Source form of any Derivative Works
|
| 103 |
-
that You distribute, all copyright, patent, trademark, and
|
| 104 |
-
attribution notices from the Source form of the Work,
|
| 105 |
-
excluding those notices that do not pertain to any part of
|
| 106 |
-
the Derivative Works; and
|
| 107 |
-
|
| 108 |
-
(d) If the Work includes a "NOTICE" text file as part of its
|
| 109 |
-
distribution, then any Derivative Works that You distribute must
|
| 110 |
-
include a readable copy of the attribution notices contained
|
| 111 |
-
within such NOTICE file, excluding those notices that do not
|
| 112 |
-
pertain to any part of the Derivative Works, in at least one
|
| 113 |
-
of the following places: within a NOTICE text file distributed
|
| 114 |
-
as part of the Derivative Works; within the Source form or
|
| 115 |
-
documentation, if provided along with the Derivative Works; or,
|
| 116 |
-
within a display generated by the Derivative Works, if and
|
| 117 |
-
wherever such third-party notices normally appear. The contents
|
| 118 |
-
of the NOTICE file are for informational purposes only and
|
| 119 |
-
do not modify the License. You may add Your own attribution
|
| 120 |
-
notices within Derivative Works that You distribute, alongside
|
| 121 |
-
or as an addendum to the NOTICE text from the Work, provided
|
| 122 |
-
that such additional attribution notices cannot be construed
|
| 123 |
-
as modifying the License.
|
| 124 |
-
|
| 125 |
-
You may add Your own copyright statement to Your modifications and
|
| 126 |
-
may provide additional or different license terms and conditions
|
| 127 |
-
for use, reproduction, or distribution of Your modifications, or
|
| 128 |
-
for any such Derivative Works as a whole, provided Your use,
|
| 129 |
-
reproduction, and distribution of the Work otherwise complies with
|
| 130 |
-
the conditions stated in this License.
|
| 131 |
-
|
| 132 |
-
5. Submission of Contributions. Unless You explicitly state otherwise,
|
| 133 |
-
any Contribution intentionally submitted for inclusion in the Work
|
| 134 |
-
by You to the Licensor shall be under the terms and conditions of
|
| 135 |
-
this License, without any additional terms or conditions.
|
| 136 |
-
Notwithstanding the above, nothing herein shall supersede or modify
|
| 137 |
-
the terms of any separate license agreement you may have executed
|
| 138 |
-
with Licensor regarding such Contributions.
|
| 139 |
-
|
| 140 |
-
6. Trademarks. This License does not grant permission to use the trade
|
| 141 |
-
names, trademarks, service marks, or product names of the Licensor,
|
| 142 |
-
except as required for reasonable and customary use in describing the
|
| 143 |
-
origin of the Work and reproducing the content of the NOTICE file.
|
| 144 |
-
|
| 145 |
-
7. Disclaimer of Warranty. Unless required by applicable law or
|
| 146 |
-
agreed to in writing, Licensor provides the Work (and each
|
| 147 |
-
Contributor provides its Contributions) on an "AS IS" BASIS,
|
| 148 |
-
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
|
| 149 |
-
implied, including, without limitation, any warranties or conditions
|
| 150 |
-
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
|
| 151 |
-
PARTICULAR PURPOSE. You are solely responsible for determining the
|
| 152 |
-
appropriateness of using or redistributing the Work and assume any
|
| 153 |
-
risks associated with Your exercise of permissions under this License.
|
| 154 |
-
|
| 155 |
-
8. Limitation of Liability. In no event and under no legal theory,
|
| 156 |
-
whether in tort (including negligence), contract, or otherwise,
|
| 157 |
-
unless required by applicable law (such as deliberate and grossly
|
| 158 |
-
negligent acts) or agreed to in writing, shall any Contributor be
|
| 159 |
-
liable to You for damages, including any direct, indirect, special,
|
| 160 |
-
incidental, or consequential damages of any character arising as a
|
| 161 |
-
result of this License or out of the use or inability to use the
|
| 162 |
-
Work (including but not limited to damages for loss of goodwill,
|
| 163 |
-
work stoppage, computer failure or malfunction, or any and all
|
| 164 |
-
other commercial damages or losses), even if such Contributor
|
| 165 |
-
has been advised of the possibility of such damages.
|
| 166 |
-
|
| 167 |
-
9. Accepting Warranty or Additional Liability. While redistributing
|
| 168 |
-
the Work or Derivative Works thereof, You may choose to offer,
|
| 169 |
-
and charge a fee for, acceptance of support, warranty, indemnity,
|
| 170 |
-
or other liability obligations and/or rights consistent with this
|
| 171 |
-
License. However, in accepting such obligations, You may act only
|
| 172 |
-
on Your own behalf and on Your sole responsibility, not on behalf
|
| 173 |
-
of any other Contributor, and only if You agree to indemnify,
|
| 174 |
-
defend, and hold each Contributor harmless for any liability
|
| 175 |
-
incurred by, or claims asserted against, such Contributor by reason
|
| 176 |
-
of your accepting any such warranty or additional liability.
|
| 177 |
-
|
| 178 |
-
END OF TERMS AND CONDITIONS
|
| 179 |
-
|
| 180 |
-
APPENDIX: How to apply the Apache License to your work.
|
| 181 |
-
|
| 182 |
-
To apply the Apache License to your work, attach the following
|
| 183 |
-
boilerplate notice, with the fields enclosed by brackets "[]"
|
| 184 |
-
replaced with your own identifying information. (Don't include
|
| 185 |
-
the brackets!) The text should be enclosed in the appropriate
|
| 186 |
-
comment syntax for the file format. We also recommend that a
|
| 187 |
-
file or class name and description of purpose be included on the
|
| 188 |
-
same "printed page" as the copyright notice for easier
|
| 189 |
-
identification within third-party archives.
|
| 190 |
-
|
| 191 |
-
Copyright 2020, Google Research.
|
| 192 |
-
|
| 193 |
-
Licensed under the Apache License, Version 2.0 (the "License");
|
| 194 |
-
you may not use this file except in compliance with the License.
|
| 195 |
-
You may obtain a copy of the License at
|
| 196 |
-
|
| 197 |
-
http://www.apache.org/licenses/LICENSE-2.0
|
| 198 |
-
|
| 199 |
-
Unless required by applicable law or agreed to in writing, software
|
| 200 |
-
distributed under the License is distributed on an "AS IS" BASIS,
|
| 201 |
-
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
| 202 |
-
See the License for the specific language governing permissions and
|
| 203 |
-
limitations under the License.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
efficientdet-d0/README.md
DELETED
|
@@ -1,62 +0,0 @@
|
|
| 1 |
-
# EfficientDet-D0
|
| 2 |
-
|
| 3 |
-
Object detection with EfficientDet-D0 trained on COCO. The model was originally
|
| 4 |
-
distributed as a frozen TensorFlow graph (`efficientdet-d0.pb`) and converted to
|
| 5 |
-
ONNX for use with OpenCV's DNN module. This is a **backbone-only** export: the
|
| 6 |
-
graph emits raw class logits and box regressions, while anchor generation, sigmoid,
|
| 7 |
-
box decoding and non-maximum suppression are performed in host code (see the demos).
|
| 8 |
-
|
| 9 |
-
## Model Details
|
| 10 |
-
- **Architecture**: EfficientDet-D0
|
| 11 |
-
- **Input**: RGB image, 512×512, raw uint8, NHWC layout (`image_arrays:0`, shape `[1, 512, 512, 3]`)
|
| 12 |
-
- **Output**: raw class logits (`concat:0`, shape `[1, 49104, 90]`) and box regression (`concat_1:0`, shape `[1, 49104, 4]`); anchor decode + NMS are done in host code, not in the graph
|
| 13 |
-
- **Framework**: ONNX (converted from the TensorFlow frozen graph via tf2onnx, opset 18)
|
| 14 |
-
- **Original weights**: https://www.dropbox.com/s/9mqp99fd2tpuqn6/efficientdet-d0.pb?dl=1
|
| 15 |
-
|
| 16 |
-
The graph outputs are per-anchor predictions only. The demos build the 49104 anchors
|
| 17 |
-
(5 pyramid levels × 9 anchors/cell), apply sigmoid to the logits, decode the box
|
| 18 |
-
regressions relative to the anchors, threshold on confidence and run NMS (IoU 0.6).
|
| 19 |
-
|
| 20 |
-
## Usage
|
| 21 |
-
|
| 22 |
-
### Python
|
| 23 |
-
```bash
|
| 24 |
-
python demo.py --model efficientdet-d0_2026jul.onnx --image example_outputs/input_image.png --output example_outputs/output_image.png --conf 0.4
|
| 25 |
-
```
|
| 26 |
-
|
| 27 |
-
Or import directly:
|
| 28 |
-
```python
|
| 29 |
-
import cv2
|
| 30 |
-
|
| 31 |
-
net = cv2.dnn.readNet("efficientdet-d0_2026jul.onnx")
|
| 32 |
-
# see demo.py for the full anchor decode + NMS pipeline
|
| 33 |
-
```
|
| 34 |
-
|
| 35 |
-
### C++
|
| 36 |
-
The C++ demo runs inference with OpenCV's DNN module. Adjust the OpenCV paths to your setup:
|
| 37 |
-
```bash
|
| 38 |
-
OCV=/path/to/opencv # OpenCV source tree
|
| 39 |
-
OCVBUILD=/path/to/opencv/build # OpenCV build directory (generated headers + libs)
|
| 40 |
-
g++ -std=c++17 demo.cpp -o demo \
|
| 41 |
-
-I$OCV/include \
|
| 42 |
-
-I$OCV/modules/core/include \
|
| 43 |
-
-I$OCV/modules/dnn/include \
|
| 44 |
-
-I$OCV/modules/imgproc/include \
|
| 45 |
-
-I$OCV/modules/imgcodecs/include \
|
| 46 |
-
-I$OCVBUILD \
|
| 47 |
-
-L$OCVBUILD/lib -Wl,-rpath,$OCVBUILD/lib -lopencv_dnn -lopencv_imgcodecs -lopencv_imgproc -lopencv_core
|
| 48 |
-
./demo --model efficientdet-d0_2026jul.onnx --image example_outputs/input_image.png --output example_outputs/output_image.png
|
| 49 |
-
```
|
| 50 |
-
|
| 51 |
-
## Conversion
|
| 52 |
-
The ONNX model was exported from the frozen TensorFlow graph with tf2onnx (opset 18)
|
| 53 |
-
via [convert_to_onnx.py](./convert_to_onnx.py) — input `image_arrays:0`, outputs
|
| 54 |
-
`concat:0` and `concat_1:0`, input shape overridden to `[1, 512, 512, 3]`. Requires
|
| 55 |
-
`tensorflow`, `tf2onnx`, and `onnx`.
|
| 56 |
-
|
| 57 |
-
```bash
|
| 58 |
-
python convert_to_onnx.py --pb ../pb/efficientdet-d0.pb
|
| 59 |
-
```
|
| 60 |
-
|
| 61 |
-
## License
|
| 62 |
-
See [LICENSE](./LICENSE) — released under the Apache License 2.0.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
efficientdet-d0/convert_to_onnx.py
DELETED
|
@@ -1,41 +0,0 @@
|
|
| 1 |
-
import argparse
|
| 2 |
-
import datetime
|
| 3 |
-
|
| 4 |
-
import onnx
|
| 5 |
-
import tensorflow as tf
|
| 6 |
-
import tf2onnx
|
| 7 |
-
|
| 8 |
-
|
| 9 |
-
def load_graph_def(pb_path):
|
| 10 |
-
with tf.io.gfile.GFile(pb_path, "rb") as f:
|
| 11 |
-
graph_def = tf.compat.v1.GraphDef()
|
| 12 |
-
graph_def.ParseFromString(f.read())
|
| 13 |
-
return graph_def
|
| 14 |
-
|
| 15 |
-
|
| 16 |
-
def main():
|
| 17 |
-
parser = argparse.ArgumentParser(description="Export efficientdet-d0.pb to ONNX")
|
| 18 |
-
parser.add_argument("--pb", default="../pb/efficientdet-d0.pb")
|
| 19 |
-
parser.add_argument("--opset", type=int, default=18)
|
| 20 |
-
args = parser.parse_args()
|
| 21 |
-
|
| 22 |
-
graph_def = load_graph_def(args.pb)
|
| 23 |
-
|
| 24 |
-
model_proto, _ = tf2onnx.convert.from_graph_def(
|
| 25 |
-
graph_def,
|
| 26 |
-
input_names=["image_arrays:0"],
|
| 27 |
-
output_names=["concat:0", "concat_1:0"],
|
| 28 |
-
opset=args.opset,
|
| 29 |
-
shape_override={"image_arrays:0": [1, 512, 512, 3]},
|
| 30 |
-
)
|
| 31 |
-
onnx.checker.check_model(model_proto)
|
| 32 |
-
|
| 33 |
-
stamp = datetime.datetime.now().strftime("%Y%b").lower()
|
| 34 |
-
onnx_path = "efficientdet-d0_%s.onnx" % stamp
|
| 35 |
-
with open(onnx_path, "wb") as f:
|
| 36 |
-
f.write(model_proto.SerializeToString())
|
| 37 |
-
print("wrote", onnx_path)
|
| 38 |
-
|
| 39 |
-
|
| 40 |
-
if __name__ == "__main__":
|
| 41 |
-
main()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
efficientdet-d0/demo.cpp
DELETED
|
@@ -1,127 +0,0 @@
|
|
| 1 |
-
#include <opencv2/dnn.hpp>
|
| 2 |
-
#include <opencv2/imgproc.hpp>
|
| 3 |
-
#include <opencv2/imgcodecs.hpp>
|
| 4 |
-
#include <algorithm>
|
| 5 |
-
#include <array>
|
| 6 |
-
#include <cmath>
|
| 7 |
-
#include <iostream>
|
| 8 |
-
#include <string>
|
| 9 |
-
#include <vector>
|
| 10 |
-
|
| 11 |
-
using namespace cv;
|
| 12 |
-
|
| 13 |
-
static std::string argVal(int argc, char** argv, const std::string& key, const std::string& def)
|
| 14 |
-
{
|
| 15 |
-
for (int i = 1; i + 1 < argc; ++i)
|
| 16 |
-
if (key == argv[i]) return argv[i + 1];
|
| 17 |
-
return def;
|
| 18 |
-
}
|
| 19 |
-
|
| 20 |
-
struct Det { float x1, y1, x2, y2, score; int cid; };
|
| 21 |
-
|
| 22 |
-
int main(int argc, char** argv)
|
| 23 |
-
{
|
| 24 |
-
std::string model = argVal(argc, argv, "--model", "efficientdet-d0_2026jul.onnx");
|
| 25 |
-
std::string image = argVal(argc, argv, "--image", "example_outputs/input_image.png");
|
| 26 |
-
std::string output = argVal(argc, argv, "--output", "example_outputs/output_image.png");
|
| 27 |
-
float conf = std::stof(argVal(argc, argv, "--conf", "0.4"));
|
| 28 |
-
|
| 29 |
-
const int sz = 512;
|
| 30 |
-
|
| 31 |
-
Mat img = imread(image);
|
| 32 |
-
if (img.empty()) { std::cerr << "could not read image: " << image << std::endl; return 1; }
|
| 33 |
-
|
| 34 |
-
Mat rgb;
|
| 35 |
-
cvtColor(img, rgb, COLOR_BGR2RGB);
|
| 36 |
-
resize(rgb, rgb, Size(sz, sz));
|
| 37 |
-
if (!rgb.isContinuous()) rgb = rgb.clone();
|
| 38 |
-
|
| 39 |
-
int blobShape[] = {1, sz, sz, 3};
|
| 40 |
-
Mat blob(4, blobShape, CV_8U, rgb.data);
|
| 41 |
-
dnn::Net net = dnn::readNetFromONNX(model);
|
| 42 |
-
net.setInput(blob);
|
| 43 |
-
std::vector<Mat> outs;
|
| 44 |
-
net.forward(outs, net.getUnconnectedOutLayersNames());
|
| 45 |
-
|
| 46 |
-
const float* boxp = nullptr;
|
| 47 |
-
const float* clsp = nullptr;
|
| 48 |
-
int n = 0, nc = 0;
|
| 49 |
-
for (size_t i = 0; i < outs.size(); ++i)
|
| 50 |
-
{
|
| 51 |
-
const Mat& o = outs[i];
|
| 52 |
-
const float* p = (const float*)o.data;
|
| 53 |
-
int last = o.size[o.dims - 1];
|
| 54 |
-
if (last == 4) { boxp = p; n = o.size[o.dims - 2]; }
|
| 55 |
-
else { clsp = p; nc = last; }
|
| 56 |
-
}
|
| 57 |
-
|
| 58 |
-
std::vector<std::array<float, 2>> baseWH;
|
| 59 |
-
double asp[3][2] = {{1.0, 1.0}, {1.4, 0.7}, {0.7, 1.4}};
|
| 60 |
-
for (int i = 0; i < 3; ++i) {
|
| 61 |
-
double s = std::pow(2.0, i / 3.0);
|
| 62 |
-
for (int a = 0; a < 3; ++a)
|
| 63 |
-
baseWH.push_back({(float)(32.0 * s * asp[a][0]), (float)(32.0 * s * asp[a][1])});
|
| 64 |
-
}
|
| 65 |
-
std::vector<float> acx, acy, aw, ah;
|
| 66 |
-
for (int lvl = 0; lvl < 5; ++lvl) {
|
| 67 |
-
int f = sz / (8 << lvl);
|
| 68 |
-
int step = 8 << lvl;
|
| 69 |
-
int m = 1 << lvl;
|
| 70 |
-
for (int y = 0; y < f; ++y)
|
| 71 |
-
for (int x = 0; x < f; ++x) {
|
| 72 |
-
float cx = (x + 0.5f) * step;
|
| 73 |
-
float cy = (y + 0.5f) * step;
|
| 74 |
-
for (auto& b : baseWH) {
|
| 75 |
-
acx.push_back(cx); acy.push_back(cy);
|
| 76 |
-
aw.push_back(b[0] * m); ah.push_back(b[1] * m);
|
| 77 |
-
}
|
| 78 |
-
}
|
| 79 |
-
}
|
| 80 |
-
|
| 81 |
-
std::vector<Det> dets;
|
| 82 |
-
for (int a = 0; a < n; ++a) {
|
| 83 |
-
const float* bp = boxp + (size_t)a * 4;
|
| 84 |
-
float ycenter = bp[0] * ah[a] + acy[a];
|
| 85 |
-
float xcenter = bp[1] * aw[a] + acx[a];
|
| 86 |
-
float bhv = std::exp(bp[2]) * ah[a];
|
| 87 |
-
float bwv = std::exp(bp[3]) * aw[a];
|
| 88 |
-
const float* cp = clsp + (size_t)a * nc;
|
| 89 |
-
int best = 0; float bestLogit = cp[0];
|
| 90 |
-
for (int c = 1; c < nc; ++c) if (cp[c] > bestLogit) { bestLogit = cp[c]; best = c; }
|
| 91 |
-
float score = 1.0f / (1.0f + std::exp(-bestLogit));
|
| 92 |
-
if (score > conf)
|
| 93 |
-
dets.push_back({(xcenter - bwv / 2) / sz, (ycenter - bhv / 2) / sz,
|
| 94 |
-
(xcenter + bwv / 2) / sz, (ycenter + bhv / 2) / sz, score, best});
|
| 95 |
-
}
|
| 96 |
-
|
| 97 |
-
std::sort(dets.begin(), dets.end(), [](const Det& a, const Det& b) { return a.score > b.score; });
|
| 98 |
-
std::vector<char> removed(dets.size(), 0);
|
| 99 |
-
std::vector<int> pick;
|
| 100 |
-
for (size_t i = 0; i < dets.size(); ++i) {
|
| 101 |
-
if (removed[i]) continue;
|
| 102 |
-
pick.push_back((int)i);
|
| 103 |
-
for (size_t j = i + 1; j < dets.size(); ++j) {
|
| 104 |
-
if (removed[j]) continue;
|
| 105 |
-
float xx1 = std::max(dets[i].x1, dets[j].x1);
|
| 106 |
-
float yy1 = std::max(dets[i].y1, dets[j].y1);
|
| 107 |
-
float xx2 = std::min(dets[i].x2, dets[j].x2);
|
| 108 |
-
float yy2 = std::min(dets[i].y2, dets[j].y2);
|
| 109 |
-
float inter = std::max(0.0f, xx2 - xx1) * std::max(0.0f, yy2 - yy1);
|
| 110 |
-
float ai = (dets[i].x2 - dets[i].x1) * (dets[i].y2 - dets[i].y1);
|
| 111 |
-
float aj = (dets[j].x2 - dets[j].x1) * (dets[j].y2 - dets[j].y1);
|
| 112 |
-
if (inter / (ai + aj - inter + 1e-9f) > 0.6f) removed[j] = 1;
|
| 113 |
-
}
|
| 114 |
-
}
|
| 115 |
-
|
| 116 |
-
std::cout << "efficientdet-d0 " << pick.size() << " detections" << std::endl;
|
| 117 |
-
int w = img.cols, h = img.rows;
|
| 118 |
-
for (int idx : pick) {
|
| 119 |
-
const Det& d = dets[idx];
|
| 120 |
-
std::cout << format("%d %.3f %.3f %.3f %.3f %.3f", d.cid, d.score, d.x1, d.y1, d.x2, d.y2) << std::endl;
|
| 121 |
-
rectangle(img, Point((int)(d.x1 * w), (int)(d.y1 * h)), Point((int)(d.x2 * w), (int)(d.y2 * h)), Scalar(0, 255, 0), 2);
|
| 122 |
-
putText(img, format("%d:%.2f", d.cid, d.score), Point((int)(d.x1 * w), (int)(d.y1 * h) - 5), FONT_HERSHEY_SIMPLEX, 0.5, Scalar(0, 255, 0), 1);
|
| 123 |
-
}
|
| 124 |
-
imwrite(output, img);
|
| 125 |
-
std::cout << "wrote " << output << std::endl;
|
| 126 |
-
return 0;
|
| 127 |
-
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
efficientdet-d0/demo.py
DELETED
|
@@ -1,105 +0,0 @@
|
|
| 1 |
-
import argparse
|
| 2 |
-
import glob
|
| 3 |
-
import os
|
| 4 |
-
|
| 5 |
-
import cv2 as cv
|
| 6 |
-
import numpy as np
|
| 7 |
-
|
| 8 |
-
here = os.path.dirname(os.path.abspath(__file__))
|
| 9 |
-
sz = 512
|
| 10 |
-
|
| 11 |
-
|
| 12 |
-
def build_anchors():
|
| 13 |
-
scales = [2.0 ** (i / 3.0) for i in range(3)]
|
| 14 |
-
aspects = [(1.0, 1.0), (1.4, 0.7), (0.7, 1.4)]
|
| 15 |
-
base = []
|
| 16 |
-
for s in scales:
|
| 17 |
-
for aw, ah in aspects:
|
| 18 |
-
base.append((32.0 * s * aw, 32.0 * s * ah))
|
| 19 |
-
anchors = []
|
| 20 |
-
for lvl in range(5):
|
| 21 |
-
f = sz // (8 * 2 ** lvl)
|
| 22 |
-
step = 8 * 2 ** lvl
|
| 23 |
-
m = 2 ** lvl
|
| 24 |
-
for y in range(f):
|
| 25 |
-
for x in range(f):
|
| 26 |
-
cx = (x + 0.5) * step
|
| 27 |
-
cy = (y + 0.5) * step
|
| 28 |
-
for bw, bh in base:
|
| 29 |
-
anchors.append((cx, cy, bw * m, bh * m))
|
| 30 |
-
return np.array(anchors, np.float32)
|
| 31 |
-
|
| 32 |
-
|
| 33 |
-
def main():
|
| 34 |
-
parser = argparse.ArgumentParser(description="EfficientDet-D0 (ONNX) object detection demo")
|
| 35 |
-
parser.add_argument("--model", default=None)
|
| 36 |
-
parser.add_argument("--image", default=os.path.join(here, "example_outputs", "input_image.png"))
|
| 37 |
-
parser.add_argument("--output", default=os.path.join(here, "example_outputs", "output_image.png"))
|
| 38 |
-
parser.add_argument("--conf", type=float, default=0.4)
|
| 39 |
-
args = parser.parse_args()
|
| 40 |
-
|
| 41 |
-
model = args.model
|
| 42 |
-
if model is None:
|
| 43 |
-
found = glob.glob(os.path.join(here, "*.onnx"))
|
| 44 |
-
if not found:
|
| 45 |
-
raise SystemExit("no onnx, run convert_to_onnx.py")
|
| 46 |
-
model = found[0]
|
| 47 |
-
|
| 48 |
-
img = cv.imread(args.image)
|
| 49 |
-
if img is None:
|
| 50 |
-
raise SystemExit("could not read image: %s" % args.image)
|
| 51 |
-
|
| 52 |
-
anchors = build_anchors()
|
| 53 |
-
acx, acy, aw, ah = anchors[:, 0], anchors[:, 1], anchors[:, 2], anchors[:, 3]
|
| 54 |
-
|
| 55 |
-
net = cv.dnn.readNetFromONNX(model)
|
| 56 |
-
inp = cv.resize(cv.cvtColor(img, cv.COLOR_BGR2RGB), (sz, sz))
|
| 57 |
-
net.setInput(inp[None].astype(np.uint8))
|
| 58 |
-
res = net.forward(net.getUnconnectedOutLayersNames())
|
| 59 |
-
box = next(a for a in res if a.shape[-1] == 4).reshape(-1, 4)
|
| 60 |
-
cls = next(a for a in res if a.shape[-1] != 4).reshape(box.shape[0], -1)
|
| 61 |
-
|
| 62 |
-
ycenter = box[:, 0] * ah + acy
|
| 63 |
-
xcenter = box[:, 1] * aw + acx
|
| 64 |
-
bh = np.exp(box[:, 2]) * ah
|
| 65 |
-
bw = np.exp(box[:, 3]) * aw
|
| 66 |
-
boxes = np.stack([xcenter - bw / 2, ycenter - bh / 2, xcenter + bw / 2, ycenter + bh / 2], 1) / sz
|
| 67 |
-
|
| 68 |
-
prob = 1.0 / (1.0 + np.exp(-cls))
|
| 69 |
-
cid = prob.argmax(1)
|
| 70 |
-
scores = prob.max(1)
|
| 71 |
-
|
| 72 |
-
keep = scores > args.conf
|
| 73 |
-
boxes = boxes[keep]
|
| 74 |
-
scores = scores[keep]
|
| 75 |
-
cid = cid[keep]
|
| 76 |
-
order = scores.argsort()[::-1]
|
| 77 |
-
pick = []
|
| 78 |
-
while order.size:
|
| 79 |
-
i = order[0]
|
| 80 |
-
pick.append(i)
|
| 81 |
-
xx1 = np.maximum(boxes[i, 0], boxes[order[1:], 0])
|
| 82 |
-
yy1 = np.maximum(boxes[i, 1], boxes[order[1:], 1])
|
| 83 |
-
xx2 = np.minimum(boxes[i, 2], boxes[order[1:], 2])
|
| 84 |
-
yy2 = np.minimum(boxes[i, 3], boxes[order[1:], 3])
|
| 85 |
-
iw = np.maximum(0, xx2 - xx1)
|
| 86 |
-
ih = np.maximum(0, yy2 - yy1)
|
| 87 |
-
inter = iw * ih
|
| 88 |
-
ai = (boxes[i, 2] - boxes[i, 0]) * (boxes[i, 3] - boxes[i, 1])
|
| 89 |
-
aj = (boxes[order[1:], 2] - boxes[order[1:], 0]) * (boxes[order[1:], 3] - boxes[order[1:], 1])
|
| 90 |
-
iou = inter / (ai + aj - inter + 1e-9)
|
| 91 |
-
order = order[1:][iou <= 0.6]
|
| 92 |
-
|
| 93 |
-
print("efficientdet-d0", len(pick), "detections")
|
| 94 |
-
h, w = img.shape[:2]
|
| 95 |
-
for i in pick:
|
| 96 |
-
x1, y1, x2, y2 = boxes[i]
|
| 97 |
-
print(int(cid[i]), round(float(scores[i]), 3), round(float(x1), 3), round(float(y1), 3), round(float(x2), 3), round(float(y2), 3))
|
| 98 |
-
cv.rectangle(img, (int(x1 * w), int(y1 * h)), (int(x2 * w), int(y2 * h)), (0, 255, 0), 2)
|
| 99 |
-
cv.putText(img, "%d:%.2f" % (int(cid[i]), scores[i]), (int(x1 * w), int(y1 * h) - 5), cv.FONT_HERSHEY_SIMPLEX, 0.5, (0, 255, 0), 1)
|
| 100 |
-
cv.imwrite(args.output, img)
|
| 101 |
-
print("wrote", args.output)
|
| 102 |
-
|
| 103 |
-
|
| 104 |
-
if __name__ == "__main__":
|
| 105 |
-
main()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
efficientdet-d0/efficientdet-d0_2026jul.onnx
DELETED
|
@@ -1,3 +0,0 @@
|
|
| 1 |
-
version https://git-lfs.github.com/spec/v1
|
| 2 |
-
oid sha256:db344f69adf1c529e08a36bbaa1779d98b4b81621a2f046656fb966bdfdc6298
|
| 3 |
-
size 15671001
|
|
|
|
|
|
|
|
|
|
|
|
efficientdet-d0/example_outputs/input_image.png
DELETED
Git LFS Details
|
efficientdet-d0/example_outputs/output_image.png
DELETED
Git LFS Details
|
faster_rcnn_inception_v2_coco_2018_01_28/LICENSE
DELETED
|
@@ -1,203 +0,0 @@
|
|
| 1 |
-
Copyright 2015 The TensorFlow Authors. All rights reserved.
|
| 2 |
-
|
| 3 |
-
Apache License
|
| 4 |
-
Version 2.0, January 2004
|
| 5 |
-
http://www.apache.org/licenses/
|
| 6 |
-
|
| 7 |
-
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
|
| 8 |
-
|
| 9 |
-
1. Definitions.
|
| 10 |
-
|
| 11 |
-
"License" shall mean the terms and conditions for use, reproduction,
|
| 12 |
-
and distribution as defined by Sections 1 through 9 of this document.
|
| 13 |
-
|
| 14 |
-
"Licensor" shall mean the copyright owner or entity authorized by
|
| 15 |
-
the copyright owner that is granting the License.
|
| 16 |
-
|
| 17 |
-
"Legal Entity" shall mean the union of the acting entity and all
|
| 18 |
-
other entities that control, are controlled by, or are under common
|
| 19 |
-
control with that entity. For the purposes of this definition,
|
| 20 |
-
"control" means (i) the power, direct or indirect, to cause the
|
| 21 |
-
direction or management of such entity, whether by contract or
|
| 22 |
-
otherwise, or (ii) ownership of fifty percent (50%) or more of the
|
| 23 |
-
outstanding shares, or (iii) beneficial ownership of such entity.
|
| 24 |
-
|
| 25 |
-
"You" (or "Your") shall mean an individual or Legal Entity
|
| 26 |
-
exercising permissions granted by this License.
|
| 27 |
-
|
| 28 |
-
"Source" form shall mean the preferred form for making modifications,
|
| 29 |
-
including but not limited to software source code, documentation
|
| 30 |
-
source, and configuration files.
|
| 31 |
-
|
| 32 |
-
"Object" form shall mean any form resulting from mechanical
|
| 33 |
-
transformation or translation of a Source form, including but
|
| 34 |
-
not limited to compiled object code, generated documentation,
|
| 35 |
-
and conversions to other media types.
|
| 36 |
-
|
| 37 |
-
"Work" shall mean the work of authorship, whether in Source or
|
| 38 |
-
Object form, made available under the License, as indicated by a
|
| 39 |
-
copyright notice that is included in or attached to the work
|
| 40 |
-
(an example is provided in the Appendix below).
|
| 41 |
-
|
| 42 |
-
"Derivative Works" shall mean any work, whether in Source or Object
|
| 43 |
-
form, that is based on (or derived from) the Work and for which the
|
| 44 |
-
editorial revisions, annotations, elaborations, or other modifications
|
| 45 |
-
represent, as a whole, an original work of authorship. For the purposes
|
| 46 |
-
of this License, Derivative Works shall not include works that remain
|
| 47 |
-
separable from, or merely link (or bind by name) to the interfaces of,
|
| 48 |
-
the Work and Derivative Works thereof.
|
| 49 |
-
|
| 50 |
-
"Contribution" shall mean any work of authorship, including
|
| 51 |
-
the original version of the Work and any modifications or additions
|
| 52 |
-
to that Work or Derivative Works thereof, that is intentionally
|
| 53 |
-
submitted to Licensor for inclusion in the Work by the copyright owner
|
| 54 |
-
or by an individual or Legal Entity authorized to submit on behalf of
|
| 55 |
-
the copyright owner. For the purposes of this definition, "submitted"
|
| 56 |
-
means any form of electronic, verbal, or written communication sent
|
| 57 |
-
to the Licensor or its representatives, including but not limited to
|
| 58 |
-
communication on electronic mailing lists, source code control systems,
|
| 59 |
-
and issue tracking systems that are managed by, or on behalf of, the
|
| 60 |
-
Licensor for the purpose of discussing and improving the Work, but
|
| 61 |
-
excluding communication that is conspicuously marked or otherwise
|
| 62 |
-
designated in writing by the copyright owner as "Not a Contribution."
|
| 63 |
-
|
| 64 |
-
"Contributor" shall mean Licensor and any individual or Legal Entity
|
| 65 |
-
on behalf of whom a Contribution has been received by Licensor and
|
| 66 |
-
subsequently incorporated within the Work.
|
| 67 |
-
|
| 68 |
-
2. Grant of Copyright License. Subject to the terms and conditions of
|
| 69 |
-
this License, each Contributor hereby grants to You a perpetual,
|
| 70 |
-
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
| 71 |
-
copyright license to reproduce, prepare Derivative Works of,
|
| 72 |
-
publicly display, publicly perform, sublicense, and distribute the
|
| 73 |
-
Work and such Derivative Works in Source or Object form.
|
| 74 |
-
|
| 75 |
-
3. Grant of Patent License. Subject to the terms and conditions of
|
| 76 |
-
this License, each Contributor hereby grants to You a perpetual,
|
| 77 |
-
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
| 78 |
-
(except as stated in this section) patent license to make, have made,
|
| 79 |
-
use, offer to sell, sell, import, and otherwise transfer the Work,
|
| 80 |
-
where such license applies only to those patent claims licensable
|
| 81 |
-
by such Contributor that are necessarily infringed by their
|
| 82 |
-
Contribution(s) alone or by combination of their Contribution(s)
|
| 83 |
-
with the Work to which such Contribution(s) was submitted. If You
|
| 84 |
-
institute patent litigation against any entity (including a
|
| 85 |
-
cross-claim or counterclaim in a lawsuit) alleging that the Work
|
| 86 |
-
or a Contribution incorporated within the Work constitutes direct
|
| 87 |
-
or contributory patent infringement, then any patent licenses
|
| 88 |
-
granted to You under this License for that Work shall terminate
|
| 89 |
-
as of the date such litigation is filed.
|
| 90 |
-
|
| 91 |
-
4. Redistribution. You may reproduce and distribute copies of the
|
| 92 |
-
Work or Derivative Works thereof in any medium, with or without
|
| 93 |
-
modifications, and in Source or Object form, provided that You
|
| 94 |
-
meet the following conditions:
|
| 95 |
-
|
| 96 |
-
(a) You must give any other recipients of the Work or
|
| 97 |
-
Derivative Works a copy of this License; and
|
| 98 |
-
|
| 99 |
-
(b) You must cause any modified files to carry prominent notices
|
| 100 |
-
stating that You changed the files; and
|
| 101 |
-
|
| 102 |
-
(c) You must retain, in the Source form of any Derivative Works
|
| 103 |
-
that You distribute, all copyright, patent, trademark, and
|
| 104 |
-
attribution notices from the Source form of the Work,
|
| 105 |
-
excluding those notices that do not pertain to any part of
|
| 106 |
-
the Derivative Works; and
|
| 107 |
-
|
| 108 |
-
(d) If the Work includes a "NOTICE" text file as part of its
|
| 109 |
-
distribution, then any Derivative Works that You distribute must
|
| 110 |
-
include a readable copy of the attribution notices contained
|
| 111 |
-
within such NOTICE file, excluding those notices that do not
|
| 112 |
-
pertain to any part of the Derivative Works, in at least one
|
| 113 |
-
of the following places: within a NOTICE text file distributed
|
| 114 |
-
as part of the Derivative Works; within the Source form or
|
| 115 |
-
documentation, if provided along with the Derivative Works; or,
|
| 116 |
-
within a display generated by the Derivative Works, if and
|
| 117 |
-
wherever such third-party notices normally appear. The contents
|
| 118 |
-
of the NOTICE file are for informational purposes only and
|
| 119 |
-
do not modify the License. You may add Your own attribution
|
| 120 |
-
notices within Derivative Works that You distribute, alongside
|
| 121 |
-
or as an addendum to the NOTICE text from the Work, provided
|
| 122 |
-
that such additional attribution notices cannot be construed
|
| 123 |
-
as modifying the License.
|
| 124 |
-
|
| 125 |
-
You may add Your own copyright statement to Your modifications and
|
| 126 |
-
may provide additional or different license terms and conditions
|
| 127 |
-
for use, reproduction, or distribution of Your modifications, or
|
| 128 |
-
for any such Derivative Works as a whole, provided Your use,
|
| 129 |
-
reproduction, and distribution of the Work otherwise complies with
|
| 130 |
-
the conditions stated in this License.
|
| 131 |
-
|
| 132 |
-
5. Submission of Contributions. Unless You explicitly state otherwise,
|
| 133 |
-
any Contribution intentionally submitted for inclusion in the Work
|
| 134 |
-
by You to the Licensor shall be under the terms and conditions of
|
| 135 |
-
this License, without any additional terms or conditions.
|
| 136 |
-
Notwithstanding the above, nothing herein shall supersede or modify
|
| 137 |
-
the terms of any separate license agreement you may have executed
|
| 138 |
-
with Licensor regarding such Contributions.
|
| 139 |
-
|
| 140 |
-
6. Trademarks. This License does not grant permission to use the trade
|
| 141 |
-
names, trademarks, service marks, or product names of the Licensor,
|
| 142 |
-
except as required for reasonable and customary use in describing the
|
| 143 |
-
origin of the Work and reproducing the content of the NOTICE file.
|
| 144 |
-
|
| 145 |
-
7. Disclaimer of Warranty. Unless required by applicable law or
|
| 146 |
-
agreed to in writing, Licensor provides the Work (and each
|
| 147 |
-
Contributor provides its Contributions) on an "AS IS" BASIS,
|
| 148 |
-
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
|
| 149 |
-
implied, including, without limitation, any warranties or conditions
|
| 150 |
-
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
|
| 151 |
-
PARTICULAR PURPOSE. You are solely responsible for determining the
|
| 152 |
-
appropriateness of using or redistributing the Work and assume any
|
| 153 |
-
risks associated with Your exercise of permissions under this License.
|
| 154 |
-
|
| 155 |
-
8. Limitation of Liability. In no event and under no legal theory,
|
| 156 |
-
whether in tort (including negligence), contract, or otherwise,
|
| 157 |
-
unless required by applicable law (such as deliberate and grossly
|
| 158 |
-
negligent acts) or agreed to in writing, shall any Contributor be
|
| 159 |
-
liable to You for damages, including any direct, indirect, special,
|
| 160 |
-
incidental, or consequential damages of any character arising as a
|
| 161 |
-
result of this License or out of the use or inability to use the
|
| 162 |
-
Work (including but not limited to damages for loss of goodwill,
|
| 163 |
-
work stoppage, computer failure or malfunction, or any and all
|
| 164 |
-
other commercial damages or losses), even if such Contributor
|
| 165 |
-
has been advised of the possibility of such damages.
|
| 166 |
-
|
| 167 |
-
9. Accepting Warranty or Additional Liability. While redistributing
|
| 168 |
-
the Work or Derivative Works thereof, You may choose to offer,
|
| 169 |
-
and charge a fee for, acceptance of support, warranty, indemnity,
|
| 170 |
-
or other liability obligations and/or rights consistent with this
|
| 171 |
-
License. However, in accepting such obligations, You may act only
|
| 172 |
-
on Your own behalf and on Your sole responsibility, not on behalf
|
| 173 |
-
of any other Contributor, and only if You agree to indemnify,
|
| 174 |
-
defend, and hold each Contributor harmless for any liability
|
| 175 |
-
incurred by, or claims asserted against, such Contributor by reason
|
| 176 |
-
of your accepting any such warranty or additional liability.
|
| 177 |
-
|
| 178 |
-
END OF TERMS AND CONDITIONS
|
| 179 |
-
|
| 180 |
-
APPENDIX: How to apply the Apache License to your work.
|
| 181 |
-
|
| 182 |
-
To apply the Apache License to your work, attach the following
|
| 183 |
-
boilerplate notice, with the fields enclosed by brackets "[]"
|
| 184 |
-
replaced with your own identifying information. (Don't include
|
| 185 |
-
the brackets!) The text should be enclosed in the appropriate
|
| 186 |
-
comment syntax for the file format. We also recommend that a
|
| 187 |
-
file or class name and description of purpose be included on the
|
| 188 |
-
same "printed page" as the copyright notice for easier
|
| 189 |
-
identification within third-party archives.
|
| 190 |
-
|
| 191 |
-
Copyright 2015, The TensorFlow Authors.
|
| 192 |
-
|
| 193 |
-
Licensed under the Apache License, Version 2.0 (the "License");
|
| 194 |
-
you may not use this file except in compliance with the License.
|
| 195 |
-
You may obtain a copy of the License at
|
| 196 |
-
|
| 197 |
-
http://www.apache.org/licenses/LICENSE-2.0
|
| 198 |
-
|
| 199 |
-
Unless required by applicable law or agreed to in writing, software
|
| 200 |
-
distributed under the License is distributed on an "AS IS" BASIS,
|
| 201 |
-
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
| 202 |
-
See the License for the specific language governing permissions and
|
| 203 |
-
limitations under the License.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
faster_rcnn_inception_v2_coco_2018_01_28/README.md
DELETED
|
@@ -1,49 +0,0 @@
|
|
| 1 |
-
# Faster-RCNN InceptionV2 (COCO)
|
| 2 |
-
|
| 3 |
-
Object detection with the Faster-RCNN meta-architecture and an Inception v2 backbone,
|
| 4 |
-
trained on the COCO dataset. The model was originally distributed as a frozen TensorFlow
|
| 5 |
-
graph (`faster_rcnn_inception_v2_coco_2018_01_28.pb`) from the TensorFlow Object Detection
|
| 6 |
-
API and converted to ONNX for inference with OpenCV's DNN module.
|
| 7 |
-
|
| 8 |
-
## Model Details
|
| 9 |
-
- **Architecture**: Faster-RCNN with an Inception v2 backbone
|
| 10 |
-
- **Input**: RGB image, uint8, NHWC layout (`image_tensor:0`, shape `[1, H, W, 3]`)
|
| 11 |
-
- **Output**: `detection_boxes:0` (normalized `[ymin, xmin, ymax, xmax]`), `detection_scores:0`, `detection_classes:0` (1-based COCO ids), `num_detections:0`
|
| 12 |
-
- **Framework**: ONNX (converted from the TensorFlow frozen graph via tf2onnx, opset 18)
|
| 13 |
-
- **Original weights**: http://download.tensorflow.org/models/object_detection/faster_rcnn_inception_v2_coco_2018_01_28.tar.gz
|
| 14 |
-
|
| 15 |
-
## Usage
|
| 16 |
-
|
| 17 |
-
### Python
|
| 18 |
-
```bash
|
| 19 |
-
python demo.py --model faster_rcnn_inception_v2_coco_2018_01_28_2026jul.onnx --image example_outputs/input_image.png --output example_outputs/output_image.png --conf 0.3
|
| 20 |
-
```
|
| 21 |
-
|
| 22 |
-
### C++
|
| 23 |
-
The C++ demo runs inference with OpenCV's DNN module. Adjust the OpenCV paths to your setup:
|
| 24 |
-
```bash
|
| 25 |
-
OCV=/path/to/opencv # OpenCV source tree
|
| 26 |
-
OCVBUILD=/path/to/opencv/build # OpenCV build directory (generated headers + libs)
|
| 27 |
-
g++ -std=c++17 demo.cpp -o demo \
|
| 28 |
-
-I$OCV/include \
|
| 29 |
-
-I$OCV/modules/core/include \
|
| 30 |
-
-I$OCV/modules/dnn/include \
|
| 31 |
-
-I$OCV/modules/imgproc/include \
|
| 32 |
-
-I$OCV/modules/imgcodecs/include \
|
| 33 |
-
-I$OCVBUILD \
|
| 34 |
-
-L$OCVBUILD/lib -Wl,-rpath,$OCVBUILD/lib -lopencv_dnn -lopencv_imgcodecs -lopencv_imgproc -lopencv_core
|
| 35 |
-
./demo --model faster_rcnn_inception_v2_coco_2018_01_28_2026jul.onnx --image example_outputs/input_image.png --output example_outputs/output_image.png
|
| 36 |
-
```
|
| 37 |
-
|
| 38 |
-
## Conversion
|
| 39 |
-
The ONNX model was exported from the frozen TensorFlow graph with tf2onnx (opset 18)
|
| 40 |
-
via [convert_to_onnx.py](./convert_to_onnx.py) — input `image_tensor:0`, outputs
|
| 41 |
-
`detection_boxes:0`, `detection_scores:0`, `detection_classes:0`, `num_detections:0`.
|
| 42 |
-
Requires `tensorflow`, `tf2onnx`, and `onnx`.
|
| 43 |
-
|
| 44 |
-
```bash
|
| 45 |
-
python convert_to_onnx.py --pb ../pb/faster_rcnn_inception_v2_coco_2018_01_28.pb
|
| 46 |
-
```
|
| 47 |
-
|
| 48 |
-
## License
|
| 49 |
-
See [LICENSE](./LICENSE) — the model is released by the TensorFlow Authors under the Apache License 2.0.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
faster_rcnn_inception_v2_coco_2018_01_28/convert_to_onnx.py
DELETED
|
@@ -1,40 +0,0 @@
|
|
| 1 |
-
import argparse
|
| 2 |
-
import datetime
|
| 3 |
-
|
| 4 |
-
import onnx
|
| 5 |
-
import tensorflow as tf
|
| 6 |
-
import tf2onnx
|
| 7 |
-
|
| 8 |
-
|
| 9 |
-
def load_graph_def(pb_path):
|
| 10 |
-
with tf.io.gfile.GFile(pb_path, "rb") as f:
|
| 11 |
-
graph_def = tf.compat.v1.GraphDef()
|
| 12 |
-
graph_def.ParseFromString(f.read())
|
| 13 |
-
return graph_def
|
| 14 |
-
|
| 15 |
-
|
| 16 |
-
def main():
|
| 17 |
-
parser = argparse.ArgumentParser(description="Export faster_rcnn_inception_v2_coco_2018_01_28.pb to ONNX")
|
| 18 |
-
parser.add_argument("--pb", default="../pb/faster_rcnn_inception_v2_coco_2018_01_28.pb")
|
| 19 |
-
parser.add_argument("--opset", type=int, default=18)
|
| 20 |
-
args = parser.parse_args()
|
| 21 |
-
|
| 22 |
-
graph_def = load_graph_def(args.pb)
|
| 23 |
-
|
| 24 |
-
model_proto, _ = tf2onnx.convert.from_graph_def(
|
| 25 |
-
graph_def,
|
| 26 |
-
input_names=["image_tensor:0"],
|
| 27 |
-
output_names=["detection_boxes:0", "detection_scores:0", "detection_classes:0", "num_detections:0"],
|
| 28 |
-
opset=args.opset,
|
| 29 |
-
)
|
| 30 |
-
onnx.checker.check_model(model_proto)
|
| 31 |
-
|
| 32 |
-
stamp = datetime.datetime.now().strftime("%Y%b").lower()
|
| 33 |
-
onnx_path = "faster_rcnn_inception_v2_coco_2018_01_28_%s.onnx" % stamp
|
| 34 |
-
with open(onnx_path, "wb") as f:
|
| 35 |
-
f.write(model_proto.SerializeToString())
|
| 36 |
-
print("wrote", onnx_path)
|
| 37 |
-
|
| 38 |
-
|
| 39 |
-
if __name__ == "__main__":
|
| 40 |
-
main()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
faster_rcnn_inception_v2_coco_2018_01_28/demo.cpp
DELETED
|
@@ -1,83 +0,0 @@
|
|
| 1 |
-
#include <opencv2/dnn.hpp>
|
| 2 |
-
#include <opencv2/imgproc.hpp>
|
| 3 |
-
#include <opencv2/imgcodecs.hpp>
|
| 4 |
-
#include <array>
|
| 5 |
-
#include <cstdint>
|
| 6 |
-
#include <iostream>
|
| 7 |
-
#include <string>
|
| 8 |
-
#include <vector>
|
| 9 |
-
|
| 10 |
-
static std::string argVal(int argc, char** argv, const std::string& key, const std::string& def)
|
| 11 |
-
{
|
| 12 |
-
for (int i = 1; i + 1 < argc; ++i)
|
| 13 |
-
if (key == argv[i]) return argv[i + 1];
|
| 14 |
-
return def;
|
| 15 |
-
}
|
| 16 |
-
|
| 17 |
-
int main(int argc, char** argv)
|
| 18 |
-
{
|
| 19 |
-
std::string model = argVal(argc, argv, "--model", "faster_rcnn_inception_v2_coco_2018_01_28_2026jul.onnx");
|
| 20 |
-
std::string image = argVal(argc, argv, "--image", "example_outputs/input_image.png");
|
| 21 |
-
std::string output = argVal(argc, argv, "--output", "example_outputs/output_image.png");
|
| 22 |
-
float conf = std::stof(argVal(argc, argv, "--conf", "0.3"));
|
| 23 |
-
|
| 24 |
-
cv::Mat img = cv::imread(image);
|
| 25 |
-
if (img.empty())
|
| 26 |
-
{
|
| 27 |
-
std::cerr << "could not read image: " << image << std::endl;
|
| 28 |
-
return 1;
|
| 29 |
-
}
|
| 30 |
-
|
| 31 |
-
const int W = 800, H = 600;
|
| 32 |
-
cv::Mat rgb;
|
| 33 |
-
cv::cvtColor(img, rgb, cv::COLOR_BGR2RGB);
|
| 34 |
-
cv::resize(rgb, rgb, cv::Size(W, H));
|
| 35 |
-
if (!rgb.isContinuous()) rgb = rgb.clone();
|
| 36 |
-
|
| 37 |
-
int blobShape[] = {1, H, W, 3};
|
| 38 |
-
cv::Mat blob(4, blobShape, CV_8U, rgb.data);
|
| 39 |
-
cv::dnn::Net net = cv::dnn::readNetFromONNX(model, cv::dnn::ENGINE_ORT);
|
| 40 |
-
net.setInput(blob);
|
| 41 |
-
std::vector<cv::String> out_strs = {"detection_boxes:0", "detection_scores:0", "detection_classes:0", "num_detections:0"};
|
| 42 |
-
std::vector<cv::Mat> outs;
|
| 43 |
-
net.forward(outs, out_strs);
|
| 44 |
-
|
| 45 |
-
float* boxes = nullptr;
|
| 46 |
-
float* scores = nullptr;
|
| 47 |
-
float* classes = nullptr;
|
| 48 |
-
float* numd = nullptr;
|
| 49 |
-
for (size_t i = 0; i < out_strs.size(); ++i)
|
| 50 |
-
{
|
| 51 |
-
float* p = (float*)outs[i].data;
|
| 52 |
-
const std::string& n = out_strs[i];
|
| 53 |
-
if (n.find("detection_boxes") != std::string::npos) boxes = p;
|
| 54 |
-
else if (n.find("detection_scores") != std::string::npos) scores = p;
|
| 55 |
-
else if (n.find("detection_classes") != std::string::npos) classes = p;
|
| 56 |
-
else if (n.find("num_detections") != std::string::npos) numd = p;
|
| 57 |
-
}
|
| 58 |
-
int nd = (int)numd[0];
|
| 59 |
-
|
| 60 |
-
int w = img.cols, h = img.rows;
|
| 61 |
-
std::vector<int> kept;
|
| 62 |
-
for (int i = 0; i < nd; ++i)
|
| 63 |
-
if (scores[i] >= conf) kept.push_back(i);
|
| 64 |
-
|
| 65 |
-
std::cout << "faster_rcnn_inception_v2_coco_2018_01_28 " << kept.size() << " detections" << std::endl;
|
| 66 |
-
for (int i : kept)
|
| 67 |
-
{
|
| 68 |
-
int cls = (int)classes[i] - 1;
|
| 69 |
-
float score = scores[i];
|
| 70 |
-
float ymin = boxes[i * 4 + 0], xmin = boxes[i * 4 + 1];
|
| 71 |
-
float ymax = boxes[i * 4 + 2], xmax = boxes[i * 4 + 3];
|
| 72 |
-
cv::Point p1((int)(xmin * w), (int)(ymin * h));
|
| 73 |
-
cv::Point p2((int)(xmax * w), (int)(ymax * h));
|
| 74 |
-
cv::rectangle(img, p1, p2, cv::Scalar(0, 255, 0), 2);
|
| 75 |
-
cv::putText(img, cv::format("%d:%.2f", cls, score), cv::Point(p1.x, p1.y - 5),
|
| 76 |
-
cv::FONT_HERSHEY_SIMPLEX, 0.5, cv::Scalar(0, 255, 0), 1);
|
| 77 |
-
std::cout << cls << " " << cv::format("%.3f %.3f %.3f %.3f %.3f", score, xmin, ymin, xmax, ymax) << std::endl;
|
| 78 |
-
}
|
| 79 |
-
|
| 80 |
-
cv::imwrite(output, img);
|
| 81 |
-
std::cout << "wrote " << output << std::endl;
|
| 82 |
-
return 0;
|
| 83 |
-
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
faster_rcnn_inception_v2_coco_2018_01_28/demo.py
DELETED
|
@@ -1,51 +0,0 @@
|
|
| 1 |
-
import argparse
|
| 2 |
-
import glob
|
| 3 |
-
import os
|
| 4 |
-
|
| 5 |
-
import cv2 as cv
|
| 6 |
-
import numpy as np
|
| 7 |
-
|
| 8 |
-
here = os.path.dirname(os.path.abspath(__file__))
|
| 9 |
-
|
| 10 |
-
|
| 11 |
-
def main():
|
| 12 |
-
parser = argparse.ArgumentParser(description="Faster-RCNN InceptionV2 (COCO) ONNX detection demo")
|
| 13 |
-
parser.add_argument("--model", default=None)
|
| 14 |
-
parser.add_argument("--image", default=os.path.join(here, "example_outputs", "input_image.png"))
|
| 15 |
-
parser.add_argument("--output", default=os.path.join(here, "example_outputs", "output_image.png"))
|
| 16 |
-
parser.add_argument("--conf", type=float, default=0.3)
|
| 17 |
-
args = parser.parse_args()
|
| 18 |
-
|
| 19 |
-
model = args.model or glob.glob(os.path.join(here, "*.onnx"))[0]
|
| 20 |
-
img = cv.imread(args.image)
|
| 21 |
-
if img is None:
|
| 22 |
-
raise SystemExit("could not read image: %s" % args.image)
|
| 23 |
-
|
| 24 |
-
rgb = cv.resize(cv.cvtColor(img, cv.COLOR_BGR2RGB), (800, 600))
|
| 25 |
-
net = cv.dnn.readNetFromONNX(model, cv.dnn.ENGINE_ORT)
|
| 26 |
-
onames = ["detection_boxes:0", "detection_scores:0", "detection_classes:0", "num_detections:0"]
|
| 27 |
-
net.setInput(rgb[None].astype(np.uint8))
|
| 28 |
-
res = net.forward(onames)
|
| 29 |
-
boxes = res[[i for i, n in enumerate(onames) if "detection_boxes" in n][0]].reshape(-1, 4)
|
| 30 |
-
scores = res[[i for i, n in enumerate(onames) if "detection_scores" in n][0]].reshape(-1)
|
| 31 |
-
classes = res[[i for i, n in enumerate(onames) if "detection_classes" in n][0]].reshape(-1)
|
| 32 |
-
nd = int(res[[i for i, n in enumerate(onames) if "num_detections" in n][0]].reshape(-1)[0])
|
| 33 |
-
|
| 34 |
-
out = np.zeros((nd, 7), np.float32)
|
| 35 |
-
out[:, 1] = classes[:nd] - 1
|
| 36 |
-
out[:, 2] = scores[:nd]
|
| 37 |
-
out[:, 3:7] = boxes[:nd][:, [1, 0, 3, 2]]
|
| 38 |
-
|
| 39 |
-
h, w = img.shape[:2]
|
| 40 |
-
kept = [row for row in out if row[2] >= args.conf]
|
| 41 |
-
print(os.path.basename(here), len(kept), "detections")
|
| 42 |
-
for row in kept:
|
| 43 |
-
cv.rectangle(img, (int(row[3] * w), int(row[4] * h)), (int(row[5] * w), int(row[6] * h)), (0, 255, 0), 2)
|
| 44 |
-
cv.putText(img, "%d:%.2f" % (int(row[1]), row[2]), (int(row[3] * w), int(row[4] * h) - 5), cv.FONT_HERSHEY_SIMPLEX, 0.5, (0, 255, 0), 1)
|
| 45 |
-
print(int(row[1]), round(float(row[2]), 3), round(float(row[3]), 3), round(float(row[4]), 3), round(float(row[5]), 3), round(float(row[6]), 3))
|
| 46 |
-
cv.imwrite(args.output, img)
|
| 47 |
-
print("wrote", args.output)
|
| 48 |
-
|
| 49 |
-
|
| 50 |
-
if __name__ == "__main__":
|
| 51 |
-
main()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
faster_rcnn_inception_v2_coco_2018_01_28/example_outputs/input_image.png
DELETED
Git LFS Details
|
faster_rcnn_inception_v2_coco_2018_01_28/example_outputs/output_image.png
DELETED
Git LFS Details
|
faster_rcnn_inception_v2_coco_2018_01_28/faster_rcnn_inception_v2_coco_2018_01_28_2026jul.onnx
DELETED
|
@@ -1,3 +0,0 @@
|
|
| 1 |
-
version https://git-lfs.github.com/spec/v1
|
| 2 |
-
oid sha256:bcf541da5a58e9d8ab6c16e4c803ccc4e0da7dd62ad89311ae2a75c36b39835b
|
| 3 |
-
size 57016094
|
|
|
|
|
|
|
|
|
|
|
|
faster_rcnn_resnet50_coco_2018_01_28/LICENSE
DELETED
|
@@ -1,203 +0,0 @@
|
|
| 1 |
-
Copyright 2015 The TensorFlow Authors. All rights reserved.
|
| 2 |
-
|
| 3 |
-
Apache License
|
| 4 |
-
Version 2.0, January 2004
|
| 5 |
-
http://www.apache.org/licenses/
|
| 6 |
-
|
| 7 |
-
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
|
| 8 |
-
|
| 9 |
-
1. Definitions.
|
| 10 |
-
|
| 11 |
-
"License" shall mean the terms and conditions for use, reproduction,
|
| 12 |
-
and distribution as defined by Sections 1 through 9 of this document.
|
| 13 |
-
|
| 14 |
-
"Licensor" shall mean the copyright owner or entity authorized by
|
| 15 |
-
the copyright owner that is granting the License.
|
| 16 |
-
|
| 17 |
-
"Legal Entity" shall mean the union of the acting entity and all
|
| 18 |
-
other entities that control, are controlled by, or are under common
|
| 19 |
-
control with that entity. For the purposes of this definition,
|
| 20 |
-
"control" means (i) the power, direct or indirect, to cause the
|
| 21 |
-
direction or management of such entity, whether by contract or
|
| 22 |
-
otherwise, or (ii) ownership of fifty percent (50%) or more of the
|
| 23 |
-
outstanding shares, or (iii) beneficial ownership of such entity.
|
| 24 |
-
|
| 25 |
-
"You" (or "Your") shall mean an individual or Legal Entity
|
| 26 |
-
exercising permissions granted by this License.
|
| 27 |
-
|
| 28 |
-
"Source" form shall mean the preferred form for making modifications,
|
| 29 |
-
including but not limited to software source code, documentation
|
| 30 |
-
source, and configuration files.
|
| 31 |
-
|
| 32 |
-
"Object" form shall mean any form resulting from mechanical
|
| 33 |
-
transformation or translation of a Source form, including but
|
| 34 |
-
not limited to compiled object code, generated documentation,
|
| 35 |
-
and conversions to other media types.
|
| 36 |
-
|
| 37 |
-
"Work" shall mean the work of authorship, whether in Source or
|
| 38 |
-
Object form, made available under the License, as indicated by a
|
| 39 |
-
copyright notice that is included in or attached to the work
|
| 40 |
-
(an example is provided in the Appendix below).
|
| 41 |
-
|
| 42 |
-
"Derivative Works" shall mean any work, whether in Source or Object
|
| 43 |
-
form, that is based on (or derived from) the Work and for which the
|
| 44 |
-
editorial revisions, annotations, elaborations, or other modifications
|
| 45 |
-
represent, as a whole, an original work of authorship. For the purposes
|
| 46 |
-
of this License, Derivative Works shall not include works that remain
|
| 47 |
-
separable from, or merely link (or bind by name) to the interfaces of,
|
| 48 |
-
the Work and Derivative Works thereof.
|
| 49 |
-
|
| 50 |
-
"Contribution" shall mean any work of authorship, including
|
| 51 |
-
the original version of the Work and any modifications or additions
|
| 52 |
-
to that Work or Derivative Works thereof, that is intentionally
|
| 53 |
-
submitted to Licensor for inclusion in the Work by the copyright owner
|
| 54 |
-
or by an individual or Legal Entity authorized to submit on behalf of
|
| 55 |
-
the copyright owner. For the purposes of this definition, "submitted"
|
| 56 |
-
means any form of electronic, verbal, or written communication sent
|
| 57 |
-
to the Licensor or its representatives, including but not limited to
|
| 58 |
-
communication on electronic mailing lists, source code control systems,
|
| 59 |
-
and issue tracking systems that are managed by, or on behalf of, the
|
| 60 |
-
Licensor for the purpose of discussing and improving the Work, but
|
| 61 |
-
excluding communication that is conspicuously marked or otherwise
|
| 62 |
-
designated in writing by the copyright owner as "Not a Contribution."
|
| 63 |
-
|
| 64 |
-
"Contributor" shall mean Licensor and any individual or Legal Entity
|
| 65 |
-
on behalf of whom a Contribution has been received by Licensor and
|
| 66 |
-
subsequently incorporated within the Work.
|
| 67 |
-
|
| 68 |
-
2. Grant of Copyright License. Subject to the terms and conditions of
|
| 69 |
-
this License, each Contributor hereby grants to You a perpetual,
|
| 70 |
-
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
| 71 |
-
copyright license to reproduce, prepare Derivative Works of,
|
| 72 |
-
publicly display, publicly perform, sublicense, and distribute the
|
| 73 |
-
Work and such Derivative Works in Source or Object form.
|
| 74 |
-
|
| 75 |
-
3. Grant of Patent License. Subject to the terms and conditions of
|
| 76 |
-
this License, each Contributor hereby grants to You a perpetual,
|
| 77 |
-
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
| 78 |
-
(except as stated in this section) patent license to make, have made,
|
| 79 |
-
use, offer to sell, sell, import, and otherwise transfer the Work,
|
| 80 |
-
where such license applies only to those patent claims licensable
|
| 81 |
-
by such Contributor that are necessarily infringed by their
|
| 82 |
-
Contribution(s) alone or by combination of their Contribution(s)
|
| 83 |
-
with the Work to which such Contribution(s) was submitted. If You
|
| 84 |
-
institute patent litigation against any entity (including a
|
| 85 |
-
cross-claim or counterclaim in a lawsuit) alleging that the Work
|
| 86 |
-
or a Contribution incorporated within the Work constitutes direct
|
| 87 |
-
or contributory patent infringement, then any patent licenses
|
| 88 |
-
granted to You under this License for that Work shall terminate
|
| 89 |
-
as of the date such litigation is filed.
|
| 90 |
-
|
| 91 |
-
4. Redistribution. You may reproduce and distribute copies of the
|
| 92 |
-
Work or Derivative Works thereof in any medium, with or without
|
| 93 |
-
modifications, and in Source or Object form, provided that You
|
| 94 |
-
meet the following conditions:
|
| 95 |
-
|
| 96 |
-
(a) You must give any other recipients of the Work or
|
| 97 |
-
Derivative Works a copy of this License; and
|
| 98 |
-
|
| 99 |
-
(b) You must cause any modified files to carry prominent notices
|
| 100 |
-
stating that You changed the files; and
|
| 101 |
-
|
| 102 |
-
(c) You must retain, in the Source form of any Derivative Works
|
| 103 |
-
that You distribute, all copyright, patent, trademark, and
|
| 104 |
-
attribution notices from the Source form of the Work,
|
| 105 |
-
excluding those notices that do not pertain to any part of
|
| 106 |
-
the Derivative Works; and
|
| 107 |
-
|
| 108 |
-
(d) If the Work includes a "NOTICE" text file as part of its
|
| 109 |
-
distribution, then any Derivative Works that You distribute must
|
| 110 |
-
include a readable copy of the attribution notices contained
|
| 111 |
-
within such NOTICE file, excluding those notices that do not
|
| 112 |
-
pertain to any part of the Derivative Works, in at least one
|
| 113 |
-
of the following places: within a NOTICE text file distributed
|
| 114 |
-
as part of the Derivative Works; within the Source form or
|
| 115 |
-
documentation, if provided along with the Derivative Works; or,
|
| 116 |
-
within a display generated by the Derivative Works, if and
|
| 117 |
-
wherever such third-party notices normally appear. The contents
|
| 118 |
-
of the NOTICE file are for informational purposes only and
|
| 119 |
-
do not modify the License. You may add Your own attribution
|
| 120 |
-
notices within Derivative Works that You distribute, alongside
|
| 121 |
-
or as an addendum to the NOTICE text from the Work, provided
|
| 122 |
-
that such additional attribution notices cannot be construed
|
| 123 |
-
as modifying the License.
|
| 124 |
-
|
| 125 |
-
You may add Your own copyright statement to Your modifications and
|
| 126 |
-
may provide additional or different license terms and conditions
|
| 127 |
-
for use, reproduction, or distribution of Your modifications, or
|
| 128 |
-
for any such Derivative Works as a whole, provided Your use,
|
| 129 |
-
reproduction, and distribution of the Work otherwise complies with
|
| 130 |
-
the conditions stated in this License.
|
| 131 |
-
|
| 132 |
-
5. Submission of Contributions. Unless You explicitly state otherwise,
|
| 133 |
-
any Contribution intentionally submitted for inclusion in the Work
|
| 134 |
-
by You to the Licensor shall be under the terms and conditions of
|
| 135 |
-
this License, without any additional terms or conditions.
|
| 136 |
-
Notwithstanding the above, nothing herein shall supersede or modify
|
| 137 |
-
the terms of any separate license agreement you may have executed
|
| 138 |
-
with Licensor regarding such Contributions.
|
| 139 |
-
|
| 140 |
-
6. Trademarks. This License does not grant permission to use the trade
|
| 141 |
-
names, trademarks, service marks, or product names of the Licensor,
|
| 142 |
-
except as required for reasonable and customary use in describing the
|
| 143 |
-
origin of the Work and reproducing the content of the NOTICE file.
|
| 144 |
-
|
| 145 |
-
7. Disclaimer of Warranty. Unless required by applicable law or
|
| 146 |
-
agreed to in writing, Licensor provides the Work (and each
|
| 147 |
-
Contributor provides its Contributions) on an "AS IS" BASIS,
|
| 148 |
-
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
|
| 149 |
-
implied, including, without limitation, any warranties or conditions
|
| 150 |
-
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
|
| 151 |
-
PARTICULAR PURPOSE. You are solely responsible for determining the
|
| 152 |
-
appropriateness of using or redistributing the Work and assume any
|
| 153 |
-
risks associated with Your exercise of permissions under this License.
|
| 154 |
-
|
| 155 |
-
8. Limitation of Liability. In no event and under no legal theory,
|
| 156 |
-
whether in tort (including negligence), contract, or otherwise,
|
| 157 |
-
unless required by applicable law (such as deliberate and grossly
|
| 158 |
-
negligent acts) or agreed to in writing, shall any Contributor be
|
| 159 |
-
liable to You for damages, including any direct, indirect, special,
|
| 160 |
-
incidental, or consequential damages of any character arising as a
|
| 161 |
-
result of this License or out of the use or inability to use the
|
| 162 |
-
Work (including but not limited to damages for loss of goodwill,
|
| 163 |
-
work stoppage, computer failure or malfunction, or any and all
|
| 164 |
-
other commercial damages or losses), even if such Contributor
|
| 165 |
-
has been advised of the possibility of such damages.
|
| 166 |
-
|
| 167 |
-
9. Accepting Warranty or Additional Liability. While redistributing
|
| 168 |
-
the Work or Derivative Works thereof, You may choose to offer,
|
| 169 |
-
and charge a fee for, acceptance of support, warranty, indemnity,
|
| 170 |
-
or other liability obligations and/or rights consistent with this
|
| 171 |
-
License. However, in accepting such obligations, You may act only
|
| 172 |
-
on Your own behalf and on Your sole responsibility, not on behalf
|
| 173 |
-
of any other Contributor, and only if You agree to indemnify,
|
| 174 |
-
defend, and hold each Contributor harmless for any liability
|
| 175 |
-
incurred by, or claims asserted against, such Contributor by reason
|
| 176 |
-
of your accepting any such warranty or additional liability.
|
| 177 |
-
|
| 178 |
-
END OF TERMS AND CONDITIONS
|
| 179 |
-
|
| 180 |
-
APPENDIX: How to apply the Apache License to your work.
|
| 181 |
-
|
| 182 |
-
To apply the Apache License to your work, attach the following
|
| 183 |
-
boilerplate notice, with the fields enclosed by brackets "[]"
|
| 184 |
-
replaced with your own identifying information. (Don't include
|
| 185 |
-
the brackets!) The text should be enclosed in the appropriate
|
| 186 |
-
comment syntax for the file format. We also recommend that a
|
| 187 |
-
file or class name and description of purpose be included on the
|
| 188 |
-
same "printed page" as the copyright notice for easier
|
| 189 |
-
identification within third-party archives.
|
| 190 |
-
|
| 191 |
-
Copyright 2015, The TensorFlow Authors.
|
| 192 |
-
|
| 193 |
-
Licensed under the Apache License, Version 2.0 (the "License");
|
| 194 |
-
you may not use this file except in compliance with the License.
|
| 195 |
-
You may obtain a copy of the License at
|
| 196 |
-
|
| 197 |
-
http://www.apache.org/licenses/LICENSE-2.0
|
| 198 |
-
|
| 199 |
-
Unless required by applicable law or agreed to in writing, software
|
| 200 |
-
distributed under the License is distributed on an "AS IS" BASIS,
|
| 201 |
-
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
| 202 |
-
See the License for the specific language governing permissions and
|
| 203 |
-
limitations under the License.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
faster_rcnn_resnet50_coco_2018_01_28/README.md
DELETED
|
@@ -1,49 +0,0 @@
|
|
| 1 |
-
# Faster-RCNN ResNet-50 (COCO)
|
| 2 |
-
|
| 3 |
-
Object detection with the Faster-RCNN meta-architecture and a ResNet-50 backbone,
|
| 4 |
-
trained on the COCO dataset. The model was originally distributed as a frozen TensorFlow
|
| 5 |
-
graph (`faster_rcnn_resnet50_coco_2018_01_28.pb`) from the TensorFlow Object Detection
|
| 6 |
-
API and converted to ONNX for inference with OpenCV's DNN module.
|
| 7 |
-
|
| 8 |
-
## Model Details
|
| 9 |
-
- **Architecture**: Faster-RCNN with a ResNet-50 backbone
|
| 10 |
-
- **Input**: RGB image, uint8, NHWC layout (`image_tensor:0`, shape `[1, H, W, 3]`)
|
| 11 |
-
- **Output**: `detection_boxes:0` (normalized `[ymin, xmin, ymax, xmax]`), `detection_scores:0`, `detection_classes:0` (1-based COCO ids), `num_detections:0`
|
| 12 |
-
- **Framework**: ONNX (converted from the TensorFlow frozen graph via tf2onnx, opset 18)
|
| 13 |
-
- **Original weights**: http://download.tensorflow.org/models/object_detection/faster_rcnn_resnet50_coco_2018_01_28.tar.gz
|
| 14 |
-
|
| 15 |
-
## Usage
|
| 16 |
-
|
| 17 |
-
### Python
|
| 18 |
-
```bash
|
| 19 |
-
python demo.py --model faster_rcnn_resnet50_coco_2018_01_28_2026jul.onnx --image example_outputs/input_image.png --output example_outputs/output_image.png --conf 0.3
|
| 20 |
-
```
|
| 21 |
-
|
| 22 |
-
### C++
|
| 23 |
-
The C++ demo runs inference with OpenCV's DNN module. Adjust the OpenCV paths to your setup:
|
| 24 |
-
```bash
|
| 25 |
-
OCV=/path/to/opencv # OpenCV source tree
|
| 26 |
-
OCVBUILD=/path/to/opencv/build # OpenCV build directory (generated headers + libs)
|
| 27 |
-
g++ -std=c++17 demo.cpp -o demo \
|
| 28 |
-
-I$OCV/include \
|
| 29 |
-
-I$OCV/modules/core/include \
|
| 30 |
-
-I$OCV/modules/dnn/include \
|
| 31 |
-
-I$OCV/modules/imgproc/include \
|
| 32 |
-
-I$OCV/modules/imgcodecs/include \
|
| 33 |
-
-I$OCVBUILD \
|
| 34 |
-
-L$OCVBUILD/lib -Wl,-rpath,$OCVBUILD/lib -lopencv_dnn -lopencv_imgcodecs -lopencv_imgproc -lopencv_core
|
| 35 |
-
./demo --model faster_rcnn_resnet50_coco_2018_01_28_2026jul.onnx --image example_outputs/input_image.png --output example_outputs/output_image.png
|
| 36 |
-
```
|
| 37 |
-
|
| 38 |
-
## Conversion
|
| 39 |
-
The ONNX model was exported from the frozen TensorFlow graph with tf2onnx (opset 18)
|
| 40 |
-
via [convert_to_onnx.py](./convert_to_onnx.py) — input `image_tensor:0`, outputs
|
| 41 |
-
`detection_boxes:0`, `detection_scores:0`, `detection_classes:0`, `num_detections:0`.
|
| 42 |
-
Requires `tensorflow`, `tf2onnx`, and `onnx`.
|
| 43 |
-
|
| 44 |
-
```bash
|
| 45 |
-
python convert_to_onnx.py --pb ../pb/faster_rcnn_resnet50_coco_2018_01_28.pb
|
| 46 |
-
```
|
| 47 |
-
|
| 48 |
-
## License
|
| 49 |
-
See [LICENSE](./LICENSE) — the model is released by the TensorFlow Authors under the Apache License 2.0.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
faster_rcnn_resnet50_coco_2018_01_28/convert_to_onnx.py
DELETED
|
@@ -1,40 +0,0 @@
|
|
| 1 |
-
import argparse
|
| 2 |
-
import datetime
|
| 3 |
-
|
| 4 |
-
import onnx
|
| 5 |
-
import tensorflow as tf
|
| 6 |
-
import tf2onnx
|
| 7 |
-
|
| 8 |
-
|
| 9 |
-
def load_graph_def(pb_path):
|
| 10 |
-
with tf.io.gfile.GFile(pb_path, "rb") as f:
|
| 11 |
-
graph_def = tf.compat.v1.GraphDef()
|
| 12 |
-
graph_def.ParseFromString(f.read())
|
| 13 |
-
return graph_def
|
| 14 |
-
|
| 15 |
-
|
| 16 |
-
def main():
|
| 17 |
-
parser = argparse.ArgumentParser(description="Export faster_rcnn_resnet50_coco_2018_01_28.pb to ONNX")
|
| 18 |
-
parser.add_argument("--pb", default="../pb/faster_rcnn_resnet50_coco_2018_01_28.pb")
|
| 19 |
-
parser.add_argument("--opset", type=int, default=18)
|
| 20 |
-
args = parser.parse_args()
|
| 21 |
-
|
| 22 |
-
graph_def = load_graph_def(args.pb)
|
| 23 |
-
|
| 24 |
-
model_proto, _ = tf2onnx.convert.from_graph_def(
|
| 25 |
-
graph_def,
|
| 26 |
-
input_names=["image_tensor:0"],
|
| 27 |
-
output_names=["detection_boxes:0", "detection_scores:0", "detection_classes:0", "num_detections:0"],
|
| 28 |
-
opset=args.opset,
|
| 29 |
-
)
|
| 30 |
-
onnx.checker.check_model(model_proto)
|
| 31 |
-
|
| 32 |
-
stamp = datetime.datetime.now().strftime("%Y%b").lower()
|
| 33 |
-
onnx_path = "faster_rcnn_resnet50_coco_2018_01_28_%s.onnx" % stamp
|
| 34 |
-
with open(onnx_path, "wb") as f:
|
| 35 |
-
f.write(model_proto.SerializeToString())
|
| 36 |
-
print("wrote", onnx_path)
|
| 37 |
-
|
| 38 |
-
|
| 39 |
-
if __name__ == "__main__":
|
| 40 |
-
main()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
faster_rcnn_resnet50_coco_2018_01_28/demo.cpp
DELETED
|
@@ -1,83 +0,0 @@
|
|
| 1 |
-
#include <opencv2/dnn.hpp>
|
| 2 |
-
#include <opencv2/imgproc.hpp>
|
| 3 |
-
#include <opencv2/imgcodecs.hpp>
|
| 4 |
-
#include <array>
|
| 5 |
-
#include <cstdint>
|
| 6 |
-
#include <iostream>
|
| 7 |
-
#include <string>
|
| 8 |
-
#include <vector>
|
| 9 |
-
|
| 10 |
-
static std::string argVal(int argc, char** argv, const std::string& key, const std::string& def)
|
| 11 |
-
{
|
| 12 |
-
for (int i = 1; i + 1 < argc; ++i)
|
| 13 |
-
if (key == argv[i]) return argv[i + 1];
|
| 14 |
-
return def;
|
| 15 |
-
}
|
| 16 |
-
|
| 17 |
-
int main(int argc, char** argv)
|
| 18 |
-
{
|
| 19 |
-
std::string model = argVal(argc, argv, "--model", "faster_rcnn_resnet50_coco_2018_01_28_2026jul.onnx");
|
| 20 |
-
std::string image = argVal(argc, argv, "--image", "example_outputs/input_image.png");
|
| 21 |
-
std::string output = argVal(argc, argv, "--output", "example_outputs/output_image.png");
|
| 22 |
-
float conf = std::stof(argVal(argc, argv, "--conf", "0.3"));
|
| 23 |
-
|
| 24 |
-
cv::Mat img = cv::imread(image);
|
| 25 |
-
if (img.empty())
|
| 26 |
-
{
|
| 27 |
-
std::cerr << "could not read image: " << image << std::endl;
|
| 28 |
-
return 1;
|
| 29 |
-
}
|
| 30 |
-
|
| 31 |
-
const int W = 800, H = 600;
|
| 32 |
-
cv::Mat rgb;
|
| 33 |
-
cv::cvtColor(img, rgb, cv::COLOR_BGR2RGB);
|
| 34 |
-
cv::resize(rgb, rgb, cv::Size(W, H));
|
| 35 |
-
if (!rgb.isContinuous()) rgb = rgb.clone();
|
| 36 |
-
|
| 37 |
-
int blobShape[] = {1, H, W, 3};
|
| 38 |
-
cv::Mat blob(4, blobShape, CV_8U, rgb.data);
|
| 39 |
-
cv::dnn::Net net = cv::dnn::readNetFromONNX(model, cv::dnn::ENGINE_ORT);
|
| 40 |
-
net.setInput(blob);
|
| 41 |
-
std::vector<cv::String> out_strs = {"detection_boxes:0", "detection_scores:0", "detection_classes:0", "num_detections:0"};
|
| 42 |
-
std::vector<cv::Mat> outs;
|
| 43 |
-
net.forward(outs, out_strs);
|
| 44 |
-
|
| 45 |
-
float* boxes = nullptr;
|
| 46 |
-
float* scores = nullptr;
|
| 47 |
-
float* classes = nullptr;
|
| 48 |
-
float* numd = nullptr;
|
| 49 |
-
for (size_t i = 0; i < out_strs.size(); ++i)
|
| 50 |
-
{
|
| 51 |
-
float* p = (float*)outs[i].data;
|
| 52 |
-
const std::string& n = out_strs[i];
|
| 53 |
-
if (n.find("detection_boxes") != std::string::npos) boxes = p;
|
| 54 |
-
else if (n.find("detection_scores") != std::string::npos) scores = p;
|
| 55 |
-
else if (n.find("detection_classes") != std::string::npos) classes = p;
|
| 56 |
-
else if (n.find("num_detections") != std::string::npos) numd = p;
|
| 57 |
-
}
|
| 58 |
-
int nd = (int)numd[0];
|
| 59 |
-
|
| 60 |
-
int w = img.cols, h = img.rows;
|
| 61 |
-
std::vector<int> kept;
|
| 62 |
-
for (int i = 0; i < nd; ++i)
|
| 63 |
-
if (scores[i] >= conf) kept.push_back(i);
|
| 64 |
-
|
| 65 |
-
std::cout << "faster_rcnn_resnet50_coco_2018_01_28 " << kept.size() << " detections" << std::endl;
|
| 66 |
-
for (int i : kept)
|
| 67 |
-
{
|
| 68 |
-
int cls = (int)classes[i] - 1;
|
| 69 |
-
float score = scores[i];
|
| 70 |
-
float ymin = boxes[i * 4 + 0], xmin = boxes[i * 4 + 1];
|
| 71 |
-
float ymax = boxes[i * 4 + 2], xmax = boxes[i * 4 + 3];
|
| 72 |
-
cv::Point p1((int)(xmin * w), (int)(ymin * h));
|
| 73 |
-
cv::Point p2((int)(xmax * w), (int)(ymax * h));
|
| 74 |
-
cv::rectangle(img, p1, p2, cv::Scalar(0, 255, 0), 2);
|
| 75 |
-
cv::putText(img, cv::format("%d:%.2f", cls, score), cv::Point(p1.x, p1.y - 5),
|
| 76 |
-
cv::FONT_HERSHEY_SIMPLEX, 0.5, cv::Scalar(0, 255, 0), 1);
|
| 77 |
-
std::cout << cls << " " << cv::format("%.3f %.3f %.3f %.3f %.3f", score, xmin, ymin, xmax, ymax) << std::endl;
|
| 78 |
-
}
|
| 79 |
-
|
| 80 |
-
cv::imwrite(output, img);
|
| 81 |
-
std::cout << "wrote " << output << std::endl;
|
| 82 |
-
return 0;
|
| 83 |
-
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
faster_rcnn_resnet50_coco_2018_01_28/demo.py
DELETED
|
@@ -1,51 +0,0 @@
|
|
| 1 |
-
import argparse
|
| 2 |
-
import glob
|
| 3 |
-
import os
|
| 4 |
-
|
| 5 |
-
import cv2 as cv
|
| 6 |
-
import numpy as np
|
| 7 |
-
|
| 8 |
-
here = os.path.dirname(os.path.abspath(__file__))
|
| 9 |
-
|
| 10 |
-
|
| 11 |
-
def main():
|
| 12 |
-
parser = argparse.ArgumentParser(description="Faster-RCNN ResNet-50 (COCO) ONNX detection demo")
|
| 13 |
-
parser.add_argument("--model", default=None)
|
| 14 |
-
parser.add_argument("--image", default=os.path.join(here, "example_outputs", "input_image.png"))
|
| 15 |
-
parser.add_argument("--output", default=os.path.join(here, "example_outputs", "output_image.png"))
|
| 16 |
-
parser.add_argument("--conf", type=float, default=0.3)
|
| 17 |
-
args = parser.parse_args()
|
| 18 |
-
|
| 19 |
-
model = args.model or glob.glob(os.path.join(here, "*.onnx"))[0]
|
| 20 |
-
img = cv.imread(args.image)
|
| 21 |
-
if img is None:
|
| 22 |
-
raise SystemExit("could not read image: %s" % args.image)
|
| 23 |
-
|
| 24 |
-
rgb = cv.resize(cv.cvtColor(img, cv.COLOR_BGR2RGB), (800, 600))
|
| 25 |
-
net = cv.dnn.readNetFromONNX(model, cv.dnn.ENGINE_ORT)
|
| 26 |
-
onames = ["detection_boxes:0", "detection_scores:0", "detection_classes:0", "num_detections:0"]
|
| 27 |
-
net.setInput(rgb[None].astype(np.uint8))
|
| 28 |
-
res = net.forward(onames)
|
| 29 |
-
boxes = res[[i for i, n in enumerate(onames) if "detection_boxes" in n][0]].reshape(-1, 4)
|
| 30 |
-
scores = res[[i for i, n in enumerate(onames) if "detection_scores" in n][0]].reshape(-1)
|
| 31 |
-
classes = res[[i for i, n in enumerate(onames) if "detection_classes" in n][0]].reshape(-1)
|
| 32 |
-
nd = int(res[[i for i, n in enumerate(onames) if "num_detections" in n][0]].reshape(-1)[0])
|
| 33 |
-
|
| 34 |
-
out = np.zeros((nd, 7), np.float32)
|
| 35 |
-
out[:, 1] = classes[:nd] - 1
|
| 36 |
-
out[:, 2] = scores[:nd]
|
| 37 |
-
out[:, 3:7] = boxes[:nd][:, [1, 0, 3, 2]]
|
| 38 |
-
|
| 39 |
-
h, w = img.shape[:2]
|
| 40 |
-
kept = [row for row in out if row[2] >= args.conf]
|
| 41 |
-
print(os.path.basename(here), len(kept), "detections")
|
| 42 |
-
for row in kept:
|
| 43 |
-
cv.rectangle(img, (int(row[3] * w), int(row[4] * h)), (int(row[5] * w), int(row[6] * h)), (0, 255, 0), 2)
|
| 44 |
-
cv.putText(img, "%d:%.2f" % (int(row[1]), row[2]), (int(row[3] * w), int(row[4] * h) - 5), cv.FONT_HERSHEY_SIMPLEX, 0.5, (0, 255, 0), 1)
|
| 45 |
-
print(int(row[1]), round(float(row[2]), 3), round(float(row[3]), 3), round(float(row[4]), 3), round(float(row[5]), 3), round(float(row[6]), 3))
|
| 46 |
-
cv.imwrite(args.output, img)
|
| 47 |
-
print("wrote", args.output)
|
| 48 |
-
|
| 49 |
-
|
| 50 |
-
if __name__ == "__main__":
|
| 51 |
-
main()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
faster_rcnn_resnet50_coco_2018_01_28/example_outputs/input_image.png
DELETED
Git LFS Details
|
faster_rcnn_resnet50_coco_2018_01_28/example_outputs/output_image.png
DELETED
Git LFS Details
|
faster_rcnn_resnet50_coco_2018_01_28/faster_rcnn_resnet50_coco_2018_01_28_2026jul.onnx
DELETED
|
@@ -1,3 +0,0 @@
|
|
| 1 |
-
version https://git-lfs.github.com/spec/v1
|
| 2 |
-
oid sha256:217613103b36eba4771087bdae63a7c04ed545e7850087f205990db7e5f18b88
|
| 3 |
-
size 120414387
|
|
|
|
|
|
|
|
|
|
|
|
human_parsing_jppnet/LICENSE
DELETED
|
@@ -1,21 +0,0 @@
|
|
| 1 |
-
MIT License
|
| 2 |
-
|
| 3 |
-
Copyright (c) 2016 Vladimir Nekrasov
|
| 4 |
-
|
| 5 |
-
Permission is hereby granted, free of charge, to any person obtaining a copy
|
| 6 |
-
of this software and associated documentation files (the "Software"), to deal
|
| 7 |
-
in the Software without restriction, including without limitation the rights
|
| 8 |
-
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
| 9 |
-
copies of the Software, and to permit persons to whom the Software is
|
| 10 |
-
furnished to do so, subject to the following conditions:
|
| 11 |
-
|
| 12 |
-
The above copyright notice and this permission notice shall be included in all
|
| 13 |
-
copies or substantial portions of the Software.
|
| 14 |
-
|
| 15 |
-
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
| 16 |
-
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
| 17 |
-
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
| 18 |
-
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
| 19 |
-
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
| 20 |
-
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
| 21 |
-
SOFTWARE.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
human_parsing_jppnet/README.md
DELETED
|
@@ -1,127 +0,0 @@
|
|
| 1 |
-
# Human Parsing (JPPNet)
|
| 2 |
-
|
| 3 |
-
Single-person human parsing with JPPNet — it labels every pixel of a person as one of
|
| 4 |
-
20 LIP classes (hair, face, upper clothes, pants, left/right arm, left/right shoe, and
|
| 5 |
-
so on). The model was originally distributed as a frozen TensorFlow graph
|
| 6 |
-
(`lip_jppnet_384.pb`, the one referenced by OpenCV's `samples/dnn/human_parsing.py`)
|
| 7 |
-
and converted to ONNX for use with OpenCV's DNN module.
|
| 8 |
-
|
| 9 |
-
## Model Details
|
| 10 |
-
- **Architecture**: JPPNet — a ResNet-101 backbone with atrous convolutions, three
|
| 11 |
-
parsing heads (`fc1_human`, `fc2_parsing`, `fc3_parsing`) built from four-branch ASPP
|
| 12 |
-
modules, run at three input scales (0.75x, 1.0x, 1.25x) whose predictions are averaged
|
| 13 |
-
- **Input**: BGR image, 384×384, raw 0–255 float, mean `(104.00698793, 116.66876762,
|
| 14 |
-
122.67891434)`, no scaling, no swapRB, NCHW layout (`input:0`, shape `[2, 3, 384, 384]`)
|
| 15 |
-
- **Output**: `Mean_3:0` — class scores, shape `[2, 20, 384, 384]`
|
| 16 |
-
- **Framework**: ONNX opset 15 (converted from the TensorFlow frozen graph via tf2onnx)
|
| 17 |
-
- **Original weights**: https://github.com/Engineering-Course/LIP_JPPNet
|
| 18 |
-
- **Paper**: Liang, Gong, Shen and Lin, *Look into Person: Joint Body Parsing & Pose
|
| 19 |
-
Estimation Network and a New Benchmark*, T-PAMI 2018
|
| 20 |
-
|
| 21 |
-
The batch dimension is fixed at **2** and is not a batch of two different pictures. The
|
| 22 |
-
network expects the image *and its horizontal mirror*: the two predictions get averaged,
|
| 23 |
-
which is what the original evaluation script does to stabilise the result. Before
|
| 24 |
-
averaging, the mirrored half has its left/right channel pairs swapped back
|
| 25 |
-
(LeftArm↔RightArm, LeftLeg↔RightLeg, LeftShoe↔RightShoe) and is flipped horizontally.
|
| 26 |
-
`demo.py` and `demo.cpp` both do this; skipping it costs accuracy on the limbs.
|
| 27 |
-
|
| 28 |
-
The 20 classes, in channel order:
|
| 29 |
-
|
| 30 |
-
| | | | |
|
| 31 |
-
|---|---|---|---|
|
| 32 |
-
| 0 Background | 5 UpperClothes | 10 Jumpsuits | 15 RightArm |
|
| 33 |
-
| 1 Hat | 6 Dress | 11 Scarf | 16 LeftLeg |
|
| 34 |
-
| 2 Hair | 7 Coat | 12 Skirt | 17 RightLeg |
|
| 35 |
-
| 3 Glove | 8 Socks | 13 Face | 18 LeftShoe |
|
| 36 |
-
| 4 Sunglasses | 9 Pants | 14 LeftArm | 19 RightShoe |
|
| 37 |
-
|
| 38 |
-
The spatial size is frozen at 384×384 — the graph resizes its own heads back to that
|
| 39 |
-
resolution with hardcoded constants, so it always predicts at 384×384 no matter what it
|
| 40 |
-
is fed. The demos resize the picture to 384×384 on the way in and scale the score maps
|
| 41 |
-
back to the original resolution before taking the argmax.
|
| 42 |
-
|
| 43 |
-
## Usage
|
| 44 |
-
|
| 45 |
-
### Python
|
| 46 |
-
```bash
|
| 47 |
-
python demo.py --model human_parsing_jppnet_2026sep.onnx \
|
| 48 |
-
--image example_outputs/input_image.png \
|
| 49 |
-
--output example_outputs/output_image.png
|
| 50 |
-
```
|
| 51 |
-
|
| 52 |
-
Or import directly:
|
| 53 |
-
```python
|
| 54 |
-
import cv2
|
| 55 |
-
|
| 56 |
-
net = cv2.dnn.readNetFromONNX("human_parsing_jppnet_2026sep.onnx")
|
| 57 |
-
# see demo.py for preprocessing, the mirror merge and the LIP palette
|
| 58 |
-
```
|
| 59 |
-
|
| 60 |
-
### C++
|
| 61 |
-
The C++ demo runs inference with OpenCV's DNN module (default engine — no ONNX Runtime
|
| 62 |
-
needed). Adjust the OpenCV paths to your setup:
|
| 63 |
-
```bash
|
| 64 |
-
OCV=/path/to/opencv # OpenCV source tree
|
| 65 |
-
OCVBUILD=/path/to/opencv/build # OpenCV build directory (generated headers + libs)
|
| 66 |
-
g++ -std=c++17 demo.cpp -o demo \
|
| 67 |
-
-I$OCV/include \
|
| 68 |
-
-I$OCV/modules/core/include \
|
| 69 |
-
-I$OCV/modules/dnn/include \
|
| 70 |
-
-I$OCV/modules/imgproc/include \
|
| 71 |
-
-I$OCV/modules/imgcodecs/include \
|
| 72 |
-
-I$OCVBUILD \
|
| 73 |
-
-L$OCVBUILD/lib -Wl,-rpath,$OCVBUILD/lib -lopencv_dnn -lopencv_imgcodecs -lopencv_imgproc -lopencv_core
|
| 74 |
-
./demo --model human_parsing_jppnet_2026sep.onnx --image example_outputs/input_image.png
|
| 75 |
-
```
|
| 76 |
-
|
| 77 |
-
Both demos produce the same label map, pixel for pixel.
|
| 78 |
-
|
| 79 |
-
## Conversion
|
| 80 |
-
The ONNX model was exported from the frozen TensorFlow graph with tf2onnx (opset 15) via
|
| 81 |
-
[convert_to_onnx.py](./convert_to_onnx.py) — input `input:0`, output `Mean_3:0`, both
|
| 82 |
-
forced to NCHW (`inputs_as_nchw` / `outputs_as_nchw`) so the tensors match OpenCV's
|
| 83 |
-
layout, with the input shape overridden to `[2, 384, 384, 3]`. Requires `tensorflow`,
|
| 84 |
-
`tf2onnx`, `onnx` and `opencv-python` (the last only for `--verify`).
|
| 85 |
-
|
| 86 |
-
```bash
|
| 87 |
-
python convert_to_onnx.py --pb ../pb/lip_jppnet_384.pb --verify example_outputs/input_image.png
|
| 88 |
-
```
|
| 89 |
-
|
| 90 |
-
Fixing the input shape lets tf2onnx fold the whole graph down to nine op types — `Conv`,
|
| 91 |
-
`Relu`, `Sum`, `Add`, `Concat`, `Resize`, `Unsqueeze`, `ReduceMean` and `MaxPool`. The
|
| 92 |
-
batch-norms fuse into the convolutions, and the `SpaceToBatchND`/`BatchToSpaceND` pairs
|
| 93 |
-
that implement atrous convolution collapse into plain `Conv` nodes with `dilations`.
|
| 94 |
-
|
| 95 |
-
One post-processing step is applied to the exported graph. The three ASPP heads sum four
|
| 96 |
-
branches each, which tf2onnx emits as nine `Sum` nodes with four inputs; OpenCV 4.x's
|
| 97 |
-
ONNX importer mis-computes those (about 14% of the pixels came out with the wrong label).
|
| 98 |
-
`split_multi_input_sums` rewrites them as chains of two-input `Add`, which is numerically
|
| 99 |
-
identical and imports correctly everywhere.
|
| 100 |
-
|
| 101 |
-
The 412 MB file size is expected: the weights are shared across the three scale branches,
|
| 102 |
-
so it is close to a single ResNet-101 plus the parsing heads at float32.
|
| 103 |
-
|
| 104 |
-
### Verification
|
| 105 |
-
The exported model was checked against the original TensorFlow graph on the example
|
| 106 |
-
image, over all 2 × 20 × 384 × 384 output values:
|
| 107 |
-
|
| 108 |
-
| runtime | max abs diff | mean abs diff | pixels with the same label |
|
| 109 |
-
|---|---|---|---|
|
| 110 |
-
| ONNX Runtime 1.23 | 3.05e-05 | 2.33e-06 | 100.0000% |
|
| 111 |
-
| OpenCV 4.11 DNN | 3.34e-05 | 2.60e-06 | 100.0000% |
|
| 112 |
-
| OpenCV 5.0 DNN | 3.62e-05 | 2.58e-06 | 100.0000% |
|
| 113 |
-
|
| 114 |
-
## Example
|
| 115 |
-
`example_outputs/input_image.png` is the standing-person image from OpenCV's own test
|
| 116 |
-
data (`opencv_extra/testdata/dnn/pose.png`); `example_outputs/output_image.png` is the
|
| 117 |
-
parsing result painted with the LIP palette.
|
| 118 |
-
|
| 119 |
-
## License
|
| 120 |
-
See [LICENSE](./LICENSE) — the MIT license file shipped in
|
| 121 |
-
[Engineering-Course/LIP_JPPNet](https://github.com/Engineering-Course/LIP_JPPNet),
|
| 122 |
-
carried over from the DeepLab-ResNet TensorFlow implementation the code is built on
|
| 123 |
-
(hence the `Copyright (c) 2016 Vladimir Nekrasov` line).
|
| 124 |
-
|
| 125 |
-
Note that the license covers the code. The released weights are trained on the
|
| 126 |
-
[LIP dataset](https://lip.sysuhcp.com/), which the authors distribute for non-commercial
|
| 127 |
-
research use; check the dataset's own terms before using the model in a product.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
human_parsing_jppnet/convert_to_onnx.py
DELETED
|
@@ -1,131 +0,0 @@
|
|
| 1 |
-
import argparse
|
| 2 |
-
import datetime
|
| 3 |
-
|
| 4 |
-
import numpy as np
|
| 5 |
-
import onnx
|
| 6 |
-
from onnx import helper
|
| 7 |
-
import tensorflow as tf
|
| 8 |
-
import tf2onnx
|
| 9 |
-
|
| 10 |
-
# The frozen graph takes a batch of exactly two images (the picture and its
|
| 11 |
-
# horizontal mirror) and always emits a 384x384 label map, so the spatial size
|
| 12 |
-
# is the only thing worth parameterising.
|
| 13 |
-
INPUT_NAME = "input:0"
|
| 14 |
-
OUTPUT_NAME = "Mean_3:0"
|
| 15 |
-
BATCH = 2
|
| 16 |
-
MEAN = (104.00698793, 116.66876762, 122.67891434)
|
| 17 |
-
|
| 18 |
-
|
| 19 |
-
def load_graph_def(pb_path):
|
| 20 |
-
with tf.io.gfile.GFile(pb_path, "rb") as f:
|
| 21 |
-
graph_def = tf.compat.v1.GraphDef()
|
| 22 |
-
graph_def.ParseFromString(f.read())
|
| 23 |
-
return graph_def
|
| 24 |
-
|
| 25 |
-
|
| 26 |
-
def split_multi_input_sums(model):
|
| 27 |
-
"""Rewrite Sum nodes that take more than two inputs into chains of Add.
|
| 28 |
-
|
| 29 |
-
The three ASPP heads are exported as four-input Sum nodes. OpenCV 4.x's
|
| 30 |
-
ONNX importer gets those wrong (roughly 14% of the pixels end up with the
|
| 31 |
-
wrong label) while two-input adds import correctly on every version we
|
| 32 |
-
tested, and the rewrite is numerically identical.
|
| 33 |
-
"""
|
| 34 |
-
graph = model.graph
|
| 35 |
-
rewritten = []
|
| 36 |
-
count = 0
|
| 37 |
-
for node in graph.node:
|
| 38 |
-
if node.op_type != "Sum" or len(node.input) <= 2:
|
| 39 |
-
rewritten.append(node)
|
| 40 |
-
continue
|
| 41 |
-
count += 1
|
| 42 |
-
acc = node.input[0]
|
| 43 |
-
for i, operand in enumerate(node.input[1:]):
|
| 44 |
-
name = "%s__add%d" % (node.name, i)
|
| 45 |
-
last = i == len(node.input) - 2
|
| 46 |
-
out = node.output[0] if last else name
|
| 47 |
-
rewritten.append(helper.make_node("Add", [acc, operand], [out], name=name))
|
| 48 |
-
acc = out
|
| 49 |
-
del graph.node[:]
|
| 50 |
-
graph.node.extend(rewritten)
|
| 51 |
-
return count
|
| 52 |
-
|
| 53 |
-
|
| 54 |
-
def make_input(image_path, size):
|
| 55 |
-
"""Build the [2, 3, size, size] NCHW blob the exported model expects."""
|
| 56 |
-
import cv2
|
| 57 |
-
|
| 58 |
-
image = cv2.imread(image_path)
|
| 59 |
-
if image is None:
|
| 60 |
-
raise OSError("cannot read %s" % image_path)
|
| 61 |
-
image = cv2.resize(image, (size, size))
|
| 62 |
-
mirror = np.flip(image, axis=1)
|
| 63 |
-
return cv2.dnn.blobFromImages([image, mirror], mean=MEAN)
|
| 64 |
-
|
| 65 |
-
|
| 66 |
-
def verify(graph_def, onnx_path, blob, size):
|
| 67 |
-
"""Compare the exported model against the original TensorFlow graph."""
|
| 68 |
-
import cv2
|
| 69 |
-
|
| 70 |
-
graph = tf.Graph()
|
| 71 |
-
with graph.as_default():
|
| 72 |
-
tf.import_graph_def(graph_def, name="")
|
| 73 |
-
with tf.compat.v1.Session(graph=graph) as sess:
|
| 74 |
-
nhwc = blob.transpose(0, 2, 3, 1).copy()
|
| 75 |
-
tf_out = sess.run(OUTPUT_NAME, feed_dict={INPUT_NAME: nhwc})
|
| 76 |
-
tf_out = tf_out.transpose(0, 3, 1, 2)
|
| 77 |
-
|
| 78 |
-
net = cv2.dnn.readNetFromONNX(onnx_path)
|
| 79 |
-
net.setInput(blob)
|
| 80 |
-
onnx_out = net.forward()
|
| 81 |
-
|
| 82 |
-
diff = np.abs(tf_out.astype(np.float64) - onnx_out.astype(np.float64))
|
| 83 |
-
agree = 100.0 * (tf_out.argmax(1) == onnx_out.argmax(1)).mean()
|
| 84 |
-
print("verify: tensorflow %s vs opencv %s" % (tf_out.shape, onnx_out.shape))
|
| 85 |
-
print("verify: max abs diff %.3e, mean abs diff %.3e" % (diff.max(), diff.mean()))
|
| 86 |
-
print("verify: identical labels on %.4f%% of the pixels" % agree)
|
| 87 |
-
return diff.max()
|
| 88 |
-
|
| 89 |
-
|
| 90 |
-
def main():
|
| 91 |
-
parser = argparse.ArgumentParser(
|
| 92 |
-
description="Export the frozen LIP_JPPNet human parsing graph to ONNX")
|
| 93 |
-
parser.add_argument("--pb", default="../pb/lip_jppnet_384.pb",
|
| 94 |
-
help="frozen TensorFlow graph (lip_jppnet_384.pb)")
|
| 95 |
-
parser.add_argument("--size", type=int, default=384, help="input resolution")
|
| 96 |
-
parser.add_argument("--opset", type=int, default=15)
|
| 97 |
-
parser.add_argument("--output", default=None, help="output .onnx path")
|
| 98 |
-
parser.add_argument("--verify", metavar="IMAGE", default=None,
|
| 99 |
-
help="after exporting, compare the ONNX model against "
|
| 100 |
-
"the TensorFlow graph on this image")
|
| 101 |
-
args = parser.parse_args()
|
| 102 |
-
|
| 103 |
-
graph_def = load_graph_def(args.pb)
|
| 104 |
-
|
| 105 |
-
model_proto, _ = tf2onnx.convert.from_graph_def(
|
| 106 |
-
graph_def,
|
| 107 |
-
input_names=[INPUT_NAME],
|
| 108 |
-
output_names=[OUTPUT_NAME],
|
| 109 |
-
inputs_as_nchw=[INPUT_NAME],
|
| 110 |
-
outputs_as_nchw=[OUTPUT_NAME],
|
| 111 |
-
opset=args.opset,
|
| 112 |
-
shape_override={INPUT_NAME: [BATCH, args.size, args.size, 3]},
|
| 113 |
-
)
|
| 114 |
-
n = split_multi_input_sums(model_proto)
|
| 115 |
-
print("rewrote %d multi-input Sum nodes as Add chains" % n)
|
| 116 |
-
onnx.checker.check_model(model_proto)
|
| 117 |
-
|
| 118 |
-
onnx_path = args.output
|
| 119 |
-
if onnx_path is None:
|
| 120 |
-
stamp = datetime.datetime.now().strftime("%Y%b").lower()
|
| 121 |
-
onnx_path = "human_parsing_jppnet_%s.onnx" % stamp
|
| 122 |
-
with open(onnx_path, "wb") as f:
|
| 123 |
-
f.write(model_proto.SerializeToString())
|
| 124 |
-
print("wrote", onnx_path)
|
| 125 |
-
|
| 126 |
-
if args.verify:
|
| 127 |
-
verify(graph_def, onnx_path, make_input(args.verify, args.size), args.size)
|
| 128 |
-
|
| 129 |
-
|
| 130 |
-
if __name__ == "__main__":
|
| 131 |
-
main()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
human_parsing_jppnet/demo.cpp
DELETED
|
@@ -1,143 +0,0 @@
|
|
| 1 |
-
#include <opencv2/dnn.hpp>
|
| 2 |
-
#include <opencv2/imgproc.hpp>
|
| 3 |
-
#include <opencv2/imgcodecs.hpp>
|
| 4 |
-
#include <iostream>
|
| 5 |
-
#include <string>
|
| 6 |
-
#include <vector>
|
| 7 |
-
|
| 8 |
-
// The exported graph is frozen at 384x384 and always takes two images: the
|
| 9 |
-
// picture and its horizontal mirror.
|
| 10 |
-
static const int INPUT_SIZE = 384;
|
| 11 |
-
static const cv::Scalar MEAN(104.00698793, 116.66876762, 122.67891434);
|
| 12 |
-
|
| 13 |
-
// The 20 LIP classes, in channel order.
|
| 14 |
-
static const char* CLASSES[] = {
|
| 15 |
-
"Background", "Hat", "Hair", "Glove", "Sunglasses", "UpperClothes",
|
| 16 |
-
"Dress", "Coat", "Socks", "Pants", "Jumpsuits", "Scarf", "Skirt",
|
| 17 |
-
"Face", "LeftArm", "RightArm", "LeftLeg", "RightLeg", "LeftShoe",
|
| 18 |
-
"RightShoe"
|
| 19 |
-
};
|
| 20 |
-
static const int NUM_CLASSES = 20;
|
| 21 |
-
|
| 22 |
-
// LIP palette, RGB.
|
| 23 |
-
static const unsigned char COLORS[NUM_CLASSES][3] = {
|
| 24 |
-
{0, 0, 0}, {128, 0, 0}, {255, 0, 0}, {0, 85, 0}, {170, 0, 51},
|
| 25 |
-
{255, 85, 0}, {0, 0, 85}, {0, 119, 221}, {85, 85, 0}, {0, 85, 85},
|
| 26 |
-
{85, 51, 0}, {52, 86, 128}, {0, 128, 0}, {0, 0, 255}, {51, 170, 221},
|
| 27 |
-
{0, 255, 255}, {85, 255, 170}, {170, 255, 85}, {255, 255, 0}, {255, 170, 0}
|
| 28 |
-
};
|
| 29 |
-
|
| 30 |
-
static std::string argVal(int argc, char** argv, const std::string& key, const std::string& def)
|
| 31 |
-
{
|
| 32 |
-
for (int i = 1; i + 1 < argc; ++i)
|
| 33 |
-
if (key == argv[i]) return argv[i + 1];
|
| 34 |
-
return def;
|
| 35 |
-
}
|
| 36 |
-
|
| 37 |
-
// Mirroring an image swaps the left and right body parts, so the channels of
|
| 38 |
-
// the mirrored prediction have to be swapped back before the two are averaged.
|
| 39 |
-
static int mirrorChannel(int c)
|
| 40 |
-
{
|
| 41 |
-
switch (c)
|
| 42 |
-
{
|
| 43 |
-
case 14: return 15; // LeftArm <-> RightArm
|
| 44 |
-
case 15: return 14;
|
| 45 |
-
case 16: return 17; // LeftLeg <-> RightLeg
|
| 46 |
-
case 17: return 16;
|
| 47 |
-
case 18: return 19; // LeftShoe <-> RightShoe
|
| 48 |
-
case 19: return 18;
|
| 49 |
-
default: return c;
|
| 50 |
-
}
|
| 51 |
-
}
|
| 52 |
-
|
| 53 |
-
// Build the [2, 3, 384, 384] blob: the image and its mirror, mean-subtracted.
|
| 54 |
-
static cv::Mat preprocess(const cv::Mat& image)
|
| 55 |
-
{
|
| 56 |
-
cv::Mat resized, mirror;
|
| 57 |
-
cv::resize(image, resized, cv::Size(INPUT_SIZE, INPUT_SIZE));
|
| 58 |
-
cv::flip(resized, mirror, 1);
|
| 59 |
-
|
| 60 |
-
std::vector<cv::Mat> images;
|
| 61 |
-
images.push_back(resized);
|
| 62 |
-
images.push_back(mirror);
|
| 63 |
-
|
| 64 |
-
return cv::dnn::blobFromImages(images, 1.0, cv::Size(), MEAN);
|
| 65 |
-
}
|
| 66 |
-
|
| 67 |
-
// Average the two predictions and turn them into a label map of `size`.
|
| 68 |
-
// `out` is [2, 20, 384, 384].
|
| 69 |
-
static cv::Mat postprocess(const cv::Mat& out, const cv::Size& size)
|
| 70 |
-
{
|
| 71 |
-
cv::Mat labels(size, CV_8U, cv::Scalar(0));
|
| 72 |
-
cv::Mat best(size, CV_32F, cv::Scalar(-FLT_MAX));
|
| 73 |
-
|
| 74 |
-
for (int c = 0; c < NUM_CLASSES; ++c)
|
| 75 |
-
{
|
| 76 |
-
cv::Mat direct(INPUT_SIZE, INPUT_SIZE, CV_32F,
|
| 77 |
-
const_cast<float*>(out.ptr<float>(0, c)));
|
| 78 |
-
cv::Mat mirrored(INPUT_SIZE, INPUT_SIZE, CV_32F,
|
| 79 |
-
const_cast<float*>(out.ptr<float>(1, mirrorChannel(c))));
|
| 80 |
-
|
| 81 |
-
cv::Mat unmirrored;
|
| 82 |
-
cv::flip(mirrored, unmirrored, 1);
|
| 83 |
-
|
| 84 |
-
cv::Mat score = 0.5f * (direct + unmirrored);
|
| 85 |
-
cv::resize(score, score, size, 0, 0, cv::INTER_LINEAR);
|
| 86 |
-
|
| 87 |
-
cv::Mat better = score > best;
|
| 88 |
-
score.copyTo(best, better);
|
| 89 |
-
labels.setTo(c, better);
|
| 90 |
-
}
|
| 91 |
-
return labels;
|
| 92 |
-
}
|
| 93 |
-
|
| 94 |
-
// Paint a label map with the LIP palette, as a BGR image.
|
| 95 |
-
static cv::Mat colorize(const cv::Mat& labels)
|
| 96 |
-
{
|
| 97 |
-
cv::Mat lut(1, NUM_CLASSES, CV_8UC3);
|
| 98 |
-
for (int i = 0; i < NUM_CLASSES; ++i)
|
| 99 |
-
lut.at<cv::Vec3b>(0, i) = cv::Vec3b(COLORS[i][2], COLORS[i][1], COLORS[i][0]);
|
| 100 |
-
|
| 101 |
-
cv::Mat segmentation(labels.size(), CV_8UC3);
|
| 102 |
-
for (int y = 0; y < labels.rows; ++y)
|
| 103 |
-
{
|
| 104 |
-
const unsigned char* src = labels.ptr<unsigned char>(y);
|
| 105 |
-
cv::Vec3b* dst = segmentation.ptr<cv::Vec3b>(y);
|
| 106 |
-
for (int x = 0; x < labels.cols; ++x)
|
| 107 |
-
dst[x] = lut.at<cv::Vec3b>(0, src[x]);
|
| 108 |
-
}
|
| 109 |
-
return segmentation;
|
| 110 |
-
}
|
| 111 |
-
|
| 112 |
-
int main(int argc, char** argv)
|
| 113 |
-
{
|
| 114 |
-
std::string model = argVal(argc, argv, "--model", "human_parsing_jppnet_2026sep.onnx");
|
| 115 |
-
std::string image = argVal(argc, argv, "--image", "example_outputs/input_image.png");
|
| 116 |
-
std::string output = argVal(argc, argv, "--output", "example_outputs/output_image.png");
|
| 117 |
-
|
| 118 |
-
cv::Mat img = cv::imread(image);
|
| 119 |
-
if (img.empty())
|
| 120 |
-
{
|
| 121 |
-
std::cerr << "could not read image: " << image << std::endl;
|
| 122 |
-
return 1;
|
| 123 |
-
}
|
| 124 |
-
|
| 125 |
-
cv::dnn::Net net = cv::dnn::readNetFromONNX(model);
|
| 126 |
-
net.setInput(preprocess(img));
|
| 127 |
-
cv::Mat out = net.forward();
|
| 128 |
-
|
| 129 |
-
cv::Mat labels = postprocess(out, img.size());
|
| 130 |
-
cv::Mat segmentation = colorize(labels);
|
| 131 |
-
|
| 132 |
-
std::cout << "human_parsing_jppnet input " << img.cols << "x" << img.rows << std::endl;
|
| 133 |
-
for (int c = 0; c < NUM_CLASSES; ++c)
|
| 134 |
-
{
|
| 135 |
-
int pixels = cv::countNonZero(labels == c);
|
| 136 |
-
if (pixels > 0)
|
| 137 |
-
std::cout << " " << CLASSES[c] << " " << pixels << " px" << std::endl;
|
| 138 |
-
}
|
| 139 |
-
|
| 140 |
-
cv::imwrite(output, segmentation);
|
| 141 |
-
std::cout << "wrote " << output << std::endl;
|
| 142 |
-
return 0;
|
| 143 |
-
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
human_parsing_jppnet/demo.py
DELETED
|
@@ -1,99 +0,0 @@
|
|
| 1 |
-
import argparse
|
| 2 |
-
import os
|
| 3 |
-
|
| 4 |
-
import cv2 as cv
|
| 5 |
-
import numpy as np
|
| 6 |
-
|
| 7 |
-
here = os.path.dirname(os.path.abspath(__file__))
|
| 8 |
-
|
| 9 |
-
# The exported graph is frozen at 384x384 and always takes two images: the
|
| 10 |
-
# picture and its horizontal mirror.
|
| 11 |
-
INPUT_SIZE = 384
|
| 12 |
-
MEAN = (104.00698793, 116.66876762, 122.67891434)
|
| 13 |
-
|
| 14 |
-
# The 20 LIP classes, in channel order.
|
| 15 |
-
CLASSES = ["Background", "Hat", "Hair", "Glove", "Sunglasses", "UpperClothes",
|
| 16 |
-
"Dress", "Coat", "Socks", "Pants", "Jumpsuits", "Scarf", "Skirt",
|
| 17 |
-
"Face", "LeftArm", "RightArm", "LeftLeg", "RightLeg", "LeftShoe",
|
| 18 |
-
"RightShoe"]
|
| 19 |
-
|
| 20 |
-
# LIP palette, RGB.
|
| 21 |
-
COLORS = [(0, 0, 0), (128, 0, 0), (255, 0, 0), (0, 85, 0), (170, 0, 51),
|
| 22 |
-
(255, 85, 0), (0, 0, 85), (0, 119, 221), (85, 85, 0), (0, 85, 85),
|
| 23 |
-
(85, 51, 0), (52, 86, 128), (0, 128, 0), (0, 0, 255), (51, 170, 221),
|
| 24 |
-
(0, 255, 255), (85, 255, 170), (170, 255, 85), (255, 255, 0),
|
| 25 |
-
(255, 170, 0)]
|
| 26 |
-
|
| 27 |
-
# Mirroring an image swaps the left and right body parts, so the channels of
|
| 28 |
-
# the mirrored prediction have to be swapped back before the two are averaged.
|
| 29 |
-
FLIP_PAIRS = [(14, 15), (16, 17), (18, 19)]
|
| 30 |
-
|
| 31 |
-
|
| 32 |
-
def preprocess(image):
|
| 33 |
-
"""Build the [2, 3, 384, 384] blob: the image and its mirror, mean-subtracted."""
|
| 34 |
-
resized = cv.resize(image, (INPUT_SIZE, INPUT_SIZE))
|
| 35 |
-
mirror = np.flip(resized, axis=1)
|
| 36 |
-
return cv.dnn.blobFromImages([resized, mirror], mean=MEAN)
|
| 37 |
-
|
| 38 |
-
|
| 39 |
-
def postprocess(out, size):
|
| 40 |
-
"""Average the two predictions and turn them into a label map of `size`.
|
| 41 |
-
|
| 42 |
-
`out` is [2, 20, 384, 384]; `size` is the (width, height) to scale back to.
|
| 43 |
-
"""
|
| 44 |
-
direct, mirrored = out[0], out[1]
|
| 45 |
-
|
| 46 |
-
order = list(range(len(CLASSES)))
|
| 47 |
-
for left, right in FLIP_PAIRS:
|
| 48 |
-
order[left], order[right] = right, left
|
| 49 |
-
mirrored = np.flip(mirrored[order], axis=2)
|
| 50 |
-
|
| 51 |
-
scores = 0.5 * (direct + mirrored)
|
| 52 |
-
scores = np.stack([cv.resize(c, size, interpolation=cv.INTER_LINEAR) for c in scores])
|
| 53 |
-
return scores.argmax(axis=0).astype(np.uint8)
|
| 54 |
-
|
| 55 |
-
|
| 56 |
-
def colorize(labels):
|
| 57 |
-
"""Paint a label map with the LIP palette, as a BGR image."""
|
| 58 |
-
palette = np.array(COLORS, dtype=np.uint8)[:, ::-1] # RGB -> BGR
|
| 59 |
-
return palette[labels]
|
| 60 |
-
|
| 61 |
-
|
| 62 |
-
def parse_human(net, image):
|
| 63 |
-
"""Run the network on one image and return its label map."""
|
| 64 |
-
net.setInput(preprocess(image))
|
| 65 |
-
out = net.forward()
|
| 66 |
-
return postprocess(out, (image.shape[1], image.shape[0]))
|
| 67 |
-
|
| 68 |
-
|
| 69 |
-
def main():
|
| 70 |
-
parser = argparse.ArgumentParser(description="JPPNet human parsing (ONNX) demo")
|
| 71 |
-
parser.add_argument("--model", default=os.path.join(here, "human_parsing_jppnet_2026sep.onnx"))
|
| 72 |
-
parser.add_argument("--image", default=os.path.join(here, "example_outputs", "input_image.png"))
|
| 73 |
-
parser.add_argument("--output", default=os.path.join(here, "example_outputs", "output_image.png"))
|
| 74 |
-
parser.add_argument("--show", action="store_true", help="display the result in a window")
|
| 75 |
-
args = parser.parse_args()
|
| 76 |
-
|
| 77 |
-
image = cv.imread(args.image)
|
| 78 |
-
if image is None:
|
| 79 |
-
raise SystemExit("could not read image: %s" % args.image)
|
| 80 |
-
|
| 81 |
-
net = cv.dnn.readNetFromONNX(args.model)
|
| 82 |
-
labels = parse_human(net, image)
|
| 83 |
-
segmentation = colorize(labels)
|
| 84 |
-
|
| 85 |
-
present = [(CLASSES[i], int((labels == i).sum())) for i in np.unique(labels)]
|
| 86 |
-
print("human_parsing_jppnet input %dx%d" % (image.shape[1], image.shape[0]))
|
| 87 |
-
for name, pixels in sorted(present, key=lambda p: -p[1]):
|
| 88 |
-
print(" %-14s %7d px" % (name, pixels))
|
| 89 |
-
|
| 90 |
-
cv.imwrite(args.output, segmentation)
|
| 91 |
-
print("wrote", args.output)
|
| 92 |
-
|
| 93 |
-
if args.show:
|
| 94 |
-
cv.imshow("Deep learning human parsing in OpenCV", segmentation)
|
| 95 |
-
cv.waitKey()
|
| 96 |
-
|
| 97 |
-
|
| 98 |
-
if __name__ == "__main__":
|
| 99 |
-
main()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
human_parsing_jppnet/example_outputs/input_image.png
DELETED
Git LFS Details
|
human_parsing_jppnet/example_outputs/output_image.png
DELETED
Git LFS Details
|
human_parsing_jppnet/human_parsing_jppnet_2026sep.onnx
DELETED
|
@@ -1,3 +0,0 @@
|
|
| 1 |
-
version https://git-lfs.github.com/spec/v1
|
| 2 |
-
oid sha256:eeace33fc98ed398bb33a3df3dca20839d9c7bcae8cfd3984409b4ddf8c426b4
|
| 3 |
-
size 431265151
|
|
|
|
|
|
|
|
|
|
|
|
lapsrn/LICENSE
DELETED
|
@@ -1,202 +0,0 @@
|
|
| 1 |
-
|
| 2 |
-
Apache License
|
| 3 |
-
Version 2.0, January 2004
|
| 4 |
-
http://www.apache.org/licenses/
|
| 5 |
-
|
| 6 |
-
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
|
| 7 |
-
|
| 8 |
-
1. Definitions.
|
| 9 |
-
|
| 10 |
-
"License" shall mean the terms and conditions for use, reproduction,
|
| 11 |
-
and distribution as defined by Sections 1 through 9 of this document.
|
| 12 |
-
|
| 13 |
-
"Licensor" shall mean the copyright owner or entity authorized by
|
| 14 |
-
the copyright owner that is granting the License.
|
| 15 |
-
|
| 16 |
-
"Legal Entity" shall mean the union of the acting entity and all
|
| 17 |
-
other entities that control, are controlled by, or are under common
|
| 18 |
-
control with that entity. For the purposes of this definition,
|
| 19 |
-
"control" means (i) the power, direct or indirect, to cause the
|
| 20 |
-
direction or management of such entity, whether by contract or
|
| 21 |
-
otherwise, or (ii) ownership of fifty percent (50%) or more of the
|
| 22 |
-
outstanding shares, or (iii) beneficial ownership of such entity.
|
| 23 |
-
|
| 24 |
-
"You" (or "Your") shall mean an individual or Legal Entity
|
| 25 |
-
exercising permissions granted by this License.
|
| 26 |
-
|
| 27 |
-
"Source" form shall mean the preferred form for making modifications,
|
| 28 |
-
including but not limited to software source code, documentation
|
| 29 |
-
source, and configuration files.
|
| 30 |
-
|
| 31 |
-
"Object" form shall mean any form resulting from mechanical
|
| 32 |
-
transformation or translation of a Source form, including but
|
| 33 |
-
not limited to compiled object code, generated documentation,
|
| 34 |
-
and conversions to other media types.
|
| 35 |
-
|
| 36 |
-
"Work" shall mean the work of authorship, whether in Source or
|
| 37 |
-
Object form, made available under the License, as indicated by a
|
| 38 |
-
copyright notice that is included in or attached to the work
|
| 39 |
-
(an example is provided in the Appendix below).
|
| 40 |
-
|
| 41 |
-
"Derivative Works" shall mean any work, whether in Source or Object
|
| 42 |
-
form, that is based on (or derived from) the Work and for which the
|
| 43 |
-
editorial revisions, annotations, elaborations, or other modifications
|
| 44 |
-
represent, as a whole, an original work of authorship. For the purposes
|
| 45 |
-
of this License, Derivative Works shall not include works that remain
|
| 46 |
-
separable from, or merely link (or bind by name) to the interfaces of,
|
| 47 |
-
the Work and Derivative Works thereof.
|
| 48 |
-
|
| 49 |
-
"Contribution" shall mean any work of authorship, including
|
| 50 |
-
the original version of the Work and any modifications or additions
|
| 51 |
-
to that Work or Derivative Works thereof, that is intentionally
|
| 52 |
-
submitted to Licensor for inclusion in the Work by the copyright owner
|
| 53 |
-
or by an individual or Legal Entity authorized to submit on behalf of
|
| 54 |
-
the copyright owner. For the purposes of this definition, "submitted"
|
| 55 |
-
means any form of electronic, verbal, or written communication sent
|
| 56 |
-
to the Licensor or its representatives, including but not limited to
|
| 57 |
-
communication on electronic mailing lists, source code control systems,
|
| 58 |
-
and issue tracking systems that are managed by, or on behalf of, the
|
| 59 |
-
Licensor for the purpose of discussing and improving the Work, but
|
| 60 |
-
excluding communication that is conspicuously marked or otherwise
|
| 61 |
-
designated in writing by the copyright owner as "Not a Contribution."
|
| 62 |
-
|
| 63 |
-
"Contributor" shall mean Licensor and any individual or Legal Entity
|
| 64 |
-
on behalf of whom a Contribution has been received by Licensor and
|
| 65 |
-
subsequently incorporated within the Work.
|
| 66 |
-
|
| 67 |
-
2. Grant of Copyright License. Subject to the terms and conditions of
|
| 68 |
-
this License, each Contributor hereby grants to You a perpetual,
|
| 69 |
-
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
| 70 |
-
copyright license to reproduce, prepare Derivative Works of,
|
| 71 |
-
publicly display, publicly perform, sublicense, and distribute the
|
| 72 |
-
Work and such Derivative Works in Source or Object form.
|
| 73 |
-
|
| 74 |
-
3. Grant of Patent License. Subject to the terms and conditions of
|
| 75 |
-
this License, each Contributor hereby grants to You a perpetual,
|
| 76 |
-
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
| 77 |
-
(except as stated in this section) patent license to make, have made,
|
| 78 |
-
use, offer to sell, sell, import, and otherwise transfer the Work,
|
| 79 |
-
where such license applies only to those patent claims licensable
|
| 80 |
-
by such Contributor that are necessarily infringed by their
|
| 81 |
-
Contribution(s) alone or by combination of their Contribution(s)
|
| 82 |
-
with the Work to which such Contribution(s) was submitted. If You
|
| 83 |
-
institute patent litigation against any entity (including a
|
| 84 |
-
cross-claim or counterclaim in a lawsuit) alleging that the Work
|
| 85 |
-
or a Contribution incorporated within the Work constitutes direct
|
| 86 |
-
or contributory patent infringement, then any patent licenses
|
| 87 |
-
granted to You under this License for that Work shall terminate
|
| 88 |
-
as of the date such litigation is filed.
|
| 89 |
-
|
| 90 |
-
4. Redistribution. You may reproduce and distribute copies of the
|
| 91 |
-
Work or Derivative Works thereof in any medium, with or without
|
| 92 |
-
modifications, and in Source or Object form, provided that You
|
| 93 |
-
meet the following conditions:
|
| 94 |
-
|
| 95 |
-
(a) You must give any other recipients of the Work or
|
| 96 |
-
Derivative Works a copy of this License; and
|
| 97 |
-
|
| 98 |
-
(b) You must cause any modified files to carry prominent notices
|
| 99 |
-
stating that You changed the files; and
|
| 100 |
-
|
| 101 |
-
(c) You must retain, in the Source form of any Derivative Works
|
| 102 |
-
that You distribute, all copyright, patent, trademark, and
|
| 103 |
-
attribution notices from the Source form of the Work,
|
| 104 |
-
excluding those notices that do not pertain to any part of
|
| 105 |
-
the Derivative Works; and
|
| 106 |
-
|
| 107 |
-
(d) If the Work includes a "NOTICE" text file as part of its
|
| 108 |
-
distribution, then any Derivative Works that You distribute must
|
| 109 |
-
include a readable copy of the attribution notices contained
|
| 110 |
-
within such NOTICE file, excluding those notices that do not
|
| 111 |
-
pertain to any part of the Derivative Works, in at least one
|
| 112 |
-
of the following places: within a NOTICE text file distributed
|
| 113 |
-
as part of the Derivative Works; within the Source form or
|
| 114 |
-
documentation, if provided along with the Derivative Works; or,
|
| 115 |
-
within a display generated by the Derivative Works, if and
|
| 116 |
-
wherever such third-party notices normally appear. The contents
|
| 117 |
-
of the NOTICE file are for informational purposes only and
|
| 118 |
-
do not modify the License. You may add Your own attribution
|
| 119 |
-
notices within Derivative Works that You distribute, alongside
|
| 120 |
-
or as an addendum to the NOTICE text from the Work, provided
|
| 121 |
-
that such additional attribution notices cannot be construed
|
| 122 |
-
as modifying the License.
|
| 123 |
-
|
| 124 |
-
You may add Your own copyright statement to Your modifications and
|
| 125 |
-
may provide additional or different license terms and conditions
|
| 126 |
-
for use, reproduction, or distribution of Your modifications, or
|
| 127 |
-
for any such Derivative Works as a whole, provided Your use,
|
| 128 |
-
reproduction, and distribution of the Work otherwise complies with
|
| 129 |
-
the conditions stated in this License.
|
| 130 |
-
|
| 131 |
-
5. Submission of Contributions. Unless You explicitly state otherwise,
|
| 132 |
-
any Contribution intentionally submitted for inclusion in the Work
|
| 133 |
-
by You to the Licensor shall be under the terms and conditions of
|
| 134 |
-
this License, without any additional terms or conditions.
|
| 135 |
-
Notwithstanding the above, nothing herein shall supersede or modify
|
| 136 |
-
the terms of any separate license agreement you may have executed
|
| 137 |
-
with Licensor regarding such Contributions.
|
| 138 |
-
|
| 139 |
-
6. Trademarks. This License does not grant permission to use the trade
|
| 140 |
-
names, trademarks, service marks, or product names of the Licensor,
|
| 141 |
-
except as required for reasonable and customary use in describing the
|
| 142 |
-
origin of the Work and reproducing the content of the NOTICE file.
|
| 143 |
-
|
| 144 |
-
7. Disclaimer of Warranty. Unless required by applicable law or
|
| 145 |
-
agreed to in writing, Licensor provides the Work (and each
|
| 146 |
-
Contributor provides its Contributions) on an "AS IS" BASIS,
|
| 147 |
-
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
|
| 148 |
-
implied, including, without limitation, any warranties or conditions
|
| 149 |
-
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
|
| 150 |
-
PARTICULAR PURPOSE. You are solely responsible for determining the
|
| 151 |
-
appropriateness of using or redistributing the Work and assume any
|
| 152 |
-
risks associated with Your exercise of permissions under this License.
|
| 153 |
-
|
| 154 |
-
8. Limitation of Liability. In no event and under no legal theory,
|
| 155 |
-
whether in tort (including negligence), contract, or otherwise,
|
| 156 |
-
unless required by applicable law (such as deliberate and grossly
|
| 157 |
-
negligent acts) or agreed to in writing, shall any Contributor be
|
| 158 |
-
liable to You for damages, including any direct, indirect, special,
|
| 159 |
-
incidental, or consequential damages of any character arising as a
|
| 160 |
-
result of this License or out of the use or inability to use the
|
| 161 |
-
Work (including but not limited to damages for loss of goodwill,
|
| 162 |
-
work stoppage, computer failure or malfunction, or any and all
|
| 163 |
-
other commercial damages or losses), even if such Contributor
|
| 164 |
-
has been advised of the possibility of such damages.
|
| 165 |
-
|
| 166 |
-
9. Accepting Warranty or Additional Liability. While redistributing
|
| 167 |
-
the Work or Derivative Works thereof, You may choose to offer,
|
| 168 |
-
and charge a fee for, acceptance of support, warranty, indemnity,
|
| 169 |
-
or other liability obligations and/or rights consistent with this
|
| 170 |
-
License. However, in accepting such obligations, You may act only
|
| 171 |
-
on Your own behalf and on Your sole responsibility, not on behalf
|
| 172 |
-
of any other Contributor, and only if You agree to indemnify,
|
| 173 |
-
defend, and hold each Contributor harmless for any liability
|
| 174 |
-
incurred by, or claims asserted against, such Contributor by reason
|
| 175 |
-
of your accepting any such warranty or additional liability.
|
| 176 |
-
|
| 177 |
-
END OF TERMS AND CONDITIONS
|
| 178 |
-
|
| 179 |
-
APPENDIX: How to apply the Apache License to your work.
|
| 180 |
-
|
| 181 |
-
To apply the Apache License to your work, attach the following
|
| 182 |
-
boilerplate notice, with the fields enclosed by brackets "[]"
|
| 183 |
-
replaced with your own identifying information. (Don't include
|
| 184 |
-
the brackets!) The text should be enclosed in the appropriate
|
| 185 |
-
comment syntax for the file format. We also recommend that a
|
| 186 |
-
file or class name and description of purpose be included on the
|
| 187 |
-
same "printed page" as the copyright notice for easier
|
| 188 |
-
identification within third-party archives.
|
| 189 |
-
|
| 190 |
-
Copyright [yyyy] [name of copyright owner]
|
| 191 |
-
|
| 192 |
-
Licensed under the Apache License, Version 2.0 (the "License");
|
| 193 |
-
you may not use this file except in compliance with the License.
|
| 194 |
-
You may obtain a copy of the License at
|
| 195 |
-
|
| 196 |
-
http://www.apache.org/licenses/LICENSE-2.0
|
| 197 |
-
|
| 198 |
-
Unless required by applicable law or agreed to in writing, software
|
| 199 |
-
distributed under the License is distributed on an "AS IS" BASIS,
|
| 200 |
-
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
| 201 |
-
See the License for the specific language governing permissions and
|
| 202 |
-
limitations under the License.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
lapsrn/README.md
DELETED
|
@@ -1,128 +0,0 @@
|
|
| 1 |
-
# LapSRN x4
|
| 2 |
-
|
| 3 |
-
Single-image super-resolution with a Laplacian Pyramid Super-Resolution Network. One forward
|
| 4 |
-
pass produces both a 2x and a 4x image, because the pyramid reconstructs each scale from the
|
| 5 |
-
previous one and both intermediate results are exposed as outputs.
|
| 6 |
-
|
| 7 |
-
The model was originally distributed as a frozen TensorFlow graph (`LapSRN_x4.pb`, the model
|
| 8 |
-
used by opencv_contrib's `dnn_superres` module) and converted to ONNX for use with OpenCV's
|
| 9 |
-
DNN module.
|
| 10 |
-
|
| 11 |
-
## Model Details
|
| 12 |
-
- **Architecture**: LapSRN — Laplacian pyramid, progressive upsampling with `DepthToSpace`
|
| 13 |
-
and recursive residual blocks (24 `Conv`, 4 `DepthToSpace`)
|
| 14 |
-
- **Input**: `IteratorGetNext:0`, **NHWC** `[1, H, W, 1]` — a single **luma (Y)** channel,
|
| 15 |
-
float32 normalized to `[0, 1]`. `H`/`W` are dynamic; the network is fully convolutional.
|
| 16 |
-
- **Outputs** (both produced in one pass, NCHW):
|
| 17 |
-
- `NCHW_output_2x` — `[1, 1, H*2, W*2]`
|
| 18 |
-
- `NCHW_output_4x` — `[1, 1, H*4, W*4]`
|
| 19 |
-
- **Framework**: ONNX (converted from the TensorFlow frozen graph via tf2onnx, opset 13)
|
| 20 |
-
- **Original weights**: https://github.com/fannymonori/TF-LapSRN/tree/master/export
|
| 21 |
-
- **Paper**: Lai, Huang, Ahuja, Yang, *Deep Laplacian Pyramid Networks for Fast and Accurate
|
| 22 |
-
Super-Resolution*, CVPR 2017 — https://arxiv.org/abs/1704.03915
|
| 23 |
-
|
| 24 |
-
> **Note on layout.** The input is NHWC while the outputs are NCHW (hence their names). This
|
| 25 |
-
> is not a mistake in the conversion — it is what `dnn_superres` feeds and reads, so the
|
| 26 |
-
> conversion preserves it. Do not use `blobFromImage` here; it would produce NCHW input.
|
| 27 |
-
|
| 28 |
-
### Colour handling
|
| 29 |
-
|
| 30 |
-
The network only sees the Y channel. To get a colour image, the demos follow exactly what
|
| 31 |
-
`dnn_superres` does (`preprocess_YCrCb` / `reconstruct_YCrCb`):
|
| 32 |
-
|
| 33 |
-
1. Convert BGR to YCrCb, scale to float `[0, 1]`.
|
| 34 |
-
2. Feed **only Y**, reshaped to `[1, H, W, 1]`.
|
| 35 |
-
3. Bicubically upscale Cr and Cb by the same factor.
|
| 36 |
-
4. Merge `(Y_hr, Cr_hr, Cb_hr)`, scale back to 8-bit, convert YCrCb to BGR.
|
| 37 |
-
|
| 38 |
-
## Usage
|
| 39 |
-
|
| 40 |
-
### Python
|
| 41 |
-
```bash
|
| 42 |
-
python demo.py --model lapsrn_x4_2026sep.onnx --image example_outputs/input_image.png --output-dir example_outputs
|
| 43 |
-
```
|
| 44 |
-
Writes `output_image_2x.png` and `output_image_4x.png`. Pass `--scale 2` or `--scale 4` to
|
| 45 |
-
run just one head.
|
| 46 |
-
|
| 47 |
-
### C++
|
| 48 |
-
The C++ demo runs inference with OpenCV's DNN module (default engine — no ONNX Runtime
|
| 49 |
-
needed). Adjust the OpenCV paths to your setup:
|
| 50 |
-
```bash
|
| 51 |
-
OCV=/path/to/opencv # OpenCV source tree
|
| 52 |
-
OCVBUILD=/path/to/opencv/build # OpenCV build directory (generated headers + libs)
|
| 53 |
-
g++ -std=c++17 demo.cpp -o demo \
|
| 54 |
-
-I$OCV/include \
|
| 55 |
-
-I$OCV/modules/core/include \
|
| 56 |
-
-I$OCV/modules/dnn/include \
|
| 57 |
-
-I$OCV/modules/imgproc/include \
|
| 58 |
-
-I$OCV/modules/imgcodecs/include \
|
| 59 |
-
-I$OCVBUILD \
|
| 60 |
-
-L$OCVBUILD/lib -Wl,-rpath,$OCVBUILD/lib -lopencv_dnn -lopencv_imgcodecs -lopencv_imgproc -lopencv_core
|
| 61 |
-
./demo --model lapsrn_x4_2026sep.onnx --image example_outputs/input_image.png --output-dir example_outputs
|
| 62 |
-
```
|
| 63 |
-
|
| 64 |
-
The Python and C++ demos agree to within 1–2 intensity levels on under 1% of pixels — NumPy
|
| 65 |
-
and OpenCV break rounding ties differently, which the YCrCb to BGR conversion mildly amplifies.
|
| 66 |
-
|
| 67 |
-
### With the dnn_superres module
|
| 68 |
-
|
| 69 |
-
This is the same file the module's own test loads, so it also works through the module API:
|
| 70 |
-
|
| 71 |
-
```cpp
|
| 72 |
-
DnnSuperResImpl sr;
|
| 73 |
-
sr.readModel("lapsrn_x4_2026sep.onnx");
|
| 74 |
-
sr.setModel("lapsrn", 4);
|
| 75 |
-
|
| 76 |
-
std::vector<Mat> outputs;
|
| 77 |
-
sr.upsampleMultioutput(img, outputs, {2, 4}, {"NCHW_output_2x", "NCHW_output_4x"});
|
| 78 |
-
```
|
| 79 |
-
|
| 80 |
-
## Conversion
|
| 81 |
-
|
| 82 |
-
Exported from the frozen TensorFlow graph with tf2onnx (opset 13) via
|
| 83 |
-
[convert_to_onnx.py](./convert_to_onnx.py). Requires `tensorflow`, `tf2onnx` and `onnx`.
|
| 84 |
-
|
| 85 |
-
```bash
|
| 86 |
-
python convert_to_onnx.py --pb LapSRN_x4.pb
|
| 87 |
-
```
|
| 88 |
-
|
| 89 |
-
Three details are specific to this model and are handled by the script:
|
| 90 |
-
|
| 91 |
-
- **The weights are stored quantized and have to be folded back to float.** The frozen graph
|
| 92 |
-
went through TensorFlow's `quantize_weights` transform, so each of the 20 weight tensors is
|
| 93 |
-
a `quint8` const plus a min/max pair, reconstituted at runtime by a `Dequantize` node in
|
| 94 |
-
`MIN_FIRST` mode. tf2onnx has no mapping for `Dequantize`, so the script evaluates those
|
| 95 |
-
nodes in a TF session and rewrites each one as a plain float32 const. This is why the ONNX
|
| 96 |
-
(2.7 MB) is about 4x the size of the frozen graph (703 KB).
|
| 97 |
-
- **The graph is pruned to the two heads that are used.** The frozen graph carries a third
|
| 98 |
-
head, `NCHW_output`, that nothing reads. `extract_sub_graph` on `NCHW_output_2x` /
|
| 99 |
-
`NCHW_output_4x` drops it — that head and its `perm` const are the only two nodes removed,
|
| 100 |
-
so no compute changes (329 to 327 nodes).
|
| 101 |
-
- **The output names are stripped of their `:0` suffix.** tf2onnx names ONNX outputs after TF
|
| 102 |
-
tensors, so the heads come out as `NCHW_output_2x:0`, and
|
| 103 |
-
`net.forward("NCHW_output_2x")` cannot resolve that. The script renames them after
|
| 104 |
-
conversion.
|
| 105 |
-
|
| 106 |
-
Note that `shape_override` uses `None`, not `-1`, for the dynamic H/W dims: the frozen graph's
|
| 107 |
-
placeholder has unknown rank, and tf2onnx's shape inference passes the override straight to
|
| 108 |
-
`set_shape`, which rejects `-1`.
|
| 109 |
-
|
| 110 |
-
Re-running the script on `LapSRN_x4.pb` reproduces the shipped model: same opset, node count
|
| 111 |
-
and initializers, and **bit-identical inference output**. The only differences are tf2onnx's
|
| 112 |
-
auto-generated constant names (`const_fold_opt__611` and friends), whose numbering depends on
|
| 113 |
-
graph traversal order.
|
| 114 |
-
|
| 115 |
-
The input is deliberately left NHWC — `--inputs-as-nchw` is *not* used here, unlike the other
|
| 116 |
-
`dnn_superres` conversions.
|
| 117 |
-
|
| 118 |
-
## Example
|
| 119 |
-
|
| 120 |
-
| | |
|
| 121 |
-
|---|---|
|
| 122 |
-
| `example_outputs/input_image.png` | 256x256 (`butterfly.png`, the `dnn_superres` test image) |
|
| 123 |
-
| `example_outputs/output_image_2x.png` | 512x512, from `NCHW_output_2x` |
|
| 124 |
-
| `example_outputs/output_image_4x.png` | 1024x1024, from `NCHW_output_4x` |
|
| 125 |
-
|
| 126 |
-
## License
|
| 127 |
-
See [LICENSE](./LICENSE) — the model is released by the TF-LapSRN author under the
|
| 128 |
-
Apache License 2.0.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
lapsrn/convert_to_onnx.py
DELETED
|
@@ -1,134 +0,0 @@
|
|
| 1 |
-
"""Export the dnn_superres LapSRN_x4 TensorFlow frozen graph to ONNX.
|
| 2 |
-
|
| 3 |
-
Three things make this model different from the other dnn_superres conversions:
|
| 4 |
-
|
| 5 |
-
1. Its weights are stored quantized. The graph was run through TensorFlow's
|
| 6 |
-
`quantize_weights` transform, so every weight is a `quint8` const plus a
|
| 7 |
-
min/max pair, reconstituted at runtime by a `Dequantize` node (MIN_FIRST).
|
| 8 |
-
tf2onnx has no mapping for `Dequantize`, so the 20 of them are constant-folded
|
| 9 |
-
back to float32 consts before conversion. This is why the ONNX (2.7 MB) is
|
| 10 |
-
roughly 4x the size of the frozen graph (703 KB).
|
| 11 |
-
|
| 12 |
-
2. The graph carries a third output head, `NCHW_output`, that nothing uses.
|
| 13 |
-
Pruning to the 2x and 4x heads drops it (it and its `perm` const are the only
|
| 14 |
-
two nodes removed - no compute changes).
|
| 15 |
-
|
| 16 |
-
3. tf2onnx names ONNX outputs after TF tensors, so the heads come out as
|
| 17 |
-
`NCHW_output_2x:0`. OpenCV's `net.forward("NCHW_output_2x")` cannot resolve a
|
| 18 |
-
name with the trailing `:0`, so the graph outputs are renamed afterwards.
|
| 19 |
-
|
| 20 |
-
The input is deliberately left in NHWC `[1, H, W, 1]` (no `--inputs-as-nchw`):
|
| 21 |
-
that is what dnn_superres feeds, and the outputs are NCHW regardless.
|
| 22 |
-
|
| 23 |
-
Requires `tensorflow`, `tf2onnx` and `onnx`.
|
| 24 |
-
"""
|
| 25 |
-
|
| 26 |
-
import argparse
|
| 27 |
-
import datetime
|
| 28 |
-
|
| 29 |
-
import onnx
|
| 30 |
-
import tensorflow as tf
|
| 31 |
-
import tf2onnx
|
| 32 |
-
from tensorflow.core.framework import attr_value_pb2, graph_pb2, node_def_pb2
|
| 33 |
-
|
| 34 |
-
INPUT_TENSOR = "IteratorGetNext:0"
|
| 35 |
-
OUTPUT_NODES = ["NCHW_output_2x", "NCHW_output_4x"]
|
| 36 |
-
|
| 37 |
-
|
| 38 |
-
def load_graph_def(pb_path):
|
| 39 |
-
with tf.io.gfile.GFile(pb_path, "rb") as f:
|
| 40 |
-
graph_def = tf.compat.v1.GraphDef()
|
| 41 |
-
graph_def.ParseFromString(f.read())
|
| 42 |
-
return graph_def
|
| 43 |
-
|
| 44 |
-
|
| 45 |
-
def fold_dequantize(graph_def):
|
| 46 |
-
"""Replace every Dequantize node with a plain float32 Const of its value.
|
| 47 |
-
|
| 48 |
-
The quint8 weight consts and their min/max pairs become unreferenced and are
|
| 49 |
-
dropped, so the returned graph is one tf2onnx can handle.
|
| 50 |
-
"""
|
| 51 |
-
names = [n.name for n in graph_def.node if n.op == "Dequantize"]
|
| 52 |
-
if not names:
|
| 53 |
-
return graph_def
|
| 54 |
-
|
| 55 |
-
graph = tf.Graph()
|
| 56 |
-
with graph.as_default():
|
| 57 |
-
tf.import_graph_def(graph_def, name="")
|
| 58 |
-
with tf.compat.v1.Session(graph=graph) as sess:
|
| 59 |
-
values = sess.run(["%s:0" % n for n in names])
|
| 60 |
-
folded = dict(zip(names, values))
|
| 61 |
-
|
| 62 |
-
out = graph_pb2.GraphDef()
|
| 63 |
-
out.versions.CopyFrom(graph_def.versions)
|
| 64 |
-
for node in graph_def.node:
|
| 65 |
-
if node.name not in folded:
|
| 66 |
-
out.node.append(node)
|
| 67 |
-
continue
|
| 68 |
-
value = folded[node.name]
|
| 69 |
-
const = node_def_pb2.NodeDef()
|
| 70 |
-
const.name = node.name
|
| 71 |
-
const.op = "Const"
|
| 72 |
-
const.attr["dtype"].CopyFrom(attr_value_pb2.AttrValue(type=tf.float32.as_datatype_enum))
|
| 73 |
-
const.attr["value"].CopyFrom(attr_value_pb2.AttrValue(
|
| 74 |
-
tensor=tf.make_tensor_proto(value, dtype=tf.float32, shape=value.shape)))
|
| 75 |
-
out.node.append(const)
|
| 76 |
-
|
| 77 |
-
# Pruning again drops the now-orphaned *_quantized_const / _min / _max nodes.
|
| 78 |
-
return tf.compat.v1.graph_util.extract_sub_graph(out, OUTPUT_NODES)
|
| 79 |
-
|
| 80 |
-
|
| 81 |
-
def strip_output_suffix(model_proto):
|
| 82 |
-
"""Rename `NCHW_output_2x:0` -> `NCHW_output_2x` so net.forward() can find it."""
|
| 83 |
-
renames = {o.name: o.name.rsplit(":", 1)[0] for o in model_proto.graph.output if ":" in o.name}
|
| 84 |
-
if not renames:
|
| 85 |
-
return
|
| 86 |
-
for out in model_proto.graph.output:
|
| 87 |
-
out.name = renames.get(out.name, out.name)
|
| 88 |
-
for node in model_proto.graph.node:
|
| 89 |
-
for i, name in enumerate(node.output):
|
| 90 |
-
if name in renames:
|
| 91 |
-
node.output[i] = renames[name]
|
| 92 |
-
for i, name in enumerate(node.input):
|
| 93 |
-
if name in renames:
|
| 94 |
-
node.input[i] = renames[name]
|
| 95 |
-
|
| 96 |
-
|
| 97 |
-
def main():
|
| 98 |
-
parser = argparse.ArgumentParser(description="Export LapSRN_x4.pb to ONNX")
|
| 99 |
-
parser.add_argument("--pb", default="LapSRN_x4.pb")
|
| 100 |
-
parser.add_argument("--opset", type=int, default=13)
|
| 101 |
-
args = parser.parse_args()
|
| 102 |
-
|
| 103 |
-
graph_def = load_graph_def(args.pb)
|
| 104 |
-
|
| 105 |
-
# Drop the unused NCHW_output head, then de-quantize the weights.
|
| 106 |
-
graph_def = tf.compat.v1.graph_util.extract_sub_graph(graph_def, OUTPUT_NODES)
|
| 107 |
-
graph_def = fold_dequantize(graph_def)
|
| 108 |
-
|
| 109 |
-
left = [n.name for n in graph_def.node if n.op == "Dequantize"]
|
| 110 |
-
if left:
|
| 111 |
-
raise SystemExit("Dequantize nodes survived folding: %s" % ", ".join(left))
|
| 112 |
-
|
| 113 |
-
model_proto, _ = tf2onnx.convert.from_graph_def(
|
| 114 |
-
graph_def,
|
| 115 |
-
input_names=[INPUT_TENSOR],
|
| 116 |
-
output_names=["%s:0" % n for n in OUTPUT_NODES],
|
| 117 |
-
opset=args.opset,
|
| 118 |
-
# Dynamic H/W: the model is fully convolutional, any input size works.
|
| 119 |
-
shape_override={INPUT_TENSOR: [1, None, None, 1]},
|
| 120 |
-
)
|
| 121 |
-
|
| 122 |
-
strip_output_suffix(model_proto)
|
| 123 |
-
onnx.checker.check_model(model_proto)
|
| 124 |
-
|
| 125 |
-
stamp = datetime.datetime.now().strftime("%Y%b").lower()
|
| 126 |
-
onnx_path = "lapsrn_x4_%s.onnx" % stamp
|
| 127 |
-
with open(onnx_path, "wb") as f:
|
| 128 |
-
f.write(model_proto.SerializeToString())
|
| 129 |
-
print("wrote", onnx_path)
|
| 130 |
-
print("outputs", [o.name for o in model_proto.graph.output])
|
| 131 |
-
|
| 132 |
-
|
| 133 |
-
if __name__ == "__main__":
|
| 134 |
-
main()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
lapsrn/demo.cpp
DELETED
|
@@ -1,83 +0,0 @@
|
|
| 1 |
-
#include <opencv2/dnn.hpp>
|
| 2 |
-
#include <opencv2/imgproc.hpp>
|
| 3 |
-
#include <opencv2/imgcodecs.hpp>
|
| 4 |
-
#include <iostream>
|
| 5 |
-
#include <string>
|
| 6 |
-
#include <vector>
|
| 7 |
-
|
| 8 |
-
static std::string argVal(int argc, char** argv, const std::string& key, const std::string& def)
|
| 9 |
-
{
|
| 10 |
-
for (int i = 1; i + 1 < argc; ++i)
|
| 11 |
-
if (key == argv[i]) return argv[i + 1];
|
| 12 |
-
return def;
|
| 13 |
-
}
|
| 14 |
-
|
| 15 |
-
// Run one pyramid head and rebuild a colour image from its luma output.
|
| 16 |
-
// Mirrors dnn_superres' preprocess_YCrCb / reconstruct_YCrCb: the network only
|
| 17 |
-
// ever sees the Y channel, and Cr/Cb are bicubically upscaled and merged back.
|
| 18 |
-
static cv::Mat upsample(cv::dnn::Net& net, const cv::Mat& img, const std::string& nodeName, int scale)
|
| 19 |
-
{
|
| 20 |
-
cv::Mat ycrcb;
|
| 21 |
-
cv::cvtColor(img, ycrcb, cv::COLOR_BGR2YCrCb);
|
| 22 |
-
ycrcb.convertTo(ycrcb, CV_32F, 1.0 / 255.0);
|
| 23 |
-
|
| 24 |
-
cv::Mat ch[3];
|
| 25 |
-
cv::split(ycrcb, ch);
|
| 26 |
-
cv::Mat Y = ch[0];
|
| 27 |
-
if (!Y.isContinuous()) Y = Y.clone();
|
| 28 |
-
|
| 29 |
-
// This model takes NHWC [1, H, W, 1] even though its outputs are NCHW.
|
| 30 |
-
int blobShape[] = {1, Y.rows, Y.cols, 1};
|
| 31 |
-
cv::Mat blob(4, blobShape, CV_32F, Y.data);
|
| 32 |
-
|
| 33 |
-
net.setInput(blob);
|
| 34 |
-
cv::Mat outBlob = net.forward(nodeName);
|
| 35 |
-
|
| 36 |
-
// Output blob is NCHW [1, 1, H*scale, W*scale] -> wrap as a single-channel Mat.
|
| 37 |
-
cv::Mat yHr(outBlob.size[2], outBlob.size[3], CV_32F, outBlob.ptr<float>());
|
| 38 |
-
|
| 39 |
-
cv::Mat crHr, cbHr;
|
| 40 |
-
cv::resize(ch[1], crHr, cv::Size(), scale, scale);
|
| 41 |
-
cv::resize(ch[2], cbHr, cv::Size(), scale, scale);
|
| 42 |
-
|
| 43 |
-
std::vector<cv::Mat> merged = {yHr, crHr, cbHr};
|
| 44 |
-
cv::Mat hr;
|
| 45 |
-
cv::merge(merged, hr);
|
| 46 |
-
hr.convertTo(hr, CV_8U, 255.0);
|
| 47 |
-
cv::cvtColor(hr, hr, cv::COLOR_YCrCb2BGR);
|
| 48 |
-
return hr;
|
| 49 |
-
}
|
| 50 |
-
|
| 51 |
-
int main(int argc, char** argv)
|
| 52 |
-
{
|
| 53 |
-
std::string model = argVal(argc, argv, "--model", "lapsrn_x4_2026sep.onnx");
|
| 54 |
-
std::string image = argVal(argc, argv, "--image", "example_outputs/input_image.png");
|
| 55 |
-
std::string outputDir = argVal(argc, argv, "--output-dir", "example_outputs");
|
| 56 |
-
|
| 57 |
-
cv::Mat img = cv::imread(image);
|
| 58 |
-
if (img.empty())
|
| 59 |
-
{
|
| 60 |
-
std::cerr << "could not read image: " << image << std::endl;
|
| 61 |
-
return 1;
|
| 62 |
-
}
|
| 63 |
-
|
| 64 |
-
cv::dnn::Net net = cv::dnn::readNetFromONNX(model);
|
| 65 |
-
|
| 66 |
-
// The two heads of the Laplacian pyramid, and the scale each one produces.
|
| 67 |
-
const std::vector<std::pair<std::string, int> > outputs =
|
| 68 |
-
{{"NCHW_output_2x", 2}, {"NCHW_output_4x", 4}};
|
| 69 |
-
|
| 70 |
-
std::cout << "lapsrn_x4 input " << img.cols << "x" << img.rows << std::endl;
|
| 71 |
-
for (size_t i = 0; i < outputs.size(); ++i)
|
| 72 |
-
{
|
| 73 |
-
const std::string& nodeName = outputs[i].first;
|
| 74 |
-
int scale = outputs[i].second;
|
| 75 |
-
|
| 76 |
-
cv::Mat hr = upsample(net, img, nodeName, scale);
|
| 77 |
-
std::string path = cv::format("%s/output_image_%dx.png", outputDir.c_str(), scale);
|
| 78 |
-
cv::imwrite(path, hr);
|
| 79 |
-
std::cout << " " << nodeName << " x" << scale
|
| 80 |
-
<< " -> " << hr.cols << "x" << hr.rows << " " << path << std::endl;
|
| 81 |
-
}
|
| 82 |
-
return 0;
|
| 83 |
-
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
lapsrn/demo.py
DELETED
|
@@ -1,60 +0,0 @@
|
|
| 1 |
-
import argparse
|
| 2 |
-
import os
|
| 3 |
-
|
| 4 |
-
import cv2 as cv
|
| 5 |
-
import numpy as np
|
| 6 |
-
|
| 7 |
-
here = os.path.dirname(os.path.abspath(__file__))
|
| 8 |
-
|
| 9 |
-
# The two heads of the Laplacian pyramid, and the scale each one produces.
|
| 10 |
-
OUTPUTS = [("NCHW_output_2x", 2), ("NCHW_output_4x", 4)]
|
| 11 |
-
|
| 12 |
-
|
| 13 |
-
def upsample(net, img, node_name, scale):
|
| 14 |
-
"""Run one pyramid head and rebuild a colour image from its luma output.
|
| 15 |
-
|
| 16 |
-
Mirrors dnn_superres' preprocess_YCrCb / reconstruct_YCrCb: the network only
|
| 17 |
-
ever sees the Y channel, and Cr/Cb are bicubically upscaled and merged back.
|
| 18 |
-
"""
|
| 19 |
-
ycrcb = cv.cvtColor(img, cv.COLOR_BGR2YCrCb).astype(np.float32) / 255.0
|
| 20 |
-
y, cr, cb = cv.split(ycrcb)
|
| 21 |
-
|
| 22 |
-
# This model takes NHWC [1, H, W, 1] even though its outputs are NCHW.
|
| 23 |
-
net.setInput(y.reshape(1, y.shape[0], y.shape[1], 1))
|
| 24 |
-
y_hr = net.forward(node_name)[0, 0]
|
| 25 |
-
|
| 26 |
-
cr_hr = cv.resize(cr, None, fx=scale, fy=scale)
|
| 27 |
-
cb_hr = cv.resize(cb, None, fx=scale, fy=scale)
|
| 28 |
-
|
| 29 |
-
merged = cv.merge([y_hr, cr_hr, cb_hr])
|
| 30 |
-
# np.rint, not a plain cast: convertTo(CV_8U) rounds, and truncating here
|
| 31 |
-
# would drift from the C++ demo by a few levels after YCrCb -> BGR.
|
| 32 |
-
merged_8u = np.rint(merged * 255.0).clip(0, 255).astype(np.uint8)
|
| 33 |
-
return cv.cvtColor(merged_8u, cv.COLOR_YCrCb2BGR)
|
| 34 |
-
|
| 35 |
-
|
| 36 |
-
def main():
|
| 37 |
-
parser = argparse.ArgumentParser(description="LapSRN x4 super-resolution (ONNX) demo")
|
| 38 |
-
parser.add_argument("--model", default=os.path.join(here, "lapsrn_x4_2026sep.onnx"))
|
| 39 |
-
parser.add_argument("--image", default=os.path.join(here, "example_outputs", "input_image.png"))
|
| 40 |
-
parser.add_argument("--output-dir", default=os.path.join(here, "example_outputs"))
|
| 41 |
-
parser.add_argument("--scale", type=int, choices=[2, 4], help="only run this scale (default: both)")
|
| 42 |
-
args = parser.parse_args()
|
| 43 |
-
|
| 44 |
-
img = cv.imread(args.image)
|
| 45 |
-
if img is None:
|
| 46 |
-
raise SystemExit("could not read image: %s" % args.image)
|
| 47 |
-
|
| 48 |
-
net = cv.dnn.readNetFromONNX(args.model)
|
| 49 |
-
|
| 50 |
-
wanted = [(n, s) for n, s in OUTPUTS if args.scale in (None, s)]
|
| 51 |
-
print("lapsrn_x4 input %dx%d" % (img.shape[1], img.shape[0]))
|
| 52 |
-
for node_name, scale in wanted:
|
| 53 |
-
out = upsample(net, img, node_name, scale)
|
| 54 |
-
path = os.path.join(args.output_dir, "output_image_%dx.png" % scale)
|
| 55 |
-
cv.imwrite(path, out)
|
| 56 |
-
print(" %-16s x%d -> %dx%d %s" % (node_name, scale, out.shape[1], out.shape[0], path))
|
| 57 |
-
|
| 58 |
-
|
| 59 |
-
if __name__ == "__main__":
|
| 60 |
-
main()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
lapsrn/example_outputs/input_image.png
DELETED
Git LFS Details
|
lapsrn/example_outputs/output_image_2x.png
DELETED
Git LFS Details
|
lapsrn/example_outputs/output_image_4x.png
DELETED
Git LFS Details
|
lapsrn/lapsrn_x4_2026sep.onnx
DELETED
|
@@ -1,3 +0,0 @@
|
|
| 1 |
-
version https://git-lfs.github.com/spec/v1
|
| 2 |
-
oid sha256:70474758dab65ae3f488bed94b11b60fb77578f9de3d45a66d72263dcfefadb7
|
| 3 |
-
size 2708806
|
|
|
|
|
|
|
|
|
|
|
|