Sciweavers

52 search results - page 3 / 11
» Representing and Retrieving Regions Using Binary Partition T...
Sort
View
CAD
2008
Springer
13 years 7 months ago
Improved Binary Space Partition merging
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
Mikola Lysenko, Roshan D'Souza, Ching-Kuan Shene
ICIP
2004
IEEE
14 years 9 months ago
Shape-adaptive coding using binary set splitting with k-d trees
The binary set splitting with k-d trees (BISK) algorithm is introduced. An embedded wavelet-based image coder based on the popular bitplane-coding paradigm, BISK is designed speci...
James E. Fowler
ISBI
2004
IEEE
14 years 8 months ago
Search Space Partitioning Using Convex Hull and Concavity Features for Fast Medical Image Retrieval
A new approach is presented for partitioning an image database by classifying and indexing the convex hull shapes and the number of region concavities. The result is a significant...
Phillip Mlsna, Nikolay Sirakov
MM
2003
ACM
165views Multimedia» more  MM 2003»
14 years 18 days ago
Video retrieval using spatio-temporal descriptors
This paper describes a novel methodology for implementing video search functions such as retrieval of near-duplicate videos and recognition of actions in surveillance video. Video...
Daniel DeMenthon, David S. Doermann
ICTAI
2003
IEEE
14 years 18 days ago
Approximate Discrete Probability Distribution Representation Using a Multi-Resolution Binary Tree
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
David Bellot, Pierre Bessière