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égis Behmo

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

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

Artificial intelligence and machine learning · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 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.

Artificial intelligence
2 papers
Image recognition and object detection · 38% Learning theory · 36% Representation and self-supervised learning · 27%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning theory › statistical pattern recognition
naive bayes nearest neighbor
0.112010
Towards Optimal Naive Bayes Nearest Neighbor · ECCV (4) 2010
Computer vision › Image recognition and object detection
image classification
0.112008
Graph commute times for image representation · CVPR 2008
Machine learning › Representation and self-supervised learning › visual representation
image representation
0.112008
Graph commute times for image representation · CVPR 2008

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

nearest neighbor · 0.1naive bayes · 0.1spectral embedding · 0.1graph commute times · 0.1bag-of-features · 0.1
YearPublicationVenuePosition
2010 Towards Optimal Naive Bayes Nearest Neighbor
Régis Behmo, Paul Marcombes, Arnak S. Dalalyan, Véronique Prinet
ECCV (4)1
2008 Graph commute times for image representation
abstract
We introduce a new image representation that encompasses both the general layout of groups of quantized local invariant descriptors as well as their relative frequency. A graph of interest points clusters is constructed and we use the matrix of commute times between the different nodes of the graph to obtain a description of their relative arrangement that is robust to large intra class variation. The obtained high dimensional representation is then embedded in a space of lower dimension by exploiting the spectral properties of the graph made of the different images. Classification tasks can be performed in this embedding space. We expose classification and labelling results obtained on three different datasets, including the challenging PASCAL VOC2007 dataset. The performances of our approach compare favorably with the standard bag of features, which is a particular case of our representation.
Régis Behmo, Nikos Paragios, Véronique Prinet
CVPR1
2008 An Application of Graph Commute Times to Image Indexing
abstract
In this paper we provide an overview of an image representation approach based on the description of layout and appearance properties of groups of features. In each image a graph of quantized features of interest is constructed. The features that are assigned to the same codebook bin are then grouped to produce a collapsed graph; the image content is represented by the matrix of commute times of this collapsed graph. This novel image descriptor can be used to label satellite image databases; we demonstrate the relevance and the efficiency of our approach by addressing classification problems on a dataset of 0.6 m resolution Quick bird images.
Régis Behmo, Nikos Paragios, Véronique Prinet
IGARSS (3)1