Investigates the application of 2D IIR digital filters for deinterlacing of video signals. A special class of diamond filters is presented, which employs only two coefficients and has approximately zero-phase response...
详细信息
Investigates the application of 2D IIR digital filters for deinterlacing of video signals. A special class of diamond filters is presented, which employs only two coefficients and has approximately zero-phase response. The implementation of this filter is very efficient and the stability is guaranteed even under finite arithmetic conditions. This filter is tested with a group of sequences. Very promising results are obtained.< >
Time-frequency distributions are two-dimensional functions that indicate the time-varying frequency content of one-dimensional signals. Each bilinear time-frequency distribution corresponds to a kernel function that c...
详细信息
Time-frequency distributions are two-dimensional functions that indicate the time-varying frequency content of one-dimensional signals. Each bilinear time-frequency distribution corresponds to a kernel function that controls its cross-component suppression properties. Current distributions rely on fixed kernels, which limit the class of signals for which a given distribution performs well. In this paper, we propose a signal-dependent kernel that changes shape for each signal to offer improved time-frequency representation for a large class of signals. The kernel design procedure is based on quantitative optimization criteria and two-dimensional functions that are Gaussian along radial profiles. We develop an efficient scheme based on Newton's algorithm for finding the optimal kernel;the cost of computing the signal-dependent time-frequency distribution is close to that of fixed-kernel methods. Examples using both synthetic and real-world multi-component signals demonstrate the effectiveness of the signal-dependent approach - even in the presence of substantial additive noise. An attractive feature of this technique is the ease with which application-specific knowledge can be incorporated into the kernel design procedure.
The problem of image decompression is cast as an ill-posed inverse problem, and a stochastic regularization technique is used to form a well-posed reconstruction algorithm. A statistical model for the image which inco...
详细信息
The problem of image decompression is cast as an ill-posed inverse problem, and a stochastic regularization technique is used to form a well-posed reconstruction algorithm. A statistical model for the image which incorporates the convex Huber minimax function is proposed. The use of the Huber minimax function rho T(.) helps to maintain the discontinuities from the original image which produces high-resolution edge boundaries. Since rho T(.) is convex, the resulting multidimensional minimization problem is a constrained convex optimization problem. The maximum a posteriori (MAP) estimation technique that is proposed results in the constrained optimization of a convex functional. The proposed image decompression algorithm produces reconstructed images which greatly reduced the noticeable artifacts which exist using standard techniques.< >
It is shown that, using grayscale morphology and a set of functions related to orthogonal polynomials-defined on a window-as structuring elements, a signal representation analogous to the polynomial transform can be d...
详细信息
It is shown that, using grayscale morphology and a set of functions related to orthogonal polynomials-defined on a window-as structuring elements, a signal representation analogous to the polynomial transform can be developed. The geometric decomposition of a signal is achieved by windowing and using a morphological opening operation to approximate the windowed signal with each of the structuring elements. The resulting representation is made to resemble an orthogonal expansion by constraining the result of opening to be equal to the structuring function. Properties of the recursive decomposition algorithm make it possible to develop an algorithm for calculating a set of coefficients used in the reconstruction. The analysis and synthesis of one-dimensional signals are illustrated with an image data compression example.< >
To achieve real-time performance in estimating the higher order statistics directly from the incoming time-series data, it is necessary to (a) design faster algorithms by reducing any inherent computational redundancy...
详细信息
To achieve real-time performance in estimating the higher order statistics directly from the incoming time-series data, it is necessary to (a) design faster algorithms by reducing any inherent computational redundancy, and (b) apply parallel processing and pipelining. The authors present a VLSI implementable parallel architecture that computes in order recursive fashion estimates of all the higher order moments and cumulants up to the fourth order, at one of their non-redundant domains of support. The system consists of a tri-array and a farm of processors producing the moment terms and fourth order cumulants respectively. They have applied a systematic array synthesis methodology that guarantees the optimality of both arrays, as well as the appropriate interface between them, so that intermediate data movement and delays are minimized while achieving maximum output throughput.< >
For real-time radar processing, it is very desirable to have an algorithm that does not assume restricted statistics of the input data and can be implemented for high-speed processing (without a high cost) to meet rea...
详细信息
For real-time radar processing, it is very desirable to have an algorithm that does not assume restricted statistics of the input data and can be implemented for high-speed processing (without a high cost) to meet real-time requirements. We therefore apply the QR decomposition-based least-squares method for linear prediction to the problem of computing the reflection coefficients of a lattice predictor, instead of using the conventional Burg algorithm. We also propose a modified one-dimensional ring architecture for implementing the QR method of least-squares. The particular application considered in this case is that of surveillance radar systems for air traffic control.< >
To achieve real-time performance in signalprocessing applications that require the adaptive estimation of higher order statistics, it is necessary to (a) design new time-recursive algorithms and (b) introduce paralle...
详细信息
To achieve real-time performance in signalprocessing applications that require the adaptive estimation of higher order statistics, it is necessary to (a) design new time-recursive algorithms and (b) introduce parallel processing and pipelining. Time-recursive estimation methods of the computation of the higher order moments from the incoming sampled data are presented. The fixed size sliding window estimation algorithm is mapped onto an optimal linear array. The array provides estimates of all the moments up to the fourth order in time- and order-recursive fashion, achieves minimum latency and is suitable for VLSI implementation. A systematic synthesis methodology facilitates the construction of the optimal locally recursive algorithm and the design of the architecture.< >
To achieve real-time performance in signalprocessing applications that require the estimation of higher order statistics, it is necessary to introduce parallel processing and pipelining. The authors present a two sta...
详细信息
To achieve real-time performance in signalprocessing applications that require the estimation of higher order statistics, it is necessary to introduce parallel processing and pipelining. The authors present a two stage VLSI architecture for the computation of all the non-negative lags of the cumulants of a real, one-dimensional data sequence. All the non-negative lags of the moments, up to the fourth order, are computed first by a triangular array, based on the indirect block-type estimation approach (C. L. Nikias and M. R. Roghuveer, 1987). The second and fourth order moments are then used to compute the fourth order cumulants using additional processors. A systematic algorithm-to-architectures synthesis methodology facilitated the design of both parts of the architecture and their optimal space and data flow matching.< >
An algorithm for converting relay ladder logic (RLL) programs for programmable logic controllers (PLCs) into sequential function chart (SFC) programs is introduced. Since an SFC (a standardization of Grafcet) better r...
详细信息
作者:
M.W. TwiggsD.B. KochCommunications
Infod Signal Proc Department of Electrical and Computer Engineering University of Tennessee Knoxville TN USA Communications
Information and Signal Processing (CISP) Group Department of Electrical and Computer Engineering University of Tennessee Knoxville TN USA
A DS/CDMA (direct-sequence code division multiple access) system using BPSK (binary phase shift keying) modulation is simulated to determine the bit error probabilities for various numbers of users with a processing g...
详细信息
A DS/CDMA (direct-sequence code division multiple access) system using BPSK (binary phase shift keying) modulation is simulated to determine the bit error probabilities for various numbers of users with a processing gain close to that of a cellular network. The results are compared to results obtained using the Gaussian approximation equations. The results obtained are to the feasibility of a DS/CDMA cellular network. It is concluded that DS/CDMA cellular networks appear to offer higher subscriber capacities than existing analog or TDMA (time division multiple access) formats. In addition, DS/CDMA offers additional advantages such as inherent privacy through the use of spreading codes and the ability to combat problems such as multipath fading and narrowband noise.< >
暂无评论