Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

S.-P. Heo

dblp:73/3770 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2006
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
1 paper
Audio and music processing · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Audio and music processing › music information retrieval
melody matching
0.112006
An effective music information retrieval method using three-dimensional continuous DP · IEEE Trans. Multim. 2006
Audio and music processing
music information retrieval
0.112006
An effective music information retrieval method using three-dimensional continuous DP · IEEE Trans. Multim. 2006
Audio and music processing › music information retrieval › melody retrieval
query-by-humming
0.112006
An effective music information retrieval method using three-dimensional continuous DP · IEEE Trans. Multim. 2006
Audio and music processing › speech processing
pitch estimation
0.012006
An effective music information retrieval method using three-dimensional continuous DP · IEEE Trans. Multim. 2006

Methods — techniques the papers use, named apart from their topics

three-dimensional continuous DP · 0.1pitch candidate selection · 0.1
YearPublicationVenuePosition
2006 An effective music information retrieval method using three-dimensional continuous DP
abstract
This paper describes a music information retrieval system that uses humming as the key for retrieval. Humming is an easy way for a user to input a melody. However, there are several problems with humming that degrade the retrieval of information. One problem is the human factor. Sometimes, people do not sing accurately, especially if they are inexperienced or unaccompanied. Another problem arises from signal processing. Therefore, a music information retrieval method should be sufficiently robust to surmount various humming errors and signal processing problems. A retrieval system has to extract the pitch from the user's humming. However, pitch extraction is not perfect. It often captures half or double pitches, which are harmonic frequencies of the true pitch, even if the extraction algorithms take the continuity of the pitch into account. Considering these problems, we propose a system that takes multiple pitch candidates into account. In addition to the frequencies of the pitch candidates, the confidence measures obtained from their powers are taken into consideration as well. We also propose the use of an algorithm with three dimensions that is an extension of the conventional Dynamic Programming (DP)algorithm, so that multiple pitch candidates can be treated. Moreover, in the proposed algorithm, DP paths are changed dynamically to take deltaPitches and IOIratios (inter-onset-interval) of input and reference notes into account in order to treat notes being split or unified. We carried out an evaluation experiment to compare the proposed system with a conventional system . When using three-pitch candidates with conference measure and IOI features, the top-ten retrieval accuracy was 94.1%. Thus, the proposed method gave a better retrieval performance than the conventional system.
S.-P. Heo, Motoyuki Suzuki, Akinori Ito, Shozo Makino
IEEE Trans. Multim.1