Sciweavers

14 search results - page 1 / 3
» Raising in watershed lattices
Sort
View
ICIP
2008
IEEE
13 years 11 months ago
Raising in watershed lattices
The watershed segmentation is a popular tool in image processing. Starting from an initial map, the border thinning transformation produces a map whose minima constitute the catch...
Jean Cousty, Laurent Najman, Jean Serra
EMMCVPR
2003
Springer
13 years 9 months ago
Watershed-Based Unsupervised Clustering
In this paper, a novel general purpose clustering algorithm is presented, based on the watershed algorithm. The proposed approach defines a density function on a suitable lattice,...
Manuele Bicego, Marco Cristani, Andrea Fusiello, V...
JMIV
1998
93views more  JMIV 1998»
13 years 4 months ago
Connectivity on Complete Lattices
Classically, connectivity is a topological notion for sets, often introduced by means of arcs. A non topological axiomatics has been proposed by Matheron and Serra. The present pa...
Jean Serra
CADE
2007
Springer
14 years 4 months ago
Logical Interpretation: Static Program Analysis Using Theorem Proving
Abstract. This paper presents the foundations for using automated deduction technology in static program analysis. The central principle is the use of logical lattices ? a class of...
Ashish Tiwari, Sumit Gulwani
COMBINATORICS
2002
85views more  COMBINATORICS 2002»
13 years 4 months ago
Parking Functions of Types A and B
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parki...
Philippe Biane