Image classification becomes a big challenge since it concerns on the one hand millions or billions of images that are available on the web and on the other hand images used for critical real-time applications. This classification involves in general learning methods and classifiers that must require both precision as well as speed performance....
-
October 11, 2013 (v1)PublicationUploaded on: October 11, 2023
-
April 18, 2013 (v1)Report
A standard approach for large scale image classification involves high dimensional features and Stochastic Gradient Descent algorithm (SGD) for the minimization of classical Hinge Loss in the primal space. Although complexity of Stochastic Gradient Descent is linear with the number of samples these method suffers from slow convergence. In order...
Uploaded on: December 2, 2022 -
September 22, 2013 (v1)Conference paper
Recent works display that large scale image classification problems rule out computationally demanding methods. On such problems, simple approaches like k-NN are affordable contenders, with still room space for statistical improvements under the algorithmic constraints. A recent work showed how to leverage k-NN to yield a formal boosting...
Uploaded on: December 3, 2022 -
September 22, 2013 (v1)Conference paper
Recent works display that large scale image classification problems rule out computationally demanding methods. On such problems, simple approaches like k-NN are affordable contenders, with still room space for statistical improvements under the algorithmic constraints. A recent work showed how to leverage k-NN to yield a formal boosting...
Uploaded on: October 11, 2023 -
2011 (v1)Conference paper
The challenge of image classification is based on two key elements: the image representation and the algorithm of classification. In this paper, we revisited the topic of image representation. Classical descriptors such as Bag-of-Features are usually based on SIFT. We propose here an alternative based on bio-inspired features. This approach is...
Uploaded on: December 4, 2022 -
September 24, 2012 (v1)Conference paper
It is an admitted fact that mainstream boosting algorithms like AdaBoost do not perform well to estimate class conditional probabilities. In this paper, we analyze, in the light of this problem, a recent algorithm, unn, which leverages nearest neighbors while minimizing a convex loss. Our contribution is threefold. First, we show that there...
Uploaded on: December 4, 2022 -
June 20, 2012 (v1)Conference paper
High-content imaging is an emerging technology for the analysis and quantification of biological phenomena. Thus, classifying a huge number of cells or quantifying markers from large sets of images by experts is a very time-consuming and poorly reproducible task. In order to overcome such limitations, we propose a supervised method for...
Uploaded on: December 3, 2022 -
June 20, 2012 (v1)Conference paper
High-content imaging is an emerging technology for the analysis and quantification of biological phenomena. Thus, classifying a huge number of cells or quantifying markers from large sets of images by experts is a very time-consuming and poorly reproducible task. In order to overcome such limitations, we propose a supervised method for...
Uploaded on: October 11, 2023 -
February 24, 2014 (v1)Journal article
Tailoring nearest neighbors algorithms to boosting is an important problem. Recent papers study an approach, UNN, which provably minimizes particular convex surrogates under weak assumptions. However, numerical issues make it necessary to experimentally tweak parts of the UNN algorithm, at the possible expense of the algorithm's convergence and...
Uploaded on: December 2, 2022 -
February 24, 2014 (v1)Journal article
Tailoring nearest neighbors algorithms to boosting is an important problem. Recent papers study an approach, UNN, which provably minimizes particular convex surrogates under weak assumptions. However, numerical issues make it necessary to experimentally tweak parts of the UNN algorithm, at the possible expense of the algorithm's convergence and...
Uploaded on: October 11, 2023 -
2014 (v1)Conference paper
International audience
Uploaded on: February 28, 2023 -
October 1, 2012 (v1)Conference paper
Universal Nearest Neighbours (unn) is a classifier recently proposed, which can also effectively estimates the posterior probability of each classification act. This algorithm, intrinsically binary, requires the use of a decomposition method to cope with multiclass problems, thus reducing their complexity in less complex binary subtasks. Then,...
Uploaded on: October 11, 2023 -
November 11, 2012 (v1)Conference paper
This paper proposes a novel automated approach for the categorization of cells in fluorescence microscopy images. Our supervised classification method aims at recognizing patterns of unlabeled cells based on an annotated dataset. First, the cell images need to be indexed by encoding them in a feature space. For this purpose, we propose tailored...
Uploaded on: December 3, 2022 -
October 1, 2012 (v1)Conference paper
Universal Nearest Neighbours (unn) is a classifier recently proposed, which can also effectively estimates the posterior probability of each classification act. This algorithm, intrinsically binary, requires the use of a decomposition method to cope with multiclass problems, thus reducing their complexity in less complex binary subtasks. Then,...
Uploaded on: December 2, 2022 -
November 11, 2012 (v1)Conference paper
This paper proposes a novel automated approach for the categorization of cells in fluorescence microscopy images. Our supervised classification method aims at recognizing patterns of unlabeled cells based on an annotated dataset. First, the cell images need to be indexed by encoding them in a feature space. For this purpose, we propose tailored...
Uploaded on: October 11, 2023 -
February 24, 2012 (v1)Conference paper
High-content cellular imaging is an emerging technology for studying many biological phenomena. statistical analyses on large populations (more than thousands) of cells are required. Hence classifying cells by experts is a very time-consuming task and poorly reproducible. In order to overcome such limitations, we propose an automatic supervised...
Uploaded on: December 3, 2022 -
June 2010 (v1)Book section
HD video content represents a tremendous quantity of information that cannot be easily handled by all types of devices. Hence the scalability issues in its processing have become a focus of interest in HD video coding technologies. In this chapter, we focus on the natural scalability of hierarchical transforms to tackle video indexing and...
Uploaded on: December 4, 2022 -
February 24, 2012 (v1)Conference paper
High-content cellular imaging is an emerging technology for studying many biological phenomena. statistical analyses on large populations (more than thousands) of cells are required. Hence classifying cells by experts is a very time-consuming task and poorly reproducible. In order to overcome such limitations, we propose an automatic supervised...
Uploaded on: October 11, 2023 -
September 16, 2021 (v1)Patent
No description
Uploaded on: December 3, 2022 -
December 2019 (v1)Journal article
Early response to first-line antipsychotic treatments is strongly associated with positive long-term symptomatic and functional outcome in psychosis. Unfortunately, attempts to identify reliable predictors of treatment response in firstepisode psychosis (FEP) patients have not yet been successful. One reason for this could be that FEP patients...
Uploaded on: December 4, 2022