Zhongxing Ye

Learn More
Recently, there has been significant interest in robust fractal image coding for the purpose of robustness against outliers. However, the known robust fractal coding methods (HFIC and LAD-FIC, etc.) are not optimal, since, besides the high computational cost, they use the corrupted domain block as the independent variable in the robust regression model,(More)
Building upon work that has illustrated families of chaotic functions with crystallographic symmetries, we explore combining these functions with orbit trap rendering methods in the rectangular coordinates plane. Visually fascinating images with crystallographic symmetries can be created in this way, and some of them exhibit an intricate 3-D appearance. r(More)
In this correspondence, we first establish a strong limit theorem for countable nonhomogeneous Markov chains indexed by a homogeneous tree. As corollaries, we obtain some strong limit theorems for frequencies of occurrence of states and ordered couple of states for these Markov chains. Finally, we prove the strong law of large numbers and the asymptotic(More)
We take the point of view that a Markov random field is a collection of so-called full conditional mutual independencies. Using the theory of -Measure, we have obtained a number of fundamental characterizations related to conditional mutual independence and Markov random fields. We show that many aspects of conditional mutual independence and Markov random(More)
This paper uses the ultrametric clustering which is based on time series of stock prices. By calculating the ultrametric distance-matrix of the stocks in Shanghai-Shenzhen 300 index, a minimum spanning tree (MST) which has certain topological meaning can be drawn. And this MST explains the physical correlation between the topological structure and economic(More)
In this paper a broad class of large Ising-type supergames, i.e., infinitely repeated games played by many players are studied. The players located on the vertex set of some planar lattice play several basic games with his neighbors. The basic game is two-person Ising-type game with symmetric payoffs. Three planar lattice models are discussed. Under the(More)
A class of discrete-time, dynamic supergames played by infinitely many players on tree is studied. Each player plays a number of two-person games with her neighbors simultaneously and updates her strategy stochastically based on the information from her neighbors' strategies and the payoff she gets. Under the conditions of the pre-specified updating rules(More)