ProceedingsIEEE Computer Society, 1997 - Computer vision |
From inside the book
Results 1-3 of 11
Page 29
... node test . The node test uses the knowledge of the similarity measure and the size of the hypercube at any node to calculate a lower bound on the value of the similarity . If the lower bound is greater than the threshold T , then the ...
... node test . The node test uses the knowledge of the similarity measure and the size of the hypercube at any node to calculate a lower bound on the value of the similarity . If the lower bound is greater than the threshold T , then the ...
Page 30
... node test says that if Ha passes the test , then so does H. Property 1 implies that the probability that the node a passes a node test depends only on the hyper- cube associated with the node and is independent of the structure of the ...
... node test says that if Ha passes the test , then so does H. Property 1 implies that the probability that the node a passes a node test depends only on the hyper- cube associated with the node and is independent of the structure of the ...
Page 31
... node a is the parent of ẞ ( Fig . 1 ) . Further , let Q and Q ' represent the average number of node tests in the entire tree before and after elimination respectively . Expressing Q and Q ' with equation ( 3 ) , expanding with equation ...
... node a is the parent of ẞ ( Fig . 1 ) . Further , let Q and Q ' represent the average number of node tests in the entire tree before and after elimination respectively . Expressing Q and Q ' with equation ( 3 ) , expanding with equation ...
Contents
Locating Deciduous Trees | 18 |
Models and Algorithms for Efficient Color Image Indexing | 36 |
Video Invariance Compressed Data | 51 |
Copyright | |
3 other sections not shown
Other editions - View all
Common terms and phrases
algorithm analysis approach average number blob blobworld classify color histogram color indexing components compressed Computer Vision conditional probabilities content-based correlation decision trees defined distance eigenspace eigenvectors Erlang Erlang distribution example images extracted false positives farthest neighbor feature space feature vectors Figure filtering Gabor Filter Gaussian graph graphics hypercube IEEE Computer Image and Video image content image database image index image patch image retrieval image search indexing tree input JPEG k-d tree kd-tree Lm distance luminance matching matrix MCAG measure method metric multi-scale multimedia node test number of node objects orientation parameters performance photographs PicHunter pixel Proc properties QBIC quantization query image rank regions relevance feedback representation retrieve images robots scale scale-space scene score selected semantic shot boundary shot duration shot segmentation similar spatial Swain's Table template texture threshold tion transform user's values visual WebSeer world wide web