Given a metric space (K, d), the hyperspace of K is defined by H(K) = {F c K: F is compact, F ≠ 0}. H(K) is itself a metric space under the Hausdorff metric dH. Hyperspaces have been extensively studied by topologists since the 1970's, but the...
Pattern perception--Data processing; Pattern recognition systems; Land mines--Detection; Data mining
For complex detection and classification problems, involving data with large intra-class variations and noisy inputs, no single source of information can provide a satisfactory solution. As a result, combination of multiple classifiers is playing...
