Angebote zu "Geometric" (7 Treffer)

Kategorien

Shops

Geometric Algebra with Applications in Engineering
64,99 € *
ggf. zzgl. Versand

The application of geometric algebra to the engineering sciences is a young, active subject of research. The promise of this field is that the mathematical structure of geometric algebra together with its descriptive power will result in intuitive and more robust algorithms. This book examines all aspects essential for a successful application of geometric algebra: the theoretical foundations, the representation of geometric constraints, and the numerical estimation from uncertain data. Formally, the book consists of two parts: theoretical foundations and applications. The first part includes chapters on random variables in geometric algebra, linear estimation methods that incorporate the uncertainty of algebraic elements, and the representation of geometry in Euclidean, projective, conformal and conic space. The second part is dedicated to applications of geometric algebra, which include uncertain geometry and transformations, a generalized camera model, and pose estimation. Graduate students, scientists, researchers and practitioners will benefit from this book. The examples given in the text are mostly recent research results, so practitioners can see how to apply geometric algebra to real tasks, while researchers note starting points for future investigations. Students will profit from the detailed introduction to geometric algebra, while the text is supported by the author´s visualization software, CLUCalc, freely available online, and a website that includes downloadable exercises, slides and tutorials.

Anbieter: buecher.de
Stand: 19.09.2019
Zum Angebot
Geometric Algebra for Computer Science
65,99 € *
ggf. zzgl. Versand

Linear algebra relies heavily on coordinates, however, which can make many geometric programming tasks very specific and complex-often a lot of effort is required to bring about even modest performance enhancements. This title presents a compelling alternative to the limitations of linear algebra.

Anbieter: buecher.de
Stand: 22.09.2019
Zum Angebot
Bezier and B-Spline Techniques
70,99 € *
ggf. zzgl. Versand

This book provides a solid and uniform derivation of the various properties Bezier and B-spline representations have, and shows the beauty of the underlying rich mathematical structure. The book focuses on the core concepts of Computer Aided Geometric Design with the intension to give a clear and illustrative presentation of the basic principles, as well as a treatment of advanced material including multivariate splines, some subdivision techniques and constructions of free form surfaces with arbitrary smoothness. The text is beautifully illustrated with many excellent figures to emphasize the geometric constructive approach of this book.

Anbieter: buecher.de
Stand: 19.09.2019
Zum Angebot
Concise Computer Vision
36,99 € *
ggf. zzgl. Versand

This textbook provides an accessible general introduction to the essential topics in computer vision. Classroom-tested programming exercises and review questions are also supplied at the end of each chapter. Features: provides an introduction to the basic notation and mathematical concepts for describing an image and the key concepts for mapping an image into an ℑ explains the topologic and geometric basics for analysing image regions and distributions of image values and discusses identifying patterns in an ℑ introduces optic flow for representing dense motion and various topics in sparse motion analysis; describes special approaches for image binarization and segmentation of still images or video frames; examines the basic components of a computer vision system; reviews different techniques for vision-based 3D shape reconstruction; includes a discussion of stereo matchers and the phase-congruency model for image features; presents an introduction into classification and learning.

Anbieter: buecher.de
Stand: 19.09.2019
Zum Angebot
Guide to Competitive Programming
36,99 € *
ggf. zzgl. Versand

This invaluable textbook presents a comprehensive introduction to modern competitive programming. The text highlights how competitive programming has proven to be an excellent way to learn algorithms, by encouraging the design of algorithms that actually work, stimulating the improvement of programming and debugging skills, and reinforcing the type of thinking required to solve problems in a competitive setting. The book contains many ´´folklore´´ algorithm design tricks that are known by experienced competitive programmers, yet which have previously only been formally discussed in online forums and blog posts. Topics and features: reviews the features of the C++ programming language, and describes how to create efficient algorithms that can quickly process large data sets; discusses sorting algorithms and binary search, and examines a selection of data structures of the C++ standard library; introduces the algorithm design technique of dynamic programming, and investigates elementary graph algorithms; covers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queries; surveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programming; examines advanced graph techniques, geometric algorithms, and string techniques; describes a selection of more advanced topics, including square root algorithms and dynamic programming optimization. This easy-to-follow guide is an ideal reference for all students wishing to learn algorithms, and practice for programming contests. Knowledge of the basics of programming is assumed, but previous background in algorithm design or programming contests is not necessary. Due to the broad range of topics covered at various levels of difficulty, this book is suitable for both beginners and more experienced readers.

Anbieter: buecher.de
Stand: 19.09.2019
Zum Angebot
Computer Vision: A Modern Approach
51,99 € *
ggf. zzgl. Versand

Appropriate for upper-division undergraduate- and graduate-level courses in computer vision found in departments of Computer Science, Computer Engineering and Electrical Engineering. This textbook provides the most complete treatment of modern computer vision methods by two of the leading authorities in the field. This accessible presentation gives both a general view of the entire computer vision enterprise and also offers sufficient detail for students to be able to build useful applications. Students will learn techniques that have proven to be useful by first-hand experience and a wide range of mathematical methods. Features + Benefits Broad coverageCoverage of a wide range of topics allows customization to fit instructor, student, and course needs. Allows instructors to select the most relevant topics for their students and encourages students to enrich their coursework by reading information on other computer vision topics. Most comprehensive and up-to-date text on computer visionIncludes essential topics that either reflect practical significance or are of theoretical importance. Provides students with the most coherent synthesis of current views and teaches them successful techniques for building applications. Depth of the material accessible to various levels of studentsTopics are discussed in substantial and increasing depth. While the first half of each chapter is accessible to undergraduates, a good grasp of each chapter provides students with a professional level of skill and knowledge. Application surveysDescribe numerous important application areas such as image based rendering and digital libraries. Teaches students about practical use of techniques and helps them gain insight into the demands of applications. Many important algorithms broken down and illustrated in pseudo code. Enables students to build working systems easily as they can understand the construction of the final application. Excellent pedagogy throughout the textIncludes numerous worked examples, exercises, programming assignments, and extensive illustrations. Provides students with ample opportunity to apply the concepts in the text. I IMAGE FORMATION 1 1 Geometric Camera Models 3 1.1 Image Formation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.1.1 Pinhole Perspective . . . . . . . . . . . . . . . . . . . . . . . 4 1.1.2 Weak Perspective . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.1.3 Cameras with Lenses . . . . . . . . . . . . . . . . . . . . . . . 8 1.1.4 The Human Eye . . . . . . . . . . . . . . . . . . . . . . . . . 12 1.2 Intrinsic and Extrinsic Parameters . . . . . . . . . . . . . . . . . . . 14 1.2.1 Rigid Transformations and Homogeneous Coordinates . . . . 14 1.2.2 Intrinsic Parameters . . . . . . . . . . . . . . . . . . . . . . . 16 1.2.3 Extrinsic Parameters . . . . . . . . . . . . . . . . . . . . . . . 18 1.2.4 Perspective Projection Matrices . . . . . . . . . . . . . . . . . 19 1.2.5 Weak-Perspective Projection Matrices . . . . . . . . . . . . . 20 1.3 Geometric Camera Calibration . . . . . . . . . . . . . . . . . . . . . 22 1.3.1 ALinear Approach to Camera Calibration . . . . . . . . . . . 23 1.3.2 ANonlinear Approach to Camera Calibration . . . . . . . . . 27 1.4 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 2 Light and Shading 32 2.1 Modelling Pixel Brightness . . . . . . . . . . . . . . . . . . . . . . . 32 2.1.1 Reflection at Surfaces . . . . . . . . . . . . . . . . . . . . . . 33 2.1.2 Sources and Their Effects . . . . . . . . . . . . . . . . . . . . 34 2.1.3 The Lambertian+Specular Model . . . . . . . . . . . . . . . . 36 2.1.4 Area Sources . . . . . . . . . . . . . . . . . . . . . . . . . . . 36 2.2 Inference from Shading . . . . . . . . . . . . . . . . . . . . . . . . . . 37 2.2.1 Radiometric Calibration and High Dynamic Range Images . . 38 2.2.2 The Shape of Specularities . . . . . . . . . . . . . . . . . . . 40 2.2.3 Inferring Lightness and Illumination . . . . . . . . . . . . . . 43 2.2.4 Photometric Stereo: Shape from Multiple Shaded Images . . 46 2.3 Modelling Interreflection . . . . . . . . . . . . . . . . . . . . . . . . . 52 2.3.1 The Illumination at a Patch Due to an Area Source . . . . . 52 2.3.2 Radiosity and Exitance . . . . . . . . . . . . . . . . . . . . . 54 2.3.3 An Interreflection Model . . . . . . . . . . . . . . . . . . . . . 55 2.3.4 Qualitative Properties of Interreflections . . . . . . . . . . . . 56 2.4 Shape from One Shaded Image

Anbieter: buecher.de
Stand: 20.09.2019
Zum Angebot
Algorithms
57,99 € *
ggf. zzgl. Versand

Essential Information that Every Serious Programming Student Needs to Know about Algorithms and Data Structures A Classic Reference The latest version of Sedgewick´s best-selling series, reflecting an indispensable body of knowledge developed over the past several decades. Broad Coverage Full treatment of data structures and algorithms for sorting, searching, graph processing, string processing, and geometric applications, including fifty algorithms every programmer should know. See www.cs.princeton.edu/algs4/top50 . Completely Revised Code New Java implementations written in an accessible, modular programming style, where all of the code is exposed to the reader and ready to use. New versions of quicksort, LZW compression, red-black tree search, RE pattern matching, and many other algorithms. Engages with Applications Algorithms are studied in the context of important scientific, engineering, and commercial applications. Clients and algorithms are expressed in real code, not the pseudo-code found in many other books. Intellectually Stimulating Engages reader interest with clear, concise text, detailed examples with visuals, carefully crafted code, historical and scientific context, and exercises at all levels. A Scientific Approach Develops precise statements about performance, supported by appropriate mathematical models and empirical studies validating those models. Integrated with the Web Visit www.cs.princeton.edu/algs4 for a freely accessible, comprehensive Web site, including text digests, program code, test data, programming projects, exercises, lecture slides, and other resources. Product Description This fourth edition of Robert Sedgewick and Kevin Wayne?s Algorithms is the leading textbook on algorithms today and is widely used in colleges and universities worldwide. This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing -- including fifty algorithms every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use. The algorithms in this book represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering, not to mention students who use computation in the liberal arts. The companion web site, algs4.cs.princeton.edu contains An online synopsis Full Java implementations Test data Exercises and answers Dynamic visualizations Lecture slides Programming assignments with checklists Links to related material The MOOC related to this book is accessible via the ´´Online Course´´ link at algs4.cs.princeton.edu . The course offers more than 100 video lecture segments that are integrated with the text, extensive online assessments, and the large-scale discussion forums that have proven so valuable. Offered each fall and spring, this course regularly attracts tens of thousands of registrants. Robert Sedgewick and Kevin Wayne are developing a modern approach to disseminating knowledge that fully embraces technology, enabling people all around the world to discover new ways of learning and teaching. By integrating their textbook, online content, and MOOC, all at the state of the art, they have built a unique resource that greatly expands the breadth and depth of the educational experience. Features + Benefits The #1 practical resource for everyone seeking to run programs faster or solve larger problems Surveys today´s most useful algorithms, with copious illustrations and examples Contains many new examples, ranging from physics, biology, and engineering to data compression and web search Contains real (not pseudocode) implementations, with detailed performance insights A companion web site, algs4.cs.princeton.edu , with many more resources for instructors, including text digests, program code, test data, programming projects, exercises, lecture slides, and other resources Preface viii Chapter 1: Fundamentals 3 1.1 Basic Programming Model 8 1.2 Data Abstraction 64 1.3 Bags, Queues, and Stacks 120 1.4 Analysis of Algorithms 172 1.5 Case Study: Union-Find 216 Chapter 2: Sorting 243 2.1 Elementary Sorts 244 2.2 Mergesort 270 2.3 Quicksort 288 2.4 Priority Queues 308 2.5 Applications

Anbieter: buecher.de
Stand: 19.09.2019
Zum Angebot