├── CMakeLists.txt ├── COPYING.txt ├── FeaturesMain.cpp ├── README.md ├── TextDetection.cpp └── TextDetection.h /CMakeLists.txt: -------------------------------------------------------------------------------- 1 | cmake_minimum_required (VERSION 3.2) 2 | project (DetectText) 3 | 4 | include(CheckCXXCompilerFlag) 5 | CHECK_CXX_COMPILER_FLAG("-std=c++11" COMPILER_SUPPORTS_CXX11) 6 | CHECK_CXX_COMPILER_FLAG("-std=c++0x" COMPILER_SUPPORTS_CXX0X) 7 | if(COMPILER_SUPPORTS_CXX11) 8 | set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11") 9 | elseif(COMPILER_SUPPORTS_CXX0X) 10 | set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++0x") 11 | else() 12 | message(STATUS "The compiler ${CMAKE_CXX_COMPILER} has no C++11 support. Please use a different C++ compiler.") 13 | endif() 14 | 15 | set(CMAKE_BUILD_TYPE Debug) 16 | 17 | find_package(OpenCV REQUIRED core imgproc video highgui features2d) 18 | 19 | ################ Boost ################# 20 | set(Boost_USE_STATIC_LIBS ON) 21 | FIND_PACKAGE(Boost COMPONENTS system REQUIRED) 22 | include_directories(${Boost_INCLUDE_DIR}) 23 | ######################################## 24 | 25 | file(GLOB DETECT_TEXT_SOURCES *.cpp *.c) 26 | file(GLOB DETECT_TEXT_HEADERS *.hpp *.h) 27 | 28 | add_executable(DetectText 29 | ${DETECT_TEXT_SOURCES} 30 | ${DETECT_TEXT_HEADERS} 31 | ) 32 | 33 | target_link_libraries(DetectText 34 | ${Boost} 35 | ${OpenCV_LIBS} 36 | ) -------------------------------------------------------------------------------- /COPYING.txt: -------------------------------------------------------------------------------- 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 | -------------------------------------------------------------------------------- /FeaturesMain.cpp: -------------------------------------------------------------------------------- 1 | 2 | /* 3 | Copyright 2012 Andrew Perrault and Saurav Kumar. 4 | 5 | This file is part of DetectText. 6 | 7 | DetectText is free software: you can redistribute it and/or modify 8 | it under the terms of the GNU General Public License as published by 9 | the Free Software Foundation, either version 3 of the License, or 10 | (at your option) any later version. 11 | 12 | DetectText is distributed in the hope that it will be useful, 13 | but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | GNU General Public License for more details. 16 | 17 | You should have received a copy of the GNU General Public License 18 | along with DetectText. If not, see . 19 | */ 20 | #include 21 | #include 22 | #include 23 | #include 24 | 25 | #include 26 | #include 27 | #include 28 | 29 | #include "TextDetection.h" 30 | 31 | using namespace std; 32 | using namespace cv; 33 | using namespace DetectText; 34 | 35 | void convertToFloatImage ( Mat& byteImage, Mat& floatImage ) 36 | { 37 | byteImage.convertTo(floatImage, CV_32FC1, 1 / 255.); 38 | } 39 | 40 | class FeatureError: public std::exception { 41 | std::string message; 42 | public: 43 | FeatureError(const std::string & msg, const std::string & file) { 44 | std::stringstream ss; 45 | 46 | ss << msg << " " << file; 47 | message = msg.c_str(); 48 | } 49 | ~FeatureError() throw () { 50 | } 51 | }; 52 | 53 | Mat loadByteImage(const char * name) { 54 | Mat image = imread(name); 55 | 56 | if (image.empty()) { 57 | return Mat(); 58 | } 59 | cvtColor(image, image, CV_BGR2RGB); 60 | return image; 61 | } 62 | 63 | Mat loadFloatImage(const char * name) { 64 | Mat image = imread(name); 65 | 66 | if (image.empty()) { 67 | return Mat(); 68 | } 69 | cvtColor(image, image, CV_BGR2RGB); 70 | Mat floatingImage(image.size(), CV_32FC3); 71 | image.convertTo(floatingImage, CV_32F, 1 / 255.); 72 | return floatingImage; 73 | } 74 | 75 | int mainTextDetection(int argc, char** argv) { 76 | Mat byteQueryImage = loadByteImage(argv[1]); 77 | if (byteQueryImage.empty()) { 78 | cerr << "couldn't load query image" << endl; 79 | return -1; 80 | } 81 | 82 | // Detect text in the image 83 | Mat output = textDetection(byteQueryImage, atoi(argv[3])); 84 | imwrite(argv[2], output); 85 | return 0; 86 | } 87 | 88 | int main(int argc, char** argv) { 89 | if ((argc != 4)) { 90 | cerr << "usage: " << argv[0] << " imagefile resultImage darkText" << endl; 91 | return -1; 92 | } 93 | return mainTextDetection(argc, argv); 94 | } 95 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | DetectText 2 | ========== 3 | 4 | Detect text with stroke width transform. 5 | 6 | ## Dependencies 7 | OpenCV 2.4+, boost. 8 | 9 | ## Compile 10 | 11 | g++ -o DetectText TextDetection.cpp FeaturesMain.cpp -lopencv_core -lopencv_highgui -lopencv_imgproc -I/path/to/current/directory 12 | 13 | where /path/to/current/directory is replaced with the absolute path to the current directory. 14 | 15 | ### Using CMake 16 | 17 | mkdir build 18 | cd build 19 | cmake .. 20 | make 21 | 22 | ## To run 23 | ./TextDetection input_file output_file dark_on_light 24 | where dark_on_light is 1 or 0, indicating whether the text is darker or lighter than the background. 25 | 26 | ## More 27 | Details on the algorithm can be found in: 28 | http://www.cs.cornell.edu/courses/cs4670/2010fa/projects/final/results/group_of_arp86_sk2357/Writeup.pdf -------------------------------------------------------------------------------- /TextDetection.cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright 2012 Andrew Perrault and Saurav Kumar. 3 | 4 | This file is part of DetectText. 5 | 6 | DetectText is free software: you can redistribute it and/or modify 7 | it under the terms of the GNU General Public License as published by 8 | the Free Software Foundation, either version 3 of the License, or 9 | (at your option) any later version. 10 | 11 | DetectText is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU General Public License for more details. 15 | 16 | You should have received a copy of the GNU General Public License 17 | along with DetectText. If not, see . 18 | */ 19 | #include 20 | #include 21 | #include 22 | #include 23 | #include 24 | #include 25 | #include 26 | /*#include 27 | #include 28 | #include 29 | #include 30 | #include 31 | #include 32 | #include */ 33 | #include 34 | #include 35 | #include 36 | #include 37 | #include 38 | #include 39 | #include 40 | #include 41 | #include 42 | #include 43 | #include 44 | 45 | using namespace cv; 46 | 47 | #include "TextDetection.h" 48 | 49 | #define PI 3.14159265 50 | 51 | namespace DetectText { 52 | 53 | const Scalar BLUE (255, 0, 0); 54 | const Scalar GREEN(0, 255, 0); 55 | const Scalar RED (0, 0, 255); 56 | 57 | std::vector findBoundingBoxes( std::vector > & components, 58 | std::vector & chains, 59 | std::vector & compBB, 60 | Mat& output) { 61 | std::vector bb; 62 | bb.reserve(chains.size()); 63 | for (auto& chainit : chains) { 64 | int minx = output.cols; 65 | int miny = output.rows; 66 | int maxx = 0; 67 | int maxy = 0; 68 | for (std::vector::const_iterator cit = chainit.components.begin(); cit != chainit.components.end(); cit++) { 69 | miny = std::min(miny,compBB[*cit].first.y); 70 | minx = std::min(minx,compBB[*cit].first.x); 71 | maxy = std::max(maxy,compBB[*cit].second.y); 72 | maxx = std::max(maxx,compBB[*cit].second.x); 73 | } 74 | Point2i p0(minx,miny); 75 | Point2i p1(maxx,maxy); 76 | SWTPointPair2i pair(p0,p1); 77 | bb.push_back(pair); 78 | } 79 | return bb; 80 | } 81 | 82 | std::vector findBoundingBoxes( std::vector > & components, 83 | Mat& output) { 84 | std::vector bb; 85 | bb.reserve(components.size()); 86 | for (auto& compit : components) { 87 | int minx = output.cols; 88 | int miny = output.rows; 89 | int maxx = 0; 90 | int maxy = 0; 91 | for (auto& it : compit) { 92 | miny = std::min(miny,it.y); 93 | minx = std::min(minx,it.x); 94 | maxy = std::max(maxy,it.y); 95 | maxx = std::max(maxx,it.x); 96 | } 97 | Point2i p0(minx,miny); 98 | Point2i p1(maxx,maxy); 99 | SWTPointPair2i pair(p0,p1); 100 | bb.push_back(pair); 101 | } 102 | return bb; 103 | } 104 | 105 | void normalizeImage (const Mat& input, Mat& output) { 106 | assert ( input.depth() == CV_32F ); 107 | assert ( input.channels() == 1 ); 108 | assert ( output.depth() == CV_32F ); 109 | assert ( output.channels() == 1 ); 110 | 111 | float maxVal = 0; 112 | float minVal = 1e100; 113 | for ( int row = 0; row < input.rows; row++ ){ 114 | const float* ptr = (const float*)input.ptr(row); 115 | for ( int col = 0; col < input.cols; col++ ){ 116 | if (*ptr < 0) { } 117 | else { 118 | maxVal = std::max(*ptr, maxVal); 119 | minVal = std::min(*ptr, minVal); 120 | } 121 | ptr++; 122 | } 123 | } 124 | 125 | float difference = maxVal - minVal; 126 | for ( int row = 0; row < input.rows; row++ ) { 127 | const float* ptrin = (const float*)input.ptr(row); 128 | float* ptrout = (float*)output.ptr(row); 129 | for ( int col = 0; col < input.cols; col++ ) { 130 | if (*ptrin < 0) { 131 | *ptrout = 1; 132 | } else { 133 | *ptrout = ((*ptrin) - minVal)/difference; 134 | } 135 | ptrout++; 136 | ptrin++; 137 | } 138 | } 139 | } 140 | 141 | void renderComponents (const Mat& SWTImage, std::vector > & components, Mat& output) { 142 | output.setTo(0); 143 | 144 | for (auto& component : components) { 145 | for (auto& pit : component) { 146 | output.at(pit.y, pit.x) = SWTImage.at(pit.y, pit.x); 147 | } 148 | } 149 | for( int row = 0; row < output.rows; row++ ){ 150 | float* ptr = (float*)output.ptr(row); 151 | for ( int col = 0; col < output.cols; col++ ){ 152 | if (*ptr == 0) { 153 | *ptr = -1; 154 | } 155 | ptr++; 156 | } 157 | } 158 | float maxVal = 0; 159 | float minVal = 1e100; 160 | for( int row = 0; row < output.rows; row++ ){ 161 | const float* ptr = (const float*)output.ptr(row); 162 | for ( int col = 0; col < output.cols; col++ ){ 163 | if (*ptr == 0) { } 164 | else { 165 | maxVal = std::max(*ptr, maxVal); 166 | minVal = std::min(*ptr, minVal); 167 | } 168 | ptr++; 169 | } 170 | } 171 | float difference = maxVal - minVal; 172 | for( int row = 0; row < output.rows; row++ ){ 173 | float* ptr = (float*)output.ptr(row); 174 | for ( int col = 0; col < output.cols; col++ ){ 175 | if (*ptr < 1) { 176 | *ptr = 1; 177 | } else { 178 | *ptr = ((*ptr) - minVal)/difference; 179 | } 180 | ptr++; 181 | } 182 | } 183 | 184 | } 185 | 186 | void renderComponentsWithBoxes (Mat& SWTImage, std::vector > & components, 187 | std::vector & compBB, Mat& output) { 188 | Mat outTemp( output.size(), CV_32FC1 ); 189 | 190 | renderComponents(SWTImage, components, outTemp); 191 | 192 | std::vector bb; 193 | bb.reserve(compBB.size()); 194 | for (auto& it : compBB) { 195 | Point2i p0 = cvPoint(it.first.x, it.first.y); 196 | Point2i p1 = cvPoint(it.second.x, it.second.y); 197 | SWTPointPair2i pair(p0, p1); 198 | bb.push_back(pair); 199 | } 200 | 201 | Mat out( output.size(), CV_8UC1 ); 202 | outTemp.convertTo(out, CV_8UC1, 255.); 203 | cvtColor (out, output, CV_GRAY2RGB); 204 | 205 | int count = 0; 206 | for (auto it : bb) { 207 | Scalar c; 208 | if (count % 3 == 0) { 209 | c = BLUE; 210 | } 211 | else if (count % 3 == 1) { 212 | c = GREEN; 213 | } 214 | else { 215 | c = RED; 216 | } 217 | count++; 218 | rectangle(output, it.first, it.second, c, 2); 219 | } 220 | } 221 | 222 | void renderChainsWithBoxes (Mat& SWTImage, 223 | std::vector > & components, 224 | std::vector & chains, 225 | std::vector & compBB, 226 | Mat& output) { 227 | // keep track of included components 228 | std::vector included; 229 | included.reserve(components.size()); 230 | for (unsigned int i = 0; i != components.size(); i++) { 231 | included.push_back(false); 232 | } 233 | for (Chain& it : chains) { 234 | for (std::vector::iterator cit = it.components.begin(); cit != it.components.end(); cit++) { 235 | included[*cit] = true; 236 | } 237 | } 238 | std::vector > componentsRed; 239 | for (unsigned int i = 0; i != components.size(); i++ ) { 240 | if (included[i]) { 241 | componentsRed.push_back(components[i]); 242 | } 243 | } 244 | Mat outTemp( output.size(), CV_32FC1 ); 245 | 246 | std::cout << componentsRed.size() << " components after chaining" << std::endl; 247 | renderComponents(SWTImage, componentsRed, outTemp); 248 | std::vector bb; 249 | bb = findBoundingBoxes(components, chains, compBB, outTemp); 250 | 251 | Mat out( output.size(), CV_8UC1 ); 252 | outTemp.convertTo(out, CV_8UC1, 255); 253 | cvtColor (out, output, CV_GRAY2RGB); 254 | 255 | int count = 0; 256 | for (auto& it : bb) { 257 | CvScalar c; 258 | if (count % 3 == 0) { 259 | c = BLUE; 260 | } 261 | else if (count % 3 == 1) { 262 | c = GREEN; 263 | } 264 | else { 265 | c = RED; 266 | } 267 | count++; 268 | rectangle(output, it.first, it.second, c, 2); 269 | } 270 | } 271 | 272 | void renderChains (Mat& SWTImage, 273 | std::vector > & components, 274 | std::vector & chains, 275 | Mat& output) { 276 | // keep track of included components 277 | std::vector included; 278 | included.reserve(components.size()); 279 | for (unsigned int i = 0; i != components.size(); i++) { 280 | included.push_back(false); 281 | } 282 | for (std::vector::iterator it = chains.begin(); it != chains.end();it++) { 283 | for (std::vector::iterator cit = it->components.begin(); cit != it->components.end(); cit++) { 284 | included[*cit] = true; 285 | } 286 | } 287 | std::vector > componentsRed; 288 | for (unsigned int i = 0; i != components.size(); i++ ) { 289 | if (included[i]) { 290 | componentsRed.push_back(components[i]); 291 | } 292 | } 293 | std::cout << componentsRed.size() << " components after chaining" << std::endl; 294 | Mat outTemp( output.size(), CV_32FC1 ); 295 | renderComponents(SWTImage,componentsRed,outTemp); 296 | outTemp.convertTo(output, CV_8UC1, 255); 297 | 298 | } 299 | 300 | Mat textDetection (const Mat& input, bool dark_on_light) { 301 | assert ( input.depth() == CV_8U ); 302 | assert ( input.channels() == 3 ); 303 | 304 | std::cout << "Running textDetection with dark_on_light " << dark_on_light << std::endl; 305 | 306 | // Convert to grayscale 307 | Mat grayImage( input.size(), CV_8UC1 ); 308 | cvtColor ( input, grayImage, CV_RGB2GRAY ); 309 | // Create Canny Image 310 | double threshold_low = 175; 311 | double threshold_high = 320; 312 | Mat edgeImage( input.size(),CV_8UC1 ); 313 | Canny(grayImage, edgeImage, threshold_low, threshold_high, 3) ; 314 | imwrite ( "canny.png", edgeImage); 315 | 316 | // Create gradient X, gradient Y 317 | Mat gaussianImage( input.size(), CV_32FC1); 318 | grayImage.convertTo(gaussianImage, CV_32FC1, 1./255.); 319 | GaussianBlur( gaussianImage, gaussianImage, Size(5, 5), 0); 320 | Mat gradientX( input.size(), CV_32FC1 ); 321 | Mat gradientY( input.size(), CV_32FC1 ); 322 | Scharr(gaussianImage, gradientX, -1, 1, 0); 323 | Scharr(gaussianImage, gradientY, -1, 0, 1); 324 | GaussianBlur(gradientX, gradientX, Size(3, 3), 0); 325 | GaussianBlur(gradientY, gradientY, Size(3, 3), 0); 326 | 327 | // Calculate SWT and return ray vectors 328 | std::vector rays; 329 | Mat SWTImage( input.size(), CV_32FC1 ); 330 | for( int row = 0; row < input.rows; row++ ){ 331 | float* ptr = (float*)SWTImage.ptr(row); 332 | for ( int col = 0; col < input.cols; col++ ){ 333 | *ptr++ = -1; 334 | } 335 | } 336 | strokeWidthTransform ( edgeImage, gradientX, gradientY, dark_on_light, SWTImage, rays ); 337 | SWTMedianFilter ( SWTImage, rays ); 338 | 339 | Mat output2( input.size(), CV_32FC1 ); 340 | normalizeImage (SWTImage, output2); 341 | Mat saveSWT( input.size(), CV_8UC1 ); 342 | output2.convertTo(saveSWT, CV_8UC1, 255); 343 | imwrite ( "SWT.png", saveSWT); 344 | 345 | 346 | 347 | // Calculate legally connect components from SWT and gradient image. 348 | // return type is a vector of vectors, where each outer vector is a component and 349 | // the inner vector contains the (y,x) of each pixel in that component. 350 | std::vector > components = findLegallyConnectedComponents(SWTImage, rays); 351 | 352 | // Filter the components 353 | std::vector > validComponents; 354 | std::vector compBB; 355 | std::vector compCenters; 356 | std::vector compMedians; 357 | std::vector compDimensions; 358 | filterComponents(SWTImage, components, validComponents, compCenters, compMedians, compDimensions, compBB ); 359 | 360 | Mat output3( input.size(), CV_8UC3 ); 361 | renderComponentsWithBoxes (SWTImage, validComponents, compBB, output3); 362 | imwrite ( "components.png",output3); 363 | // 364 | 365 | // Make chains of components 366 | std::vector chains; 367 | chains = makeChains(input, validComponents, compCenters, compMedians, compDimensions, compBB); 368 | 369 | Mat output4( input.size(), CV_8UC1 ); 370 | renderChains ( SWTImage, validComponents, chains, output4 ); 371 | //imwrite ( "text.png", output4); 372 | 373 | Mat output5( input.size(), CV_8UC3 ); 374 | cvtColor (output4, output5, CV_GRAY2RGB); 375 | 376 | 377 | /*IplImage * output = 378 | cvCreateImage ( input.size(), CV_8UC3 ); 379 | renderChainsWithBoxes ( SWTImage, validComponents, chains, compBB, output); */ 380 | return output5; 381 | } 382 | 383 | void strokeWidthTransform (const Mat& edgeImage, 384 | Mat& gradientX, 385 | Mat& gradientY, 386 | bool dark_on_light, 387 | Mat& SWTImage, 388 | std::vector & rays) { 389 | // First pass 390 | float prec = .05; 391 | for( int row = 0; row < edgeImage.rows; row++ ){ 392 | const uchar* ptr = (const uchar*)edgeImage.ptr(row); 393 | for ( int col = 0; col < edgeImage.cols; col++ ){ 394 | if (*ptr > 0) { 395 | Ray r; 396 | 397 | SWTPoint2d p; 398 | p.x = col; 399 | p.y = row; 400 | r.p = p; 401 | std::vector points; 402 | points.push_back(p); 403 | 404 | float curX = (float)col + 0.5; 405 | float curY = (float)row + 0.5; 406 | int curPixX = col; 407 | int curPixY = row; 408 | float G_x = gradientX.at(row, col); 409 | float G_y = gradientY.at(row, col); 410 | // normalize gradient 411 | float mag = sqrt( (G_x * G_x) + (G_y * G_y) ); 412 | if (dark_on_light){ 413 | G_x = -G_x/mag; 414 | G_y = -G_y/mag; 415 | } else { 416 | G_x = G_x/mag; 417 | G_y = G_y/mag; 418 | 419 | } 420 | while (true) { 421 | curX += G_x*prec; 422 | curY += G_y*prec; 423 | if ((int)(floor(curX)) != curPixX || (int)(floor(curY)) != curPixY) { 424 | curPixX = (int)(floor(curX)); 425 | curPixY = (int)(floor(curY)); 426 | // check if pixel is outside boundary of image 427 | if (curPixX < 0 || (curPixX >= SWTImage.cols) || curPixY < 0 || (curPixY >= SWTImage.rows)) { 428 | break; 429 | } 430 | SWTPoint2d pnew; 431 | pnew.x = curPixX; 432 | pnew.y = curPixY; 433 | points.push_back(pnew); 434 | 435 | if (edgeImage.at(curPixY, curPixX) > 0) { 436 | r.q = pnew; 437 | // dot product 438 | float G_xt = gradientX.at(curPixY,curPixX); 439 | float G_yt = gradientY.at(curPixY,curPixX); 440 | mag = sqrt( (G_xt * G_xt) + (G_yt * G_yt) ); 441 | if (dark_on_light) { 442 | G_xt = -G_xt / mag; 443 | G_yt = -G_yt / mag; 444 | } else { 445 | G_xt = G_xt / mag; 446 | G_yt = G_yt / mag; 447 | 448 | } 449 | 450 | if (acos(G_x * -G_xt + G_y * -G_yt) < PI/2.0 ) { 451 | float length = sqrt( ((float)r.q.x - (float)r.p.x)*((float)r.q.x - (float)r.p.x) + ((float)r.q.y - (float)r.p.y)*((float)r.q.y - (float)r.p.y)); 452 | for (std::vector::iterator pit = points.begin(); pit != points.end(); pit++) { 453 | if (SWTImage.at(pit->y, pit->x) < 0) { 454 | SWTImage.at(pit->y, pit->x) = length; 455 | } else { 456 | SWTImage.at(pit->y, pit->x) = std::min(length, SWTImage.at(pit->y, pit->x)); 457 | } 458 | } 459 | r.points = points; 460 | rays.push_back(r); 461 | } 462 | break; 463 | } 464 | } 465 | } 466 | } 467 | ptr++; 468 | } 469 | } 470 | 471 | } 472 | 473 | void SWTMedianFilter (Mat& SWTImage, std::vector & rays) { 474 | for (auto& rit : rays) { 475 | for (auto& pit : rit.points) { 476 | pit.SWT = SWTImage.at(pit.y, pit.x); 477 | } 478 | std::sort(rit.points.begin(), rit.points.end(), &Point2dSort); 479 | float median = (rit.points[rit.points.size()/2]).SWT; 480 | for (auto& pit : rit.points) { 481 | SWTImage.at(pit.y, pit.x) = std::min(pit.SWT, median); 482 | } 483 | } 484 | } 485 | 486 | bool Point2dSort (const SWTPoint2d &lhs, const SWTPoint2d &rhs) { 487 | return lhs.SWT < rhs.SWT; 488 | } 489 | 490 | std::vector< std::vector > findLegallyConnectedComponents (Mat& SWTImage, std::vector & rays) { 491 | boost::unordered_map map; 492 | boost::unordered_map revmap; 493 | 494 | typedef boost::adjacency_list Graph; 495 | int num_vertices = 0; 496 | // Number vertices for graph. Associate each point with number 497 | for( int row = 0; row < SWTImage.rows; row++ ){ 498 | float * ptr = (float*)SWTImage.ptr(row); 499 | for (int col = 0; col < SWTImage.cols; col++ ){ 500 | if (*ptr > 0) { 501 | map[row * SWTImage.cols + col] = num_vertices; 502 | SWTPoint2d p; 503 | p.x = col; 504 | p.y = row; 505 | revmap[num_vertices] = p; 506 | num_vertices++; 507 | } 508 | ptr++; 509 | } 510 | } 511 | 512 | Graph g(num_vertices); 513 | 514 | for( int row = 0; row < SWTImage.rows; row++ ){ 515 | float * ptr = (float*)SWTImage.ptr(row); 516 | for (int col = 0; col < SWTImage.cols; col++ ){ 517 | if (*ptr > 0) { 518 | // check pixel to the right, right-down, down, left-down 519 | int this_pixel = map[row * SWTImage.cols + col]; 520 | if (col+1 < SWTImage.cols) { 521 | float right = SWTImage.at(row, col+1); 522 | if (right > 0 && ((*ptr)/right <= 3.0 || right/(*ptr) <= 3.0)) 523 | boost::add_edge(this_pixel, map.at(row * SWTImage.cols + col + 1), g); 524 | } 525 | if (row+1 < SWTImage.rows) { 526 | if (col+1 < SWTImage.cols) { 527 | float right_down = SWTImage.at(row+1, col+1); 528 | if (right_down > 0 && ((*ptr)/right_down <= 3.0 || right_down/(*ptr) <= 3.0)) 529 | boost::add_edge(this_pixel, map.at((row+1) * SWTImage.cols + col + 1), g); 530 | } 531 | float down = SWTImage.at(row+1, col); 532 | if (down > 0 && ((*ptr)/down <= 3.0 || down/(*ptr) <= 3.0)) 533 | boost::add_edge(this_pixel, map.at((row+1) * SWTImage.cols + col), g); 534 | if (col-1 >= 0) { 535 | float left_down = SWTImage.at(row+1, col-1); 536 | if (left_down > 0 && ((*ptr)/left_down <= 3.0 || left_down/(*ptr) <= 3.0)) 537 | boost::add_edge(this_pixel, map.at((row+1) * SWTImage.cols + col - 1), g); 538 | } 539 | } 540 | } 541 | ptr++; 542 | } 543 | } 544 | 545 | std::vector c(num_vertices); 546 | 547 | int num_comp = connected_components(g, &c[0]); 548 | 549 | std::vector > components; 550 | components.reserve(num_comp); 551 | std::cout << "Before filtering, " << num_comp << " components and " << num_vertices << " vertices" << std::endl; 552 | for (int j = 0; j < num_comp; j++) { 553 | std::vector tmp; 554 | components.push_back( tmp ); 555 | } 556 | for (int j = 0; j < num_vertices; j++) { 557 | SWTPoint2d p = revmap[j]; 558 | (components[c[j]]).push_back(p); 559 | } 560 | 561 | return components; 562 | } 563 | 564 | std::vector< std::vector > 565 | findLegallyConnectedComponentsRAY (Mat& SWTImage, 566 | std::vector & rays) 567 | { 568 | boost::unordered_map map; 569 | boost::unordered_map revmap; 570 | 571 | typedef boost::adjacency_list Graph; 572 | int num_vertices = 0; 573 | // Number vertices for graph. Associate each point with number 574 | for( int row = 0; row < SWTImage.rows; row++ ){ 575 | float * ptr = (float*)SWTImage.ptr(row); 576 | for (int col = 0; col < SWTImage.cols; col++ ){ 577 | if (*ptr > 0) { 578 | map[row * SWTImage.cols + col] = num_vertices; 579 | SWTPoint2d p; 580 | p.x = col; 581 | p.y = row; 582 | revmap[num_vertices] = p; 583 | num_vertices++; 584 | } 585 | ptr++; 586 | } 587 | } 588 | 589 | Graph g(num_vertices); 590 | 591 | // Traverse and add edges to graph 592 | for (std::vector::const_iterator it = rays.begin(); it != rays.end(); it++) { 593 | float lastSW = 0; 594 | int lastRow = 0; 595 | int lastCol = 0; 596 | for (std::vector::const_iterator it2 = it->points.begin(); it2 != it->points.end(); it2++) { 597 | float currentSW = SWTImage.at(it2->y, it2->x); 598 | if (lastSW == 0) {} 599 | else if (lastSW/currentSW<=3.0 || currentSW/lastSW<=3.0){ 600 | boost::add_edge(map.at(it2->y * SWTImage.cols + it2->x), map.at(lastRow * SWTImage.cols + lastCol), g); 601 | } 602 | lastSW = currentSW; 603 | lastRow = it2->y; 604 | lastCol = it2->x; 605 | } 606 | lastSW = 0; 607 | lastRow = 0; 608 | lastCol = 0; 609 | } 610 | 611 | std::vector c(num_vertices); 612 | 613 | int num_comp = connected_components(g, &c[0]); 614 | 615 | std::vector > components; 616 | components.reserve(num_comp); 617 | std::cout << "Before filtering, " << num_comp << " components and " << num_vertices << " vertices" << std::endl; 618 | for (int j = 0; j < num_comp; j++) { 619 | std::vector tmp; 620 | components.push_back( tmp ); 621 | } 622 | for (int j = 0; j < num_vertices; j++) { 623 | SWTPoint2d p = revmap[j]; 624 | (components[c[j]]).push_back(p); 625 | } 626 | 627 | return components; 628 | } 629 | 630 | void componentStats(Mat& SWTImage, 631 | const std::vector & component, 632 | float & mean, float & variance, float & median, 633 | int & minx, int & miny, int & maxx, int & maxy) 634 | { 635 | std::vector temp; 636 | temp.reserve(component.size()); 637 | mean = 0; 638 | variance = 0; 639 | minx = 1000000; 640 | miny = 1000000; 641 | maxx = 0; 642 | maxy = 0; 643 | for (std::vector::const_iterator it = component.begin(); it != component.end(); it++) { 644 | float t = SWTImage.at(it->y, it->x); 645 | mean += t; 646 | temp.push_back(t); 647 | miny = std::min(miny,it->y); 648 | minx = std::min(minx,it->x); 649 | maxy = std::max(maxy,it->y); 650 | maxx = std::max(maxx,it->x); 651 | } 652 | mean = mean / ((float)component.size()); 653 | for (std::vector::const_iterator it = temp.begin(); it != temp.end(); it++) { 654 | variance += (*it - mean) * (*it - mean); 655 | } 656 | variance = variance / ((float)component.size()); 657 | std::sort(temp.begin(),temp.end()); 658 | median = temp[temp.size()/2]; 659 | } 660 | 661 | 662 | void filterComponents(Mat& SWTImage, 663 | std::vector > & components, 664 | std::vector > & validComponents, 665 | std::vector & compCenters, 666 | std::vector & compMedians, 667 | std::vector & compDimensions, 668 | std::vector & compBB ) 669 | { 670 | validComponents.reserve(components.size()); 671 | compCenters.reserve(components.size()); 672 | compMedians.reserve(components.size()); 673 | compDimensions.reserve(components.size()); 674 | // bounding boxes 675 | compBB.reserve(components.size()); 676 | for (std::vector >::iterator it = components.begin(); it != components.end();it++) { 677 | // compute the stroke width mean, variance, median 678 | float mean, variance, median; 679 | int minx, miny, maxx, maxy; 680 | componentStats(SWTImage, (*it), mean, variance, median, minx, miny, maxx, maxy); 681 | 682 | // check if variance is less than half the mean 683 | if (variance > 0.5 * mean) { 684 | continue; 685 | } 686 | 687 | float length = (float)(maxx-minx+1); 688 | float width = (float)(maxy-miny+1); 689 | 690 | // check font height 691 | if (width > 300) { 692 | continue; 693 | } 694 | 695 | float area = length * width; 696 | float rminx = (float)minx; 697 | float rmaxx = (float)maxx; 698 | float rminy = (float)miny; 699 | float rmaxy = (float)maxy; 700 | // compute the rotated bounding box 701 | float increment = 1./36.; 702 | for (float theta = increment * PI; theta 10.) { 726 | continue; 727 | } 728 | 729 | // compute the diameter TODO finish 730 | // compute dense representation of component 731 | std::vector > denseRepr; 732 | denseRepr.reserve(maxx-minx+1); 733 | for (int i = 0; i < maxx-minx+1; i++) { 734 | std::vector tmp; 735 | tmp.reserve(maxy-miny+1); 736 | denseRepr.push_back(tmp); 737 | for (int j = 0; j < maxy-miny+1; j++) {\ 738 | denseRepr[i].push_back(0); 739 | } 740 | } 741 | for (std::vector::iterator pit = it->begin(); pit != it->end(); pit++) { 742 | (denseRepr[pit->x - minx])[pit->y - miny] = 1; 743 | } 744 | // create graph representing components 745 | const int num_nodes = it->size(); 746 | /* 747 | E edges[] = { E(0,2), 748 | E(1,1), E(1,3), E(1,4), 749 | E(2,1), E(2,3), 750 | E(3,4), 751 | E(4,0), E(4,1) }; 752 | 753 | Graph G(edges + sizeof(edges) / sizeof(E), weights, num_nodes); 754 | */ 755 | Point2dFloat center; 756 | center.x = ((float)(maxx+minx))/2.0; 757 | center.y = ((float)(maxy+miny))/2.0; 758 | 759 | SWTPoint2d dimensions; 760 | dimensions.x = maxx - minx + 1; 761 | dimensions.y = maxy - miny + 1; 762 | 763 | SWTPoint2d bb1; 764 | bb1.x = minx; 765 | bb1.y = miny; 766 | 767 | SWTPoint2d bb2; 768 | bb2.x = maxx; 769 | bb2.y = maxy; 770 | SWTPointPair2d pair(bb1,bb2); 771 | 772 | compBB.push_back(pair); 773 | compDimensions.push_back(dimensions); 774 | compMedians.push_back(median); 775 | compCenters.push_back(center); 776 | validComponents.push_back(*it); 777 | } 778 | std::vector > tempComp; 779 | std::vector tempDim; 780 | std::vector tempMed; 781 | std::vector tempCenters; 782 | std::vector tempBB; 783 | tempComp.reserve(validComponents.size()); 784 | tempCenters.reserve(validComponents.size()); 785 | tempDim.reserve(validComponents.size()); 786 | tempMed.reserve(validComponents.size()); 787 | tempBB.reserve(validComponents.size()); 788 | for (unsigned int i = 0; i < validComponents.size(); i++) { 789 | int count = 0; 790 | for (unsigned int j = 0; j < validComponents.size(); j++) { 791 | if (i != j) { 792 | if (compBB[i].first.x <= compCenters[j].x && compBB[i].second.x >= compCenters[j].x && 793 | compBB[i].first.y <= compCenters[j].y && compBB[i].second.y >= compCenters[j].y) { 794 | count++; 795 | } 796 | } 797 | } 798 | if (count < 2) { 799 | tempComp.push_back(validComponents[i]); 800 | tempCenters.push_back(compCenters[i]); 801 | tempMed.push_back(compMedians[i]); 802 | tempDim.push_back(compDimensions[i]); 803 | tempBB.push_back(compBB[i]); 804 | } 805 | } 806 | validComponents = tempComp; 807 | compDimensions = tempDim; 808 | compMedians = tempMed; 809 | compCenters = tempCenters; 810 | compBB = tempBB; 811 | 812 | compDimensions.reserve(tempComp.size()); 813 | compMedians.reserve(tempComp.size()); 814 | compCenters.reserve(tempComp.size()); 815 | validComponents.reserve(tempComp.size()); 816 | compBB.reserve(tempComp.size()); 817 | 818 | std::cout << "After filtering " << validComponents.size() << " components" << std::endl; 819 | } 820 | 821 | bool sharesOneEnd( Chain c0, Chain c1) { 822 | if (c0.p == c1.p || c0.p == c1.q || c0.q == c1.q || c0.q == c1.p) { 823 | return true; 824 | } 825 | else { 826 | return false; 827 | } 828 | } 829 | 830 | bool chainSortDist (const Chain &lhs, const Chain &rhs) { 831 | return lhs.dist < rhs.dist; 832 | } 833 | 834 | bool chainSortLength (const Chain &lhs, const Chain &rhs) { 835 | return lhs.components.size() > rhs.components.size(); 836 | } 837 | 838 | std::vector makeChains( const Mat& colorImage, 839 | std::vector > & components, 840 | std::vector & compCenters, 841 | std::vector & compMedians, 842 | std::vector & compDimensions, 843 | std::vector & compBB) { 844 | assert (compCenters.size() == components.size()); 845 | // make vector of color averages 846 | std::vector colorAverages; 847 | colorAverages.reserve(components.size()); 848 | for (std::vector >::iterator it = components.begin(); it != components.end();it++) { 849 | Point3dFloat mean; 850 | mean.x = 0; 851 | mean.y = 0; 852 | mean.z = 0; 853 | int num_points = 0; 854 | for (std::vector::iterator pit = it->begin(); pit != it->end(); pit++) { 855 | mean.x += (float) colorImage.at(pit->y, (pit->x)*3 ); 856 | mean.y += (float) colorImage.at(pit->y, (pit->x)*3+1 ); 857 | mean.z += (float) colorImage.at(pit->y, (pit->x)*3+2 ); 858 | num_points++; 859 | } 860 | mean.x = mean.x / ((float)num_points); 861 | mean.y = mean.y / ((float)num_points); 862 | mean.z = mean.z / ((float)num_points); 863 | colorAverages.push_back(mean); 864 | } 865 | 866 | // form all eligible pairs and calculate the direction of each 867 | std::vector chains; 868 | for ( unsigned int i = 0; i < components.size(); i++ ) { 869 | for ( unsigned int j = i + 1; j < components.size(); j++ ) { 870 | // TODO add color metric 871 | if ( (compMedians[i]/compMedians[j] <= 2.0 || compMedians[j]/compMedians[i] <= 2.0) && 872 | (compDimensions[i].y/compDimensions[j].y <= 2.0 || compDimensions[j].y/compDimensions[i].y <= 2.0)) { 873 | float dist = (compCenters[i].x - compCenters[j].x) * (compCenters[i].x - compCenters[j].x) + 874 | (compCenters[i].y - compCenters[j].y) * (compCenters[i].y - compCenters[j].y); 875 | float colorDist = (colorAverages[i].x - colorAverages[j].x) * (colorAverages[i].x - colorAverages[j].x) + 876 | (colorAverages[i].y - colorAverages[j].y) * (colorAverages[i].y - colorAverages[j].y) + 877 | (colorAverages[i].z - colorAverages[j].z) * (colorAverages[i].z - colorAverages[j].z); 878 | if (dist < 9*(float)(std::max(std::min(compDimensions[i].x,compDimensions[i].y),std::min(compDimensions[j].x,compDimensions[j].y))) 879 | *(float)(std::max(std::min(compDimensions[i].x,compDimensions[i].y),std::min(compDimensions[j].x,compDimensions[j].y))) 880 | && colorDist < 1600) { 881 | Chain c; 882 | c.p = i; 883 | c.q = j; 884 | std::vector comps; 885 | comps.push_back(c.p); 886 | comps.push_back(c.q); 887 | c.components = comps; 888 | c.dist = dist; 889 | float d_x = (compCenters[i].x - compCenters[j].x); 890 | float d_y = (compCenters[i].y - compCenters[j].y); 891 | /* 892 | float d_x = (compBB[i].first.x - compBB[j].second.x); 893 | float d_y = (compBB[i].second.y - compBB[j].second.y); 894 | */ 895 | float mag = sqrt(d_x*d_x + d_y*d_y); 896 | d_x = d_x / mag; 897 | d_y = d_y / mag; 898 | Point2dFloat dir; 899 | dir.x = d_x; 900 | dir.y = d_y; 901 | c.direction = dir; 902 | chains.push_back(c); 903 | 904 | /*std::cerr << c.p << " " << c.q << std::endl; 905 | std::cerr << c.direction.x << " " << c.direction.y << std::endl; 906 | std::cerr << compCenters[c.p].x << " " << compCenters[c.p].y << std::endl; 907 | std::cerr << compCenters[c.q].x << " " << compCenters[c.q].y << std::endl; 908 | std::cerr << std::endl; 909 | std::cerr << colorDist << std::endl; */ 910 | } 911 | } 912 | } 913 | } 914 | std::cout << chains.size() << " eligible pairs" << std::endl; 915 | std::sort(chains.begin(), chains.end(), &chainSortDist); 916 | 917 | std::cerr << std::endl; 918 | const float strictness = PI/6.0; 919 | //merge chains 920 | int merges = 1; 921 | while (merges > 0) { 922 | for (unsigned int i = 0; i < chains.size(); i++) { 923 | chains[i].merged = false; 924 | } 925 | merges = 0; 926 | std::vector newchains; 927 | for (unsigned int i = 0; i < chains.size(); i++) { 928 | for (unsigned int j = 0; j < chains.size(); j++) { 929 | if (i != j) { 930 | if (!chains[i].merged && !chains[j].merged && sharesOneEnd(chains[i],chains[j])) { 931 | if (chains[i].p == chains[j].p) { 932 | if (acos(chains[i].direction.x * -chains[j].direction.x + chains[i].direction.y * -chains[j].direction.y) < strictness) { 933 | /* if (chains[i].p == chains[i].q || chains[j].p == chains[j].q) { 934 | std::cout << "CRAZY ERROR" << std::endl; 935 | } else if (chains[i].p == chains[j].p && chains[i].q == chains[j].q) { 936 | std::cout << "CRAZY ERROR" << std::endl; 937 | } else if (chains[i].p == chains[j].q && chains[i].q == chains[j].p) { 938 | std::cout << "CRAZY ERROR" << std::endl; 939 | } 940 | std::cerr << 1 <::iterator it = chains[j].components.begin(); it != chains[j].components.end(); it++) { 951 | chains[i].components.push_back(*it); 952 | } 953 | float d_x = (compCenters[chains[i].p].x - compCenters[chains[i].q].x); 954 | float d_y = (compCenters[chains[i].p].y - compCenters[chains[i].q].y); 955 | chains[i].dist = d_x * d_x + d_y * d_y; 956 | 957 | float mag = sqrt(d_x*d_x + d_y*d_y); 958 | d_x = d_x / mag; 959 | d_y = d_y / mag; 960 | Point2dFloat dir; 961 | dir.x = d_x; 962 | dir.y = d_y; 963 | chains[i].direction = dir; 964 | chains[j].merged = true; 965 | merges++; 966 | /*j=-1; 967 | i=0; 968 | if (i == chains.size() - 1) i=-1; 969 | std::stable_sort(chains.begin(), chains.end(), &chainSortLength);*/ 970 | } 971 | } else if (chains[i].p == chains[j].q) { 972 | if (acos(chains[i].direction.x * chains[j].direction.x + chains[i].direction.y * chains[j].direction.y) < strictness) { 973 | /* 974 | if (chains[i].p == chains[i].q || chains[j].p == chains[j].q) { 975 | std::cout << "CRAZY ERROR" << std::endl; 976 | } else if (chains[i].p == chains[j].p && chains[i].q == chains[j].q) { 977 | std::cout << "CRAZY ERROR" << std::endl; 978 | } else if (chains[i].p == chains[j].q && chains[i].q == chains[j].p) { 979 | std::cout << "CRAZY ERROR" << std::endl; 980 | } 981 | std::cerr << 2 <::iterator it = chains[j].components.begin(); it != chains[j].components.end(); it++) { 994 | chains[i].components.push_back(*it); 995 | } 996 | float d_x = (compCenters[chains[i].p].x - compCenters[chains[i].q].x); 997 | float d_y = (compCenters[chains[i].p].y - compCenters[chains[i].q].y); 998 | float mag = sqrt(d_x*d_x + d_y*d_y); 999 | chains[i].dist = d_x * d_x + d_y * d_y; 1000 | 1001 | d_x = d_x / mag; 1002 | d_y = d_y / mag; 1003 | 1004 | Point2dFloat dir; 1005 | dir.x = d_x; 1006 | dir.y = d_y; 1007 | chains[i].direction = dir; 1008 | chains[j].merged = true; 1009 | merges++; 1010 | /*j=-1; 1011 | i=0; 1012 | if (i == chains.size() - 1) i=-1; 1013 | std::stable_sort(chains.begin(), chains.end(), &chainSortLength); */ 1014 | } 1015 | } else if (chains[i].q == chains[j].p) { 1016 | if (acos(chains[i].direction.x * chains[j].direction.x + chains[i].direction.y * chains[j].direction.y) < strictness) { 1017 | /* if (chains[i].p == chains[i].q || chains[j].p == chains[j].q) { 1018 | std::cout << "CRAZY ERROR" << std::endl; 1019 | } else if (chains[i].p == chains[j].p && chains[i].q == chains[j].q) { 1020 | std::cout << "CRAZY ERROR" << std::endl; 1021 | } else if (chains[i].p == chains[j].q && chains[i].q == chains[j].p) { 1022 | std::cout << "CRAZY ERROR" << std::endl; 1023 | } 1024 | std::cerr << 3 <::iterator it = chains[j].components.begin(); it != chains[j].components.end(); it++) { 1035 | chains[i].components.push_back(*it); 1036 | } 1037 | float d_x = (compCenters[chains[i].p].x - compCenters[chains[i].q].x); 1038 | float d_y = (compCenters[chains[i].p].y - compCenters[chains[i].q].y); 1039 | float mag = sqrt(d_x*d_x + d_y*d_y); 1040 | chains[i].dist = d_x * d_x + d_y * d_y; 1041 | 1042 | 1043 | d_x = d_x / mag; 1044 | d_y = d_y / mag; 1045 | Point2dFloat dir; 1046 | dir.x = d_x; 1047 | dir.y = d_y; 1048 | 1049 | chains[i].direction = dir; 1050 | chains[j].merged = true; 1051 | merges++; 1052 | /*j=-1; 1053 | i=0; 1054 | if (i == chains.size() - 1) i=-1; 1055 | std::stable_sort(chains.begin(), chains.end(), &chainSortLength); */ 1056 | } 1057 | } else if (chains[i].q == chains[j].q) { 1058 | if (acos(chains[i].direction.x * -chains[j].direction.x + chains[i].direction.y * -chains[j].direction.y) < strictness) { 1059 | /* if (chains[i].p == chains[i].q || chains[j].p == chains[j].q) { 1060 | std::cout << "CRAZY ERROR" << std::endl; 1061 | } else if (chains[i].p == chains[j].p && chains[i].q == chains[j].q) { 1062 | std::cout << "CRAZY ERROR" << std::endl; 1063 | } else if (chains[i].p == chains[j].q && chains[i].q == chains[j].p) { 1064 | std::cout << "CRAZY ERROR" << std::endl; 1065 | } 1066 | std::cerr << 4 <::iterator it = chains[j].components.begin(); it != chains[j].components.end(); it++) { 1075 | chains[i].components.push_back(*it); 1076 | } 1077 | float d_x = (compCenters[chains[i].p].x - compCenters[chains[i].q].x); 1078 | float d_y = (compCenters[chains[i].p].y - compCenters[chains[i].q].y); 1079 | chains[i].dist = d_x * d_x + d_y * d_y; 1080 | 1081 | float mag = sqrt(d_x*d_x + d_y*d_y); 1082 | d_x = d_x / mag; 1083 | d_y = d_y / mag; 1084 | Point2dFloat dir; 1085 | dir.x = d_x; 1086 | dir.y = d_y; 1087 | chains[i].direction = dir; 1088 | chains[j].merged = true; 1089 | merges++; 1090 | /*j=-1; 1091 | i=0; 1092 | if (i == chains.size() - 1) i=-1; 1093 | std::stable_sort(chains.begin(), chains.end(), &chainSortLength);*/ 1094 | } 1095 | } 1096 | } 1097 | } 1098 | } 1099 | } 1100 | for (unsigned int i = 0; i < chains.size(); i++) { 1101 | if (!chains[i].merged) { 1102 | newchains.push_back(chains[i]); 1103 | } 1104 | } 1105 | chains = newchains; 1106 | std::stable_sort(chains.begin(), chains.end(), &chainSortLength); 1107 | } 1108 | 1109 | std::vector newchains; 1110 | newchains.reserve(chains.size()); 1111 | for (std::vector::iterator cit = chains.begin(); cit != chains.end(); cit++) { 1112 | if (cit->components.size() >= 3) { 1113 | newchains.push_back(*cit); 1114 | } 1115 | } 1116 | chains = newchains; 1117 | std::cout << chains.size() << " chains after merging" << std::endl; 1118 | return chains; 1119 | } 1120 | 1121 | } 1122 | -------------------------------------------------------------------------------- /TextDetection.h: -------------------------------------------------------------------------------- 1 | /* 2 | Copyright 2012 Andrew Perrault and Saurav Kumar. 3 | 4 | This file is part of DetectText. 5 | 6 | DetectText is free software: you can redistribute it and/or modify 7 | it under the terms of the GNU General Public License as published by 8 | the Free Software Foundation, either version 3 of the License, or 9 | (at your option) any later version. 10 | 11 | DetectText is distributed in the hope that it will be useful, 12 | but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | GNU General Public License for more details. 15 | 16 | You should have received a copy of the GNU General Public License 17 | along with DetectText. If not, see . 18 | */ 19 | #ifndef TEXTDETECTION_H 20 | #define TEXTDETECTION_H 21 | 22 | #include 23 | 24 | namespace DetectText { 25 | 26 | struct SWTPoint2d { 27 | int x; 28 | int y; 29 | float SWT; 30 | }; 31 | 32 | typedef std::pair SWTPointPair2d; 33 | typedef std::pair SWTPointPair2i; 34 | 35 | struct Point2dFloat { 36 | float x; 37 | float y; 38 | }; 39 | 40 | struct Ray { 41 | SWTPoint2d p; 42 | SWTPoint2d q; 43 | std::vector points; 44 | }; 45 | 46 | struct Point3dFloat { 47 | float x; 48 | float y; 49 | float z; 50 | }; 51 | 52 | 53 | struct Chain { 54 | int p; 55 | int q; 56 | float dist; 57 | bool merged; 58 | Point2dFloat direction; 59 | std::vector components; 60 | }; 61 | 62 | bool Point2dSort (SWTPoint2d const & lhs, 63 | SWTPoint2d const & rhs); 64 | 65 | cv::Mat textDetection (const cv::Mat& input, bool dark_on_light); 66 | 67 | void strokeWidthTransform (const cv::Mat& edgeImage, 68 | cv::Mat& gradientX, 69 | cv::Mat& gradientY, 70 | bool dark_on_light, 71 | cv::Mat& SWTImage, 72 | std::vector & rays); 73 | 74 | void SWTMedianFilter (cv::Mat& SWTImage, std::vector & rays); 75 | 76 | std::vector< std::vector > findLegallyConnectedComponents (cv::Mat& SWTImage, std::vector & rays); 77 | 78 | std::vector< std::vector > 79 | findLegallyConnectedComponentsRAY (IplImage * SWTImage, 80 | std::vector & rays); 81 | 82 | void componentStats(IplImage * SWTImage, 83 | const std::vector & component, 84 | float & mean, float & variance, float & median, 85 | int & minx, int & miny, int & maxx, int & maxy); 86 | 87 | void filterComponents(cv::Mat& SWTImage, 88 | std::vector > & components, 89 | std::vector > & validComponents, 90 | std::vector & compCenters, 91 | std::vector & compMedians, 92 | std::vector & compDimensions, 93 | std::vector & compBB ); 94 | 95 | std::vector makeChains( const cv::Mat& colorImage, 96 | std::vector > & components, 97 | std::vector & compCenters, 98 | std::vector & compMedians, 99 | std::vector & compDimensions, 100 | std::vector & compBB); 101 | 102 | } 103 | 104 | #endif // TEXTDETECTION_H 105 | 106 | --------------------------------------------------------------------------------