Sciweavers

3265 search results - page 432 / 653
» Representing Groups on Graphs
Sort
View
ICCV
2005
IEEE
16 years 8 months ago
A Spectral Technique for Correspondence Problems Using Pairwise Constraints
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
Marius Leordeanu, Martial Hebert
ECCV
2004
Springer
16 years 8 months ago
Face Recognition with Local Binary Patterns
In this work, we present a novel approach to face recognition which considers both shape and texture information to represent face images. The face area is first divided into small...
Abdenour Hadid, Matti Pietikäinen, Timo Ahone...
ECCV
2006
Springer
16 years 8 months ago
Automatic Image Segmentation by Positioning a Seed
We present a method that automatically partitions a single image into non-overlapping regions coherent in texture and colour. An assumption that each textured or coloured region ca...
Branislav Micusík, Allan Hanbury
ICML
2006
IEEE
16 years 7 months ago
Pachinko allocation: DAG-structured mixture models of topic correlations
Latent Dirichlet allocation (LDA) and other related topic models are increasingly popular tools for summarization and manifold discovery in discrete data. However, LDA does not ca...
Wei Li, Andrew McCallum
ICCD
2002
IEEE
101views Hardware» more  ICCD 2002»
16 years 3 months ago
Improving the Efficiency of Circuit-to-BDD Conversion by Gate and Input Ordering
Boolean functions are fundamental to synthesis and verification of digital logic, and compact representations of Boolean functions have great practical significance. Popular repre...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah