We are presenting an extension to the classic multiple signal classification method (MUSIC) developed by Schmidt and Bienvenu in 1979.(1) While the classic MUSIC algorithm is limited to the detection of constant frequ...
详细信息
ISBN:
(纸本)0819463922
We are presenting an extension to the classic multiple signal classification method (MUSIC) developed by Schmidt and Bienvenu in 1979.(1) While the classic MUSIC algorithm is limited to the detection of constant frequency sinusoids in white noise, the proposed new method is capable of detecting signals with a continuously varying instantaneous frequency. The method is based on the development of a discrete-time version of the generalized scale transform (GST) which was introduced by Nickel and Williams in 1999.(2) As a byproduct we obtain techniques for discrete-time warp-shift invariant filtering which can be used in addition to the signal detection to separate signals with different instantaneous frequency contours.
Detection and tracking of pedestrians in vast crowded areas is a complex problem addressed actively by the computer vision community. Proposed algorithms should ideally tackle issues of accuracy and speed at the same ...
详细信息
ISBN:
(纸本)9781538692943
Detection and tracking of pedestrians in vast crowded areas is a complex problem addressed actively by the computer vision community. Proposed algorithms should ideally tackle issues of accuracy and speed at the same time. Lengthy computation times for high-quality optimization-based algorithms relying on multiple sensors make them impractical to use on long and detailed sequences. Hence, an efficient acceleration scheme, which preserves the overall accuracy, is vital to be considered. In the current work, we iterate various steps taken to accelerate a multi-camera pedestrian detection algorithm formulated as an optimization of a height map with local scene geometry constraints. The work is performed using the NVIDIA CUDA framework which allows us to efficiently utilize GPU processors and optimize the various memory accesses. The final results show more than 1000x speedup on real data frames. With respect to preserving the output accuracy, we achieve an accelerated output which is more than 99.9% in agreement with the original results.
We are presenting a new method for super resolution tracking of frequency modulated sinusoids in white noise. The method is specifically designed to handle the rapid transient problem, i.e. the problem of tracking a c...
详细信息
ISBN:
(纸本)9780819468451
We are presenting a new method for super resolution tracking of frequency modulated sinusoids in white noise. The method is specifically designed to handle the rapid transient problem, i.e. the problem of tracking a continuous, rapidly changing instantaneous frequency contour. The proposed method employs to components: 1) an adaptive generalized scale transform 1, 2 which applies a localized change of time-frequency coordinates within the given signal, and 2) an estimation of signal parameters by rotational invariance techniques 3 (ESPRIT). With experiments we have shown that the proposed method provides a significantly higher estimation accuracy than conventional methods. 3 With an optimal choice of transform parameters the estimation error can be reduced dramatically. Error reductions of over 40% have been observed.
The Jacobi method for singular value decomposition is well-suited for parallel architectures. Its application to signal subspace computations is well known. Basically the subspace spanned by singular vectors of large ...
详细信息
ISBN:
(纸本)0819425842
The Jacobi method for singular value decomposition is well-suited for parallel architectures. Its application to signal subspace computations is well known. Basically the subspace spanned by singular vectors of large singular values are separated from subspace spanned by those of small singular values. The Jacobi algorithm computes the singular values and the corresponding vectors in random order. This requires sorting the result after convergence of the algorithm to select the signal subspace. A modification of the Jacobi method based on a linear objective function merges the sorting into the SVD-algorithm at little extra cost. In fact, the complexity of the diagonal processor cells in a triangular array get slightly larger. In this paper we present these extensions, in particular the modified algorithm for computing the rotation angles and give an example of its usefulness for subspace separation.
The use of the probability density distribution of random processes leads to certain difficulties in the implementation of signalprocessingalgorithms, especially for processing non-Gaussian processes. One of the adv...
详细信息
In this paper, we present a new class of representations of signals in the time-frequency (TF) plane. These representations are complex valued, linear, and satisfy reconstruction conditions in which the signal and its...
详细信息
ISBN:
(纸本)0819429163
In this paper, we present a new class of representations of signals in the time-frequency (TF) plane. These representations are complex valued, linear, and satisfy reconstruction conditions in which the signal and its complex spectrum may be uniquely reconstructed from their TF representation. These surfaces are generalizations of one-dimensional linear transforms with which they share many properties.. The primary advantage of these representations is that the phase of the surface may be used to recover signal information which is not contained in real TF surfaces. Linearity guarantees that cross-terms normally associated with TF distributions do not exist in these representations. Several examples of invertible surfaces are presented, and it is demonstrated that these surfaces agree with normal intuition. Finally, a method, based on the phase gradient, is proposed as a method of modifying Fourier surfaces to produce representations which are more focused or more concentrated in time and frequency.
Given the moments of a time-frequency distribution, one can, in principle, construct the characteristic function from which one then obtains the distribution by Fourier transformation. However, often one can not find ...
详细信息
ISBN:
(纸本)9780819468451
Given the moments of a time-frequency distribution, one can, in principle, construct the characteristic function from which one then obtains the distribution by Fourier transformation. However, often one can not find a closed form for the characteristic function and hence one can not obtain the distribution in a direct manner. We formulate the problem of constructing time-frequency representations from moments without first constructing the characteristic function. Our method is based on expanding the distribution in terms of a complete set of functions where the expansion coefficients are dependent directly on the moments. We apply the method to a case where the even moments are manifestly positive which is a necessary condition for obtaining a proper time-frequency representation.
We consider the identification of nonlinear systems when the excitation is a non-Gaussian process. Closed from expressions are found for a class of nonlinear time-invariant as well as for time-varying systems which ar...
详细信息
ISBN:
(纸本)0819419222
We consider the identification of nonlinear systems when the excitation is a non-Gaussian process. Closed from expressions are found for a class of nonlinear time-invariant as well as for time-varying systems which are excited by stationary and nonstationary inputs, respectively. The nonlinear model used represents a subset of the Volterra series, judiciously chosen so that closed form expressions can be resolved for non-Gaussian inputs. Nonlinear coherence functions are also derived in closed form. Estimation issues are discussed. Two examples are given to illustrate the general results.
The problem of kernel design for Cohen time-frequency distributions is formulated as a blind deconvolution problem. It is shown that the iterative blind deconvolution method (IBDM) used in image restoration problems c...
详细信息
ISBN:
(纸本)0819450782
The problem of kernel design for Cohen time-frequency distributions is formulated as a blind deconvolution problem. It is shown that the iterative blind deconvolution method (IBDM) used in image restoration problems can be successfully applied to solve the kernel design problem. We obtain the following results: (1) the rate of convergence depends on which domains the constraints are imposed (2) certain constraints are needed for algorithm convergence (3) the more constrained the kernel design is, the faster the rate of convergence (4) there are tradeoffs between constraints, e.g., compact support vs. satisfaction of marginals;(5) time-frequency distributions which are more amenable to visual interpretation can be obtained using this algorithm.
Satellite communication plays an important role in the global connection for its large coverage and stability against the terrestrial disaster. Usually the on-board signal processor is customized for the satellite whi...
详细信息
ISBN:
(纸本)9781538636282
Satellite communication plays an important role in the global connection for its large coverage and stability against the terrestrial disaster. Usually the on-board signal processor is customized for the satellite which it is implemented on, with high processing ability but also with high construction cost and difficulty of reconfiguration. Thus a reconfigurable on-board processor is required to fulfill the demand of more frequent and periodic configuration update. This paper presents a computing task allocation scheme based on general purpose processor (GPP)-digital signal processor (DSP) signalprocessing system, in which GPP handles the generic algorithms such as channel coding, modulation, time and frequency synchronization while DSP is in charge of special mathematic operations. We first introduce a low earth orbit (LEO) orthogonal frequency division multiplexing (OFDM) satellite physical layer system as an example with an analysis of the system's calculation characteristics. After that, a computing task allocation scheme corresponding to the system is derived based on the computation characteristic of all the modules in the system. Finally, the processing time with and without the scheme algorithm is tested on a system consist of a PC and a DSP board. Experiment results show that the processing time of the DSP-GPP system is shortened using the proposed scheme, compared to the GPP-only system without the task allocation scheme.
暂无评论