Book•
Fractals Everywhere
01 Jan 1988-
TL;DR: Focusing on how fractal geometry can be used to model real objects in the physical world, this up-to-date edition featurestwo 16-page full-color inserts, problems and tools emphasizing fractal applications, and an answers section.
Abstract: Focusing on how fractal geometry can be used to model real objects in the physical world, this up-to-date edition featurestwo 16-page full-color inserts, problems and tools emphasizing fractal applications, and an answers section. A bonus CD of an IFS Generator provides an excellent software tool for designing iterated function systems codes and fractal images.
Citations
More filters
Book•
01 Jan 1992TL;DR: This book discusses the evolution of architecture, primitive functions, terminals, sufficiency, and closure, and the role of representation and the lens effect in genetic programming.
Abstract: Background on genetic algorithms, LISP, and genetic programming hierarchical problem-solving introduction to automatically-defined functions - the two-boxes problem problems that straddle the breakeven point for computational effort Boolean parity functions determining the architecture of the program the lawnmower problem the bumblebee problem the increasing benefits of ADFs as problems are scaled up finding an impulse response function artificial ant on the San Mateo trail obstacle-avoiding robot the minesweeper problem automatic discovery of detectors for letter recognition flushes and four-of-a-kinds in a pinochle deck introduction to biochemistry and molecular biology prediction of transmembrane domains in proteins prediction of omega loops in proteins lookahead version of the transmembrane problem evolutionary selection of the architecture of the program evolution of primitives and sufficiency evolutionary selection of terminals evolution of closure simultaneous evolution of architecture, primitive functions, terminals, sufficiency, and closure the role of representation and the lens effect Appendices: list of special symbols list of special functions list of type fonts default parameters computer implementation annotated bibliography of genetic programming electronic mailing list and public repository
13,487 citations
TL;DR: Bendixson's theorem is extended to the case of Lipschitz continuous vector fields, allowing limit cycle analysis of a class of "continuous switched" systems.
Abstract: We introduce some analysis tools for switched and hybrid systems. We first present work on stability analysis. We introduce multiple Lyapunov functions as a tool for analyzing Lyapunov stability and use iterated function systems theory as a tool for Lagrange stability. We also discuss the case where the switched systems are indexed by an arbitrary compact set. Finally, we extend Bendixson's theorem to the case of Lipschitz continuous vector fields, allowing limit cycle analysis of a class of "continuous switched" systems.
3,289 citations
Book•
01 Jan 1990TL;DR: Graphical modeling using L-systems and turtle interpretation of symbols for plant models and iterated function systems, and Fractal properties of plants.
Abstract: 1 Graphical modeling using L-systems.- 1.1 Rewriting systems.- 1.2 DOL-systems.- 1.3 Turtle interpretation of strings.- 1.4 Synthesis of DOL-systems.- 1.4.1 Edge rewriting.- 1.4.2 Node rewriting.- 1.4.3 Relationship between edge and node rewriting.- 1.5 Modeling in three dimensions.- 1.6 Branching structures.- 1.6.1 Axial trees.- 1.6.2 Tree OL-systems.- 1.6.3 Bracketed OL-systems.- 1.7 Stochastic L-systems.- 1.8 Context-sensitive L-systems.- 1.9 Growth functions.- 1.10 Parametric L-systems.- 1.10.1 Parametric OL-systems.- 1.10.2 Parametric 2L-systems.- 1.10.3 Turtle interpretation of parametric words.- 2 Modeling of trees.- 3 Developmental models of herbaceous plants.- 3.1 Levels of model specification.- 3.1.1 Partial L-systems.- 3.1.2 Control mechanisms in plants.- 3.1.3 Complete models.- 3.2 Branching patterns.- 3.3 Models of inflorescences.- 3.3.1 Monopodial inflorescences.- 3.3.2 Sympodial inflorescences.- 3.3.3 Polypodial inflorescences.- 3.3.4 Modified racemes.- 4 Phyllotaxis.- 4.1 The planar model.- 4.2 The cylindrical model.- 5 Models of plant organs.- 5.1 Predefined surfaces.- 5.2 Developmental surface models.- 5.3 Models of compound leaves.- 6 Animation of plant development.- 6.1 Timed DOL-systems.- 6.2 Selection of growth functions.- 6.2.1 Development of nonbranching filaments.- 6.2.2 Development of branching structures.- 7 Modeling of cellular layers.- 7.1 Map L-systems.- 7.2 Graphical interpretation of maps.- 7.3 Microsorium linguaeforme.- 7.4 Dryopteris thelypteris.- 7.5 Modeling spherical cell layers.- 7.6 Modeling 3D cellular structures.- 8 Fractal properties of plants.- 8.1 Symmetry and self-similarity.- 8.2 Plant models and iterated function systems.- Epilogue.- Appendix A Software environment for plant modeling.- A.1 A virtual laboratory in botany.- A.2 List of laboratory programs.- Appendix B About the figures.- Turtle interpretation of symbols.
2,753 citations
Cites background or methods from "Fractals Everywhere"
...An alternative approach for approximating the set A is termed the chaos game [7] (see also [107, Chapter 5])....
[...]
...It offers a method for synthesizing L-systems that generate objects with a given recursive structure, and links methods for plant generation based on L-systems with those using iterated function systems [7] (see Chapter 8)....
[...]
...2: The fern leaf from Barnsley’s model [7]...
[...]
Book•
19 Aug 1998
TL;DR: This chapter establishes the framework of random dynamical systems and introduces the concept of random attractors to analyze models with stochasticity or randomness.
Abstract: I. Random Dynamical Systems and Their Generators.- 1. Basic Definitions. Invariant Measures.- 2. Generation.- II. Multiplicative Ergodic Theory.- 3. The Multiplicative Ergodic Theorem in Euclidean Space.- 4. The Multiplicative Ergodic Theorem on Bundles and Manifolds.- 5. The MET for Related Linear and Affine RDS.- 6. RDS on Homogeneous Spaces of the General Linear Group.- III. Smooth Random Dynamical Systems.- 7. Invariant Manifolds.- 8. Normal Forms.- 9. Bifurcation Theory.- IV. Appendices.- Appendix A. Measurable Dynamical Systems.- A.1 Ergodic Theory.- A.2 Stochastic Processes and Dynamical Systems.- A.3 Stationary Processes.- A.4 Markov Processes.- Appendix B. Smooth Dynamical Systems.- B.1 Two-Parameter Flows on a Manifold.- B.4 Autonomous Case: Dynamical Systems.- B.5 Vector Fields and Flows on Manifolds.- References.
2,663 citations
07 Jun 2015
TL;DR: This paper expands the internal patch search space by allowing geometric variations, and proposes a compositional model to simultaneously handle both types of transformations to accommodate local shape variations.
Abstract: Self-similarity based super-resolution (SR) algorithms are able to produce visually pleasing results without extensive training on external databases. Such algorithms exploit the statistical prior that patches in a natural image tend to recur within and across scales of the same image. However, the internal dictionary obtained from the given image may not always be sufficiently expressive to cover the textural appearance variations in the scene. In this paper, we extend self-similarity based SR to overcome this drawback. We expand the internal patch search space by allowing geometric variations. We do so by explicitly localizing planes in the scene and using the detected perspective geometry to guide the patch search process. We also incorporate additional affine transformations to accommodate local shape variations. We propose a compositional model to simultaneously handle both types of transformations. We extensively evaluate the performance in both urban and natural scenes. Even without using any external training databases, we achieve significantly superior results on urban scenes, while maintaining comparable performance on natural scenes as other state-of-the-art SR algorithms.
2,389 citations
Cites methods from "Fractals Everywhere"
...Internal database driven SR: Among internal database driven SR methods, Ebrahimi and Vrscay [10] combined ideas from fractal coding [3] with example-based algo- rithms such as non-local means filtering [5], to propose a self-similarity based SR algorithm....
[...]
...These methods are based on the fractal nature of images [3], which suggests that patches of a natural image recur within and across scales of the same image....
[...]