Marcello Pelillo

Francesc Serratosa

Proceedings of the 21st International Conference on Pattern Recognition, 2012

Structured Local Predictors for image labelling.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition, 2012

2011

Content-based image retrieval with relevance feedback using random walks.

[BibT_eX]

[DOI]

Massimo Rabbi

Pattern Recognit., 2011

Graph-based quadratic optimization: A fast evolutionary approach.

[BibT_eX]

[DOI]

Comput. Vis. Image Underst., 2011

Structured class-labels in random forests for semantic image labelling.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Computer Vision, 2011

Graph Transduction as a Non-cooperative Game.

[BibT_eX]

[DOI]

Aykut Erdem

Proceedings of the Graph-Based Representations in Pattern Recognition, 2011

Semantic Image Labelling as a Label Puzzle Game.

[BibT_eX]

[DOI]

Proceedings of the British Machine Vision Conference, 2011

2010

A New Spectral Bound on the Clique Number of Graphs.

[BibT_eX]

[DOI]

Proceedings of the Structural, 2010

Pairwise Probabilistic Clustering Using Evidence Accumulation.

[BibT_eX]

[DOI]

Proceedings of the Structural, 2010

Fast Population Game Dynamics for Dominant Sets and Other Quadratic Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Structural, 2010

Probabilistic Clustering Using the Baum-Eagon Inequality.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Pattern Recognition, 2010

2009

Replicator Dynamics in Combinatorial Optimization.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Heuristics for Maximum Clique and Independent Set.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

A generalization of the Motzkin-Straus theorem to hypergraphs.

[BibT_eX]

[DOI]

Optim. Lett., 2009

A game-theoretic approach to partial clique enumeration.

[BibT_eX]

[DOI]

Image Vis. Comput., 2009

From Cliques to Equilibria: The Dominant-Set Framework for Pairwise Data Clustering.

[BibT_eX]

Proceedings of the Pattern Recognition in Information Systems, 2009

New Bounds on the Clique Number of Graphs Based on Spectral Hypergraph Theory.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization, Third International Conference, 2009

Matching as a non-cooperative game.

[BibT_eX]

[DOI]

Proceedings of the IEEE 12th International Conference on Computer Vision, ICCV 2009, Kyoto, Japan, September 27, 2009

Hierarchical Pairwise Segmentation Using Dominant Sets and Anisotropic Diffusion Kernels.

[BibT_eX]

[DOI]

Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition, 2009

2008

Consensus Graphs for Symmetry Plane Estimation.

[BibT_eX]

[DOI]

Andrea Albarelli

Sebastiano Viviani

Proceedings of the Structural, 2008

Beyond partitions: Allowing overlapping groups in pairwise clustering.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Pattern Recognition (ICPR 2008), 2008

A hypergraph-based approach to affine parameters estimation.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Pattern Recognition (ICPR 2008), 2008

2007

Dominant Sets and Pairwise Clustering.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 2007

A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization, Second International Conference, 2007

Integrating Boundary Information in Pairwise Segmentation.

[BibT_eX]

[DOI]

Marco Di Gesu

Proceedings of the 14th International Conference on Image Analysis and Processing (ICIAP 2007), 2007

Matching Relational Structures using the Edge-Association Graph.

[BibT_eX]

[DOI]

Andrea Albarelli

Proceedings of the 14th International Conference on Image Analysis and Processing (ICIAP 2007), 2007

A Continuous-Based Approach for Partial Clique Enumeration.

[BibT_eX]

[DOI]

Proceedings of the Graph-Based Representations in Pattern Recognition, 2007

Szemerédi's Regularity Lemma and Its Applications to Pairwise Clustering and Segmentation.

[BibT_eX]

[DOI]

Anna Sperotto

Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition, 2007

2006

Similarity-based pattern recognition.

[BibT_eX]

[DOI]

Pattern Recognit., 2006

Payoff-Monotonic Game Dynamics and the Maximum Clique Problem.

[BibT_eX]

[DOI]

Neural Comput., 2006

Graph polynomials from principal pivoting.

[BibT_eX]

[DOI]

Discret. Math., 2006

Grouping with Asymmetric Affinities: A Game-Theoretic Perspective.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2006), 2006

2005

Polynomial-Time Metrics for Attributed Trees.

[BibT_eX]

[DOI]

Dzena Hidovic Rowe

IEEE Trans. Pattern Anal. Mach. Intell., 2005

Spatio-temporal Segmentation Using Dominant Sets.

[BibT_eX]

[DOI]

Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition, 2005

2004

The combinatorics of pivoting for the maximum weight clique.

[BibT_eX]

[DOI]

Marco Locatelli

Oper. Res. Lett., 2004

Metrics For Attributed Graphs Based On The Maximal Similarity Common Subgraph.

[BibT_eX]

[DOI]

Dzena Hidovic

Int. J. Pattern Recognit. Artif. Intell., 2004

Matching Segmentation Hierarchies.

[BibT_eX]

[DOI]

Walter G. Kropatsch

Int. J. Pattern Recognit. Artif. Intell., 2004

Fast Dominant-Set Clustering.

[BibT_eX]

[DOI]

Proceedings of the Biological and Artificial Intelligence Environments, 2004

Efficient Out-of-Sample Extension of Dominant-Set Clusters.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 17 [Neural Information Processing Systems, 2004

Four Metrics for Efficiently Comparing Attributed Trees.

[BibT_eX]

[DOI]

Dzena Hidovic

Proceedings of the 17th International Conference on Pattern Recognition, 2004

Relaxation Labeling Processes for Protein Secondary Structure Prediction.

[BibT_eX]

[DOI]

Giacomo Colle

Proceedings of the 17th International Conference on Pattern Recognition, 2004

Efficiently Segmenting Images with Dominant Sets.

[BibT_eX]

[DOI]

Proceedings of the Image Analysis and Recognition: International Conference, 2004

A Polynomial-Time Metric for Attributed Trees.

[BibT_eX]

[DOI]

Dzena Hidovic

Proceedings of the Computer Vision, 2004

2003

Matching graphs by pivoting.

[BibT_eX]

[DOI]

Alessio Massaro

Pattern Recognit. Lett., 2003

Guest Editors' Introduction to the Special Section on Energy Minimization Methods in Computer Vision and Pattern Recognition.

[BibT_eX]

[DOI]

Mário A. T. Figueiredo

Edwin R. Hancock

Josiane Zerubia

IEEE Trans. Pattern Anal. Mach. Intell., 2003

Image Segmentation by Dominant Sets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

Unsupervised texture segmentation by dominant sets and game dynamics.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Image Analysis and Processing (ICIAP 2003), 2003

Hierarchical matching of panoramic images.

[BibT_eX]

[DOI]

Walter G. Kropatsch

Proceedings of the 12th International Conference on Image Analysis and Processing (ICIAP 2003), 2003

Dominant Sets and Hierarchical Clustering.

[BibT_eX]

[DOI]

Proceedings of the 9th IEEE International Conference on Computer Vision (ICCV 2003), 2003

Graph Polynomials, Principal Piovoting, and Maximum Independent Sets.

[BibT_eX]

[DOI]

Proceedings of the Graph Based Representations in Pattern Recognition, 2003

Swap Strategies for Graph Matching.

[BibT_eX]

[DOI]

Proceedings of the Graph Based Representations in Pattern Recognition, 2003

Generalizing the Motzkin-Straus Theorem to Edge-Weighted Graphs, with Applications to Image Segmentation.

[BibT_eX]

[DOI]

Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition, 2003

Graph-Theoretic Approach to Clustering and Segmentation.

[BibT_eX]

[DOI]

Proceedings of the 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2003), 2003

Pairwise Data Clustering Using Monotone Game Dynamics.

[BibT_eX]

[DOI]

Proceedings of the AI*IA 2003: Advances in Artificial Intelligence, 2003

2002

A Complementary Pivoting Approach to the Maximum Weight Clique Problem.

[BibT_eX]

[DOI]

Alessio Massaro

SIAM J. Optim., 2002

Matching Free Trees, Maximal Cliques, and Monotone Game Dynamics.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 2002

Annealed replication: a new heuristic for the maximum clique problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

2001

Introduction to the Special Section on Graph Algorithms in Computer Vision.

[BibT_eX]

[DOI]

Sven J. Dickinson

Ramin Zabih

IEEE Trans. Pattern Anal. Mach. Intell., 2001

Payoff-monotonic Game Dynamics for the Maximum Clique Problem.

[BibT_eX]

[DOI]

Claudio Rossi

Proceedings of the 12th Italian Workshop on Neural Nets, 2001

Matching Free Trees with Replicator Equations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 14 [Neural Information Processing Systems: Natural and Synthetic, 2001

Many-to-many Matching of Attributed Trees Using Association Graphs and Game Dynamics.

[BibT_eX]

[DOI]

Kaleem Siddiqi

Steven W. Zucker

Proceedings of the Visual Form 2001, 4th International Workshop on Visual Form, 2001

Evolutionary Game Dynamics in Combinatorial Optimization: An Overview.

[BibT_eX]

[DOI]

Proceedings of the Applications of Evolutionary Computing, 2001

A Complementary Pivoting Approach to Graph Matching.

[BibT_eX]

[DOI]

Alessio Massaro

Proceedings of the Energy Minimization Methods in Computer Vision and Pattern Recognition, 2001

2000

Approximating the maximum weight clique using replicator dynamics.

[BibT_eX]

[DOI]

Volker Stix

IEEE Trans. Neural Networks Learn. Syst., 2000

Continuous-time relaxation labeling processes.

[BibT_eX]

[DOI]

Pattern Recognit., 2000

A New Deterministic Annealing Algorithm for Maximum Clique.

[BibT_eX]

[DOI]

Arun Jagota

Anand Rangarajan

Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks, 2000

Attributed Tree Homomorphism Using Association Graphs.

[BibT_eX]

[DOI]

Proceedings of the 15th International Conference on Pattern Recognition, 2000

1999

Matching Hierarchical Structures Using Association Graphs.

[BibT_eX]

[DOI]

Kaleem Siddiqi

Steven W. Zucker

IEEE Trans. Pattern Anal. Mach. Intell., 1999

Replicator Equations, Maximal Cliques, and Graph Isomorphism.

[BibT_eX]

[DOI]

Neural Comput., 1999

Attributed Tree Matching and Maximum Weight Cliques.

[BibT_eX]

[DOI]

Kaleem Siddiqi

Steven W. Zucker

Proceedings of the 1oth International Conference on Image Analysis and Processing (ICIAP 1999), 1999

The Maximum Clique Problem.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Combinatorial Optimization, 1999

1998

A Bayesian interpretation for the exponential correlation associative memory.

[BibT_eX]

[DOI]

Edwin R. Hancock

Pattern Recognit. Lett., 1998

A unifying framework for relational structure matching.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Conference on Pattern Recognition, 1998

1997

An iterative pruning algorithm for feedforward neural networks.

[BibT_eX]

[DOI]

Giovanna Castellano

IEEE Trans. Neural Networks, 1997

Autoassociative learning in relaxation labeling networks.

[BibT_eX]

[DOI]

Pattern Recognit. Lett., 1997

The Dynamics of Nonlinear Relaxation Labeling Processes.

[BibT_eX]

[DOI]

J. Math. Imaging Vis., 1997

1996

A Relaxation Algorithm for Estimating the Domain of Validity of Feedforward Neural Networks.

[BibT_eX]

[DOI]

Neural Process. Lett., 1996

Parallelizable Evolutionary Dynamics Principles for Solving the Maximum Clique Problem.

[BibT_eX]

[DOI]

Proceedings of the Parallel Problem Solving from Nature, 1996

An analysis of the exponential correlation associative memory.

[BibT_eX]

[DOI]

Edwin R. Hancock

Proceedings of the 13th International Conference on Pattern Recognition, 1996

1995

An evolutionary approach to training relaxation labeling processes.

[BibT_eX]

[DOI]

Fabio Abbattista

Angelo Maffione

Pattern Recognit. Lett., 1995

Iterative pruning in second-order recurrent neural networks.

[BibT_eX]

[DOI]

Giovanna Castellano

Neural Process. Lett., 1995

Teaching Relaxation Labeling Processes Using Genetic Algorithms.

[BibT_eX]

[DOI]

Fabio Abbattista

Angelo Maffione

Proceedings of the Artificial Neural Nets and Genetic Algorithms, 1995

An asymmetric associative memory model based on relaxation labeling processes.

[BibT_eX]

[DOI]

Proceedings of the 3rd European Symposium on Artificial Neural Networks, 1995

Clique Finding Relaxation Labeling Networks.

[BibT_eX]

[DOI]

Proceedings of the Recent Developments in Computer Vision, 1995

1994

Learning Compatibility Coefficients for Relaxation Labeling Processes.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 1994

Nonlinear relaxation labeling as growth transformation.

[BibT_eX]

[DOI]

Proceedings of the 12th IAPR International Conference on Pattern Recognition, 1994

1993

A Method of Pruning Layered Feed-Forward Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the New Trends in Neural Computation, 1993

Evolutionary Learning for Relaxation Labeling Processes.

[BibT_eX]

[DOI]

Fabio Abbattista

Angelo Maffione

Proceedings of the Advances in Artificial Intelligence, 1993

1992

Learning compatibility coefficients for word-class disambiguation relaxation processes.

[BibT_eX]

[DOI]

Proceedings of the Second International Conference on Spoken Language Processing, 1992

Probabilistic prediction of parts-of-speech from word spelling using decision trees.

[BibT_eX]

[DOI]

Franca Moro

Proceedings of the Second International Conference on Spoken Language Processing, 1992

An optimization algorithm for determining the compatibility coefficients of relaxation labeling processes.

[BibT_eX]

[DOI]

Proceedings of the 11th IAPR International Conference on Pattern Recognition, 1992

1991

Syntactic category disambiguation through relaxation processes.

[BibT_eX]

[DOI]