Sciweavers

2969 search results - page 54 / 594
» A space efficient algorithm for group structure computation
Sort
View
ICIP
2006
IEEE
16 years 4 months ago
Efficient 2-D Gray-Scale Dilations and Erosions with Arbitrary Flat Structuring Elements
An efficient algorithm is presented for the computation of gray-scale morphological operations with 2-D structuring elements (S.E.). The required computing time is independent of ...
Erik R. Urbach, Michael H. F. Wilkinson

Book
412views
17 years 2 months ago
Algorithms for Clustering Data
"Cluster analysis is an important technique in the rapidly growing field known as exploratory data analysis and is being applied in a variety of engineering and scientific dis...
A. K. Jain, R. C. Dubes
ICIP
2005
IEEE
16 years 4 months ago
Joint feature-spatial-measure space: a new approach to highly efficient probabilistic object tracking
In this paper we present a probabilistic framework for tracking objects based on local dynamic segmentation. We view the segn to be a Markov labeling process and abstract it as a ...
Feng Chen, XiaoTong Yuan, ShuTang Yang
ICDE
2006
IEEE
124views Database» more  ICDE 2006»
16 years 4 months ago
C-Cubing: Efficient Computation of Closed Cubes by Aggregation-Based Checking
It is well recognized that data cubing often produces huge outputs. Two popular efforts devoted to this problem are (1) iceberg cube, where only significant cells are kept, and (2...
Dong Xin, Zheng Shao, Jiawei Han, Hongyan Liu
ICCV
2005
IEEE
16 years 5 months ago
Is Levenberg-Marquardt the Most Efficient Optimization Algorithm for Implementing Bundle Adjustment?
In order to obtain optimal 3D structure and viewing parameter estimates, bundle adjustment is often used as the last step of feature-based structure and motion estimation algorith...
Manolis I. A. Lourakis, Antonis A. Argyros