Spelling suggestions: "subject:"local extrema"" "subject:"focal extrema""
1 |
Identification of Push-to-Talk Transmitters Using WaveletsPayal, Yalçin 12 1900 (has links)
The views expressed in this thesis are those of the author and do not reflect the official policy or position of the Department
of Defense or the U.S. Government. / The main objective of this study is to find a wavelet-based, feature extracting algorithm for push-to-talk transmitter
identification. A distance-measure algorithm is introduced to classify signals belonging to one of four transmitters. The
signals are first preprocessed to put them into a form suitable for wavelet analysis. The preprocessing scheme includes
taking the envelopes and differentials. Median filtering is also applied to the outputs of the wavelet transform. The
distance algorithm uses local extrema of the wavelet coefficients, and computes the distance between the local extrema of
a template and the processed signals. A small distance implies high similarity . A signal from each transmitter is selected
as a template. A small distance measure indicates that the signal belongs to the transmitter from which the template
originated. The distance algorithm can classify correctly the four different signal sets provided for the research. Even at
lower signal-to-noise levels, good identification is achieved.
|
2 |
Multispektrální analýza obrazových dat / Multispectral Analyse of Image DataNovotný, Jan January 2009 (has links)
The airborne hyperspectral remote sensing is used as an approach to monitor actual state of environmental components. This thesis covers priority treatment to analyse of hyperspectral data with the aim of a tree crowns delineation. Specific algorithm applying adaptive equalization and the Voronoi diagrams is designed to subdivide a forest area into individual trees. A computer program executes the algorithm and allows testing it on real data, checking and analyzing the results.
|
3 |
Discrete Scale-Space Theory and the Scale-Space Primal SketchLindeberg, Tony January 1991 (has links)
This thesis, within the subfield of computer science known as computer vision, deals with the use of scale-space analysis in early low-level processing of visual information. The main contributions comprise the following five subjects: The formulation of a scale-space theory for discrete signals. Previously, the scale-space concept has been expressed for continuous signals only. We propose that the canonical way to construct a scale-space for discrete signals is by convolution with a kernel called the discrete analogue of the Gaussian kernel, or equivalently by solving a semi-discretized version of the diffusion equation. Both the one-dimensional and two-dimensional cases are covered. An extensive analysis of discrete smoothing kernels is carried out for one-dimensional signals and the discrete scale-space properties of the most common discretizations to the continuous theory are analysed. A representation, called the scale-space primal sketch, which gives a formal description of the hierarchical relations between structures at different levels of scale. It is aimed at making information in the scale-space representation explicit. We give a theory for its construction and an algorithm for computing it. A theory for extracting significant image structures and determining the scales of these structures from this representation in a solely bottom-up data-driven way. Examples demonstrating how such qualitative information extracted from the scale-space primal sketch can be used for guiding and simplifying other early visual processes. Applications are given to edge detection, histogram analysis and classification based on local features. Among other possible applications one can mention perceptual grouping, texture analysis, stereo matching, model matching and motion. A detailed theoretical analysis of the evolution properties of critical points and blobs in scale-space, comprising drift velocity estimates under scale-space smoothing, a classification of the possible types of generic events at bifurcation situations and estimates of how the number of local extrema in a signal can be expected to decrease as function of the scale parameter. For two-dimensional signals the generic bifurcation events are annihilations and creations of extremum-saddle point pairs. Interpreted in terms of blobs, these transitions correspond to annihilations, merges, splits and creations. Experiments on different types of real imagery demonstrate that the proposed theory gives perceptually intuitive results. / <p>QC 20120119</p>
|
Page generated in 0.0671 seconds