Distance transform (DT)((1)) is used to convert a binary image that consists of object (foreground) and nonobject (background) pixels into another image in which each object pixel has a value corresponding to the mini...
详细信息
Distance transform (DT)((1)) is used to convert a binary image that consists of object (foreground) and nonobject (background) pixels into another image in which each object pixel has a value corresponding to the minimum distance from the background by a predefined distance function. The Euclidean distance is more accurate than the others, such as city-black, chessboard and chamfer, but it takes more computational time due to its nonlinearity. By using the relative X and Y coordinates computed from the object pixel to the source mapping pixel of its neighbors as well as correction of particular cases, the Euclidean distance transformation (EDT) can be correctly obtained in just four scans of an image. In other words, the new algorithm achieves the computational complexity of EDT to be linear to the size of an image. (C) 1998 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
This paper presents the estimation considering the Second Probability Moment applied to a simplified Third Order Stochastic Process. Model commonly used to describe smoothing systems as a synchronous motor. Its values...
详细信息
This paper presents the estimation considering the Second Probability Moment applied to a simplified Third Order Stochastic Process. Model commonly used to describe smoothing systems as a synchronous motor. Its values used into the model describe and estimate the Black Box system behavior. In the design three parameters based on covariance P-k and Q(k) are calculated The stochastic variable depends on the three gains and three functional estimation errors, respectively, developing the stochastic identification by a reference model that converges in almost all points with 10 iterations in recursive estimation. The results demonstrate a theoretical experiment using the Matlab (R) obtaining the parameters and the third order model to converge in accordance to the reference signal. The accuracy achieved in thousandths was in a Supermartingale sense and. implementation performed as a function of recursive estimation.
In this work, we present a simple theoretical analysis of a compact rectangular microstrip resonator with stubs. The analytical model is based on a recursive algorithm for a transmission line loaded with capacitive st...
详细信息
In this work, we present a simple theoretical analysis of a compact rectangular microstrip resonator with stubs. The analytical model is based on a recursive algorithm for a transmission line loaded with capacitive stubs. We calculate the input impedance and the resonant frequency of this resonator and analyse the dependence of these parameters on the number and dimensions of the stubs. The numerical results are compared with those obtained by other methods and with experimental data. (C) 2004 Wiley Periodicals, Inc.
The results of the development of a recursive algorithm for temporal noise reduction with an adaptive threshold for thermal imaging systems are presented. This algorithm is designed to reduce the level of temporal noi...
详细信息
The results of the development of a recursive algorithm for temporal noise reduction with an adaptive threshold for thermal imaging systems are presented. This algorithm is designed to reduce the level of temporal noise based on the results of analyzing a sequence of images obtained using a thermal imaging channel. A mathematical model of the algorithm is provided, as well as the required amount of computing resources needed for its hardware implementation in field programmable gate arrays (FPGAs). Several characteristics of the thermal imaging system with the developed algorithm were measured and conclusions were made about the positive influence of the algorithm on its noise equivalent temperature difference (NETD).
The problem of pole assignment in linear, multivariable systems using an unconstrained-rank feedback matrix is considered. The effect of output feedback of unspecified rank on the characteristic polynomial of a multiv...
详细信息
The problem of pole assignment in linear, multivariable systems using an unconstrained-rank feedback matrix is considered. The effect of output feedback of unspecified rank on the characteristic polynomial of a multivariable system is first studied. The results are then used to derive a recursive algorithm for pole assignment without any restrictions on the rank of the output feedback matrix used. The method is based on the pseudoinverse concept for obtaining least-squares solutions of sets of linear equations, and is computationally efficient.
A linear connected-(r,s)-out-of-(m,n):F lattice system has its components ordered like the elements of a (m,n)-matrix such that the system fails iff all components in a connected (r,s)-submatrix fail. This paper propo...
详细信息
A linear connected-(r,s)-out-of-(m,n):F lattice system has its components ordered like the elements of a (m,n)-matrix such that the system fails iff all components in a connected (r,s)-submatrix fail. This paper proposes a recursive algorithm, named Yamamoto-Miyakawa (YM), for the system reliability. The YM algorithm requires O(s(m-r) . m(2) . r . n) computing time. Comparisons with the existing methods show its usefulness. We prove that the reliability of the large system tends to exp(-mu . lambda(r . s)) as n = mu . m(eta-1), m --> infinity if every component has failure probability lambda . m(-eta/(r . s)), where mu,lambda,eta are constant, mu > 0, lambda > 0, eta > s, or r/(r-1) - eta > 1.
In a 1987 Scientific American Computer Recreations article, A.K. Dewdney posed the problem of reversing an n -car train on a track with a one-car spur using the minimum amount of work. In that article, Dewdney indicat...
详细信息
In a 1987 Scientific American Computer Recreations article, A.K. Dewdney posed the problem of reversing an n -car train on a track with a one-car spur using the minimum amount of work. In that article, Dewdney indicated an algorithm for reversing the train that uses O( n 3 ) work. Shortly thereafter, Amato, Blum, Irani and Rubinfeld (Reversing Trains: A Turn of the Century Sorting Problem, J. algorithms, Vol. 10, 1989, pp. 413-428) discovered a simple recursive algorithm that requires O ( n 2 log n ) work to reverse a train. In this paper, we prove that Amato et al.'s algorithm is optimal up to a constant factor, i.e., we prove that any algorithm for reversing an n -car train in the Dewdney model requires Ω(n 2 log n) work.
This paper presents a recursive algorithm to approximate the likelihood in arbitrary pedigrees with loops. The algorithm handles any number and nesting levels of loops in pedigrees. The loops are cut as described in a...
详细信息
This paper presents a recursive algorithm to approximate the likelihood in arbitrary pedigrees with loops. The algorithm handles any number and nesting levels of loops in pedigrees. The loops are cut as described in a previous publication and the approximate likelihood is simultaneously computed using the cut pedigree. No identification of a loop in the pedigree is necessary before the algorithm is applied.
In this paper, a high-order soft constrained Nash strategy for weakly coupled large-scale systems is investigated. In order to solve the cross-coupled sign-indefinite algebraic Riccati equations (CSAREs) corresponding...
详细信息
In this paper, a high-order soft constrained Nash strategy for weakly coupled large-scale systems is investigated. In order to solve the cross-coupled sign-indefinite algebraic Riccati equations (CSAREs) corresponding to strategy, the iterative algorithm on the basis of the Newton's method is first applied. Second, the recursive algorithm for solving the CSAREs is also established to reduce the amount of algebraic computation as compared with the Newton's method. Using these iterative solutions, a high-order soft-constrained Nash strategy is designed. As a result, it is proved that the proposed high-order approximate equilibrium strategies achieve better performance. Finally, in order to demonstrate the efficiency of the algorithm, a numerical example is given.
In this paper, the relation between difference algorithms and the representation of parametric curves is studied in detail. It is shown that stationary difference algorithms could generate a class of curves, the so-ca...
详细信息
In this paper, the relation between difference algorithms and the representation of parametric curves is studied in detail. It is shown that stationary difference algorithms could generate a class of curves, the so-called D-curves, that are suitable in free-form curve and surface modelling and design. The corresponding D-Bezier curves are also constructed and their properties studied. This generalizes our findings in the study of a simple three-term difference algorithm in which it has been concluded that a simple three-term difference algorithm could generate both conic curves, general monomial curves, and exponential spiral curves. (C) 1998 Elsevier Science Ltd. All rights reserved.
暂无评论