├── .gitignore ├── LICENSE ├── README.md ├── model ├── det1.caffemodel ├── det1.png ├── det1.prototxt ├── det2.caffemodel ├── det2.png ├── det2.prototxt ├── det3.caffemodel ├── det3.png └── det3.prototxt └── pymtcnn.py /.gitignore: -------------------------------------------------------------------------------- 1 | # Byte-compiled / optimized / DLL files 2 | __pycache__/ 3 | *.py[cod] 4 | *$py.class 5 | 6 | # C extensions 7 | *.so 8 | 9 | # Distribution / packaging 10 | .Python 11 | build/ 12 | develop-eggs/ 13 | dist/ 14 | downloads/ 15 | eggs/ 16 | .eggs/ 17 | lib/ 18 | lib64/ 19 | parts/ 20 | sdist/ 21 | var/ 22 | wheels/ 23 | *.egg-info/ 24 | .installed.cfg 25 | *.egg 26 | MANIFEST 27 | 28 | # PyInstaller 29 | # Usually these files are written by a python script from a template 30 | # before PyInstaller builds the exe, so as to inject date/other infos into it. 31 | *.manifest 32 | *.spec 33 | 34 | # Installer logs 35 | pip-log.txt 36 | pip-delete-this-directory.txt 37 | 38 | # Unit test / coverage reports 39 | htmlcov/ 40 | .tox/ 41 | .coverage 42 | .coverage.* 43 | .cache 44 | nosetests.xml 45 | coverage.xml 46 | *.cover 47 | .hypothesis/ 48 | .pytest_cache/ 49 | 50 | # Translations 51 | *.mo 52 | *.pot 53 | 54 | # Django stuff: 55 | *.log 56 | local_settings.py 57 | db.sqlite3 58 | 59 | # Flask stuff: 60 | instance/ 61 | .webassets-cache 62 | 63 | # Scrapy stuff: 64 | .scrapy 65 | 66 | # Sphinx documentation 67 | docs/_build/ 68 | 69 | # PyBuilder 70 | target/ 71 | 72 | # Jupyter Notebook 73 | .ipynb_checkpoints 74 | 75 | # pyenv 76 | .python-version 77 | 78 | # celery beat schedule file 79 | celerybeat-schedule 80 | 81 | # SageMath parsed files 82 | *.sage.py 83 | 84 | # Environments 85 | .env 86 | .venv 87 | env/ 88 | venv/ 89 | ENV/ 90 | env.bak/ 91 | venv.bak/ 92 | 93 | # Spyder project settings 94 | .spyderproject 95 | .spyproject 96 | 97 | # Rope project settings 98 | .ropeproject 99 | 100 | # mkdocs documentation 101 | /site 102 | 103 | # mypy 104 | .mypy_cache/ 105 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 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 | 635 | Copyright (C) 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 . 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 | Copyright (C) 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 | . 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 | . 675 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # pymtcnn 2 | - pymtcnn is a caffe based python implementation for MTCNN (Joint Face Detection and Alignment using Multi-task Cascaded Convolutional Neural Networks); 3 | - You can visit https://zhuanlan.zhihu.com/p/39499030 for more detail. 4 | 5 | # Functions 6 | - detect faces; 7 | - align faces with cv2.warpAffine API. 8 | 9 | 10 | # Usage 11 | 12 | ## pre configure 13 | There has some options you need pre configure, of course you can leave them as default value, but I don't think that is what you want; 14 | - multi scale values: `self.d['scales'] = [0.3, 0.15, 0.075]` 15 | - PNet detect threshold: `self.detect_thresh_value = 0.8` 16 | - RNet detect threshold: `self.detect_thresh_value = 0.9` 17 | - ONet detect threshold: `self.detect_thresh_value = 0.95` 18 | 19 | ## call the API 20 | ```python 21 | videoCapture = cv2.VideoCapture(video_path) 22 | status, frame = videoCapture.read() 23 | # Mtcnn instance 24 | mtcnn = Mtcnn() 25 | # AlignFace instance 26 | alignFace = AlignFace() 27 | frame_num = 0 28 | while status: 29 | frame_num += 1 30 | print('process {}'.format(frame_num)) 31 | # do the mtcnn detect job with this API 32 | rc = mtcnn.process(frame) 33 | if not rc: 34 | status, frame = videoCapture.read() 35 | continue 36 | # draw the boxes just for test purpose 37 | mtcnn.drawBoxes(frame, frame_num) 38 | points = mtcnn.d['points'] 39 | if points.shape[0] > 0: 40 | for i in range(points.shape[0]): 41 | # align the faces 42 | alignFace.drawBoxes(alignFace(frame, points[i,:]), frame_num) 43 | status, frame = videoCapture.read() 44 | else: 45 | print('End for some reasons...') 46 | ``` 47 | -------------------------------------------------------------------------------- /model/det1.caffemodel: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/CivilNet/pymtcnn/815253bb76f0751a60c2a20b6a39c508be6c93e9/model/det1.caffemodel -------------------------------------------------------------------------------- /model/det1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/CivilNet/pymtcnn/815253bb76f0751a60c2a20b6a39c508be6c93e9/model/det1.png -------------------------------------------------------------------------------- /model/det1.prototxt: -------------------------------------------------------------------------------- 1 | name: "PNet" 2 | input: "data" 3 | input_dim: 1 4 | input_dim: 3 5 | input_dim: 12 6 | input_dim: 12 7 | 8 | layer { 9 | name: "conv1" 10 | type: "Convolution" 11 | bottom: "data" 12 | top: "conv1" 13 | param { 14 | lr_mult: 1 15 | decay_mult: 1 16 | } 17 | param { 18 | lr_mult: 2 19 | decay_mult: 0 20 | } 21 | convolution_param { 22 | num_output: 10 23 | kernel_size: 3 24 | stride: 1 25 | weight_filler { 26 | type: "xavier" 27 | } 28 | bias_filler { 29 | type: "constant" 30 | value: 0 31 | } 32 | } 33 | } 34 | layer { 35 | name: "PReLU1" 36 | type: "PReLU" 37 | bottom: "conv1" 38 | top: "conv1" 39 | } 40 | layer { 41 | name: "pool1" 42 | type: "Pooling" 43 | bottom: "conv1" 44 | top: "pool1" 45 | pooling_param { 46 | pool: MAX 47 | kernel_size: 2 48 | stride: 2 49 | } 50 | } 51 | 52 | layer { 53 | name: "conv2" 54 | type: "Convolution" 55 | bottom: "pool1" 56 | top: "conv2" 57 | param { 58 | lr_mult: 1 59 | decay_mult: 1 60 | } 61 | param { 62 | lr_mult: 2 63 | decay_mult: 0 64 | } 65 | convolution_param { 66 | num_output: 16 67 | kernel_size: 3 68 | stride: 1 69 | weight_filler { 70 | type: "xavier" 71 | } 72 | bias_filler { 73 | type: "constant" 74 | value: 0 75 | } 76 | } 77 | } 78 | layer { 79 | name: "PReLU2" 80 | type: "PReLU" 81 | bottom: "conv2" 82 | top: "conv2" 83 | } 84 | 85 | layer { 86 | name: "conv3" 87 | type: "Convolution" 88 | bottom: "conv2" 89 | top: "conv3" 90 | param { 91 | lr_mult: 1 92 | decay_mult: 1 93 | } 94 | param { 95 | lr_mult: 2 96 | decay_mult: 0 97 | } 98 | convolution_param { 99 | num_output: 32 100 | kernel_size: 3 101 | stride: 1 102 | weight_filler { 103 | type: "xavier" 104 | } 105 | bias_filler { 106 | type: "constant" 107 | value: 0 108 | } 109 | } 110 | } 111 | layer { 112 | name: "PReLU3" 113 | type: "PReLU" 114 | bottom: "conv3" 115 | top: "conv3" 116 | } 117 | 118 | 119 | layer { 120 | name: "conv4-1" 121 | type: "Convolution" 122 | bottom: "conv3" 123 | top: "conv4-1" 124 | param { 125 | lr_mult: 1 126 | decay_mult: 1 127 | } 128 | param { 129 | lr_mult: 2 130 | decay_mult: 0 131 | } 132 | convolution_param { 133 | num_output: 2 134 | kernel_size: 1 135 | stride: 1 136 | weight_filler { 137 | type: "xavier" 138 | } 139 | bias_filler { 140 | type: "constant" 141 | value: 0 142 | } 143 | } 144 | } 145 | 146 | layer { 147 | name: "conv4-2" 148 | type: "Convolution" 149 | bottom: "conv3" 150 | top: "conv4-2" 151 | param { 152 | lr_mult: 1 153 | decay_mult: 1 154 | } 155 | param { 156 | lr_mult: 2 157 | decay_mult: 0 158 | } 159 | convolution_param { 160 | num_output: 4 161 | kernel_size: 1 162 | stride: 1 163 | weight_filler { 164 | type: "xavier" 165 | } 166 | bias_filler { 167 | type: "constant" 168 | value: 0 169 | } 170 | } 171 | } 172 | layer { 173 | name: "prob1" 174 | type: "Softmax" 175 | bottom: "conv4-1" 176 | top: "prob1" 177 | } 178 | -------------------------------------------------------------------------------- /model/det2.caffemodel: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/CivilNet/pymtcnn/815253bb76f0751a60c2a20b6a39c508be6c93e9/model/det2.caffemodel -------------------------------------------------------------------------------- /model/det2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/CivilNet/pymtcnn/815253bb76f0751a60c2a20b6a39c508be6c93e9/model/det2.png -------------------------------------------------------------------------------- /model/det2.prototxt: -------------------------------------------------------------------------------- 1 | name: "RNet" 2 | input: "data" 3 | input_dim: 1 4 | input_dim: 3 5 | input_dim: 24 6 | input_dim: 24 7 | 8 | 9 | ########################## 10 | ###################### 11 | layer { 12 | name: "conv1" 13 | type: "Convolution" 14 | bottom: "data" 15 | top: "conv1" 16 | param { 17 | lr_mult: 0 18 | decay_mult: 0 19 | } 20 | param { 21 | lr_mult: 0 22 | decay_mult: 0 23 | } 24 | convolution_param { 25 | num_output: 28 26 | kernel_size: 3 27 | stride: 1 28 | weight_filler { 29 | type: "xavier" 30 | } 31 | bias_filler { 32 | type: "constant" 33 | value: 0 34 | } 35 | } 36 | } 37 | layer { 38 | name: "prelu1" 39 | type: "PReLU" 40 | bottom: "conv1" 41 | top: "conv1" 42 | propagate_down: true 43 | } 44 | layer { 45 | name: "pool1" 46 | type: "Pooling" 47 | bottom: "conv1" 48 | top: "pool1" 49 | pooling_param { 50 | pool: MAX 51 | kernel_size: 3 52 | stride: 2 53 | } 54 | } 55 | 56 | layer { 57 | name: "conv2" 58 | type: "Convolution" 59 | bottom: "pool1" 60 | top: "conv2" 61 | param { 62 | lr_mult: 0 63 | decay_mult: 0 64 | } 65 | param { 66 | lr_mult: 0 67 | decay_mult: 0 68 | } 69 | convolution_param { 70 | num_output: 48 71 | kernel_size: 3 72 | stride: 1 73 | weight_filler { 74 | type: "xavier" 75 | } 76 | bias_filler { 77 | type: "constant" 78 | value: 0 79 | } 80 | } 81 | } 82 | layer { 83 | name: "prelu2" 84 | type: "PReLU" 85 | bottom: "conv2" 86 | top: "conv2" 87 | propagate_down: true 88 | } 89 | layer { 90 | name: "pool2" 91 | type: "Pooling" 92 | bottom: "conv2" 93 | top: "pool2" 94 | pooling_param { 95 | pool: MAX 96 | kernel_size: 3 97 | stride: 2 98 | } 99 | } 100 | #################################### 101 | 102 | ################################## 103 | layer { 104 | name: "conv3" 105 | type: "Convolution" 106 | bottom: "pool2" 107 | top: "conv3" 108 | param { 109 | lr_mult: 0 110 | decay_mult: 0 111 | } 112 | param { 113 | lr_mult: 0 114 | decay_mult: 0 115 | } 116 | convolution_param { 117 | num_output: 64 118 | kernel_size: 2 119 | stride: 1 120 | weight_filler { 121 | type: "xavier" 122 | } 123 | bias_filler { 124 | type: "constant" 125 | value: 0 126 | } 127 | } 128 | } 129 | layer { 130 | name: "prelu3" 131 | type: "PReLU" 132 | bottom: "conv3" 133 | top: "conv3" 134 | propagate_down: true 135 | } 136 | ############################### 137 | 138 | ############################### 139 | 140 | layer { 141 | name: "conv4" 142 | type: "InnerProduct" 143 | bottom: "conv3" 144 | top: "conv4" 145 | param { 146 | lr_mult: 0 147 | decay_mult: 0 148 | } 149 | param { 150 | lr_mult: 0 151 | decay_mult: 0 152 | } 153 | inner_product_param { 154 | num_output: 128 155 | weight_filler { 156 | type: "xavier" 157 | } 158 | bias_filler { 159 | type: "constant" 160 | value: 0 161 | } 162 | } 163 | } 164 | layer { 165 | name: "prelu4" 166 | type: "PReLU" 167 | bottom: "conv4" 168 | top: "conv4" 169 | } 170 | 171 | layer { 172 | name: "conv5-1" 173 | type: "InnerProduct" 174 | bottom: "conv4" 175 | top: "conv5-1" 176 | param { 177 | lr_mult: 0 178 | decay_mult: 0 179 | } 180 | param { 181 | lr_mult: 0 182 | decay_mult: 0 183 | } 184 | inner_product_param { 185 | num_output: 2 186 | #kernel_size: 1 187 | #stride: 1 188 | weight_filler { 189 | type: "xavier" 190 | } 191 | bias_filler { 192 | type: "constant" 193 | value: 0 194 | } 195 | } 196 | } 197 | layer { 198 | name: "conv5-2" 199 | type: "InnerProduct" 200 | bottom: "conv4" 201 | top: "conv5-2" 202 | param { 203 | lr_mult: 1 204 | decay_mult: 1 205 | } 206 | param { 207 | lr_mult: 2 208 | decay_mult: 1 209 | } 210 | inner_product_param { 211 | num_output: 4 212 | #kernel_size: 1 213 | #stride: 1 214 | weight_filler { 215 | type: "xavier" 216 | } 217 | bias_filler { 218 | type: "constant" 219 | value: 0 220 | } 221 | } 222 | } 223 | layer { 224 | name: "prob1" 225 | type: "Softmax" 226 | bottom: "conv5-1" 227 | top: "prob1" 228 | } -------------------------------------------------------------------------------- /model/det3.caffemodel: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/CivilNet/pymtcnn/815253bb76f0751a60c2a20b6a39c508be6c93e9/model/det3.caffemodel -------------------------------------------------------------------------------- /model/det3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/CivilNet/pymtcnn/815253bb76f0751a60c2a20b6a39c508be6c93e9/model/det3.png -------------------------------------------------------------------------------- /model/det3.prototxt: -------------------------------------------------------------------------------- 1 | name: "ONet" 2 | input: "data" 3 | input_dim: 1 4 | input_dim: 3 5 | input_dim: 48 6 | input_dim: 48 7 | ################################## 8 | layer { 9 | name: "conv1" 10 | type: "Convolution" 11 | bottom: "data" 12 | top: "conv1" 13 | param { 14 | lr_mult: 1 15 | decay_mult: 1 16 | } 17 | param { 18 | lr_mult: 2 19 | decay_mult: 1 20 | } 21 | convolution_param { 22 | num_output: 32 23 | kernel_size: 3 24 | stride: 1 25 | weight_filler { 26 | type: "xavier" 27 | } 28 | bias_filler { 29 | type: "constant" 30 | value: 0 31 | } 32 | } 33 | } 34 | layer { 35 | name: "prelu1" 36 | type: "PReLU" 37 | bottom: "conv1" 38 | top: "conv1" 39 | } 40 | layer { 41 | name: "pool1" 42 | type: "Pooling" 43 | bottom: "conv1" 44 | top: "pool1" 45 | pooling_param { 46 | pool: MAX 47 | kernel_size: 3 48 | stride: 2 49 | } 50 | } 51 | layer { 52 | name: "conv2" 53 | type: "Convolution" 54 | bottom: "pool1" 55 | top: "conv2" 56 | param { 57 | lr_mult: 1 58 | decay_mult: 1 59 | } 60 | param { 61 | lr_mult: 2 62 | decay_mult: 1 63 | } 64 | convolution_param { 65 | num_output: 64 66 | kernel_size: 3 67 | stride: 1 68 | weight_filler { 69 | type: "xavier" 70 | } 71 | bias_filler { 72 | type: "constant" 73 | value: 0 74 | } 75 | } 76 | } 77 | 78 | layer { 79 | name: "prelu2" 80 | type: "PReLU" 81 | bottom: "conv2" 82 | top: "conv2" 83 | } 84 | layer { 85 | name: "pool2" 86 | type: "Pooling" 87 | bottom: "conv2" 88 | top: "pool2" 89 | pooling_param { 90 | pool: MAX 91 | kernel_size: 3 92 | stride: 2 93 | } 94 | } 95 | 96 | layer { 97 | name: "conv3" 98 | type: "Convolution" 99 | bottom: "pool2" 100 | top: "conv3" 101 | param { 102 | lr_mult: 1 103 | decay_mult: 1 104 | } 105 | param { 106 | lr_mult: 2 107 | decay_mult: 1 108 | } 109 | convolution_param { 110 | num_output: 64 111 | kernel_size: 3 112 | weight_filler { 113 | type: "xavier" 114 | } 115 | bias_filler { 116 | type: "constant" 117 | value: 0 118 | } 119 | } 120 | } 121 | layer { 122 | name: "prelu3" 123 | type: "PReLU" 124 | bottom: "conv3" 125 | top: "conv3" 126 | } 127 | layer { 128 | name: "pool3" 129 | type: "Pooling" 130 | bottom: "conv3" 131 | top: "pool3" 132 | pooling_param { 133 | pool: MAX 134 | kernel_size: 2 135 | stride: 2 136 | } 137 | } 138 | layer { 139 | name: "conv4" 140 | type: "Convolution" 141 | bottom: "pool3" 142 | top: "conv4" 143 | param { 144 | lr_mult: 1 145 | decay_mult: 1 146 | } 147 | param { 148 | lr_mult: 2 149 | decay_mult: 1 150 | } 151 | convolution_param { 152 | num_output: 128 153 | kernel_size: 2 154 | weight_filler { 155 | type: "xavier" 156 | } 157 | bias_filler { 158 | type: "constant" 159 | value: 0 160 | } 161 | } 162 | } 163 | layer { 164 | name: "prelu4" 165 | type: "PReLU" 166 | bottom: "conv4" 167 | top: "conv4" 168 | } 169 | 170 | 171 | layer { 172 | name: "conv5" 173 | type: "InnerProduct" 174 | bottom: "conv4" 175 | top: "conv5" 176 | param { 177 | lr_mult: 1 178 | decay_mult: 1 179 | } 180 | param { 181 | lr_mult: 2 182 | decay_mult: 1 183 | } 184 | inner_product_param { 185 | #kernel_size: 3 186 | num_output: 256 187 | weight_filler { 188 | type: "xavier" 189 | } 190 | bias_filler { 191 | type: "constant" 192 | value: 0 193 | } 194 | } 195 | } 196 | 197 | layer { 198 | name: "drop5" 199 | type: "Dropout" 200 | bottom: "conv5" 201 | top: "conv5" 202 | dropout_param { 203 | dropout_ratio: 0.25 204 | } 205 | } 206 | layer { 207 | name: "prelu5" 208 | type: "PReLU" 209 | bottom: "conv5" 210 | top: "conv5" 211 | } 212 | 213 | 214 | layer { 215 | name: "conv6-1" 216 | type: "InnerProduct" 217 | bottom: "conv5" 218 | top: "conv6-1" 219 | param { 220 | lr_mult: 1 221 | decay_mult: 1 222 | } 223 | param { 224 | lr_mult: 2 225 | decay_mult: 1 226 | } 227 | inner_product_param { 228 | #kernel_size: 1 229 | num_output: 2 230 | weight_filler { 231 | type: "xavier" 232 | } 233 | bias_filler { 234 | type: "constant" 235 | value: 0 236 | } 237 | } 238 | } 239 | layer { 240 | name: "conv6-2" 241 | type: "InnerProduct" 242 | bottom: "conv5" 243 | top: "conv6-2" 244 | param { 245 | lr_mult: 1 246 | decay_mult: 1 247 | } 248 | param { 249 | lr_mult: 2 250 | decay_mult: 1 251 | } 252 | inner_product_param { 253 | #kernel_size: 1 254 | num_output: 4 255 | weight_filler { 256 | type: "xavier" 257 | } 258 | bias_filler { 259 | type: "constant" 260 | value: 0 261 | } 262 | } 263 | } 264 | layer { 265 | name: "conv6-3" 266 | type: "InnerProduct" 267 | bottom: "conv5" 268 | top: "conv6-3" 269 | param { 270 | lr_mult: 1 271 | decay_mult: 1 272 | } 273 | param { 274 | lr_mult: 2 275 | decay_mult: 1 276 | } 277 | inner_product_param { 278 | #kernel_size: 1 279 | num_output: 10 280 | weight_filler { 281 | type: "xavier" 282 | } 283 | bias_filler { 284 | type: "constant" 285 | value: 0 286 | } 287 | } 288 | } 289 | layer { 290 | name: "prob1" 291 | type: "Softmax" 292 | bottom: "conv6-1" 293 | top: "prob1" 294 | } 295 | -------------------------------------------------------------------------------- /pymtcnn.py: -------------------------------------------------------------------------------- 1 | # -*- coding: utf-8 -*- 2 | import os 3 | import sys 4 | import numpy as np 5 | from numpy.linalg import inv, norm, lstsq 6 | from numpy.linalg import matrix_rank as rank 7 | import caffe 8 | import time 9 | import cv2 10 | 11 | caffe.set_device(0) 12 | caffe.set_mode_gpu() 13 | 14 | class Net(object): 15 | def __init__(self, stage): 16 | self.caffemodel = './model/det{}.caffemodel'.format(stage) 17 | self.prototxt = './model/det{}.prototxt'.format(stage) 18 | self.net = caffe.Net(self.prototxt, self.caffemodel, caffe.TEST) 19 | self.input_size = None 20 | self.detect_thresh_value = None 21 | 22 | def bbreg(self, boundingbox, reg): 23 | #reg now is (numbox, 4), gemfield 24 | reg = reg.T 25 | 26 | w = boundingbox[:, 2] - boundingbox[:, 0] + 1 27 | h = boundingbox[:, 3] - boundingbox[:, 1] + 1 28 | 29 | bb0 = boundingbox[:, 0] + reg[:, 0] * w 30 | bb1 = boundingbox[:, 1] + reg[:, 1] * h 31 | bb2 = boundingbox[:, 2] + reg[:, 2] * w 32 | bb3 = boundingbox[:, 3] + reg[:, 3] * h 33 | 34 | boundingbox[:, 0:4] = np.array([bb0, bb1, bb2, bb3]).T 35 | return boundingbox 36 | 37 | def pad(self, boxesA, w, h): 38 | boxes = boxesA.copy() 39 | tmph = boxes[:, 3] - boxes[:, 1] + 1 40 | tmpw = boxes[:, 2] - boxes[:, 0] + 1 41 | numbox = boxes.shape[0] 42 | 43 | dx = np.ones(numbox) 44 | dy = np.ones(numbox) 45 | edx = tmpw 46 | edy = tmph 47 | x = boxes[:, 0:1][:, 0] 48 | y = boxes[:, 1:2][:, 0] 49 | ex = boxes[:, 2:3][:, 0] 50 | ey = boxes[:, 3:4][:, 0] 51 | 52 | tmp = np.where(ex > w)[0] 53 | if tmp.shape[0] != 0: 54 | edx[tmp] = -ex[tmp] + w - 1 + tmpw[tmp] 55 | ex[tmp] = w - 1 56 | 57 | tmp = np.where(ey > h)[0] 58 | if tmp.shape[0] != 0: 59 | edy[tmp] = -ey[tmp] + h - 1 + tmph[tmp] 60 | ey[tmp] = h - 1 61 | 62 | tmp = np.where(x < 1)[0] 63 | if tmp.shape[0] != 0: 64 | dx[tmp] = 2 - x[tmp] 65 | x[tmp] = np.ones_like(x[tmp]) 66 | 67 | tmp = np.where(y < 1)[0] 68 | if tmp.shape[0] != 0: 69 | dy[tmp] = 2 - y[tmp] 70 | y[tmp] = np.ones_like(y[tmp]) 71 | 72 | dy = np.maximum(0, dy - 1) 73 | dx = np.maximum(0, dx - 1) 74 | y = np.maximum(0, y - 1) 75 | x = np.maximum(0, x - 1) 76 | edy = np.maximum(0, edy - 1) 77 | edx = np.maximum(0, edx - 1) 78 | ey = np.maximum(0, ey - 1) 79 | ex = np.maximum(0, ex - 1) 80 | return [dy, edy, dx, edx, y, ey, x, ex, tmpw, tmph] 81 | 82 | def rerec(self, bboxA): 83 | w = bboxA[:, 2] - bboxA[:, 0] 84 | h = bboxA[:, 3] - bboxA[:, 1] 85 | l = np.maximum(w, h).T 86 | bboxA[:, 0] = bboxA[:, 0] + w * 0.5 - l * 0.5 87 | bboxA[:, 1] = bboxA[:, 1] + h * 0.5 - l * 0.5 88 | bboxA[:, 2:4] = bboxA[:, 0:2] + np.repeat([l], 2, axis=0).T 89 | return bboxA 90 | 91 | def nms(self, dets, thresh, type): 92 | x1 = dets[:, 0] 93 | y1 = dets[:, 1] 94 | x2 = dets[:, 2] 95 | y2 = dets[:, 3] 96 | scores = dets[:, 4] 97 | 98 | areas = (x2 - x1 + 1) * (y2 - y1 + 1) 99 | order = scores.argsort()[::-1] 100 | keep = [] 101 | while order.size > 0: 102 | i = order[0] 103 | keep.append(i) 104 | xx1 = np.maximum(x1[i], x1[order[1:]]) 105 | yy1 = np.maximum(y1[i], y1[order[1:]]) 106 | xx2 = np.minimum(x2[i], x2[order[1:]]) 107 | yy2 = np.minimum(y2[i], y2[order[1:]]) 108 | 109 | w = np.maximum(0.0, xx2 - xx1 + 1) 110 | h = np.maximum(0.0, yy2 - yy1 + 1) 111 | inter = w * h 112 | if type == 'Min': 113 | ovr = inter / np.minimum(areas[i], areas[order[1:]]) 114 | else: 115 | ovr = inter / (areas[i] + areas[order[1:]] - inter) 116 | inds = np.where(ovr <= thresh)[0] 117 | order = order[inds + 1] 118 | 119 | end = time.time() 120 | return keep 121 | 122 | def forward(self, d): 123 | total_boxes = d['boxes'] 124 | numbox = total_boxes.shape[0] 125 | h = d['frame'].shape[0] 126 | w = d['frame'].shape[1] 127 | 128 | [dy, edy, dx, edx, y, ey, x, ex, tmpw,tmph] = self.pad(total_boxes, w, h) 129 | input_img = np.zeros((numbox, self.input_size, self.input_size, 3)) 130 | for k in range(numbox): 131 | gemfield_tmp = np.zeros((int(tmph[k]), int(tmpw[k]), 3)) 132 | gemfield_tmp[int(dy[k]):int(edy[k]) + 1, int(dx[k]):int(edx[k]) + 1] = d['frame'][int(y[k]):int(ey[k]) + 1, int(x[k]):int(ex[k]) + 1] 133 | input_img[k, :, :, :] = cv2.resize(gemfield_tmp, (self.input_size, self.input_size)) 134 | 135 | input_img = (input_img - 127.5) / 128 136 | input_img = np.swapaxes(input_img, 1, 3) 137 | self.net.blobs['data'].reshape(numbox, 3, self.input_size, self.input_size) 138 | self.net.blobs['data'].data[...] = input_img 139 | out = self.net.forward() 140 | return out 141 | 142 | class PNet(Net): 143 | def __init__(self): 144 | super(PNet, self).__init__(1) 145 | self.detect_thresh_value = 0.8 146 | 147 | def generateBoundingBox(self, map, reg, scale): 148 | stride = 2 149 | cellsize = 12 150 | # y*x -> x*y 151 | map = map.T 152 | 153 | dx1 = reg[0, :, :].T 154 | dy1 = reg[1, :, :].T 155 | dx2 = reg[2, :, :].T 156 | dy2 = reg[3, :, :].T 157 | 158 | (x, y) = np.where(map >= self.detect_thresh_value) 159 | score = map[x, y] 160 | # reg shape is (4, numbox) 161 | reg = np.array([dx1[x, y], dy1[x, y], dx2[x, y], dy2[x, y]]) 162 | # boundingbox shape is (933, 2) 163 | boundingbox = np.array([y, x]).T 164 | # mapping to original image, shape is (2, numbox) 165 | bb1 = np.fix((stride * (boundingbox) + 1) / scale).T 166 | # 12 pixel toward right and bottom, quare is generated, shape is (2, numbox), by gemfield 167 | bb2 = np.fix((stride * (boundingbox) + cellsize - 1 + 1) /scale).T 168 | # shape is (1, numbox), notice the [score], it reform (numbox,) to (1,numbox), by gemfield 169 | score = np.array([score]) 170 | # (9, numbox), 2 + 2 + 1 + 4 = 9 171 | boundingbox_out = np.concatenate((bb1, bb2, score, reg), axis=0) 172 | return boundingbox_out.T 173 | 174 | def processOne(self, frame, scale): 175 | h = frame.shape[0] 176 | w = frame.shape[1] 177 | hs = int(np.ceil(h * scale)) 178 | ws = int(np.ceil(w * scale)) 179 | #RNet need greater than 11 180 | if hs < 11 or ws < 11: 181 | return np.array([]) 182 | 183 | im_data = cv2.resize(frame, (ws, hs)) 184 | im_data = (im_data - 127.5)/128 185 | 186 | # hwc -> cwh 187 | im_data = np.swapaxes(im_data, 0, 2) 188 | 189 | # PNet.blobs['data'] is caffe._caffe.Blob 190 | self.net.blobs['data'].reshape(1, 3, ws, hs) 191 | # c, w, h broadcast to 1, c, w, h 192 | self.net.blobs['data'].data[...] = np.array([im_data], dtype=np.float) 193 | # out is dict 194 | out = self.net.forward() 195 | 196 | # 0 means non face, 1 means face 197 | boxes = self.generateBoundingBox(out['prob1'][0, 1, :, :], out['conv4-2'][0], scale) 198 | if boxes.shape[0] != 0: 199 | pick = self.nms(boxes, 0.5, 'Union') 200 | if len(pick) > 0: 201 | boxes = boxes[pick, :] 202 | return boxes 203 | 204 | def process(self, d): 205 | frame = d['frame'] 206 | for scale in d['scales']: 207 | boxes = self.processOne(frame, scale) 208 | if boxes.shape[0] != 0: 209 | d['boxes'] = np.concatenate((d['boxes'], boxes), axis=0) 210 | 211 | numbox = d['boxes'].shape[0] 212 | 213 | if numbox <= 0: 214 | return False 215 | 216 | total_boxes = d['boxes'] 217 | pick = self.nms(total_boxes, 0.7, 'Union') 218 | total_boxes = total_boxes[pick, :] 219 | 220 | if total_boxes.shape[0] <= 0: 221 | return False 222 | 223 | total_boxes = self.bbreg(total_boxes[:,0:4], total_boxes[:,5:9].T ) 224 | total_boxes = self.rerec(total_boxes) 225 | total_boxes = np.fix(total_boxes) 226 | d['boxes'] = total_boxes 227 | return True 228 | 229 | class RNet(Net): 230 | def __init__(self): 231 | super(RNet, self).__init__(2) 232 | self.input_size = 24 233 | self.detect_thresh_value = 0.9 234 | 235 | def process(self, d): 236 | out = self.forward(d) 237 | # score shape is (numbox,) 238 | score = out['prob1'][:, 1] 239 | pass_t = np.where(score > self.detect_thresh_value)[0] 240 | # score shape now is (numbox, 1) 241 | score = np.array([score[pass_t]]).T 242 | #total_boxes shape: (numbox, 5) 243 | total_boxes = d['boxes'] 244 | total_boxes = np.concatenate((total_boxes[pass_t, 0:4], score), axis=1) 245 | #out['conv5-2'] shape is (numbox, 4), and mv shape is (4, numbox) 246 | mv = out['conv5-2'][pass_t, :].T 247 | if total_boxes.shape[0] <= 0: 248 | return False 249 | 250 | pick = self.nms(total_boxes, 0.7, 'Union') 251 | if len(pick) > 0: 252 | total_boxes = total_boxes[pick, :] 253 | total_boxes = self.bbreg(total_boxes, mv[:, pick]) 254 | total_boxes = self.rerec(total_boxes) 255 | if total_boxes.shape[0] <= 0: 256 | return False 257 | 258 | total_boxes = np.fix(total_boxes) 259 | d['boxes'] = total_boxes 260 | return True 261 | 262 | class ONet(Net): 263 | def __init__(self): 264 | super(ONet, self).__init__(3) 265 | self.input_size = 48 266 | self.detect_thresh_value = 0.95 267 | 268 | def process(self, d): 269 | out = self.forward(d) 270 | score = out['prob1'][:, 1] 271 | points = out['conv6-3'] 272 | pass_t = np.where(score > self.detect_thresh_value)[0] 273 | points = points[pass_t, :] 274 | score = np.array([score[pass_t]]).T 275 | total_boxes = d['boxes'] 276 | total_boxes = np.concatenate((total_boxes[pass_t, 0:4], score), axis=1) 277 | mv = out['conv6-2'][pass_t, :].T 278 | 279 | w = total_boxes[:, 3] - total_boxes[:, 1] + 1 280 | h = total_boxes[:, 2] - total_boxes[:, 0] + 1 281 | 282 | points[:, 0:5] = np.tile(w, (5, 1)).T * points[:, 0:5] + np.tile(total_boxes[:, 0], (5, 1)).T - 1 283 | points[:, 5:10] = np.tile(h, (5, 1)).T * points[:, 5:10] + np.tile(total_boxes[:, 1], (5, 1)).T - 1 284 | if total_boxes.shape[0] <= 0: 285 | return False 286 | 287 | total_boxes = self.bbreg(total_boxes, mv[:, :]) 288 | pick = self.nms(total_boxes, 0.7, 'Min') 289 | if len(pick) > 0: 290 | total_boxes = total_boxes[pick, :] 291 | points = points[pick, :] 292 | d['boxes'] = total_boxes 293 | d['points'] = points 294 | return True 295 | 296 | class Mtcnn(object): 297 | def __init__(self): 298 | self.nets = [PNet(), RNet(), ONet()] 299 | self.d = {} 300 | self.d['scales'] = [0.3, 0.15, 0.075] 301 | 302 | def preprocess(self, d): 303 | frame = cv2.cvtColor(d['frame'], cv2.COLOR_BGR2RGB) 304 | d['frame'] = frame.astype(float) 305 | 306 | def postprocess(self, d): 307 | self.d['boxes'] = np.maximum(d['boxes'], 0) 308 | 309 | def process(self, frame): 310 | self.d['frame'] = frame 311 | self.d['boxes'] = np.zeros((0, 9), np.float) 312 | self.d['points'] = np.zeros((1, 1)) 313 | 314 | self.preprocess(self.d) 315 | 316 | for net in self.nets: 317 | rc = net.process(self.d) 318 | if not rc: 319 | return False 320 | self.postprocess(self.d) 321 | return True 322 | 323 | def drawBoxes(self, frame, imgname): 324 | boxes = self.d['boxes'] 325 | points = self.d['points'] 326 | x1 = boxes[:, 0] 327 | y1 = boxes[:, 1] 328 | x2 = boxes[:, 2] 329 | y2 = boxes[:, 3] 330 | for i in range(x1.shape[0]): 331 | rightEyeCenter = (points[i][0], points[i][5]) 332 | leftEyeCenter = (points[i][1], points[i][6]) 333 | p3 = (points[i][2], points[i][7]) 334 | p4 = (points[i][3], points[i][8]) 335 | p5 = (points[i][4], points[i][9]) 336 | cv2.rectangle(frame, (int(x1[i]), int(y1[i])),(int(x2[i]), int(y2[i])), (0, 255, 0), 1) 337 | cv2.circle(frame, rightEyeCenter, 2, (0, 0, 255), 3) 338 | cv2.circle(frame, leftEyeCenter, 2, (0, 255, 0), 3) 339 | cv2.circle(frame, p3, 2, (255, 0, 0), 3) 340 | cv2.circle(frame, p4, 2, (255, 255, 0), 3) 341 | cv2.circle(frame, p5, 2, (0, 255, 255), 3) 342 | 343 | write_path = './results/{}/bbox/'.format( time.strftime("%Y%m%d", time.localtime()) ) 344 | if not os.path.exists(write_path): 345 | os.makedirs(write_path) 346 | cv2.imwrite('{}{}.jpg'.format(write_path, imgname), frame) 347 | 348 | class AlignFace(object): 349 | def __init__(self): 350 | # reference facial points, a list of coordinates (x,y) 351 | self.REFERENCE_FACIAL_POINTS_96x112 = [ 352 | [30.29459953, 51.69630051], 353 | [65.53179932, 51.50139999], 354 | [48.02519989, 71.73660278], 355 | [33.54930115, 92.3655014], 356 | [62.72990036, 92.20410156] 357 | ] 358 | # made by gemfield 359 | self.REFERENCE_FACIAL_POINTS_112x112 = [ 360 | [38.29459953, 51.69630051], 361 | [73.53179932, 51.50139999], 362 | [56.02519989, 71.73660278], 363 | [41.54930115, 92.3655014 ], 364 | [70.72990036, 92.20410156] 365 | ] 366 | 367 | def __call__(self, frame, facial_5pts): 368 | # shape from (10,) to (2, 5) 369 | facial_5pts = np.reshape(facial_5pts, (2, -1)) 370 | dst_img = self.warpAndCrop(frame, facial_5pts, (112, 112)) 371 | return dst_img 372 | 373 | def warpAndCrop(self, src_img, facial_pts, crop_size): 374 | reference_pts = self.REFERENCE_FACIAL_POINTS_112x112 375 | ref_pts = np.float32(reference_pts) 376 | ref_pts_shp = ref_pts.shape 377 | 378 | if ref_pts_shp[0] == 2: 379 | ref_pts = ref_pts.T 380 | 381 | src_pts = np.float32(facial_pts) 382 | src_pts_shp = src_pts.shape 383 | if max(src_pts_shp) < 3 or min(src_pts_shp) != 2: 384 | raise Exception('facial_pts.shape must be (K,2) or (2,K) and K>2') 385 | # 2*5 to 5*2 386 | if src_pts_shp[0] == 2: 387 | src_pts = src_pts.T 388 | 389 | if src_pts.shape != ref_pts.shape: 390 | raise Exception('facial_pts and reference_pts must have the same shape: {} vs {}'.format(src_pts.shape, ref_pts.shape) ) 391 | 392 | tfm = self.getAffineTransform(src_pts, ref_pts) 393 | 394 | face_img = cv2.warpAffine(src_img, tfm, (crop_size[0], crop_size[1])) 395 | return face_img 396 | 397 | def getAffineTransform(self, uv, xy): 398 | options = {'K': 2} 399 | # Solve for trans1 400 | trans1, trans1_inv = self.findNonreflectiveSimilarity(uv, xy, options) 401 | # manually reflect the xy data across the Y-axis 402 | xyR = xy 403 | xyR[:, 0] = -1 * xyR[:, 0] 404 | 405 | trans2r, trans2r_inv = self.findNonreflectiveSimilarity(uv, xyR, options) 406 | 407 | # manually reflect the tform to undo the reflection done on xyR 408 | TreflectY = np.array([ 409 | [-1, 0, 0], 410 | [0, 1, 0], 411 | [0, 0, 1] 412 | ]) 413 | 414 | trans2 = np.dot(trans2r, TreflectY) 415 | 416 | # Figure out if trans1 or trans2 is better 417 | xy1 = self.tformfwd(trans1, uv) 418 | norm1 = norm(xy1 - xy) 419 | 420 | xy2 = self.tformfwd(trans2, uv) 421 | norm2 = norm(xy2 - xy) 422 | 423 | if norm1 <= norm2: 424 | trans = trans1 425 | else: 426 | trans2_inv = inv(trans2) 427 | trans = trans2 428 | 429 | cv2_trans = trans[:, 0:2].T 430 | return cv2_trans 431 | 432 | def findNonreflectiveSimilarity(self, uv, xy, options=None): 433 | options = {'K': 2} 434 | 435 | K = options['K'] 436 | M = xy.shape[0] 437 | x = xy[:, 0].reshape((-1, 1)) 438 | y = xy[:, 1].reshape((-1, 1)) 439 | 440 | tmp1 = np.hstack((x, y, np.ones((M, 1)), np.zeros((M, 1)))) 441 | tmp2 = np.hstack((y, -x, np.zeros((M, 1)), np.ones((M, 1)))) 442 | X = np.vstack((tmp1, tmp2)) 443 | 444 | u = uv[:, 0].reshape((-1, 1)) 445 | v = uv[:, 1].reshape((-1, 1)) 446 | U = np.vstack((u, v)) 447 | 448 | if rank(X) >= 2 * K: 449 | r, _, _, _ = lstsq(X, U, rcond=-1) 450 | r = np.squeeze(r) 451 | else: 452 | raise Exception('cp2tform:twoUniquePointsReq') 453 | sc = r[0] 454 | ss = r[1] 455 | tx = r[2] 456 | ty = r[3] 457 | 458 | Tinv = np.array([ 459 | [sc, -ss, 0], 460 | [ss, sc, 0], 461 | [tx, ty, 1] 462 | ]) 463 | 464 | T = inv(Tinv) 465 | T[:, 2] = np.array([0, 0, 1]) 466 | return T, Tinv 467 | 468 | def tformfwd(self, trans, uv): 469 | uv = np.hstack(( 470 | uv, np.ones((uv.shape[0], 1)) 471 | )) 472 | xy = np.dot(uv, trans) 473 | xy = xy[:, 0:-1] 474 | return xy 475 | 476 | def drawBoxes(self, img, imgname): 477 | write_path = './results/{}/bbox/'.format( time.strftime("%Y%m%d", time.localtime()) ) 478 | if not os.path.exists(write_path): 479 | os.makedirs(write_path) 480 | cv2.imwrite('{}{}_aligned.jpg'.format(write_path, imgname), img) 481 | 482 | #### gemfield test phase #### 483 | video_path = 'gemfield.mp4' 484 | if __name__ == '__main__': 485 | if len(sys.argv) == 2: 486 | video_path = sys.argv[1] 487 | 488 | if not os.path.exists(video_path): 489 | print('File not found: {}'.format(video_path)) 490 | sys.exit(1) 491 | 492 | videoCapture = cv2.VideoCapture(video_path) 493 | status, frame = videoCapture.read() 494 | mtcnn = Mtcnn() 495 | alignFace = AlignFace() 496 | frame_num = 0 497 | while status: 498 | frame_num += 1 499 | print('process {}'.format(frame_num)) 500 | rc = mtcnn.process(frame) 501 | if not rc: 502 | status, frame = videoCapture.read() 503 | continue 504 | mtcnn.drawBoxes(frame, frame_num) 505 | points = mtcnn.d['points'] 506 | if points.shape[0] > 0: 507 | for i in range(points.shape[0]): 508 | #gemfield.org: WARNING! THE IMG WILL CONTAIN THE MARK drew earlier! 509 | alignFace.drawBoxes(alignFace(frame, points[i,:]), frame_num) 510 | status, frame = videoCapture.read() 511 | else: 512 | print('End for some reasons...') 513 | --------------------------------------------------------------------------------