504 search results - page 35 / 101 » Canonical Graph Shapes |
ICCV
2007
IEEE
14 years 11 months ago
2007
IEEE
So far global optimization techniques have been developed independently for the tasks of shape matching and image segmentation. In this paper we show that both tasks can in fact b...
BMVC
2010
13 years 7 months ago
2010
Markov random field pixel labelling is often used to obtain image segmentations in which each segment or region is labelled according to its attributes such as colour or texture. ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
ABSTRACT. Reeb graphs provide a method for studying the shape of a manifold by encoding the evolution and arrangement of level sets of a simple Morse function defined on
CORR
2004
Springer
13 years 9 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
IADIS
2008
13 years 11 months ago
2008
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...