Demo Data from VLDB 2026 / reviewers in the wild / expert
Marco Fornoni
dblp:58/8428
· DBLP profile ↗
6ranked-venue papers
3as first author
2since 2021 · last 2024
0000-0001-5538-8012ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 6 · 3 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 5 · 2 first-author · 2 since 2021
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 · 51% Efficient and distributed learning · 49% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
model compression |
0.8 | 1 | 2024 | MobileNetV4: Universal Models for the Mobile Ecosystem · ECCV (40) 2024 |
Computer vision › Image recognition and object detection
object localization |
0.6 | 1 | 2022 | On Label Granularity and Object Localization · ECCV (10) 2022 |
Computer vision › Image recognition and object detection › efficient visual recognition
mobile image recognition |
0.2 | 1 | 2024 | MobileNetV4: Universal Models for the Mobile Ecosystem · ECCV (40) 2024 |
Methods — techniques the papers use, named apart from their topics
neural architecture search · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | MobileNetV4: Universal Models for the Mobile Ecosystem
Danfeng Qin, Chas Leichner, Manolis Delakis, Marco Fornoni, Shixin Luo, Colby R. Banbury, Chengxi Ye, Berkin Akin, Vaibhav Aggarwal, Tenghui Zhu, Daniele Moro, Andrew G. Howard |
ECCV (40) | 4 |
| 2022 | On Label Granularity and Object Localization
Elijah Cole, Kimberly Wilber, Grant Van Horn, Marco Fornoni, Pietro Perona, Serge J. Belongie, Andrew G. Howard, Oisin Mac Aodha |
ECCV (10) | 5 |
| 2020 | SpotPatch: Parameter-Efficient Transfer Learning for Mobile Object Detection
Keren Ye, Adriana Kovashka, Mark Sandler 0002, Menglong Zhu, Andrew G. Howard, Marco Fornoni |
ACCV (6) | 6 |
| 2014 | Scene Recognition with Naive Bayes Non-linear LearningabstractA crucial feature of a good scene recognition algorithm is its ability to generalize. Scene categories, especially those related to human made indoor places or to human activities like sports, do present a high degree of intra-class variability, which in turn requires high robustness and generalization properties. Such features are amongst the distinctive characteristics of the Naive Bayes Nearest Neighbor (NBNN) approach [1], an image classification framework that since its introduction in 2008 has been gaining momentum in the visual recognition community. In this paper we show how with a straightforward modification of the original NBNN scoring function it is possible to use a recently introduced latent locally linear SVM algorithm to discriminatively learn a set of prototype local features for each class. The resulting classification algorithm, that we call Naive Bayes Nonlinear Learning (NBNL) preserves the generality and robustness properties of the original approach, while greatly reducing its memory requirements during testing, and significantly improving its performance. To the best of our knowledge this is the first work to exploit the structure of the local features through the use of a latent locally linear discriminative learning method. Experiments over three different public scene recognition datasets show the effectiveness of the proposed algorithm, which outperforms several existing NBNN-based methods and is competitive with standard Bag-of-Words plus SVM approaches. Marco Fornoni, Barbara Caputo |
ICPR | 1 |
| 2013 | Multiclass Latent Locally Linear Support Vector MachinesabstractKernelized Support Vector Machines (SVM) have gained the status of off-the-shelf classifiers, able to deliver state of the art performance on almost any problem. Still, their practical use is constrained by their computational and memory complexity, which grows super-linearly with the number of training samples. In order to retain the low training and testing complexity of linear classifiers and the flexibility of non linear ones, a growing, promising alternative is represented by methods that learn non-linear classifiers through local combinations of linear ones. In this paper we propose a new multi class local classifier, based on a latent SVM formulation. The proposed classifier makes use of a set of linear models that are linearly combined using sample and class specific weights. Thanks to the latent formulation, the combination coefficients are modeled as latent variables. We allow soft combinations and we provide a closed-form solution for their estimation, resulting in an efficient prediction rule. This novel formulation allows to learn in a principled way the sample specific weights and the linear classifiers, in a unique optimization problem, using a CCCP optimization procedure. Extensive experiments on ten standard UCI machine learning datasets, one large binary dataset, three character and digit recognition databases, and a visual place categorization dataset show the power of the proposed approach. Marco Fornoni, Barbara Caputo, Francesco Orabona |
ACML | 1 |
| 2012 | Indoor Scene Recognition using Task and Saliency-driven Feature PoolingabstractIndoor scenes are characterized by a high intra-class variability, mainly due to the intrinsic variety of the objects in them, and to the drastic image variations due to (even small) view-point changes. One of the main trends in the literature has been to employ representations coupling statistical characterizations of the image, with a description of their spatial distribution. This is usually done by combining multiple representations of different image regions, most often using a fixed 44, or pyramidal image-partitioning scheme. While these encodings are able to capture the spatial regularities of the problem, they are unsuitable to handle its spatial variabilities. In this work we propose to complement a traditional spatial-encoding scheme with a bottom-up approach designed to discover visual-structures regardless of their exact position in the scene. To this end we use saliency maps to segment each image in two regions: The most and least salient 50%. This segmentation provides a description of images which is somehow related to the relative semantics of the discovered regions, complementing the canonical spatial description. We evaluated the proposed technique on three public scene recognition datasets. Our results prove this approach to be effective in the indoor scenario, while being also meaningful for other scene categorization tasks. Marco Fornoni, Barbara Caputo |
BMVC | 1 |