A Novel Secure Arithmetic Image Coding Algorithm Based on Two-Dimensional Generalized Logistic Mapping

2015 ◽  
Author(s):  
Liu Huiying ◽  
Xu Caiyun ◽  
Kong Jun ◽  
Du Ying
Keyword(s):  
Image Coding ◽  
Two Dimensional ◽  
Logistic Mapping

A STUDY OF BIFURCATIONS IN A CIRCULAR REAL CELLULAR AUTOMATON

1993 ◽  
Vol 03 (02) ◽  
pp. 293-321 ◽  
Author(s):  
JÜRGEN WEITKÄMPER
Keyword(s):  
Hopf Bifurcation ◽  
Dynamical Systems ◽  
Cellular Automata ◽  
Cellular Automaton ◽  
Parallel Computers ◽  
Discrete Dynamical Systems ◽  
Two Dimensional ◽  
Bifurcation Structure ◽  
Logistic Mapping ◽  
Henon Mapping

Real cellular automata (RCA) are time-discrete dynamical systems on ℝN. Like cellular automata they can be obtained from discretizing partial differential equations. Due to their structure RCA are ideally suited to implementation on parallel computers with a large number of processors. In a way similar to the Hénon mapping, the system we consider here embeds the logistic mapping in a system on ℝN, N>1. But in contrast to the Hénon system an RCA in general is not invertible. We present some results about the bifurcation structure of such systems, mostly restricting ourselves, due to the complexity of the problem, to the two-dimensional case. Among others we observe cascades of cusp bifurcations forming generalized crossroad areas and crossroad areas with the flip curves replaced by Hopf bifurcation curves.

Mycielski Based 2d-Predictive Image Coding Algorithm

2016 ◽  
Vol 850 ◽  
pp. 144-151 ◽  
Author(s):  
Mehmet Fidan ◽  
Ömer Nezih Gerek
Keyword(s):  
Image Coding ◽  
Predictive Coding ◽  
Prediction Method ◽  
Physical Distance ◽  
Prediction Algorithm ◽  
Two Dimensional ◽  
Two Dimensional Image ◽  
Past Data ◽  
And Performance ◽  
Definition Of

The Mycielski method is a prospering prediction algorithm which is based on searching and finding largest repeated binary patterns. It uses infinite-past data to devise a rule based prediction method on a time series. In this work, a novel two-dimensional (image processing) version of the Mycielski algorithm is proposed. Since the dimensionality definition of “past” data increases in two-dimensional signals, the proposed algorithm also needs to handle how the boundaries of the pixel cliques are iteratively extended in the neighborhood of a current pixel. The clique extension invokes novel similarity search strategies that depend on the chosen physical distance metric. The proposed prediction algorithm is used for predictive image compression and performance comparisons with other predictive coding methods are presented.

Two-Dimensional DPCM Image Coding Based on an Assumed Stochastic Image Model

1981 ◽  
Vol 29 (9) ◽  
pp. 1365-1374 ◽  
Author(s):  
D. Daut ◽  
R. Fries ◽  
J. Modestino
Keyword(s):  
Image Coding ◽  
Two Dimensional ◽  
Image Model
Sign in / Sign up

Export Citation Format

Share Document