- When: 5th December 2017 14:00 - 15:00
- Where: Cole 1.33a
- Series: School Seminar Series
- Format: Seminar
Searching for complex objects (e.g. images, faces, audio or video), is an everyday problem in computer science, motivated by many applications. Efficient algorithms are demanded for reverse searching, also known as query by content, in large repositories. Current industrial solutions are ad hoc, domain-dependant, hardware intensive and have limited scaling. However, those disparate domains can be modelled, for indexing and searching, as a metric space. This model has been championed to become a solution to generic proximity searching problems. In practice, however, the metric space approach has been limited by the amount of main memory available.
In this talk we will explore the main ideas behind this technology, present a successful example in audio indexing and retrieval. The application scales well for large amounts of audio because the representation is quite compact and the full audio streams are not needed for indexing and searching.
Edgar Chavez received his Phd from the Center for Mathematical Research in Guanajuato, Mexico in 1999. He founded the information retrieval group at Universidad Michoacana where he worked until 2012. After a brief period in the Institute of Mathematics in UNAM, he joined the computer science department in CICESE in 2013, where he founded the data science group. His main research interest include access and retrieval of data and data representation, such as fingerprints and point clouds. In 2009 he obtained the Thompson-Reuters award for having the most cited paper in computer science in Mexico and Latin America. In 2008 he co-funded, with Gonzalo Navarro, the conference Similarity Search and Applications, which is an international reference in the area. He has published more than 100 scientific contributions, with about 3500 citations in google scholar.