Robust Hashing and its Applications to Content Identification
- 講者Pierre Moulin 教授 (University of Illinois)
邀請人：廖弘源 - 時間2013-01-11 (Fri.) 10:30 ~ 12:00
- 地點資訊所新館106演講廳
摘要
The need to compress signals (audio, video, etc.) into short bitstrings for the purpose of reliable identification (instead of reconstruction) arises in many modern applications, including management of user-submitted content websites such as YouTube; connected audio, e.g. the Shazam application running on smartphones; and contextual advertising. These short bitstrings are called robust hashes, or fingerprints of the signal. A successful application of content identification requires that different versions of a signal can be matched reliably based on their fingerprints (a property called robustness) whereas unrelated signals yield a negative match (this property is called discriminability). This talk will overview the fundamental concepts behind these applications and outline practical approaches.