Localized Key-Finding: Algorithms and Applications. Ilya Shmulevich, Olli Yli-Harja Tampere University of Technology Tampere, Finland October 4, 1999. Outline. Review of key-finding algorithms Median-based filters Graph-based smoothing of class data
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Ilya Shmulevich, Olli Yli-Harja
Tampere University of Technology
October 4, 1999
Most stable pitch classes should occur most often.
Class data cannot be ordered.
Relax requirements of metric space to allow for “distance” between elements of class data.
“Distance” – Based on similarity between two keys.
High similarity corresponds to small distance.
Used methods discussed to correct pitch error
Types of Pitch Error:
Less stable elements are poorly remembered. To compute perceptual pitch error, must have knowledge of the key. The localized key-finding algorithm may be used to obtain this.