A technique to guide landmark matching known as hopping dynamic programming is described. The location of the model in the scene is estimated with a least-squares fit. A heuristic measure is then computed to decide if...
详细信息
A technique to guide landmark matching known as hopping dynamic programming is described. The location of the model in the scene is estimated with a least-squares fit. A heuristic measure is then computed to decide if the model is in the scene. The shape features of an object are the landmarks associated with the object. The landmarks of an object are defined as the points of interest of the object that have important shape attributes. Examples of landmarks are corners, holes, protrusions, and high-curvature points.< >
A statistical analysis of the estimates of the damping factor of a single complex exponential in additive white Gaussian noise is presented. The analysis is done for two of the more popular methods, namely, the system...
详细信息
A statistical analysis of the estimates of the damping factor of a single complex exponential in additive white Gaussian noise is presented. The analysis is done for two of the more popular methods, namely, the system identification method of principal Hankel components (PHC) and the Tufts-Kumaresan (TK) method of linear prediction. Assuming a high signal-to-noise ratio, closed form expressions for the variances of the damping factor are derived. These analytical solutions are confirmed with computer simulations. The analysis indicates that both the TK method and the PHC method perform well in comparison to the Cramer-Rao bound. Theoretically, however, the PHC method slightly outperforms the TK method.< >
In adaptive IIR (infinite impulse response) filtering, gradient search techniques minimize the mean-square output error (MSOE). The uniqueness of the minimum MSOE estimate for exactly matching adaptive filters is a ne...
详细信息
In adaptive IIR (infinite impulse response) filtering, gradient search techniques minimize the mean-square output error (MSOE). The uniqueness of the minimum MSOE estimate for exactly matching adaptive filters is a necessary condition for global convergence of these algorithms. Although the existence of stable degenerated solutions is sufficient for the existence of local minima, it is shown by an example not to be a necessary condition, this uniqueness is also guaranteed if T. Soderstrom's (1985) condition, n/sub b/-n/sub e/+1>or=0, is met when the input is white. It is proved that n/sub b/-n/sub c/+2>or=0 is a weaker sufficient condition for exactly matching models. In fact, this serves as the weakest sufficient condition.< >
The authors have developed an alternative formulation of simulated annealing using a tree-based Metropolis procedure called tree annealing. Tree annealing is suited to continuous optimization problems and, in particul...
详细信息
The authors have developed an alternative formulation of simulated annealing using a tree-based Metropolis procedure called tree annealing. Tree annealing is suited to continuous optimization problems and, in particular, to transistor parameter extraction. The tree annealing optimization algorithm was used to extract the parameters of the HBT (heterojunction bipolar transistor) of U.K. Mishra et al. (IEDM Tech. Dig., p.180-3, Dec. 1988) using a physically based equivalent circuit and deembedded scattering parameter measurements from 45 MHz to 26.5 GHz. Good results were obtained from the parameter extraction technique, and the ability of MFA not to be locked in local minima enabled a physically based equivalent circuit model to be used. Tree annealing is essentially a smart random search technique and so requires many more functional evaluations than do gradient-based minimization algorithms. However, no startling guess is required, and the bounds on parameter values can be widely separated with little effect on optimization time.< >
A procedure is described for evaluating the likelihood of a hidden Markov model (HMM) using only O(N) flops per observation, where N is the number of states. This improved computational complexity is necessary for nea...
详细信息
A procedure is described for evaluating the likelihood of a hidden Markov model (HMM) using only O(N) flops per observation, where N is the number of states. This improved computational complexity is necessary for near-real-time recognition algorithms for nonverbal speech to be run on ordinary personal computers. In preliminary experiments these measures have significantly reduced the computational load. Further significant reductions are anticipated with larger databases.< >
This paper concerns the supervisory coordination and control of concurrent activities in an automated manufacturing facility. In contrast to commonly used simulation models which integrate the control policy with the ...
详细信息
This paper concerns the supervisory coordination and control of concurrent activities in an automated manufacturing facility. In contrast to commonly used simulation models which integrate the control policy with the system model, the subsystem state transition logic is represented by a class of controlled Petri nets (CPNs) with external inputs to be determined by the control synthesis algorithm. We formulate the forbidden state control problem in the CPN context and present a computationally efficient algorithm for generating maximally permissive controls which guarantee the system will avoid the forbidden states while permitting a maximal amount of flexibility in the system operation. The problem formulation and control synthesis algorithm is illustrated for an example of AGV coordination, and several classes of manufacturing control problems which can be addressed within this framework are identified.
An image coding technique with the capability of producing good image quality at a compression ratio over 1000:1 is described. The main idea is to break the image into complicated primitives using a priori knowledge. ...
详细信息
An image coding technique with the capability of producing good image quality at a compression ratio over 1000:1 is described. The main idea is to break the image into complicated primitives using a priori knowledge. Usually these primitives are not coded and transmitted, but are matched to a previously created database, and the necessary information about the best match is coded and transmitted. This information is used at the receiver to retrieve a replica of the original primitive from a duplicate database. The primitives are assembled as in computer animation to produce a faithful reconstruction of the original image. The proposed technique allow real-time transmission of video signals over low-bit-rate channels (less than 64 kb/s). The application of this technique to teleconference and picture phone images is discussed.< >
A set of compact equations is derived for a system of multiconductor transmission lines with arbitrary source and load termination networks. The derivations are based on defining the reflection coefficient matrix for ...
详细信息
A set of compact equations is derived for a system of multiconductor transmission lines with arbitrary source and load termination networks. The derivations are based on defining the reflection coefficient matrix for multiconductor transmission lines. Expressions for the voltage and current transfer functions are derived. For the two-conductor case, the equations reduce to well known results. The expressions are very suitable for straightforward coding on a computer. The validity of the derived equations is checked with published experimental and computer models for three- and four-conductor transmission line systems.< >
The effects of input signal correlation on the performance on finite-precision RLS (recursive-least-squares) algorithms we presented. It is shown that one way to analyze finite-precision effects is indirectly through ...
详细信息
The effects of input signal correlation on the performance on finite-precision RLS (recursive-least-squares) algorithms we presented. It is shown that one way to analyze finite-precision effects is indirectly through the study of the sensitivity of the RLS algorithm to perturbations in the filter coefficients. The authors show that the mean deviation of the optimum error power grows linearly with time and is the same for both correlated and uncorrelated input samples. However, the variance of the deviation from the optimum increases with signal correlation. Upper and lower bounds are derived in terms of the ratio of the maximum eigenvalue of the sample autocorrelation matrix to the signal variance. (The deviation increases as the signal dynamic range increases.) Simulations are presented to verify the theory. A stable finite-precision RLS algorithm is derived by modeling roundoff errors and incorporating their effects into the algorithm.< >
A new image coding technique for achieving an extremely high compression ratio while producing good image quality is described. The idea is analogous to that used in forensic applications when constructing a composite...
详细信息
A new image coding technique for achieving an extremely high compression ratio while producing good image quality is described. The idea is analogous to that used in forensic applications when constructing a composite image of a criminal from a collection of images of facial features. The imput image is segmented into complicated primitives that are coded using previously constructed database of primitives. A duplicate database is used at the receiver to decode the primitives. The decoded primitives are assembled as in computer animation to produce a faithful reconstruction of the original image. The technique has been applied to head-and-shoulders images and compression ratios over 1000:1 have been achieved.< >
暂无评论