- Hauptmenü-

Katalogdatenanzeige

Digital Geometry Algorithms: Theoretical Foundations and Applications to Computational Imaging

Kataloginformation Katalogdatensatz500171076 .

Kataloginformation
Feldname	Details
Vorliegende Sprache	eng
Hinweise auf parallele Ausgaben	368106950 Buchausg. u.d.T.: ‡Digital geometry algorithms
ISBN	978-94-007-4173-7
Name	Brimkov, Valentin E.
Name	Barneva, Reneta P.
ANZEIGE DER KETTE	Barneva, Reneta P.
T I T E L	Digital Geometry Algorithms
Zusatz zum Titel	Theoretical Foundations and Applications to Computational Imaging
Verlagsort	Dordrecht
Verlag	Springer Netherlands
Erscheinungsjahr	2012
Erscheinungsjahr	2012
Umfang	Online-Ressource (X, 428 p. 208 illus., 42 illus. in color, digital)
Reihe	Lecture Notes in Computational Vision and Biomechanics ; 2
Notiz / Fußnoten	Description based upon print version of record
Weiterer Inhalt	Digital Geometry Algorithms; Preface; Contents; Contributors; Part I: General; Chapter 1: Digital Geometry in Image-Based Metrology; 1.1 Introduction; 1.2 The Digitization Model and the Metrology Tasks; 1.3 Self Similarity of Digital Lines; 1.4 Digital Straight Segments: Their Characterization and Recognition; 1.5 Digital Disks, Convex and Star-Shaped Objects; 1.6 Shape Designs for Good Metrology; 1.7 The Importance of Being Gray; 1.8 Some Further Open Questions; 1.9 Concluding Remarks; References; Chapter 2: Provably Robust Simpliﬁcation of Component Trees of Multidimensional Images. 2.1 Introduction2.2 Foreground Component Tree Structures (FCTSs); 2.3 The (lambda, k)-Simpliﬁcation of a kappa-FCTS, Essential Isomorphism, and the Main Theorem; 2.4 Pruning by Removing Branches of Length <=lambda; 2.4.1 Speciﬁcation of Simpliﬁcation Step 2; 2.4.2 An Easily Visualized Characterization of the Output of Simpliﬁcation Step 2; 2.4.3 Linear-Time Implementation of Simpliﬁcation Step 2; 2.5 Elimination of Internal Edges of Length <=lambda from Fcrit; 2.5.1 Speciﬁcation of Simpliﬁcation Step 3; 2.5.2 Implementation of Simpliﬁcation Step 3. 2.6 Demonstration of Potential Biological Applicability2.7 Possibilities for Future Work; 2.7.1 How Can Our Simpliﬁcation Method and Theorem 1 Be Adapted to Contour Trees?; 2.7.2 Does the Bottleneck Stability Theorem Have an Analog for FCTSs That Implies Theorem 1?; 2.7.3 Can Images Be Simpliﬁed Using Variants of Our Method?; 2.8 Conclusion; Appendix A: Some Properties of Simpliﬁcation Steps 2 and 3, and a Proof of the Correctness of Algorithm 1; A.1 Properties of Simpliﬁcation Step 2; A.2 Properties of Simpliﬁcation Step 3; A.3 Justiﬁcation of Algorithm 1. Appendix B: A Constructive Proof of Theorem 1B.1 Step 1 of the Proof of the Fundamental Lemma; B.2 Some Useful Observations; B.3 Step 2 of the Proof of the Fundamental Lemma; B.4 Step 3 of the Proof of the Fundamental Lemma; Appendix C: Justiﬁcation of Assertions L, M, N, and O in Step 3 of the Proof of the Fundamental Lemma; C.1 Proof of Assertion L; C.2 Proof of Assertion M; C.3 Proof of Assertion N; C.4 Proof of Assertion O; References; Part II: Topology, Transformations; Chapter 3: Discrete Topological Transformations for Image Processing; 3.1 Introduction. 3.2 Topological Transformations of Binary Images3.2.1 Neighborhoods, Connectedness; 3.2.2 Connectivity Numbers; 3.2.3 Topological Classiﬁcation of Object Points; 3.2.4 Topology-Preserving Transformations; 3.2.5 Transformations Guided by a Priority Function; 3.2.6 Lambda-Medial Axis; 3.2.7 Other Applications of Guided Thinning; 3.2.8 Hole Closing; 3.3 Topological Transformations for Grayscale Images; 3.3.1 Cross-Section Topology; 3.3.2 Local Characterizations and Topological Classiﬁcation of Points; 3.3.3 Topological Filtering; 3.3.4 Topological Segmentation. 3.3.5 Crest Restoration Based on Topology
Titelhinweis	Buchausg. u.d.T.: ‡Digital geometry algorithms
ISBN	ISBN 978-94-007-4174-4
	ISBN 1-280-79616-2 ebk
	ISBN 978-1-280-79616-6 MyiLibrary
Klassifikation	54.74
	TTBM
	UYS
	TEC008000
	COM073000
	*68-06
	00B15
	68U05
	68U10
	65D18
	621.382
	516.110285
	TK5102.9
	TA1637-1638
	TK7882.S65
Kurzbeschreibung	Digital geometry emerged as an independent discipline in the second half of the last century. It deals with geometric properties of digital objects and is developed with the unambiguous goal to provide rigorous theoretical foundations for devising new advanced approaches and algorithms for various problems of visual computing. Different aspects of digital geometry have been addressed in the literature. This book is the first one that explicitly focuses on the presentation of the most important digital geometry algorithms. Each chapter provides a brief survey on a major research area related to the general volume theme, description and analysis of related fundamental algorithms, as well as new original contributions by the authors. Every chapter contains a section in which interesting open problems are addressed.
SWB-Titel-Idn	366284479
Signatur	Springer E-Book
Bemerkungen	Elektronischer Volltext - Campuslizenz
Elektronische Adresse	$uhttp://dx.doi.org/10.1007/978-94-007-4174-4
Internetseite / Link	Volltext
Siehe auch	Volltext
Siehe auch	Cover
Siehe auch	Inhaltstext

ISBD-Anzeige Katalogdatensatz500171076

Kategorien-Anzeige Katalogdatensatz500171076

Titel zur Titelsammlung hinzufügen Katalogdatensatz500171076

Kataloginformation500171076 Datensatzanfang . Kataloginformation500171076 Seitenanfang .

Titel vormerken Katalogdatensatz500171076

Vollanzeige Katalogdaten

Auf diesem Bildschirm erhalten Sie Katalog- und Exemplarinformationen zum ausgewählten Titel.

Im Bereich Kataloginformation werden die bibliographischen Details angezeigt. Per Klick auf Hyperlink-Begriffe wie Schlagwörter, Autoren, Reihen, Körperschaften und Klassifikationen können Sie sich weitere Titel des gewählten Begriffes anzeigen lassen.

Der Bereich Exemplarinformationen enthält zum einen Angaben über den Standort und die Verfügbarkeit der Exemplare. Zum anderen haben Sie die Möglichkeit, ausgeliehene Exemplare vorzumerken oder Exemplare aus dem Magazin zu bestellen.