Overview
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 11414)
Part of the book sub series: Image Processing, Computer Vision, Pattern Recognition, and Graphics (LNIP)
Included in the following conference series:
Conference proceedings info: DGCI 2019.
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
This book constitutes the thoroughly refereed proceedings of the 21st IAPR International Conference on Discrete Geometry for Computer Imagery, DGCI 2019, held in Marne-la-Vallée, France, in March 2019.
The 38 full papers were carefully selected from 50 submissions. The papers are organized in topical sections on discrete geometric models and transforms; discrete topology; graph-based models, analysis and segmentation; mathematical morphology; shape representation, recognition and analysis; and geometric computation.
Similar content being viewed by others
Keywords
Table of contents (38 papers)
-
Discrete Geometric Models and Transforms
-
Graph-Based Models, Analysis and Segmentation
Other volumes
-
Discrete Geometry for Computer Imagery
Editors and Affiliations
Bibliographic Information
Book Title: Discrete Geometry for Computer Imagery
Book Subtitle: 21st IAPR International Conference, DGCI 2019, Marne-la-Vallée, France, March 26–28, 2019, Proceedings
Editors: Michel Couprie, Jean Cousty, Yukiko Kenmochi, Nabil Mustafa
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-030-14085-4
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer Nature Switzerland AG 2019
Softcover ISBN: 978-3-030-14084-7Published: 23 February 2019
eBook ISBN: 978-3-030-14085-4Published: 19 March 2019
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XIV, 496
Number of Illustrations: 551 b/w illustrations, 141 illustrations in colour
Topics: Computer Graphics, Image Processing and Computer Vision, Pattern Recognition, Math Applications in Computer Science, Algorithm Analysis and Problem Complexity