A Generative Theory of Shape

• Κύριος συγγραφέας: Leyton, Michael (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Έκδοση: 1st ed. 2001.
• Σειρά: Lecture Notes in Computer Science, 2145
• Θέματα: Optical data processing.; Geometry.; Application software.; Computer graphics.; Group theory.; Computer-aided engineering.; Image Processing and Computer Vision.; Computer Applications.; Computer Graphics.; Group Theory and Generalizations.; Computer-Aided Engineering (CAD, CAE) and Design.

 The purpose of this book is to develop a generative theory of shape that has two properties we regard as fundamental to intelligence -(1) maximization of transfer: whenever possible, new structure should be described as the transfer of existing structure; and (2) maximization of recoverability: the generative operations in the theory must allow maximal inferentiability from data sets. We shall show that, if generativity satis?es these two basic criteria of - telligence, then it has a powerful mathematical structure and considerable applicability to the computational disciplines. The requirement of intelligence is particularly important in the gene- tion of complex shape. There are plenty of theories of shape that make the generation of complex shape unintelligible. However, our theory takes the opposite direction: we are concerned with the conversion of complexity into understandability. In this, we will develop a mathematical theory of und- standability. The issue of understandability comes down to the two basic principles of intelligence - maximization of transfer and maximization of recoverability. We shall show how to formulate these conditions group-theoretically. (1) Ma- mization of transfer will be formulated in terms of wreath products. Wreath products are groups in which there is an upper subgroup (which we will call a control group) that transfers a lower subgroup (which we will call a ?ber group) onto copies of itself. (2) maximization of recoverability is insured when the control group is symmetry-breaking with respect to the ?ber group. 

 Transfer -- Recoverability -- Mathematical Theory of Transfer, I -- Mathematical Theory of Transfer, II -- Theory of Grouping -- Robot Manipulators -- Algebraic Theory of Inheritance -- Reference Frames -- Relative Motion -- Surface Primitives -- Unfolding Groups, I -- Unfolding Groups, II -- Unfolding Groups, III -- Mechanical Design and Manufacturing -- A Mathematical Theory of Architecture -- Solid Structure -- Wreath Formulation of Splines -- Wreath Formulation of Sweep Representations -- Process Grammar -- Conservation Laws of Physics -- Music -- Against the Erlanger Program.