├── .gitignore ├── LICENSE ├── README.md ├── configs └── freenet │ ├── freenet_1_0_grss2013.py │ ├── freenet_1_0_pavia.py │ └── freenet_1_0_salinas.py ├── data ├── __init__.py ├── base.py ├── dataloader.py ├── grss2013.py ├── pavia.py └── salinas.py ├── module ├── __init__.py └── freenet.py ├── scripts ├── freenet_1_0_grss.sh ├── freenet_1_0_pavia.sh └── freenet_1_0_salinas.sh └── train.py /.gitignore: -------------------------------------------------------------------------------- 1 | # Created by .ignore support plugin (hsz.mobi) 2 | 3 | .idea -------------------------------------------------------------------------------- /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 | [![PWC](https://img.shields.io/endpoint.svg?url=https://paperswithcode.com/badge/fpga-fast-patch-free-global-learning-1/hyperspectral-image-classification-on-casi)](https://paperswithcode.com/sota/hyperspectral-image-classification-on-casi?p=fpga-fast-patch-free-global-learning-1) 2 | 3 | [![PWC](https://img.shields.io/endpoint.svg?url=https://paperswithcode.com/badge/fpga-fast-patch-free-global-learning-1/hyperspectral-image-classification-on-pavia)](https://paperswithcode.com/sota/hyperspectral-image-classification-on-pavia?p=fpga-fast-patch-free-global-learning-1) 4 | 5 | [![PWC](https://img.shields.io/endpoint.svg?url=https://paperswithcode.com/badge/fpga-fast-patch-free-global-learning-1/hyperspectral-image-classification-on-salinas-1)](https://paperswithcode.com/sota/hyperspectral-image-classification-on-salinas-1?p=fpga-fast-patch-free-global-learning-1) 6 | 7 | [![License: GPL v3](https://img.shields.io/github/license/Z-Zheng/FreeNet?style=plastic)](https://www.gnu.org/licenses/gpl-3.0) 8 | 9 | 10 | 11 |

FPGA & FreeNet

12 |
Fast Patch-Free Global Learning Framework for Fully End-to-End Hyperspectral Image Classification
13 | 14 |
by Zhuo Zheng, Yanfei Zhong, Ailong Ma and Liangpei Zhang
15 | 16 |
17 |

18 |
19 | 20 | This is an official implementation of FPGA framework and FreeNet in our TGRS 2020 paper ["FPGA: Fast Patch-Free Global Learning Framework for Fully End-to-End Hyperspectral Image Classification"](https://ieeexplore.ieee.org/document/9007624). 21 | 22 | We hope the FPGA framework can become a stronger and cleaner baseline for hyperspectral image classification research in the future. 23 | 24 | ## News 25 | 1. 2020/05/28, We release the code of FreeNet and FPGA framework. 26 | 27 | 28 | ## Features 29 | 1. Patch-free training and inference 30 | 2. Fully end-to-end (w/o preprocess technologies, such as dimension reduction) 31 | 32 | 33 | ## Citation 34 | If you use FPGA framework or FreeNet in your research, please cite the following paper: 35 | ```text 36 | @article{zheng2020fpga, 37 | title={FPGA: Fast Patch-Free Global Learning Framework for Fully End-to-End Hyperspectral Image Classification}, 38 | author={Zheng, Zhuo and Zhong, Yanfei and Ma, Ailong and Zhang, Liangpei}, 39 | journal={IEEE Transactions on Geoscience and Remote Sensing}, 40 | year={2020}, 41 | publisher={IEEE}, 42 | note={doi: {10.1109/TGRS.2020.2967821}} 43 | } 44 | ``` 45 | 46 | 47 | ## Getting Started 48 | ### 1. Install SimpleCV 49 | 50 | ```bash 51 | pip install --upgrade git+https://github.com/Z-Zheng/SimpleCV.git 52 | ``` 53 | ### 2. Prepare datasets 54 | 55 | It is recommended to symlink the dataset root to `$FreeNet`. 56 | 57 | The project should be organized as: 58 | ```text 59 | FreeNet 60 | ├── configs // configure files 61 | ├── data // dataset and dataloader class 62 | ├── module // network arch. 63 | ├── scripts 64 | ├── pavia // data 1 65 | │ ├── PaviaU.mat 66 | │ ├── PaviaU_gt.mat 67 | ├── salinas // data 2 68 | │ ├── Salinas_corrected.mat 69 | │ ├── Salinas_gt.mat 70 | ├── GRSS2013 // data 3 71 | │ ├── 2013_IEEE_GRSS_DF_Contest_CASI.tif 72 | │ ├── train_roi.tif 73 | │ ├── val_roi.tif 74 | ``` 75 | 76 | ### 3. run experiments 77 | 78 | #### 1. PaviaU 79 | ```bash 80 | bash scripts/freenet_1_0_pavia.sh 81 | ``` 82 | 83 | #### 2. Salinas 84 | ```bash 85 | bash scripts/freenet_1_0_salinas.sh 86 | ``` 87 | 88 | #### 3. GRSS2013 89 | ```bash 90 | bash scripts/freenet_1_0_grss.sh 91 | ``` 92 | 93 | ### License 94 | This source code is released under [GPLv3](http://www.gnu.org/licenses/) license. 95 | 96 | For commercial use, please contact Prof. Zhong (zhongyanfei@whu.edu.cn). 97 | 98 | -------------------------------------------------------------------------------- /configs/freenet/freenet_1_0_grss2013.py: -------------------------------------------------------------------------------- 1 | config = dict( 2 | model=dict( 3 | type='FreeNet', 4 | params=dict( 5 | in_channels=144, 6 | num_classes=15, 7 | block_channels=(96, 128, 192, 256), 8 | inner_dim=128, 9 | reduction_ratio=1.0, 10 | ) 11 | ), 12 | data=dict( 13 | train=dict( 14 | type='NewGRSS2013Loader', 15 | params=dict( 16 | training=True, 17 | num_workers=0, 18 | image_path='./GRSS2013/2013_IEEE_GRSS_DF_Contest_CASI.tif', 19 | gt_path='./GRSS2013/train_roi.tif', 20 | sub_minibatch=20 21 | ) 22 | ), 23 | test=dict( 24 | type='NewGRSS2013Loader', 25 | params=dict( 26 | training=False, 27 | num_workers=0, 28 | image_path='./GRSS2013/2013_IEEE_GRSS_DF_Contest_CASI.tif', 29 | gt_path='./GRSS2013/val_roi.tif', 30 | sub_minibatch=20 31 | ) 32 | ) 33 | ), 34 | optimizer=dict( 35 | type='sgd', 36 | params=dict( 37 | momentum=0.9, 38 | weight_decay=0.001 39 | ) 40 | ), 41 | learning_rate=dict( 42 | type='poly', 43 | params=dict( 44 | base_lr=0.001, 45 | power=0.9, 46 | max_iters=1000), 47 | ), 48 | train=dict( 49 | forward_times=1, 50 | num_iters=1000, 51 | eval_per_epoch=True, 52 | summary_grads=False, 53 | summary_weights=False, 54 | eval_after_train=True, 55 | resume_from_last=True, 56 | ), 57 | test=dict( 58 | draw=dict( 59 | image_size=(349, 1905), 60 | palette=[ 61 | 0, 0, 0, 62 | 139, 67, 45, 63 | 0, 0, 255, 64 | 255, 100, 0, 65 | 0, 255, 123, 66 | 164, 75, 155, 67 | 101, 173, 255, 68 | 118, 254, 172, 69 | 60, 91, 112, 70 | 255, 255, 0, 71 | 255, 255, 125, 72 | 255, 0, 255, 73 | 100, 0, 255, 74 | 0, 172, 254, 75 | 0, 255, 0, 76 | 171, 175, 80 77 | ] 78 | ) 79 | ), 80 | 81 | ) 82 | -------------------------------------------------------------------------------- /configs/freenet/freenet_1_0_pavia.py: -------------------------------------------------------------------------------- 1 | config = dict( 2 | model=dict( 3 | type='FreeNet', 4 | params=dict( 5 | in_channels=103, 6 | num_classes=9, 7 | block_channels=(96, 128, 192, 256), 8 | inner_dim=128, 9 | reduction_ratio=1.0, 10 | ) 11 | ), 12 | data=dict( 13 | train=dict( 14 | type='NewPaviaLoader', 15 | params=dict( 16 | training=True, 17 | num_workers=0, 18 | image_mat_path='./pavia/PaviaU.mat', 19 | gt_mat_path='./pavia/PaviaU_gt.mat', 20 | num_train_samples_per_class=200, 21 | sub_minibatch=20 22 | ) 23 | ), 24 | test=dict( 25 | type='NewPaviaLoader', 26 | params=dict( 27 | training=False, 28 | num_workers=0, 29 | image_mat_path='./pavia/PaviaU.mat', 30 | gt_mat_path='./pavia/PaviaU_gt.mat', 31 | num_train_samples_per_class=200, 32 | sub_minibatch=20 33 | ) 34 | ) 35 | ), 36 | optimizer=dict( 37 | type='sgd', 38 | params=dict( 39 | momentum=0.9, 40 | weight_decay=0.001 41 | ) 42 | ), 43 | learning_rate=dict( 44 | type='poly', 45 | params=dict( 46 | base_lr=0.001, 47 | power=0.9, 48 | max_iters=1000), 49 | ), 50 | train=dict( 51 | forward_times=1, 52 | num_iters=1000, 53 | eval_per_epoch=True, 54 | summary_grads=False, 55 | summary_weights=False, 56 | eval_after_train=True, 57 | resume_from_last=False, 58 | ), 59 | test=dict( 60 | draw=dict( 61 | image_size=(610, 340), 62 | palette=[ 63 | 0, 0, 0, 64 | 192, 192, 192, 65 | 0, 255, 1, 66 | 0, 255, 255, 67 | 0, 128, 1, 68 | 255, 0, 254, 69 | 165, 82, 40, 70 | 129, 0, 127, 71 | 255, 0, 0, 72 | 255, 255, 0, ] 73 | ) 74 | ), 75 | ) 76 | -------------------------------------------------------------------------------- /configs/freenet/freenet_1_0_salinas.py: -------------------------------------------------------------------------------- 1 | config = dict( 2 | model=dict( 3 | type='FreeNet', 4 | params=dict( 5 | in_channels=204, 6 | num_classes=16, 7 | block_channels=(96, 128, 192, 256), 8 | inner_dim=128, 9 | reduction_ratio=1.0, 10 | ) 11 | ), 12 | data=dict( 13 | train=dict( 14 | type='NewSalinasLoader', 15 | params=dict( 16 | num_workers=0, 17 | image_mat_path='./salinas/Salinas_corrected.mat', 18 | gt_mat_path='./salinas/Salinas_gt.mat', 19 | training=True, 20 | num_train_samples_per_class=200, 21 | sub_minibatch=20 22 | ) 23 | ), 24 | test=dict( 25 | type='NewSalinasLoader', 26 | params=dict( 27 | num_workers=0, 28 | image_mat_path='./salinas/Salinas_corrected.mat', 29 | gt_mat_path='./salinas/Salinas_gt.mat', 30 | training=False, 31 | num_train_samples_per_class=200, 32 | sub_minibatch=20 33 | ) 34 | ) 35 | ), 36 | optimizer=dict( 37 | type='sgd', 38 | params=dict( 39 | momentum=0.9, 40 | weight_decay=0.001 41 | ) 42 | ), 43 | learning_rate=dict( 44 | type='poly', 45 | params=dict( 46 | base_lr=0.001, 47 | power=0.9, 48 | max_iters=1000), 49 | ), 50 | train=dict( 51 | forward_times=1, 52 | num_iters=1000, 53 | eval_per_epoch=True, 54 | summary_grads=False, 55 | summary_weights=False, 56 | eval_after_train=True, 57 | resume_from_last=False, 58 | ), 59 | test=dict( 60 | draw=dict( 61 | image_size=(610, 340), 62 | palette=[ 63 | 0, 0, 0, 64 | 192, 192, 192, 65 | 0, 255, 1, 66 | 0, 255, 255, 67 | 0, 128, 1, 68 | 255, 0, 254, 69 | 165, 82, 40, 70 | 129, 0, 127, 71 | 255, 0, 0, 72 | 255, 255, 0, ] 73 | ) 74 | ), 75 | ) 76 | -------------------------------------------------------------------------------- /data/__init__.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Z-Zheng/FreeNet/ac0f5a35262ec867529d279a6d9c53074348767b/data/__init__.py -------------------------------------------------------------------------------- /data/base.py: -------------------------------------------------------------------------------- 1 | from torch.utils.data import dataset 2 | import numpy as np 3 | from simplecv.data.preprocess import divisible_pad 4 | import torch 5 | from torch.utils import data 6 | 7 | SEED = 2333 8 | 9 | 10 | class FullImageDataset(dataset.Dataset): 11 | def __init__(self, 12 | image, 13 | mask, 14 | training, 15 | np_seed=2333, 16 | num_train_samples_per_class=200, 17 | sub_minibatch=10, 18 | ): 19 | self.image = image 20 | self.mask = mask 21 | self.training = training 22 | self.num_train_samples_per_class = num_train_samples_per_class 23 | self.sub_minibatch = sub_minibatch 24 | self._seed = np_seed 25 | self._rs = np.random.RandomState(np_seed) 26 | # set list lenght = 9999 to make sure seeds enough 27 | self.seeds_for_minibatchsample = [e for e in self._rs.randint(low=2 << 31 - 1, size=9999)] 28 | self.preset() 29 | 30 | def preset(self): 31 | train_indicator, test_indicator = fixed_num_sample(self.mask, self.num_train_samples_per_class, 32 | self.num_classes, self._seed) 33 | 34 | blob = divisible_pad([np.concatenate([self.image.transpose(2, 0, 1), 35 | self.mask[None, :, :], 36 | train_indicator[None, :, :], 37 | test_indicator[None, :, :]], axis=0)], 16, False) 38 | im = blob[0, :self.image.shape[-1], :, :] 39 | 40 | mask = blob[0, -3, :, :] 41 | self.train_indicator = blob[0, -2, :, :] 42 | self.test_indicator = blob[0, -1, :, :] 43 | 44 | if self.training: 45 | self.train_inds_list = minibatch_sample(mask, self.train_indicator, self.sub_minibatch, 46 | seed=self.seeds_for_minibatchsample.pop()) 47 | 48 | self.pad_im = im 49 | self.pad_mask = mask 50 | 51 | def resample_minibatch(self): 52 | self.train_inds_list = minibatch_sample(self.pad_mask, self.train_indicator, self.sub_minibatch, 53 | seed=self.seeds_for_minibatchsample.pop()) 54 | 55 | @property 56 | def num_classes(self): 57 | return 9 58 | 59 | def __getitem__(self, idx): 60 | 61 | if self.training: 62 | return self.pad_im, self.pad_mask, self.train_inds_list[idx] 63 | 64 | else: 65 | return self.pad_im, self.pad_mask, self.test_indicator 66 | 67 | def __len__(self): 68 | if self.training: 69 | return len(self.train_inds_list) 70 | else: 71 | return 1 72 | 73 | 74 | class MinibatchSampler(data.Sampler): 75 | def __init__(self, dataset: FullImageDataset): 76 | super(MinibatchSampler, self).__init__(None) 77 | self.dataset = dataset 78 | self.g = torch.Generator() 79 | self.g.manual_seed(SEED) 80 | 81 | def __iter__(self): 82 | self.dataset.resample_minibatch() 83 | n = len(self.dataset) 84 | return iter(torch.randperm(n, generator=self.g).tolist()) 85 | 86 | def __len__(self): 87 | return len(self.dataset) 88 | 89 | 90 | def fixed_num_sample(gt_mask: np.ndarray, num_train_samples, num_classes, seed=2333): 91 | """ 92 | 93 | Args: 94 | gt_mask: 2-D array of shape [height, width] 95 | num_train_samples: int 96 | num_classes: scalar 97 | seed: int 98 | 99 | Returns: 100 | train_indicator, test_indicator 101 | """ 102 | rs = np.random.RandomState(seed) 103 | 104 | gt_mask_flatten = gt_mask.ravel() 105 | train_indicator = np.zeros_like(gt_mask_flatten) 106 | test_indicator = np.zeros_like(gt_mask_flatten) 107 | for i in range(1, num_classes + 1): 108 | inds = np.where(gt_mask_flatten == i)[0] 109 | rs.shuffle(inds) 110 | 111 | train_inds = inds[:num_train_samples] 112 | test_inds = inds[num_train_samples:] 113 | 114 | train_indicator[train_inds] = 1 115 | test_indicator[test_inds] = 1 116 | 117 | train_indicator = train_indicator.reshape(gt_mask.shape) 118 | test_indicator = test_indicator.reshape(gt_mask.shape) 119 | 120 | return train_indicator, test_indicator 121 | 122 | 123 | def minibatch_sample(gt_mask: np.ndarray, train_indicator: np.ndarray, minibatch_size, seed): 124 | """ 125 | 126 | Args: 127 | gt_mask: 2-D array of shape [height, width] 128 | train_indicator: 2-D array of shape [height, width] 129 | minibatch_size: 130 | 131 | Returns: 132 | 133 | """ 134 | rs = np.random.RandomState(seed) 135 | # split into N classes 136 | cls_list = np.unique(gt_mask) 137 | inds_dict_per_class = dict() 138 | for cls in cls_list: 139 | train_inds_per_class = np.where(gt_mask == cls, train_indicator, np.zeros_like(train_indicator)) 140 | inds = np.where(train_inds_per_class.ravel() == 1)[0] 141 | rs.shuffle(inds) 142 | 143 | inds_dict_per_class[cls] = inds 144 | 145 | train_inds_list = [] 146 | cnt = 0 147 | while True: 148 | train_inds = np.zeros_like(train_indicator).ravel() 149 | for cls, inds in inds_dict_per_class.items(): 150 | left = cnt * minibatch_size 151 | if left >= len(inds): 152 | continue 153 | # remain last batch though the real size is smaller than minibatch_size 154 | right = min((cnt + 1) * minibatch_size, len(inds)) 155 | fetch_inds = inds[left:right] 156 | train_inds[fetch_inds] = 1 157 | cnt += 1 158 | if train_inds.sum() == 0: 159 | return train_inds_list 160 | train_inds_list.append(train_inds.reshape(train_indicator.shape)) 161 | -------------------------------------------------------------------------------- /data/dataloader.py: -------------------------------------------------------------------------------- 1 | from torch.utils.data.dataloader import DataLoader 2 | from simplecv import registry 3 | from data.pavia import NewPaviaDataset 4 | from data.base import MinibatchSampler 5 | from data.grss2013 import NewGRSS2013Dataset 6 | from data.salinas import NewSalinasDataset 7 | 8 | 9 | @registry.DATALOADER.register('NewPaviaLoader') 10 | class NewPaviaLoader(DataLoader): 11 | def __init__(self, config): 12 | self.config = dict() 13 | self.set_defalut() 14 | self.config.update(config) 15 | for k, v in self.config.items(): 16 | self.__dict__[k] = v 17 | 18 | dataset = NewPaviaDataset(self.image_mat_path, self.gt_mat_path, self.training, 19 | self.num_train_samples_per_class, self.sub_minibatch) 20 | sampler = MinibatchSampler(dataset) 21 | super(NewPaviaLoader, self).__init__(dataset, 22 | batch_size=1, 23 | shuffle=False, 24 | sampler=sampler, 25 | batch_sampler=None, 26 | num_workers=self.num_workers, 27 | pin_memory=True, 28 | drop_last=False, 29 | timeout=0, 30 | worker_init_fn=None) 31 | 32 | def set_defalut(self): 33 | self.config.update(dict( 34 | num_workers=0, 35 | image_mat_path='', 36 | gt_mat_path='', 37 | training=True, 38 | num_train_samples_per_class=200, 39 | # mini-batch per class, if there are 10 categories, the total mini-batch is sub_minibatch * num_classes (10) 40 | sub_minibatch=10 41 | )) 42 | 43 | 44 | @registry.DATALOADER.register('NewSalinasLoader') 45 | class NewSalinasLoader(DataLoader): 46 | def __init__(self, config): 47 | self.config = dict() 48 | self.set_defalut() 49 | self.config.update(config) 50 | for k, v in self.config.items(): 51 | self.__dict__[k] = v 52 | 53 | dataset = NewSalinasDataset(self.image_mat_path, self.gt_mat_path, self.training, 54 | self.num_train_samples_per_class, self.sub_minibatch) 55 | sampler = MinibatchSampler(dataset) 56 | super(NewSalinasLoader, self).__init__(dataset, 57 | batch_size=1, 58 | shuffle=False, 59 | sampler=sampler, 60 | batch_sampler=None, 61 | num_workers=self.num_workers, 62 | pin_memory=True, 63 | drop_last=False, 64 | timeout=0, 65 | worker_init_fn=None) 66 | 67 | def set_defalut(self): 68 | self.config.update(dict( 69 | num_workers=0, 70 | image_mat_path='', 71 | gt_mat_path='', 72 | training=True, 73 | num_train_samples_per_class=200, 74 | # mini-batch per class, if there are 10 categories, the total mini-batch is sub_minibatch * num_classes (10) 75 | sub_minibatch=10 76 | )) 77 | 78 | 79 | @registry.DATALOADER.register('NewGRSS2013Loader') 80 | class NewGRSS2013Loader(DataLoader): 81 | def __init__(self, config): 82 | self.config = dict() 83 | self.set_defalut() 84 | self.config.update(config) 85 | for k, v in self.config.items(): 86 | self.__dict__[k] = v 87 | 88 | dataset = NewGRSS2013Dataset(self.image_path, self.gt_path, self.training, self.sub_minibatch) 89 | sampler = MinibatchSampler(dataset) 90 | super(NewGRSS2013Loader, self).__init__(dataset, 91 | batch_size=1, 92 | shuffle=False, 93 | sampler=sampler, 94 | batch_sampler=None, 95 | num_workers=self.num_workers, 96 | pin_memory=True, 97 | drop_last=False, 98 | timeout=0, 99 | worker_init_fn=None) 100 | 101 | def set_defalut(self): 102 | self.config.update(dict( 103 | num_workers=0, 104 | image_path='', 105 | gt_path='', 106 | training=True, 107 | # mini-batch per class, if there are 10 categories, the total mini-batch is sub_minibatch * num_classes (10) 108 | sub_minibatch=10 109 | )) 110 | -------------------------------------------------------------------------------- /data/grss2013.py: -------------------------------------------------------------------------------- 1 | from simplecv.data import preprocess 2 | import numpy as np 3 | from data.base import FullImageDataset 4 | import tifffile 5 | from data.base import minibatch_sample 6 | from simplecv.data.preprocess import divisible_pad 7 | 8 | SEED = 2333 9 | 10 | 11 | class NewGRSS2013Dataset(FullImageDataset): 12 | def __init__(self, 13 | image_path, 14 | gt_path, 15 | training=True, 16 | sub_minibatch=10): 17 | self.im_mat_path = image_path 18 | self.gt_mat_path = gt_path 19 | 20 | image = tifffile.imread(image_path) 21 | mask = tifffile.imread(gt_path) 22 | 23 | im_cmean = image.reshape((-1, image.shape[-1])).mean(axis=0) 24 | im_cstd = image.reshape((-1, image.shape[-1])).std(axis=0) 25 | self.vanilla_image = image 26 | image = preprocess.mean_std_normalize(image, im_cmean, im_cstd) 27 | self.training = training 28 | self.sub_minibatch = sub_minibatch 29 | super(NewGRSS2013Dataset, self).__init__(image, mask, training, np_seed=SEED, 30 | num_train_samples_per_class=None, 31 | sub_minibatch=sub_minibatch) 32 | 33 | def preset(self): 34 | indicator = np.where(self.mask != 0, np.ones_like(self.mask), np.zeros_like(self.mask)) 35 | 36 | blob = divisible_pad([np.concatenate([self.image.transpose(2, 0, 1), 37 | self.mask[None, :, :], 38 | indicator[None, :, :]], axis=0)], 16, False) 39 | im = blob[0, :self.image.shape[-1], :, :] 40 | 41 | mask = blob[0, -2, :, :] 42 | self.indicator = blob[0, -1, :, :] 43 | 44 | if self.training: 45 | self.train_inds_list = minibatch_sample(mask, self.indicator, self.sub_minibatch, 46 | seed=self.seeds_for_minibatchsample.pop()) 47 | 48 | self.pad_im = im 49 | self.pad_mask = mask 50 | 51 | def resample_minibatch(self): 52 | self.train_inds_list = minibatch_sample(self.pad_mask, self.indicator, self.sub_minibatch, 53 | seed=self.seeds_for_minibatchsample.pop()) 54 | 55 | @property 56 | def num_classes(self): 57 | return 15 58 | 59 | def __getitem__(self, idx): 60 | 61 | if self.training: 62 | return self.pad_im, self.pad_mask, self.train_inds_list[idx] 63 | 64 | else: 65 | return self.pad_im, self.pad_mask, self.indicator 66 | 67 | def __len__(self): 68 | if self.training: 69 | return len(self.train_inds_list) 70 | else: 71 | return 1 72 | -------------------------------------------------------------------------------- /data/pavia.py: -------------------------------------------------------------------------------- 1 | from scipy.io import loadmat 2 | from simplecv.data import preprocess 3 | 4 | from data.base import FullImageDataset 5 | 6 | SEED = 2333 7 | 8 | 9 | class NewPaviaDataset(FullImageDataset): 10 | def __init__(self, 11 | image_mat_path, 12 | gt_mat_path, 13 | training=True, 14 | num_train_samples_per_class=200, 15 | sub_minibatch=10): 16 | self.im_mat_path = image_mat_path 17 | self.gt_mat_path = gt_mat_path 18 | 19 | im_mat = loadmat(image_mat_path) 20 | image = im_mat['paviaU'] 21 | gt_mat = loadmat(gt_mat_path) 22 | mask = gt_mat['paviaU_gt'] 23 | 24 | im_cmean = image.reshape((-1, image.shape[-1])).mean(axis=0) 25 | im_cstd = image.reshape((-1, image.shape[-1])).std(axis=0) 26 | self.vanilla_image = image 27 | image = preprocess.mean_std_normalize(image, im_cmean, im_cstd) 28 | self.training = training 29 | self.num_train_samples_per_class = num_train_samples_per_class 30 | self.sub_minibatch = sub_minibatch 31 | super(NewPaviaDataset, self).__init__(image, mask, training, np_seed=SEED, 32 | num_train_samples_per_class=num_train_samples_per_class, 33 | sub_minibatch=sub_minibatch) 34 | -------------------------------------------------------------------------------- /data/salinas.py: -------------------------------------------------------------------------------- 1 | from scipy.io import loadmat 2 | from simplecv.data import preprocess 3 | 4 | from data.base import FullImageDataset 5 | 6 | SEED = 2333 7 | 8 | 9 | class NewSalinasDataset(FullImageDataset): 10 | def __init__(self, 11 | image_mat_path, 12 | gt_mat_path, 13 | training=True, 14 | num_train_samples_per_class=200, 15 | sub_minibatch=10): 16 | self.im_mat_path = image_mat_path 17 | self.gt_mat_path = gt_mat_path 18 | 19 | im_mat = loadmat(image_mat_path) 20 | image = im_mat['salinas_corrected'] 21 | gt_mat = loadmat(gt_mat_path) 22 | mask = gt_mat['salinas_gt'] 23 | 24 | im_cmean = image.reshape((-1, image.shape[-1])).mean(axis=0) 25 | im_cstd = image.reshape((-1, image.shape[-1])).std(axis=0) 26 | self.vanilla_image = image 27 | image = preprocess.mean_std_normalize(image, im_cmean, im_cstd) 28 | self.training = training 29 | self.num_train_samples_per_class = num_train_samples_per_class 30 | self.sub_minibatch = sub_minibatch 31 | super(NewSalinasDataset, self).__init__(image, mask, training, np_seed=SEED, 32 | num_train_samples_per_class=num_train_samples_per_class, 33 | sub_minibatch=sub_minibatch) 34 | 35 | @property 36 | def num_classes(self): 37 | return 16 38 | -------------------------------------------------------------------------------- /module/__init__.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Z-Zheng/FreeNet/ac0f5a35262ec867529d279a6d9c53074348767b/module/__init__.py -------------------------------------------------------------------------------- /module/freenet.py: -------------------------------------------------------------------------------- 1 | import torch.nn as nn 2 | import torch.nn.functional as F 3 | from simplecv.interface import CVModule 4 | from simplecv.module import SEBlock 5 | from simplecv import registry 6 | import torch 7 | import math 8 | 9 | 10 | def conv3x3_gn_relu(in_channel, out_channel, num_group): 11 | return nn.Sequential( 12 | nn.Conv2d(in_channel, out_channel, 3, 1, 1), 13 | nn.GroupNorm(num_group, out_channel), 14 | nn.ReLU(inplace=True), 15 | ) 16 | 17 | 18 | def downsample2x(in_channel, out_channel): 19 | return nn.Sequential( 20 | nn.Conv2d(in_channel, out_channel, 3, 2, 1), 21 | nn.ReLU(inplace=True) 22 | ) 23 | 24 | 25 | def repeat_block(block_channel, r, n): 26 | layers = [ 27 | nn.Sequential( 28 | SEBlock(block_channel, r), 29 | conv3x3_gn_relu(block_channel, block_channel, r) 30 | ) 31 | for _ in range(n)] 32 | return nn.Sequential(*layers) 33 | 34 | 35 | @registry.MODEL.register('FreeNet') 36 | class FreeNet(CVModule): 37 | def __init__(self, config): 38 | super(FreeNet, self).__init__(config) 39 | r = int(16 * self.config.reduction_ratio) 40 | block1_channels = int(self.config.block_channels[0] * self.config.reduction_ratio / r) * r 41 | block2_channels = int(self.config.block_channels[1] * self.config.reduction_ratio / r) * r 42 | block3_channels = int(self.config.block_channels[2] * self.config.reduction_ratio / r) * r 43 | block4_channels = int(self.config.block_channels[3] * self.config.reduction_ratio / r) * r 44 | 45 | self.feature_ops = nn.ModuleList([ 46 | conv3x3_gn_relu(self.config.in_channels, block1_channels, r), 47 | 48 | repeat_block(block1_channels, r, self.config.num_blocks[0]), 49 | nn.Identity(), 50 | downsample2x(block1_channels, block2_channels), 51 | 52 | repeat_block(block2_channels, r, self.config.num_blocks[1]), 53 | nn.Identity(), 54 | downsample2x(block2_channels, block3_channels), 55 | 56 | repeat_block(block3_channels, r, self.config.num_blocks[2]), 57 | nn.Identity(), 58 | downsample2x(block3_channels, block4_channels), 59 | 60 | repeat_block(block4_channels, r, self.config.num_blocks[3]), 61 | nn.Identity(), 62 | ]) 63 | inner_dim = int(self.config.inner_dim * self.config.reduction_ratio) 64 | self.reduce_1x1convs = nn.ModuleList([ 65 | nn.Conv2d(block1_channels, inner_dim, 1), 66 | nn.Conv2d(block2_channels, inner_dim, 1), 67 | nn.Conv2d(block3_channels, inner_dim, 1), 68 | nn.Conv2d(block4_channels, inner_dim, 1), 69 | ]) 70 | self.fuse_3x3convs = nn.ModuleList([ 71 | nn.Conv2d(inner_dim, inner_dim, 3, 1, 1), 72 | nn.Conv2d(inner_dim, inner_dim, 3, 1, 1), 73 | nn.Conv2d(inner_dim, inner_dim, 3, 1, 1), 74 | nn.Conv2d(inner_dim, inner_dim, 3, 1, 1), 75 | ]) 76 | self.cls_pred_conv = nn.Conv2d(inner_dim, self.config.num_classes, 1) 77 | 78 | def top_down(self, top, lateral): 79 | top2x = F.interpolate(top, scale_factor=2.0, mode='nearest') 80 | return lateral + top2x 81 | 82 | def forward(self, x, y=None, w=None, **kwargs): 83 | feat_list = [] 84 | for op in self.feature_ops: 85 | x = op(x) 86 | if isinstance(op, nn.Identity): 87 | feat_list.append(x) 88 | 89 | inner_feat_list = [self.reduce_1x1convs[i](feat) for i, feat in enumerate(feat_list)] 90 | inner_feat_list.reverse() 91 | 92 | out_feat_list = [self.fuse_3x3convs[0](inner_feat_list[0])] 93 | for i in range(len(inner_feat_list) - 1): 94 | inner = self.top_down(out_feat_list[i], inner_feat_list[i + 1]) 95 | out = self.fuse_3x3convs[i + 1](inner) 96 | out_feat_list.append(out) 97 | 98 | final_feat = out_feat_list[-1] 99 | 100 | logit = self.cls_pred_conv(final_feat) 101 | if self.training: 102 | loss_dict = { 103 | 'cls_loss': self.loss(logit, y, w) 104 | } 105 | return loss_dict 106 | 107 | return torch.softmax(logit, dim=1) 108 | 109 | def loss(self, x, y, weight): 110 | losses = F.cross_entropy(x, y.long() - 1, weight=None, 111 | ignore_index=-1, reduction='none') 112 | 113 | v = losses.mul_(weight).sum() / weight.sum() 114 | return v 115 | 116 | def set_defalut_config(self): 117 | self.config.update(dict( 118 | in_channels=204, 119 | num_classes=16, 120 | block_channels=(96, 128, 192, 256), 121 | num_blocks=(1, 1, 1, 1), 122 | inner_dim=128, 123 | reduction_ratio=1.0, 124 | )) 125 | -------------------------------------------------------------------------------- /scripts/freenet_1_0_grss.sh: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env bash 2 | 3 | export CUDA_VISIBLE_DEVICES=0 4 | export PYTHONPATH=${PYTHONPATH}:`pwd` 5 | config_path='freenet.freenet_1_0_grss2013' 6 | 7 | model_dir='./log/grss2013/freenet/1.0_poly' 8 | 9 | 10 | python train.py \ 11 | --config_path=${config_path} \ 12 | --model_dir=${model_dir} \ 13 | train.save_ckpt_interval_epoch 9999 -------------------------------------------------------------------------------- /scripts/freenet_1_0_pavia.sh: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env bash 2 | 3 | export CUDA_VISIBLE_DEVICES=0 4 | export PYTHONPATH=${PYTHONPATH}:`pwd` 5 | config_path='freenet.freenet_1_0_pavia' 6 | 7 | model_dir='./log/pavia/freenet/1.0_poly' 8 | 9 | 10 | python train.py \ 11 | --config_path=${config_path} \ 12 | --model_dir=${model_dir} \ 13 | train.save_ckpt_interval_epoch 9999 -------------------------------------------------------------------------------- /scripts/freenet_1_0_salinas.sh: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env bash 2 | 3 | export CUDA_VISIBLE_DEVICES=0 4 | export PYTHONPATH=${PYTHONPATH}:`pwd` 5 | config_path='freenet.freenet_1_0_salinas' 6 | 7 | model_dir='./log/salinas/freenet/1.0_poly' 8 | 9 | 10 | python train.py \ 11 | --config_path=${config_path} \ 12 | --model_dir=${model_dir} \ 13 | train.save_ckpt_interval_epoch 9999 -------------------------------------------------------------------------------- /train.py: -------------------------------------------------------------------------------- 1 | from simplecv import dp_train as train 2 | import torch 3 | from simplecv.util.logger import eval_progress, speed 4 | import time 5 | from module import freenet 6 | from simplecv.util import metric 7 | from data import dataloader 8 | 9 | 10 | def fcn_evaluate_fn(self, test_dataloader, config): 11 | if self.checkpoint.global_step < 0: 12 | return 13 | self._model.eval() 14 | total_time = 0. 15 | with torch.no_grad(): 16 | for idx, (im, mask, w) in enumerate(test_dataloader): 17 | start = time.time() 18 | y_pred = self._model(im).squeeze() 19 | torch.cuda.synchronize() 20 | time_cost = round(time.time() - start, 3) 21 | y_pred = y_pred.argmax(dim=0).cpu() + 1 22 | w.unsqueeze_(dim=0) 23 | 24 | w = w.byte() 25 | mask = torch.masked_select(mask.view(-1), w.view(-1)) 26 | y_pred = torch.masked_select(y_pred.view(-1), w.view(-1)) 27 | 28 | oa = metric.th_overall_accuracy_score(mask.view(-1), y_pred.view(-1)) 29 | aa, acc_per_class = metric.th_average_accuracy_score(mask.view(-1), y_pred.view(-1), 30 | self._model.module.config.num_classes, 31 | return_accuracys=True) 32 | kappa = metric.th_cohen_kappa_score(mask.view(-1), y_pred.view(-1), self._model.module.config.num_classes) 33 | total_time += time_cost 34 | speed(self._logger, time_cost, 'im') 35 | 36 | eval_progress(self._logger, idx + 1, len(test_dataloader)) 37 | 38 | speed(self._logger, round(total_time / len(test_dataloader), 3), 'batched im (avg)') 39 | 40 | metric_dict = { 41 | 'OA': oa.item(), 42 | 'AA': aa.item(), 43 | 'Kappa': kappa.item() 44 | } 45 | for i, acc in enumerate(acc_per_class): 46 | metric_dict['acc_{}'.format(i + 1)] = acc.item() 47 | self._logger.eval_log(metric_dict=metric_dict, step=self.checkpoint.global_step) 48 | 49 | 50 | def register_evaluate_fn(launcher): 51 | launcher.override_evaluate(fcn_evaluate_fn) 52 | 53 | 54 | if __name__ == '__main__': 55 | torch.backends.cudnn.benchmark = True 56 | args = train.parser.parse_args() 57 | SEED = 2333 58 | torch.manual_seed(SEED) 59 | torch.cuda.manual_seed(SEED) 60 | train.run(config_path=args.config_path, 61 | model_dir=args.model_dir, 62 | cpu_mode=args.cpu, 63 | after_construct_launcher_callbacks=[register_evaluate_fn], 64 | opts=args.opts) 65 | --------------------------------------------------------------------------------