May 23
HDR Defense “Large-scale Content-based Visual Information Retrieval”, Alexis Joly, May 26, 2015
- Filed under Slider News, Uncategorized
-
May 23, 2015
Alexis Joly’s HDR defense will take place on Tuesday, May 26, 2015 at 14h at LIRMM, salle des séminaires.
Title: Large-scale Content-based Visual Information Retrieval
Jury members:
– Pr. Jenny BENOIS-PINEAU, université Bordeaux 1 (reviewer)
– Pr. Bernard MERIALDO, EURECOM (reviewer)
– Dr. Yannis KOMPATSIARIS, CERTH-ITI (reviewer)
– Pr. Nozha BOUJEMAA, Inria Saclay
– Dr. Olivier BUISSON, INA
– Dr. Guillaume GRAVIER, IRISA
– Pr. William PUECH, LIRMM
– Pr. Patrick VALDURIEZ, Inria & LIRMM
Abstract:
Rather than restricting search to the use of metadata, content-based information retrieval methods attempt to index, search and browse digital objects by means of signatures or features describing their actual content. Such methods have been intensively studied in the multimedia community to allow managing the massive amount of raw multimedia documents created every day (e.g. video will account to 84% of U.S. internet traffic by 2018). Recent years have consequently witnessed a consistent growth of content-aware and multi-modal search engines deployed on massive multimedia data. Popular multimedia search applications such as Google images, Youtube, Shazam, Tineye or MusicID clearly demonstrated that the first generation of large-scale audio-visual search technologies is now mature enough to be deployed on real-world big data. All these successful applications did greatly benefit from 15 years of research on multimedia analysis and efficient content-based indexing techniques. Yet the maturity reached by the first generation of content-based search engines does not preclude an intensive research activity in the field. There is actually still a lot of hard problems to be solved before we can retrieve any information in images or sounds as easily as we do in text documents. Content-based search methods actually have to reach a finer understanding of the contents as well as a higher semantic level. This requires modeling the raw signals by more and more complex and numerous features, so that the algorithms for analyzing, indexing and searching such features have to evolve accordingly. This thesis describes several of my works related to large-scale content-based information retrieval. The different contributions are presented in a bottom-up fashion reflecting a typical three-tier software architecture of an end-to-end multimedia information retrieval system. The lowest layer is only concerned with managing, indexing and searching large sets of high-dimensional feature vectors, whatever their origin or role in the upper levels (visual or audio features, global or part-based descriptions, low or high semantic level, etc. ). The middle layer rather works at the document level and is in charge of analyzing, indexing and searching collections of documents. It typically extracts and embeds the low-level features, implements the querying mechanisms and post-processes the results returned by the lower layer. The upper layer works at the applicative level and is in charge of providing useful and interactive functionalities to the end-user. It typically implements the front-end of the search application, the crawler and the orchestration of the different indexing and search services.
Permanent link to this article: https://team.inria.fr/zenith/hdr-defense-of-alexis-joly-26-may-2015-14h-at-lirmm/
Search
Events
- A new book on time series by Eduardo Ogasawara, Rebecca Salles, Fabio Porto and Esther Pacitti
- 16 August 2024: 9th Workshop of the HPDaSc project, CEFET-RJ, Rio de janeiro, Brazil
- Patrick Valduriez, keynote speaker at SSDBM 2024.
- HPDaSc Workshop on Data Driven Science, 31 May, 2024, Campus Saint Priest, Bat. 5, Montpellier.
- Seminar by Patrick Valduriez on “Ciência de Dados e Inovação”, IMPA, Rio de Janeiro, 9 May 2024
Calendar
M | T | W | T | F | S | S |
---|---|---|---|---|---|---|
1 | 2 | 3 | ||||
4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 13 | 14 | 15 | 16 | 17 |
18 | 19 | 20 | 21 | 22 | 23 | 24 |
25 | 26 | 27 | 28 | 29 | 30 |