In this paper an approximation for entropy rate of an ergodic Markov chain via sample path simulation is calculated. Although there is an explicit form of the entropy rate here, the exact computational method is laborious to apply. It is demonstrated that the estimated entropy rate of Markov chain via sample path not only converges to the correct entropy rate but also does it exponential...

The fast dynamo growth rate for a C k+1 map or ow is bounded above by topo-logical entropy plus a 1=k correction. The proof uses techniques of random maps combined with a result of Yomdin relating curve growth to topological entropy. This upper bound implies the following anti-dynamo theorem: in C 1 systems fast dynamo action is not possible without the presence of chaos. In addition topologica...

The fast dynamo growth rate for a C k+1 map or ow is bounded above by topo-logical entropy plus a 1=k correction. The proof uses techniques of random maps combined with a result of Yomdin relating curve growth to topological entropy. This upper bound implies the following anti-dynamo theorem: in C 1 systems fast dynamo action is not possible without the presence of chaos. In addition topologica...

Computer vision tasks such as learning, recognition, classification or segmentation applied to spatial data often requires spatial normalization of repeated features and structures. Spatial normalization, or in other words, image registration, is still a big hurdle for the image processing community. Its formulation often relies on the fact that correspondence is achieved when a similarity meas...

This thesis investigates the employment of different entropic measures, including Rényi entropy, in the context of image registration. Specifically, we focus on the entropy estimation problem for image registration and provide theoretical and experimental comparisons of two important entropy estimators: the plug-in estimator and minimal entropic graphs. We further develop an image registration ...

of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy A FAMILY OF MINIMUM RENYI’S ERROR ENTROPY ALGORITHM FOR INFORMATION PROCESSING By Seungju Han August 2007 Chair: Jose C. Principe Major: Electrical and Computer Engineering Adaptive systems are self-adjusting and seek the optimum in a co...