Convex dynamics and applications

DOI10.1017/S0143385704000537MaRDI QIDQ5695822zbMATH OpenOpenAlexFDO

Authors

Publication date 6 October 2005

Published in Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0402115

zbMATH Keywords

image processingsymbolic dynamicsDiophantine approximationscheduling problemsdigital halftoninguniform distributionstime-dependent dynamical systembounding orbitsDigital printing

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10) Applications of dynamical systems (37N99)

Abstract: This paper proves a theorem about bounding orbits of a time dependent dynamical system. The maps that are involved are examples in convex dynamics, by which we mean the dynamics of piecewise isometries where the pieces are convex. The theorem came to the attention of the authors in connection with the problem of digital halftoning. extit{Digital halftoning} is a family of printing technologies for getting full color images from only a few different colors deposited at dots all of the same size. The simplest version consist in obtaining grey scale images from only black and white dots. A corollary of the theorem is that for extit{error diffusion}, one of the methods of digital halftoning, averages of colors of the printed dots converge to averages of the colors taken from the same dots of the actual images. Digital printing is a special case of a much wider class of scheduling problems to which the theorem applies. Convex dynamics has roots in classical areas of mathematics such as symbolic dynamics, Diophantine approximation, and the theory of uniform distributions.

Recommendations

• Convex dynamics: properties of invariant sets
• Weak*-convergence to minimum energy measure and dispersed-dot halftoning
• Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms
• scientific article; zbMATH DE number 1958099
• Dithering by differences of convex functions

Cited in

(11)

• Bounding the errors for convex dynamics on one or more polytopes
• Convex dynamics with constant input
• Convex dynamics: properties of invariant sets
• On the geometry and regularity of invariant sets of piecewise-affine automorphisms on the Euclidean space
• Error diffusion on simplices: the structure of bounded invariant tiles
• Synchronization properties of random piecewise isometries
• Convex dynamics: Unavoidable difficulties in bounding some greedy algorithms
• Error diffusion on acute simplices: invariant tiles
• Sigma-delta quantization for fusion frames and distributed sensor networks
• High-order low-bit Sigma-Delta quantization for fusion frames
• In memoriam: Roy Adler (1931--2016) and the lasting impact of his work

This page was built for publication: Convex dynamics and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5695822)