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

Tat-Wan Leung

dblp:96/1170 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2004
—ORCID · unresolved

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 2 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Audio and music processing
music information retrieval
0.012004
Indexing and matching of polyphonic songs for query-by-singing system · ACM Multimedia 2004
Audio and music processing › music information retrieval › melody retrieval
query-by-singing
0.012004
Indexing and matching of polyphonic songs for query-by-singing system · ACM Multimedia 2004

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

vantage point trees · 0.0proportional transportation distance · 0.0SVM · 0.0ICA · 0.0
YearPublicationVenuePosition
2004 Indexing and matching of polyphonic songs for query-by-singing system
abstract
This paper investigates the issues in polyphonic popular song retrieval. The problems that we consider include singing voice extraction, melodic curve representation, and database indexing. Initially, polyphonic songs are decomposed into singing voices and instruments sounds in both time and frequency domains based on SVM and ICA. The extracted singing voices are represented as two melodic curves that model the statistical mean and neighborhood similarity of notes. To speed up the matching between songs and query, we further adopt proportional transportation distance to index the songs as vantage point trees. Encouraging results have been obtained through experiments.
Tat-Wan Leung, Chong-Wah Ngo
ACM Multimedia1