In this paper the well-known Markus-Yamabe example [1] is revisited in a more general setting and in light of the Floquet Characteristic Exponent Theory which leads to some interesting and enlightening results. These ...
详细信息
The authors develop a path metric for sequential search based on the linear model. The metric forms the heart of an edge-linking algorithm that combines edge elements enhanced by an optimal filter. From a starting nod...
详细信息
The authors develop a path metric for sequential search based on the linear model. The metric forms the heart of an edge-linking algorithm that combines edge elements enhanced by an optimal filter. From a starting node, transitions are made to the goal nodes by a maximum likelihood metric. This metric requires only local calculations on the search space and its use in edge linking provides more accurate results than other linking techniques.< >
Recently, a very simple nonlinear algorithm, the so-called Teager's algorithm, has been introduced to calculate the energy of a one-dimensional sequence [1]. In this paper, this algorithm is extended to two-dimens...
详细信息
Two types of very simple two-dimensional nonlinear filters are introduced and applied to image contrast enhancement. The first type is based on a generalization of the Teager's algorithm. A theoretical analysis ha...
详细信息
Two types of very simple two-dimensional nonlinear filters are introduced and applied to image contrast enhancement. The first type is based on a generalization of the Teager's algorithm. A theoretical analysis has shown that this type of nonlinear filter works like a local-mean-weighted highpass filter. Based on this analysis, a second type of nonlinear filter has been developed which works like local-mean-weighted bandpass filter. The proposed image contrast enhancement technique is based on combining the original image with its filtered version obtained using one of the two nonlinear filters. Very high quality enhancement has been achieved for natural images.< >
The stability of linear time-varying systems can be assessed using frozen-time eigenvalues (system eigenvalues computed at each instant). The failure of the sufficiency part of this method was illustrated by L. Markus...
详细信息
The stability of linear time-varying systems can be assessed using frozen-time eigenvalues (system eigenvalues computed at each instant). The failure of the sufficiency part of this method was illustrated by L. Markus and M. Yamabe (1960). Their example is examined in a more general setting and in the light of the Floquet characteristic exponent theory which leads to some interesting and enlightening results. These results provide deeper insight into and better understanding of the concept of frozen-time eigenvalues and Floquet characteristic exponents. They are also useful in the robustness analysis for linear time-invariant systems, since the nominal eigenvalues in that case are the frozen-time eigenvalues of the perturbed systems used in such analysis.< >
The controlled pointing of an Earth-orbiting astronomical telescope in the presence of time-dependent gravity-gradient torques is studied using recent techniques for the analysis and synthesis of time-varying linear s...
详细信息
The controlled pointing of an Earth-orbiting astronomical telescope in the presence of time-dependent gravity-gradient torques is studied using recent techniques for the analysis and synthesis of time-varying linear scalar dynamical systems. We present results which show that effective adaptive control of unstable motions due to gravity gradient torques can be accomplished, resulting in high pointing accuracy and stability for astronomical telescopes in both circular and elliptical orbits.
An adaptive VLSI neuroprocessor based on vector quantization algorithm has been developed for real-time high-ratio image compression applications. This VLSI neural-network-based vector quantization (NNVQ) module combi...
详细信息
An adaptive VLSI neuroprocessor based on vector quantization algorithm has been developed for real-time high-ratio image compression applications. This VLSI neural-network-based vector quantization (NNVQ) module combines a fully parallel vector quantizer with a pipelined codebook generator for a broad area of data compression applications. The NNVQ module is capable of producing good-quality reconstructed data at high compression ratios more than 20. The vector quantizer chip has been designed, fabricated, and tested. It contains 64 inner-product neural units and a high-speed extendable winner-take-all block. This mixed-signal chip occupies a compact silicon area of 4.6*6.8 mm/sup 2/ in a 2.0- mu m scalable CMOS technology. The throughput rate of the 2- mu m NNVQ module is 2 million vectors per second and its equivalent computation power is 3.33 billion connections per second.< >
The frequency-sensitive competitive learning (FSCL) algorithm and its associated VLSI neuroprocessor have been developed for adaptive vector quantisation (AVQ). Simulation results show that the FSCL algorithm is capab...
详细信息
The frequency-sensitive competitive learning (FSCL) algorithm and its associated VLSI neuroprocessor have been developed for adaptive vector quantisation (AVQ). Simulation results show that the FSCL algorithm is capable of producing a good-quality codebook for AVQ at high compression ratios of more than 20 in real time. This VLSI neural-network-based vector quantization design includes a fully parallel vector quantizer and a pipelined codebook generator to provide an effective data compression scheme. It provides a computing capability as high as 3.33 billion connections per second. Its performance can achieve a speedup of 750 compared with SUN-3/60 and a compression ratio of 33 at a signal-to-noise ratio of 23.81 dB.< >
We address the problem of reconstructing a smooth curve from sparse and noisy information that is invariant to the choice of the coordinate system. Tikhonov regularization is used to form a well-posed mathematical pro...
详细信息
We address the problem of reconstructing a smooth curve from sparse and noisy information that is invariant to the choice of the coordinate system. Tikhonov regularization is used to form a well-posed mathematical problem statement, and conditions for an invariant reconstruction are given. The resulting functional minimization problem is shown to be nonconvex. Approximations to the invariant functional are often used to form a convex problem that can be solved efficiently. Two common approximations, those of cubic and weighted cubic splines, are detailed, and examples are given to show that the approximations are often invalid. To form a valid approximation to the invariant functional we propose a two-step algorithm. The first step forms a piecewise-linear curve, which is invariant to the coordinate system. This piecewise-linear curve is then used to construct a parameterization of the curve for which we can make a valid approximation to the invariant functional. Examples are given to demonstrate the effectiveness of the algorithm, and two example applications for which the invariant property is important are given.
This paper investigates some approaches for designing one-dimensional linear phase finite-duration impulse-responses (FIR) notch filters, which are based on the modification of several established design techniques of...
详细信息
This paper investigates some approaches for designing one-dimensional linear phase finite-duration impulse-responses (FIR) notch filters, which are based on the modification of several established design techniques of linear phase FIR band-selective filters. Based on extensive design examples and theoretical analysis, formulae have been developed for estimating the length of a linear phase FIR notch filter meeting the given specifications. In addition, the design of two-dimensional linear phase FIR notch filters is briefly considered. Illustrative examples are included.
暂无评论