GuitarLSTM

Deep learning models for guitar amp/pedal emulation using LSTM with Keras
Log | Files | Refs | README

commit 31b247704ec9b04cb2b3eda2ca92896cf66bb8ce
Author: Keith <kbloemer@aegistg.com>
Date:   Fri,  4 Dec 2020 11:14:19 -0600

first commit

Diffstat:
ALICENSE.txt | 674+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
AReadMe.txt | 76++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Adata/ts9_test1_in_FP32.wav | 0
Adata/ts9_test1_out_FP32.wav | 0
Afigures/signal_chain_amp.png | 0
Afigures/signal_chain_pedal.png | 0
Aguitar_lstm_colab.ipynb | 225+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Amodels/ts9_model.h5 | 0
Aplot.py | 159+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Apredict.py | 76++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
Atrain.py | 175+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
11 files changed, 1385 insertions(+), 0 deletions(-)

diff --git a/LICENSE.txt b/LICENSE.txt @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/> + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + <one line to give the program's name and a brief idea of what it does.> + Copyright (C) <year> <name of author> + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see <https://www.gnu.org/licenses/>. + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + <program> Copyright (C) <year> <name of author> + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +<https://www.gnu.org/licenses/>. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +<https://www.gnu.org/licenses/why-not-lgpl.html>. diff --git a/ReadMe.txt b/ReadMe.txt @@ -0,0 +1,75 @@ +# GuitarLSTM + +GuitarLSTM trains guitar effect/amp neural network models for processing +on wav data. In comparison to the WaveNet model from PedalNetRT, this +implementation is much faster and better suited for copying the sound +of guitar amps and pedals. + + +## Info +Re-creation of LSTM model from [Real-Time Guitar Amplifier Emulation with Deep +Learning](https://www.mdpi.com/2076-3417/10/3/766/htm) + + +For a great explanation of how LSTMs works, check out this blog post:<br> +https://colah.github.io/posts/2015-08-Understanding-LSTMs/ + + +## Data + +`data/ts9_test1_in_FP32.wav` - Playing from a Fender Telecaster, bridge pickup, max tone and volume<br> +`data/ts9_test1_out_FP32.wav` - Split with JHS Buffer Splitter to Ibanez TS9 Tube Screamer +(max drive, mid tone and volume).<br> +`models/ts9_model.h5` - Pretrained model weights + + +## Usage + +**Run effect on .wav file**: +Must be single channel, 44.1 kHz, FP32 wav data (not int16) +```bash +# This will preprocess the input data, perform training, and generate test wavs and analysis plots. +# Output will be saved to "models/out_model_name" folder. +python train.py data\ts9_test1_in_FP32.wav data\ts9_test1_out_FP32.wav out_model_name + +# Run prediction on target wav file +# Specify input file, desired output file, and model path +predict.py data\ts9_test1_in_FP32.wav output models\ts9_model.h5 +``` + + +## Training Info + +Helpful tips on training models: +1. Wav files should be 3 - 4 minutes long, and contain a variety of + chords, individual notes, and playing techniques to get a full spectrum + of data for the model to "learn" from. +2. A buffer splitter was used with pedals to obtain a pure guitar signal + and post effect signal. +3. Obtaining sample data from an amp can be done by splitting off the original + signal, with the post amp signal coming from a microphone (I used a SM57). + Keep in mind that this captures the dynamic response of the mic and cabinet. + In the original research the sound was captured directly from within the amp + circuit to have a "pure" amp signal. +4. Generally speaking, the more distorted the effect/amp, the more difficult it + is to train. +5. Requires float32 .wav files for training (as opposed to int16). + + +## Future Work + +A real time implementation for use in a guitar plugin is +currenty in work. This would theoretically perform much faster +(less cpu usage) than the previous WaveNet model. If you want to +use deep learning models through a real time guitar plugin, +reference the following repositories: + +PedalNetRT<br> +https://github.com/GuitarML/PedalNetRT<br> + +SmartGuitarAmp<br> +https://github.com/GuitarML/SmartGuitarAmp<br> + + +Note: See Google Colab notebook (guitar_lstm_colab.ipynb) for training + GuitarLSTM models in the cloud. See notebook comments for instructions. +\ No newline at end of file diff --git a/data/ts9_test1_in_FP32.wav b/data/ts9_test1_in_FP32.wav Binary files differ. diff --git a/data/ts9_test1_out_FP32.wav b/data/ts9_test1_out_FP32.wav Binary files differ. diff --git a/figures/signal_chain_amp.png b/figures/signal_chain_amp.png Binary files differ. diff --git a/figures/signal_chain_pedal.png b/figures/signal_chain_pedal.png Binary files differ. diff --git a/guitar_lstm_colab.ipynb b/guitar_lstm_colab.ipynb @@ -0,0 +1,224 @@ +{ + "nbformat": 4, + "nbformat_minor": 0, + "metadata": { + "colab": { + "name": "guitar_lstm_colab.ipynb", + "provenance": [], + "collapsed_sections": [] + }, + "kernelspec": { + "name": "python3", + "display_name": "Python 3" + }, + "accelerator": "GPU" + }, + "cells": [ + { + "cell_type": "code", + "metadata": { + "id": "RF2uyPfxgi8H" + }, + "source": [ + "# TO USE: \n", + "# 1. Upload your input and output wav files to the current directory in Colab\n", + "# 2. Edit the USER INPUTS section to point to your wav files, and choose a\n", + "# model name, and number of epochs for training. If you experience \n", + "# crashing due to low RAM, reduce the \"input_size\" parameter.\n", + "# 3. Run each section of code. The trained models and output wav files will be \n", + "# added to the \"models\" directory.\n", + "#\n", + "# Note: Tested on CPU and GPU runtimes.\n", + "\n", + "import tensorflow as tf\n", + "from tensorflow.keras import Sequential\n", + "from tensorflow.keras.layers import LSTM, Conv1D, Dense\n", + "from tensorflow.keras.optimizers import Adam\n", + "from tensorflow.keras.backend import clear_session\n", + "from tensorflow.keras.activations import tanh, elu, relu\n", + "from tensorflow.keras.models import load_model\n", + "import tensorflow.keras.backend as K\n", + "from tensorflow.keras.utils import Sequence\n", + "\n", + "import os\n", + "from scipy import signal\n", + "from scipy.io import wavfile\n", + "import numpy as np\n", + "import matplotlib.pyplot as plt\n", + "import math\n", + "import h5py\n", + "\n" + ], + "execution_count": null, + "outputs": [] + }, + { + "cell_type": "code", + "metadata": { + "id": "U22mDBe4jaf2" + }, + "source": [ + "# EDIT THIS SECTION FOR USER INPUTS\n", + "#\n", + "name = 'test'\n", + "in_file = 'ts9_test1_in_FP32.wav'\n", + "out_file = 'ts9_test1_out_FP32.wav'\n", + "epochs = 1\n", + "\n", + "\n", + "train_mode = 0 # 0 = speed training, \n", + " # 1 = accuracy training \n", + " # 2 = extended training\n", + "\n", + "input_size = 75 # !!!IMPORTANT !!!: The input_size is set at 75 for Colab notebook. \n", + " # a higher setting may result in crashing due to\n", + " # memory limitation of 8GB for the free version\n", + " # of Colab. This setting limits the accuracy of\n", + " # the training, especially for complex guitar signals\n", + " # such as high distortion.\n", + " # \n", + " # !!!IMPORTANT!!!: You will most likely need to cycle the runtime to \n", + " # free up RAM between training sessions.\n", + " #\n", + " # Future dev note: Using a custom dataloader may be a good\n", + " # workaround for this limitation, at the cost\n", + " # of slower training.\n", + "\n", + "if not os.path.exists('models/'+name):\n", + " os.makedirs('models/'+name)\n", + "else:\n", + " print(\"A model with the same name already exists. Please choose a new name.\")\n", + " exit\n" + ], + "execution_count": null, + "outputs": [] + }, + { + "cell_type": "code", + "metadata": { + "id": "WqI-cGt1jaG2" + }, + "source": [ + "\n", + "def pre_emphasis_filter(x, coeff=0.95):\n", + " return tf.concat([x, x - coeff * x], 1)\n", + " \n", + "def error_to_signal(y_true, y_pred): \n", + " \"\"\"\n", + " Error to signal ratio with pre-emphasis filter:\n", + " \"\"\"\n", + " y_true, y_pred = pre_emphasis_filter(y_true), pre_emphasis_filter(y_pred)\n", + " return K.sum(tf.pow(y_true - y_pred, 2), axis=0) / K.sum(tf.pow(y_true, 2), axis=0) + 1e-10\n", + " \n", + "def save_wav(name, data):\n", + " wavfile.write(name, 44100, data.flatten().astype(np.float32))\n", + "\n", + "def normalize(data):\n", + " data_max = max(data)\n", + " data_min = min(data)\n", + " data_norm = max(data_max,abs(data_min))\n", + " return data / data_norm\n", + "\n", + "\n", + "'''This is a similar Tensorflow/Keras implementation of the LSTM model from the paper:\n", + " \"Real-Time Guitar Amplifier Emulation with Deep Learning\"\n", + " https://www.mdpi.com/2076-3417/10/3/766/htm\n", + "\n", + " Uses a stack of two 1-D Convolutional layers, followed by LSTM, followed by \n", + " a Dense (fully connected) layer. Three preset training modes are available, \n", + " with further customization by editing the code. A Sequential tf.keras model \n", + " is implemented here.\n", + "\n", + " Note: RAM may be a limiting factor for the parameter \"input_size\". The wav data\n", + " is preprocessed and stored in RAM, which improves training speed but quickly runs out\n", + " if using a large number for \"input_size\". Reduce this if you are experiencing\n", + " RAM issues. \n", + " \n", + " --training_mode=0 Speed training (default)\n", + " --training_mode=1 Accuracy training\n", + " --training_mode=2 Extended training (set max_epochs as desired, for example 50+)\n", + "'''\n", + "\n", + "batch_size = 4096 \n", + "test_size = 0.2\n", + "\n", + "if train_mode == 0: # Speed Training\n", + " learning_rate = 0.01 \n", + " conv1d_strides = 12 \n", + " conv1d_filters = 16\n", + " hidden_units = 36\n", + "elif train_mode == 1: # Accuracy Training (~10x longer than Speed Training)\n", + " learning_rate = 0.01 \n", + " conv1d_strides = 4\n", + " conv1d_filters = 36\n", + " hidden_units= 64\n", + "else: # Extended Training (~60x longer than Accuracy Training)\n", + " learning_rate = 0.0005 \n", + " conv1d_strides = 3\n", + " conv1d_filters = 36\n", + " hidden_units= 96\n", + "\n", + "\n", + "# Load and Preprocess Data ###########################################\n", + "in_rate, in_data = wavfile.read(in_file)\n", + "out_rate, out_data = wavfile.read(out_file)\n", + "\n", + "X = in_data.astype(np.float32).flatten() \n", + "X = normalize(X).reshape(len(X),1) \n", + "y = out_data.astype(np.float32).flatten() \n", + "y = normalize(y).reshape(len(y),1) \n", + "\n", + "y_ordered = y[input_size-1:] \n", + "\n", + "indices = np.arange(input_size) + np.arange(len(X)-input_size+1)[:,np.newaxis] \n", + "X_ordered = tf.gather(X,indices) \n", + "\n", + "shuffled_indices = np.random.permutation(len(X_ordered)) \n", + "X_random = tf.gather(X_ordered,shuffled_indices)\n", + "y_random = tf.gather(y_ordered, shuffled_indices)\n", + "\n", + "# Create Sequential Model ###########################################\n", + "clear_session()\n", + "model = Sequential()\n", + "model.add(Conv1D(conv1d_filters, 12,strides=conv1d_strides, activation=None, padding='same',input_shape=(input_size,1)))\n", + "model.add(Conv1D(conv1d_filters, 12,strides=conv1d_strides, activation=None, padding='same'))\n", + "model.add(LSTM(hidden_units))\n", + "model.add(Dense(1, activation=None))\n", + "model.compile(optimizer=Adam(learning_rate=learning_rate), loss=error_to_signal, metrics=[error_to_signal])\n", + "print(model.summary())\n", + "\n", + "# Train Model ###################################################\n", + "model.fit(X_random,y_random, epochs=epochs, batch_size=batch_size, validation_split=test_size) \n", + "\n", + "model.save('models/'+name+'/'+name+'.h5')\n", + "\n", + "#model.save('model_data/')\n", + "#model = load_model('new_model_'+name+'.h5', custom_objects={'error_to_signal' : error_to_signal})\n", + "#learning_rate = 0.005\n", + "#model.compile(optimizer=Adam(learning_rate=learning_rate), loss=error_to_signal, metrics=[error_to_signal])\n", + "\n", + "# Run Prediction #################################################\n", + "print(\"Running prediction..\")\n", + "y_the_rest, y_last_part = np.split(y_ordered, [int(len(y_ordered)*.8)])\n", + "x_the_rest, x_last_part = np.split(X, [int(len(X)*.8)])\n", + "\n", + "x_the_rest, x_ordered_last_part = np.split(X_ordered, [int(len(X_ordered)*.8)])\n", + "prediction = model.predict(x_ordered_last_part, batch_size=batch_size)\n", + "\n", + "save_wav('models/'+name+'/y_pred.wav', prediction)\n", + "save_wav('models/'+name+'/x_test.wav', x_last_part)\n", + "save_wav('models/'+name+'/y_test.wav', y_last_part)\n", + "\n", + "# Add additional data to the saved model (like input_size)\n", + "filename = 'models/'+name+'/'+name+'.h5'\n", + "f = h5py.File(filename, 'a')\n", + "grp = f.create_group(\"info\")\n", + "dset = grp.create_dataset(\"input_size\", (1,), dtype='int16')\n", + "dset[0] = input_size\n", + "f.close()" + ], + "execution_count": null, + "outputs": [] + } + ] +} +\ No newline at end of file diff --git a/models/ts9_model.h5 b/models/ts9_model.h5 Binary files differ. diff --git a/plot.py b/plot.py @@ -0,0 +1,159 @@ +import matplotlib.pyplot as plt +import numpy as np + +# import wave +from scipy.io import wavfile +import sys +from scipy import signal +import argparse + +import struct + + +def error_to_signal(y, y_pred, use_filter=1): + """ + Error to signal ratio with pre-emphasis filter: + https://www.mdpi.com/2076-3417/10/3/766/htm + """ + if use_filter == 1: + y, y_pred = pre_emphasis_filter(y), pre_emphasis_filter(y_pred) + return np.sum(np.power(y - y_pred, 2)) / (np.sum(np.power(y, 2) + 1e-10)) + + +def pre_emphasis_filter(x, coeff=0.95): + return np.concatenate([x, np.subtract(x, np.multiply(x, coeff))]) + + +def read_wave(wav_file): + # Extract Audio and framerate from Wav File + fs, signal = wavfile.read(wav_file) + return signal, fs + + +def analyze_pred_vs_actual(args): + """Generate plots to analyze the predicted signal vs the actual + signal. + + Inputs: + output_wav : The actual signal, by default will use y_test.wav from the test.py output + pred_wav : The predicted signal, by default will use y_pred.wav from the test.py output + input_wav : The pre effect signal, by default will use x_test.wav from the test.py output + model_name : Used to add the model name to the plot .png filename + path : The save path for generated .png figures + show_plots : Default is 1 to show plots, 0 to only generate .png files and suppress plots + + 1. Plots the two signals + 2. Calculates Error to signal ratio the same way Pedalnet evauluates the model for training + 3. Plots the absolute value of pred_signal - actual_signal (to visualize abs error over time) + 4. Plots the spectrogram of (pred_signal - actual signal) + The idea here is to show problem frequencies from the model training + """ + try: + output_wav = args.path + '/' + args.output_wav + pred_wav = args.path + '/' + args.pred_wav + input_wav = args.path + '/' + args.input_wav + model_name = args.model_name + show_plots = args.show_plots + path = args.path + except: + output_wav = args['output_wav'] + pred_wav = args['pred_wav'] + input_wav = args['input_wav'] + model_name = args['model_name'] + show_plots = args['show_plots'] + path = args['path'] + + # Read the input wav file + signal3, fs3 = read_wave(input_wav) + + # Read the output wav file + signal1, fs = read_wave(output_wav) + + Time = np.linspace(0, len(signal1) / fs, num=len(signal1)) + fig, (ax3, ax1, ax2) = plt.subplots(3, sharex=True, figsize=(13, 8)) + fig.suptitle("Predicted vs Actual Signal") + ax1.plot(Time, signal1, label=output_wav, color="red") + + # Read the predicted wav file + signal2, fs2 = read_wave(pred_wav) + + Time2 = np.linspace(0, len(signal2) / fs2, num=len(signal2)) + ax1.plot(Time2, signal2, label=pred_wav, color="green") + ax1.legend(loc="upper right") + ax1.set_xlabel("Time (s)") + ax1.set_ylabel("Amplitude") + ax1.set_title("Wav File Comparison") + ax1.grid("on") + + error_list = [] + for s1, s2 in zip(signal1, signal2): + error_list.append(abs(s2 - s1)) + + # Calculate error to signal ratio with pre-emphasis filter as + # used to train the model + e2s = error_to_signal(signal1, signal2) + e2s_no_filter = error_to_signal(signal1, signal2, use_filter=0) + print("Error to signal (with pre-emphasis filter): ", e2s) + print("Error to signal (no pre-emphasis filter): ", e2s_no_filter) + fig.suptitle("Predicted vs Actual Signal (error to signal: " + str(round(e2s, 4)) + ")") + # Plot signal difference + signal_diff = signal2 - signal1 + ax2.plot(Time2, error_list, label="signal diff", color="blue") + ax2.set_xlabel("Time (s)") + ax2.set_ylabel("Amplitude") + ax2.set_title("abs(pred_signal-actual_signal)") + ax2.grid("on") + + # Plot the original signal + Time3 = np.linspace(0, len(signal3) / fs3, num=len(signal3)) + ax3.plot(Time3, signal3, label=input_wav, color="purple") + ax3.legend(loc="upper right") + ax3.set_xlabel("Time (s)") + ax3.set_ylabel("Amplitude") + ax3.set_title("Original Input") + ax3.grid("on") + + # Save the plot + plt.savefig(path+'/'+model_name + "_signal_comparison_e2s_" + str(round(e2s, 4)) + ".png", bbox_inches="tight") + + # Create a zoomed in plot of 0.01 seconds centered at the max input signal value + sig_temp = signal1.tolist() + plt.axis( + [ + Time3[sig_temp.index((max(sig_temp)))] - 0.005, + Time3[sig_temp.index((max(sig_temp)))] + 0.005, + min(signal2), + max(signal2), + ] + ) + plt.savefig(path+'/'+model_name + "_Detail_signal_comparison_e2s_" + str(round(e2s, 4)) + ".png", bbox_inches="tight") + + # Reset the axis + plt.axis([0, Time3[-1], min(signal2), max(signal2)]) + + # Plot spectrogram difference + # plt.figure(figsize=(12, 8)) + # print("Creating spectrogram data..") + # frequencies, times, spectrogram = signal.spectrogram(signal_diff, 44100) + # plt.pcolormesh(times, frequencies, 10 * np.log10(spectrogram)) + # plt.colorbar() + # plt.title("Diff Spectrogram") + # plt.ylabel("Frequency [Hz]") + # plt.xlabel("Time [sec]") + # plt.savefig(path+'/'+model_name + "_diff_spectrogram.png", bbox_inches="tight") + + if show_plots == 1: + plt.show() + + +if __name__ == "__main__": + parser = argparse.ArgumentParser() + #parser.add_argument("--path", default=".") + parser.add_argument("--output_wav", default="y_test.wav") + parser.add_argument("--pred_wav", default="y_pred.wav") + parser.add_argument("--input_wav", default="x_test.wav") + parser.add_argument("--model_name", default="plot") + parser.add_argument("--path", default="") + parser.add_argument("--show_plots", default=1) + args = parser.parse_args() + analyze_pred_vs_actual(args) diff --git a/predict.py b/predict.py @@ -0,0 +1,76 @@ + +import tensorflow as tf +from tensorflow.keras.models import load_model +import tensorflow.keras.backend as K +from tensorflow.keras.optimizers import Adam + +import matplotlib.pyplot as plt +import os +from scipy import signal +from scipy.io import wavfile +import numpy as np +import matplotlib.pyplot as plt +import math +import h5py +import argparse + + +def save_wav(name, data): + if name.endswith('.wav') == False: + name = name + '.wav' + wavfile.write(name, 44100, data.flatten().astype(np.float32)) + print("Predicted wav file generated: "+name) + +def pre_emphasis_filter(x, coeff=0.95): + return tf.concat([x, x - coeff * x], 1) + +def error_to_signal(y_true, y_pred): + y_true, y_pred = pre_emphasis_filter(y_true), pre_emphasis_filter(y_pred) + return K.sum(tf.pow(y_true - y_pred, 2), axis=0) / K.sum(tf.pow(y_true, 2), axis=0) + 1e-10 + +def normalize(data): + data_max = max(data) + data_min = min(data) + data_norm = max(data_max,abs(data_min)) + return data / data_norm + +def predict(args): + ''' + Predicts the output wav given an input wav file, trained GuitarLSTM model, + and output wav filename. + ''' + # Read the input_size from the .h5 model file + f = h5py.File(args.model, 'a') + input_size = f["info"]["input_size"][0] + f.close() + input_size = 180 + learning_rate = 0.01 + # Load model from .h5 model file + name = args.out_filename + model = load_model(args.model, custom_objects={'error_to_signal' : error_to_signal}) + model.compile(optimizer=Adam(learning_rate=learning_rate), loss=error_to_signal, metrics=[error_to_signal]) + + # Load and Preprocess Data + print("Processing input wav..") + in_rate, in_data = wavfile.read(args.in_file) + + X = in_data.astype(np.float32).flatten() + X = normalize(X).reshape(len(X),1) + + indices = np.arange(input_size) + np.arange(len(X)-input_size+1)[:,np.newaxis] + X_ordered = tf.gather(X,indices) + + # Run prediction and save output audio as a wav file + print("Running prediction..") + prediction = model.predict(X_ordered, batch_size=args.batch_size) + save_wav(name, prediction) + +if __name__ == "__main__": + parser = argparse.ArgumentParser() + parser.add_argument("in_file") + parser.add_argument("out_filename") + parser.add_argument("model") + parser.add_argument("--train_data", default="data.pickle") + parser.add_argument("--batch_size", type=int, default=4096) + args = parser.parse_args() + predict(args) diff --git a/train.py b/train.py @@ -0,0 +1,175 @@ +import tensorflow as tf +from tensorflow.keras import Sequential +from tensorflow.keras.layers import LSTM, Conv1D, Dense +from tensorflow.keras.optimizers import Adam +from tensorflow.keras.backend import clear_session +from tensorflow.keras.activations import tanh, elu, relu +from tensorflow.keras.models import load_model +import tensorflow.keras.backend as K +from tensorflow.keras.utils import Sequence + +import os +from scipy import signal +from scipy.io import wavfile +import numpy as np +import matplotlib.pyplot as plt +import math +import h5py +import argparse + + +def pre_emphasis_filter(x, coeff=0.95): + return tf.concat([x, x - coeff * x], 1) + +def error_to_signal(y_true, y_pred): + """ + Error to signal ratio with pre-emphasis filter: + """ + y_true, y_pred = pre_emphasis_filter(y_true), pre_emphasis_filter(y_pred) + return K.sum(tf.pow(y_true - y_pred, 2), axis=0) / K.sum(tf.pow(y_true, 2), axis=0) + 1e-10 + +def save_wav(name, data): + wavfile.write(name, 44100, data.flatten().astype(np.float32)) + +def normalize(data): + data_max = max(data) + data_min = min(data) + data_norm = max(data_max,abs(data_min)) + return data / data_norm + +def main(args): + '''Ths is a similar Tensorflow/Keras implementation of the LSTM model from the paper: + "Real-Time Guitar Amplifier Emulation with Deep Learning" + https://www.mdpi.com/2076-3417/10/3/766/htm + + Uses a stack of two 1-D Convolutional layers, followed by LSTM, followed by + a Dense (fully connected) layer. Three preset training modes are available, + with further customization by editing the code. A Sequential tf.keras model + is implemented here. + + Note: RAM may be a limiting factor for the parameter "input_size". The wav data + is preprocessed and stored in RAM, which improves training speed but quickly runs out + if using a large number for "input_size". Reduce this if you are experiencing + RAM issues. + + --training_mode=0 Speed training (default) + --training_mode=1 Accuracy training + --training_mode=2 Extended training (set max_epochs as desired, for example 50+) + ''' + + name = args.name + if not os.path.exists('models/'+name): + os.makedirs('models/'+name) + else: + print("A model with the same name already exists. Please choose a new name.") + return + + train_mode = args.training_mode # 0 = speed training, + # 1 = accuracy training + # 2 = extended training + batch_size = args.batch_size + test_size = 0.2 + epochs = args.max_epochs + if train_mode == 0: # Speed Training + learning_rate = 0.01 + conv1d_strides = 12 + conv1d_filters = 16 + hidden_units = 36 + input_size = 180 + elif train_mode == 1: # Accuracy Training (~10x longer than Speed Training) + learning_rate = 0.01 + conv1d_strides = 4 + conv1d_filters = 36 + hidden_units= 64 + input_size = 300 + else: # Extended Training (~60x longer than Accuracy Training) + learning_rate = 0.0005 + conv1d_strides = 3 + conv1d_filters = 36 + hidden_units= 96 + input_size = 500 + + + # Load and Preprocess Data ########################################### + in_rate, in_data = wavfile.read(args.in_file) + out_rate, out_data = wavfile.read(args.out_file) + + X = in_data.astype(np.float32).flatten() + X = normalize(X).reshape(len(X),1) + y = out_data.astype(np.float32).flatten() + y = normalize(y).reshape(len(y),1) + + y_ordered = y[input_size-1:] + + indices = np.arange(input_size) + np.arange(len(X)-input_size+1)[:,np.newaxis] + X_ordered = tf.gather(X,indices) + + shuffled_indices = np.random.permutation(len(X_ordered)) + X_random = tf.gather(X_ordered,shuffled_indices) + y_random = tf.gather(y_ordered, shuffled_indices) + + # Create Sequential Model ########################################### + clear_session() + model = Sequential() + model.add(Conv1D(conv1d_filters, 12,strides=conv1d_strides, activation=None, padding='same',input_shape=(input_size,1))) + model.add(Conv1D(conv1d_filters, 12,strides=conv1d_strides, activation=None, padding='same')) + model.add(LSTM(hidden_units)) + model.add(Dense(1, activation=None)) + model.compile(optimizer=Adam(learning_rate=learning_rate), loss=error_to_signal, metrics=[error_to_signal]) + print(model.summary()) + + # Train Model ################################################### + model.fit(X_random,y_random, epochs=epochs, batch_size=batch_size, validation_split=test_size) + + model.save('models/'+name+'/'+name+'.h5') + + #model.save('model_data/') + #model = load_model('new_model_'+name+'.h5', custom_objects={'error_to_signal' : error_to_signal}) + #learning_rate = 0.005 + #model.compile(optimizer=Adam(learning_rate=learning_rate), loss=error_to_signal, metrics=[error_to_signal]) + + # Run Prediction ################################################# + print("Running prediction..") + y_the_rest, y_last_part = np.split(y_ordered, [int(len(y_ordered)*.8)]) + x_the_rest, x_last_part = np.split(X, [int(len(X)*.8)]) + + x_the_rest, x_ordered_last_part = np.split(X_ordered, [int(len(X_ordered)*.8)]) + prediction = model.predict(x_ordered_last_part, batch_size=batch_size) + + save_wav('models/'+name+'/y_pred.wav', prediction) + save_wav('models/'+name+'/x_test.wav', x_last_part) + save_wav('models/'+name+'/y_test.wav', y_last_part) + + # Add additional data to the saved model (like input_size) + filename = 'models/'+name+'/'+name+'.h5' + f = h5py.File(filename, 'a') + grp = f.create_group("info") + dset = grp.create_dataset("input_size", (1,), dtype='int16') + dset[0] = input_size + f.close() + + # Create Analysis Plots ########################################### + if args.create_plots == 1: + print("Plotting results..") + import plot + + plot.analyze_pred_vs_actual({ 'output_wav':'models/'+name+'/y_test.wav', + 'pred_wav':'models/'+name+'/y_pred.wav', + 'input_wav':'models/'+name+'/x_test.wav', + 'model_name':name, + 'show_plots':1, + 'path':'models/'+name + }) + +if __name__ == "__main__": + parser = argparse.ArgumentParser() + + parser.add_argument("in_file") + parser.add_argument("out_file") + parser.add_argument("name") + parser.add_argument("--training_mode", type=int, default=0) + parser.add_argument("--batch_size", type=int, default=4096) + parser.add_argument("--max_epochs", type=int, default=1) + parser.add_argument("--create_plots", type=int, default=1) + args = parser.parse_args() + main(args)