September 15, 2005

BACK


Professor Michael Leyton,

Center for Cognitive Science, Busch Campus, Rutgers University, New Brunswick, NJ 08904, USA.

www.rci.rutgers.edu/~mleyton/homepage.htm

Center for Discrete Mathematics & Theoretical Computer Science (DIMACS),

< mleyton@dimacs.rutgers.edu >


Publications of Michael Leyton et al. :

Shape Representation:

Perception :

BibTeX references.



The Foundations of Aesthetics

Michael Leyton
Ch. 13 in Fishwick, P. (Ed), Aesthetic Computing, MIT Press, 2006 (expected).

Summary


A Rigorous Theory of Aesthetics This paper summarizes the theory of aesthetics that comes from the new foundations for geometry developed in  my books. The new geometric foundations are based on two principles:
  1. maximizing transfer of structure, 
  2. maximizing recoverability of the generative operations.

According to the foundations, these are the two basic principles of aesthetics. This paper shows that the two principles are fundamental to aesthetic judgment in (1) the arts, where we examine painting, music, and poetry; (2) the sciences, where we examine general relativity and quantum mechanics; and (3) computer programming, where we examine object-oriented programming. It is shown that all these areas are driven by the same two underlying principles: maximization of transfer and recoverability. Transfer is formalized in terms of particular products of groups. It is shown to be the basis of Gestalt. Recoverability is shown to depend on a new theory of symmetry-breaking, provided in the geometric theory. Together, transfer and recoverability are shown to be the basis of memory storage; and our rigorous theory of aesthetics says that the rules of aesthetics are the rules of memory storage. In particular, both the arts and the sciences are driven by the single goal of maximizing memory storage. Finally, these principles are applied to explain core phenomena in object-oriented programming.


A Generative Theory of Shape

Michael Leyton
Springer-Verlag, Lecture Notes in Computer Science, no. 2145,
554 pages, 2001.

"Geometry == Memory"

Summary

In this book, the author develops a generative theory of shape with two properties fundamental to intelligence: maximizing transfer of structure, and maximizing recoverability of generative operations. The theory is applied in considerable detail to CAD, perception, and robotics. A significant aspect of this book is the development of an object-oriented theory of geometry. This includes a group-theoretic formulation of object-oriented inheritance. In particular, a class of groups is developed called "unfolding groups", which define any complex shape as unfolded from a maximally collapsed version of itself called an "alignment kernel". The group is decomposed into levels corresponding to the inheritance hierarchy within the complex object. This achieves one of the main goals of the theory - the conversion of complexity into understandability. The advantages of the theory are demonstrated with lengthy studies of robot manipulators, perceptual organization, constructive solid geometry, assembly planning, architectural CAD, and mechanical CAD/CAM

Keywords: Geometric Shape, Shape Theory, Geometric Objects, Computer Vision, Robot Navigation, Visual Perception, Shape Generati- on, Geometric Structure, Group Theory, Complex Shape, Wreath Products, Erlanger Program, Geometric Invariants.

From "James Johnson" <James-Johnson@nyc.rr.com>:

ToC

  1. Transfer
  2. Recoverability, p. 35
  3. Mathematical Theory of Transfer, I, p. 77
  4. Mathematical Theory of Transfer, II, p. 115
  5. Theory of Grouping, p. 135
  6. Robot Manipulators, p. 161
  7. Algebraic Theory of Inheritance, p. 175
  8. Reference Frames, p. 185
  9. Relative Motion, p. 213
  10. Surface Primitives, p. 229
  11. Unfolding Groups, I, p. 239
  12. Unfolding Groups, II, p. 257
  13. Unfolding Groups, III, p. 271
  14. Mechanical Design and Manufacturing, p. 299
  15. A Mathematical Theory of Architecture, p. 365
  16. Solid Structure, p. 397
  17. Wreath Formulation of Splines, p. 423
  18. Wreath Formulation of Sweep Representations, p. 443
  19. Process Grammar, p. 455
  20. Conservation Laws of Physics, p. 467
  21. Music, p. 477
  22. Against the Erlanger Program, p. 495
  23. Appendix A. Semi-direct Products, p. 531
  24. Appendix B. Symbols, p. 539
  25. References, p. 541
  26. Index, p. 549


Group Theory and Architecture, 1:
Nested Symmetries

Michael Leyton

Visual Mathematics, Volume 1, No. 3, 1999

web link

Introduction

In a forthcoming book, I give a comprehensive theory of design based on group theory. Whereas the book itself requires an advanced knowledge of group theory, the present series of articles will give the material in an intuitive form, and build up any needed group theory, in tutorial passages. The articles will begin by assuming that the reader has no knowledge of group theory, and we will progressively add more and more group theory in an easy form, until we finally are able to get to quite difficult topics in tensor algebras, and give a group-theoretic analysis of complex buildings such as those of Peter Eisenman, Zaha Hadid, Frank Gehry, Coop Himmelblau, Rem Koolhaas, Daniel Libeskind, Greg Lynn, and Bernard Tschumi. This first article is on a subject of considerable psychological relevance: nested symmetries.

Group Theory and Architecture, 2:
Why Symmetry/Asymmetry?

Michael Leyton

Visual Mathematics, Volume 1, No. 4, 1999

web link


Symmetry, Causality, Mind

Michael Leyton,
MIT Press, 1992, 630 pp.

From Piero Scaruffi's Annotated Bibliography of Mind-related Topics:

From the MIT Press:

ToC

  1. Recovering Process-History
  • Traces
  • Radical Computational Vision
  • Representation Is Explanation
  • Groups and Symmetry
  • Domain-Independent Rules
  • Linguistics
  • Art
  • Political Prisoners

  • A Process Grammar for Shape

    M. Leyton
    AI Journal, v.34(2), March 1988, pp. 213-247.

    Web link.


    Symmetry-Curvature Duality

    M. Leyton
    CVGIP, v.38, pp. 327-341, 1987,

    Summary

    Establishes the "Symmetry-Curvature Duality Theorem":

    Uses the SLS (smoothed local symmetries of Brady & Asada) as a construction process (example) of symmetries.

    Studies the Codon representation of Hoffman & Richards.

    SLS-Codon Theorem:

    Details on evolutes: they bound (on each side) the loci of maximally inscribed circles.

    Note on information theory:


    BACK

    Page created & maintained by Frederic Leymarie, 2000-5.
    Comments, suggestions, etc., mail to: ffl at gold dot ac dot uk