Optimizing Time-Frequency Distributions for Automatic Classification
نویسندگان
چکیده
An entirely new set of criteria for the design of kernels (generating functions) for time-frequency representations (TFRs) is presented. These criteria aim only to produce kernels (and thus, TFRs) which will enable more accurate classification. We refer to these kernels, which are optimized to discriminate among several classes of signals, as signal class dependent kernels, or simply class dependent kernels.
منابع مشابه
An Improved Automatic EEG Signal Segmentation Method based on Generalized Likelihood Ratio
It is often needed to label electroencephalogram (EEG) signals by segments of similar characteristics that are particularly meaningful to clinicians and for assessment by neurophysiologists. Within each segment, the signals are considered statistically stationary, usually with similar characteristics such as amplitude and/or frequency. In order to detect the segments boundaries of a signal, we ...
متن کاملAn Automatic Fingerprint Classification Algorithm
Manual fingerprint classification algorithms are very time consuming, and usually not accurate. Fast and accurate fingerprint classification is essential to each AFIS (Automatic Fingerprint Identification System). This paper investigates a fingerprint classification algorithm that reduces the complexity and costs associated with the fingerprint identification procedure. A new structural algorit...
متن کاملAn Automatic Fingerprint Classification Algorithm
Manual fingerprint classification algorithms are very time consuming, and usually not accurate. Fast and accurate fingerprint classification is essential to each AFIS (Automatic Fingerprint Identification System). This paper investigates a fingerprint classification algorithm that reduces the complexity and costs associated with the fingerprint identification procedure. A new structural algorit...
متن کاملAutomatic Classification of Positive Time- Frequency Distributions
A method of performing automatic classification of positive time-frequency distributions is presented. These distributions are computed via constrained optimization, minimizing the cross-entropy of the distribution subject to a set of constraints. An algorithm for clustering using cross-entropy as the distance measure between vectors was derived by Shore and Gray [14]. We apply this method to t...
متن کاملOptimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing
Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...
متن کامل