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

Marco Bressan 0001

dblp:55/1385-1 · DBLP profile ↗
← Back
7ranked-venue papers
5as first author
0since 2021 · last 2007
0000-0001-5211-2264ORCID · corroborated

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

Artificial intelligence and machine learning · 5 · 4 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1Applied, 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
Probabilistic and Bayesian machine learning · 40% Representation and self-supervised learning · 40% Image recognition and object detection · 20%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › Image recognition and object detection › object recognition
appearance-based recognition
0.012001
Using an ICA Representation of High Dimensional Data for Object Recognition and Classification · CVPR (1) 2001
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
bayesian classification
0.012001
Using an ICA Representation of High Dimensional Data for Object Recognition and Classification · CVPR (1) 2001
Machine learning › Probabilistic and Bayesian machine learning › statistical inference
density estimation
0.012001
Using an ICA Representation of High Dimensional Data for Object Recognition and Classification · CVPR (1) 2001
Machine learning › Representation and self-supervised learning › matrix factorization
nonnegative matrix factorization
0.012001
A Weighted Non-Negative Matrix Factorization for Local Representations · CVPR (1) 2001
Machine learning › Representation and self-supervised learning › representation learning › compositional representation
part-based representation
0.012001
A Weighted Non-Negative Matrix Factorization for Local Representations · CVPR (1) 2001
Data mining
clustering
0.012001
A Weighted Non-Negative Matrix Factorization for Local Representations · CVPR (1) 2001

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

weighted non-negative matrix factorization · 0.1local independent component analysis · 0.0bayesian decision theory · 0.0
YearPublicationVenuePosition
2007 Bayesian Classification of Cork Stoppers Using Class-Conditional Independent Component Analysis
abstract
In this paper, a real-time application for visual inspection and classification of cork stoppers is presented. The process of cork inspection and quality grading is based on analyzing a large set of characteristics corresponding to visual features that are related to cork porosity. We have applied a set of nonparametric and parametric classification methods for comparing and evaluating their performance in this real problem. The best results have been achieved using Bayesian classification through probabilistic modeling in a high-dimensional space. In this context, it is well known that high dimensionality represents a serious problem for density estimation. We propose a class-conditional independent component analysis representation of the data that allows an accurate estimation of the data probability density function by factorizing it. The method has achieved a success of 98% of correct classification
Jordi Vitrià, Marco Bressan 0001, Petia Radeva
IEEE Trans. Syst. Man Cybern. Part C2
2004 Multiclass Object Recognition Using Class-Conditional Independent Component Analysis
abstract
A new modeling technique, based on independent component analysis (ICA), is proposed to represent and recognize high-dimensional samples from a large set of classes. The model is constructed via density estimation techniques, and recognition is performed in the Bayesian decision framework. We show that the technique can be successfully used for automatic object identification in environments where a visual observer is faced with a classification problem in high-dimensional spaces with a large number of classes. A first experiment illustrates that classification using an ICA representation is a technique that, even in low dimensions, performs comparably to standard classification techniques. The second experiment tests the ICA classification model on high-dimensional data. Recognition was performed using local color histograms of images corresponding to 400 different objects. It is also shown how our approach outperforms other techniques commonly used in the context of appearance-based recognition.
Marco Bressan 0001, David Guillamet, Jordi Vitrià
Cybern. Syst.1
2003 On the Selection and Classification of Independent Features
abstract
This paper is focused on the problems of feature selection and classification when classes are modeled by statistically independent features. We show that, under the assumption of class-conditional independence, the class separability measure of divergence is greatly simplified, becoming a sum of unidimensional divergences, providing a feature selection criterion where no exhaustive search is required. Since the hypothesis of independence is infrequently met in practice, we also provide a framework making use of class-conditional Independent Component Analyzers where this assumption can be held on stronger grounds. Divergence and the Bayes decision scheme are adapted to this class-conditional representation. An algorithm that integrates the proposed representation, feature selection technique, and classifier is presented. Experiments on artificial, benchmark, and real-world data illustrate our technique and evaluate its performance.
Marco Bressan 0001, Jordi Vitrià
IEEE Trans. Pattern Anal. Mach. Intell.1
2003 Using an ICA representation of local color histograms for object recognition
Marco Bressan 0001, David Guillamet, Jordi Vitrià
Pattern Recognit.1
2003 Nonparametric discriminant analysis and nearest neighbor classification
Marco Bressan 0001, Jordi Vitrià
Pattern Recognit. Lett.1
2001 Using an ICA Representation of High Dimensional Data for Object Recognition and Classification
abstract
This paper applies a Bayesian classification scheme to the problem of recognition through probabilistic modeling of high dimensional data. In this context, high dimensionality does not allow precision in the density estimation. We propose a local independent component analysis (ICA) representation of the data. The components can be assumed statistically independent and, in many cases, sparsity is observed. We show how these two characteristics can be used to simplify and add accuracy to the density estimation and develop bayesian decision within this representation. A first experiment illustrates that classification using an ICA representation is a technique that, even in low dimensions, performs comparably to standard classification techniques. The second experiment tests the ICA classification model on high dimensional data. Recognition was performed using local color histograms as salient features. It is also shown how our approach outperforms other techniques commonly used in the context of appearance-based recognition.
Marco Bressan 0001, David Guillamet, Jordi Vitrià
CVPR (1)1
2001 A Weighted Non-Negative Matrix Factorization for Local Representations
abstract
The paper presents an improvement of the classical Non-negative Matrix Factorization (NMF) approach for dealing with local representations of image objects. NHF, when applied to global data representations such as faces presents a high ability to represent local features of the original data in an unsupervised way. However, when applied to local representations, NMF generates redundant basis. This work implements an improvement on the original NMF approach by incorporating prior knowledge in the form of a weight matrix extracted from the training data. A detailed mathematical description of the inclusion of this weight matrix is provided, and results demonstrating its advantages are included. Furthermore, the original NMF approach lacks a hierarchy of the elements of the estimated basis. A technique to determine an ordered set of discriminant basis is also presented. Finally, the effectiveness of the weighted approach with respect to the classical approach is experimentally compared. This is done by implementing a clustering algorithm that automatically extracts object parts from the NMF representation of an image database corresponding to newspapers.
David Guillamet, Marco Bressan 0001, Jordi Vitrià
CVPR (1)2