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

Rémi Landais

dblp:79/5971 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 3

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
3 papers
Multimedia analysis and retrieval · 62% Audio and music processing · 38%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 6 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Audio and music processing › music information retrieval
content-based music retrieval
0.112011
MuMa: a scalable music search engine based on content analysis · ACM Multimedia 2011
Audio and music processing
music information retrieval
0.112011
MuMa: a scalable music search engine based on content analysis · ACM Multimedia 2011
Multimedia analysis and retrieval › audio retrieval
music search engine
0.112011
MuMa: a scalable music search engine based on content analysis · ACM Multimedia 2011
Multimedia analysis and retrieval
image retrieval
0.112009
Lightweight web image reranking · ACM Multimedia 2009
Recommender systems › music recommendation
playlist generation
0.012011
MuMa: a scalable music search engine based on content analysis · ACM Multimedia 2011
Multimedia analysis and retrieval › image retrieval
image re-ranking
0.012009
Lightweight web image reranking · ACM Multimedia 2009

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

speech-to-text processing · 0.3image processing · 0.3content analysis · 0.2visual similarity · 0.1diversification · 0.1
YearPublicationVenuePosition
2013 Semantic dispatching of multimedia news with MEWS
abstract
Online news comes in rich multimedia form: video, audio, photos, in addition to traditional text. Recent advances in semantically-rich text processing, in speech-to-text processing, and in image processing allows us to develop new ways of presenting and enriching news stories. Here we present MEWS, a Multimedia nEWS platform, which enriches news browsing according to media (text, images, and video) and to automatically detected type of news (music, general news, politics).
Julien Law-To, Gregory Grefenstette, Rémi Landais
ACM Multimedia3
2011 MuMa: a scalable music search engine based on content analysis
abstract
Existing music search engines process music as they would process text, ignoring the richness of this media. We introduce here MuMa1 (MUsic MAshup), a web application which makes the most of audio contents (the signal itself) to provide the user with new ways of browsing music. MuMa allows the user to search for particular chords sequences, to generate smart playlists and to extend its musical universe.
Arthur Lenoir, Rémi Landais
ACM Multimedia2
2009 Lightweight web image reranking
abstract
Web image search is inspired by text search techniques; it mainly relies on indexing textual data that surround the image file. But retrieval results are often noisy and image processing techniques have been proposed to rerank images. Unfortunately, these techniques usually imply a computational overload that makes the reranking process intractable in real time. We introduce here a lightweight reranking method that compares each result not only to the other query results but also to an external, contrastive class of items. The external class contains diversified images; the intuition supporting our approach is that results that are visually similar to other query results but dissimilar to elements of the contrastive class are likely to be good answers. The success of visual reranking depends on the visual coherence of queries; we measure this coherence in order to evaluate the chances of success. Visual reranking tends to emerge near duplicate images and we complement it with a diversification function which ensures that different aspects of a query are presented to the user. Our method is evaluated against a standard search engine using 210 diversified queries. Significant improvements are reported for both quantitative and qualitative tests.
Adrian Popescu 0001, Pierre-Alain Moëllic, Ioannis Kanellos, Rémi Landais
ACM Multimedia4