Search Results for author:
Found 31 papers, 15 papers with code
AlignMix: Improving representations by interpolating aligned features
Mixup is a powerful data augmentation method that interpolates between two or more examples in the input or feature space and between the corresponding target labels.
All the attention you need: Global-local, spatial-channel attention for image retrieval
Apart from backbone, training pipelines and loss functions, popular approaches have focused on different spatial pooling and attention mechanisms, which are at the core of learning a powerful global image representation.
It Takes Two to Tango: Mixup for Deep Metric Learning
To the best of our knowledge, we are the first to investigate mixing examples and target labels for deep metric learning.
Ranked #1 on
Metric Learning
on In-Shop
(using extra training data)
Tensor feature hallucination for few-shot learning
We follow a different approach and investigate how a simple and straightforward synthetic data generation method can be used effectively.
Few-shot learning via tensor hallucination
Few-shot classification addresses the challenge of classifying examples given only limited labeled data.
AlignMix: Improving representation by interpolating aligned features
Mixup is a powerful data augmentation method that interpolates between two or more examples in the input or feature space and between the corresponding target labels.
On the hidden treasure of dialog in video question answering
High-level understanding of stories in video such as movies and TV shows from raw data is extremely challenging.
Ranked #1 on
Video Question Answering
on KnowIT VQA
Local Propagation for Few-Shot Learning
The challenge in few-shot learning is that available data is not enough to capture the underlying distribution.
Iterative label cleaning for transductive and semi-supervised few-shot learning
Few-shot learning amounts to learning representations and acquiring knowledge such that novel tasks may be solved with both supervision and data being limited.
Asymmetric metric learning for knowledge transfer
This acts as a simple combination of knowledge transfer with the original metric learning task.
Few-Shot Few-Shot Learning and the role of Spatial Attention
This motivates us to study a problem where the representation is obtained from a classifier pre-trained on a large-scale dataset of a different domain, assuming no access to its training process, while the base class data are limited to few examples per class and their role is to adapt the representation to the domain at hand rather than learn from scratch.
Walking on the Edge: Fast, Low-Distortion Adversarial Examples
Adversarial examples of deep neural networks are receiving ever increasing attention because they help in understanding and reducing the sensitivity to their input.
Training Object Detectors from Few Weakly-Labeled and Many Unlabeled Images
Weakly-supervised object detection attempts to limit the amount of supervision by dispensing the need for bounding boxes, but still assumes image-level labels on the entire training set.
Ranked #21 on
Weakly Supervised Object Detection
on PASCAL VOC 2012 test
(using extra training data)
Rethinking deep active learning: Using unlabeled data at model training
By systematically evaluating on a number of popular acquisition strategies and datasets, we find that the use of unlabeled data during model training brings a surprising accuracy improvement in image classification, compared to the differences between acquisition strategies.
Graph convolutional networks for learning with few clean and many noisy labels
In this work we consider the problem of learning a classifier from noisy labels when a few clean labeled examples are given.
Local Features and Visual Words Emerge in Activations
We propose a novel method of deep spatial matching (DSM) for image retrieval.
Label Propagation for Deep Semi-supervised Learning
In this work, we employ a transductive label propagation method that is based on the manifold assumption to make predictions on the entire dataset and use these predictions to generate pseudo-labels for the unlabeled data and train a deep neural network.
Dense Classification and Implanting for Few-Shot Learning
Training deep neural networks from few examples is a highly challenging and key problem for many computer vision tasks.
Hybrid Diffusion: Spectral-Temporal Graph Filtering for Manifold Ranking
State of the art image retrieval performance is achieved with CNN features and manifold ranking using a k-NN similarity graph that is pre-computed off-line.
Revisiting Oxford and Paris: Large-Scale Image Retrieval Benchmarking
In particular, annotation errors, the size of the dataset, and the level of challenge are addressed: new annotation for both datasets is created with an extra attention to the reliability of the ground truth.
Mining on Manifolds: Metric Learning without Labels
Positive examples are distant points on a single manifold, while negative examples are nearby points on different manifolds.
Unsupervised object discovery for instance recognition
Eliminating the impact of the clutter on the image descriptor increases the chance of retrieving relevant images and prevents topic drift due to actually retrieving the clutter in the case of query expansion.
Panorama to panorama matching for location recognition
Location recognition is commonly treated as visual instance retrieval on "street view" imagery.
Unsupervised part learning for visual recognition
This strategy opens the door to the use of PBM in new applications for which the notion of image categories is irrelevant, such as instance-based image retrieval, for example.
Fast Spectral Ranking for Similarity Search
This makes the Euclidean nearest neighbor search biased for this task.
Efficient Diffusion on Region Manifolds: Recovering Small Objects with Compact CNN Representations
The diffusion is carried out on descriptors of overlapping image regions rather than on a global image descriptor like in previous approaches.
Automatic discovery of discriminative parts as a quadratic assignment problem
Part-based image classification consists in representing categories by small sets of discriminative parts upon which a representation of the images is built.
Web-Scale Image Clustering Revisited
Large scale duplicate detection, clustering and mining of documents or images has been conventionally treated with seed detection via hashing, followed by seed growing heuristics using fast search.
Early Burst Detection for Memory-Efficient Image Retrieval
Then, we show the interest of using this strategy in an asymmetrical manner, with only the database features being aggregated but not those of the query.
Locally Optimized Product Quantization for Approximate Nearest Neighbor Search
We present a simple vector quantizer that combines low distortion with fast search and apply it to approximate nearest neighbor (ANN) search in high dimensional spaces.
