Sciweavers

33 search results - page 2 / 7
» Labeled Partitions and the q-Derangement Numbers
Sort
View
COMBINATORICS
2000
92views more  COMBINATORICS 2000»
13 years 5 months ago
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components
Let n be the fraction of structures of size" n which are connected"; e.g., a the fraction of labeled or unlabeled n-vertex graphshavingone component, b the fraction of p...
Jason P. Bell, Edward A. Bender, Peter J. Cameron,...
CVPR
2009
IEEE
14 years 10 days ago
Automatic facial landmark labeling with minimal supervision
Landmark labeling of training images is essential for many learning tasks in computer vision, such as object detection, tracking, and alignment. Image labeling is typically conduc...
Yan Tong, Xiaoming Liu 0002, Frederick W. Wheeler,...
CATA
2000
13 years 6 months ago
Fast connected component labeling algorithm using a divide and conquer technique
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
June-Me Park, Carl G. Looney, Hui-Chuan Chen
IGARSS
2010
13 years 2 months ago
New hyperspectral data representation using binary partition tree
The optimal exploitation of the information provided by hyperspectral images requires the development of advanced image processing tools. This paper introduces a new hierarchical ...
Silvia Valero, Philippe Salembier, Jocelyn Chanuss...
PPSWR
2005
Springer
13 years 11 months ago
Computational Treatment of Temporal Notions: The CTTN-System
The CTTN-system is a computer program which provides advanced processing or temporal notions. The basic data structures of the CTTN-system are time points, crisp and fuzzy time int...
Hans Jürgen Ohlbach