Hasil Pencarian  ::  Simpan CSV :: Kembali

"This timely text/​reference presents a broad overview of advanced deep learning architectures for learning effective feature representation for perceptual and biometrics-related tasks. The text offers a showcase of cutting-edge research on the use of convolutional neural networks (CNN) in face, iris, fingerprint, and vascular biometric systems, in addition to surveillance systems that use soft biometrics. Issues of biometrics security are also examined. Topics and features: Addresses the application of deep learning to enhance the performance of biometrics identification across a wide range of different biometrics modalities Revisits deep learning for face biometrics, offering insights from neuroimaging, and provides comparison with popular CNN-based architectures for face recognition Examines deep learning for state-of-the-art latent fingerprint and finger-vein recognition, as well as iris recognition Discusses deep learning for soft biometrics, including approaches for gesture-based identification, gender classification, and tattoo recognition Investigates deep learning for biometrics security, covering biometrics template protection methods, and liveness detection to protect against fake biometrics samples Presents contributions from a global selection of pre-eminent experts in the field representing academia, industry and government laboratories Providing both an accessible introduction to the practical applications of deep learning in biometrics, and a comprehensive coverage of the entire spectrum of biometric modalities, this authoritative volume will be of great interest to all researchers, practitioners and students involved in related areas of computer vision, pattern recognition and machine learning. Dr. Bir Bhanu is Bourns Presidential Chair, Distinguished Professor of Electrical and Computer Engineering and the Director of the Center for Research in Intelligent Systems at the University of California at Riverside, USA. Some of his other Springer publications include the titles Video Bioinformatics, Distributed Video Sensor Networks, and Human Recognition at a Distance in Video. Dr. Ajay Kumar is an Associate Professor in the Department of Computing at the Hong Kong Polytechnic University."

"This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut &​ Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way. The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds. All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work."

"his book constitutes the thoroughly refereed post-proceedings of the 11th International Workshop on Coalgebraic Methods in Computer Science, CMCS 2012, colocated with ETAPS 2012, held in Tallin, Estonia, in March/April 2012. The 10 revised full papers were carefully reviewed and selected from 23 submissions. Also included are three invited talks. The papers cover a wide range of topics in the theory, logics and applications of coalgebras."

"This book constitutes the refereed post-proceedings of the 10th IFIP WG 2.5 Working Conference on Uncertainty Quantification in Scientific Computing, WoCoUQ 2011, held in Boulder, CO, USA, in August 2011. The 24 revised papers were carefully reviewed and selected from numerous submissions. They are organized in the following topical sections : UQ need: risk, policy, and decision making, UQ theory, UQ tools, UQ practice, and hot topics. The papers are followed by the records of the discussions between the participants and the speaker."

"In this book the author presents general techniques for analysing the structure of such functions and the computational complexity of the minimisation problem, and he gives a comprehensive list of tractable cases. Moreover, he demonstrates that the so-called algebraic approach to VCSPs can be used not only for the search for tractable VCSPs, but also for other questions such as finding the boundaries to the applicability of certain algorithmic techniques."

"The research interests of Cristian Calude are reflected in the topics covered by the 32 papers included in this book, namely, algorithmic information theory, algorithms, automata and formal languages, computing and natural sciences, computability and applications, logic and applications, philosophy of computation, physics and computation, and unconventional models of computation. They have been organized into four parts. The first part consists of papers discussing his life achievements. This is followed by papers in the three general areas of complexity, computability, and randomness; physics, philosophy (and logic), and computation; and algorithms, automata, and formal models (including unconventional computing)."

"This book constitutes the refereed proceedings of the 10th International Conference on Formal Concept Analysis, ICFCA 2012, held in Leuven, Belgium in May 2012. The 20 revised full papers presented together with 6 invited talks were carefully reviewed and selected from 68 submissions. The topics covered in this volume range from recent advances in machine learning and data mining, mining terrorist networks and revealing criminals, concept-based process mining, to scalability issues in FCA and rough sets."

"The 53 revised papers presented together with 6 invited lectures were carefully reviewed and selected with an acceptance rate of under 29,8%. The CiE 2012 Turing Centenary Conference will be remembered as a historic event in the continuing development of the powerful explanatory role of computability across a wide spectrum of research areas. The papers presented at CiE 2012 represent the best of current research in the area, and forms a fitting tribute to the short but brilliant trajectory of Alan Mathison Turing. Both the conference series and the association promote the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences such as physics and biology, and also including the promotion of related non-scientific fields such as philosophy and history of computing."

"This book constitutes the proceedings of the 14th International Workshop on Computer Algebra in Scientific Computing, CASC 2012, held in Maribor, Slovenia, in September 2012. The 28 full papers presented were carefully reviewed and selected for inclusion in this book. One of the main themes of the CASC workshop series, namely polynomial algebra, is represented by contributions devoted to new algorithms for computing comprehensive Gröbner and involutive systems, parallelization of the Gröbner bases computation, the study of quasi-stable polynomial ideals, new algorithms to compute the Jacobson form of a matrix of Ore polynomials, a recursive Leverrier algorithm for inversion of dense matrices whose entries are monic polynomials, root isolation of zero-dimensional triangular polynomial systems, optimal computation of the third power of a long integer, investigation of the complexity of solving systems with few independent monomials, the study of ill-conditioned polynomial systems, a method for polynomial root-finding via eigen-solving and randomization, an algorithm for fast dense polynomial multiplication with Java using the new opaque typed method, and sparse polynomial powering using heaps."

"This book constitutes the thoroughly refereed post-conference proceedings of the 7th International Reversible Computation, RC 2011, held in Gent, Belgium, in July 2011. The 10 revised full papers presented were carefully reviewed and selected from 25 initial submissions for inclusion in the book. The papers are devoted to all aspects of reversible computation, ranging from theoretical and experimental aspects to various applications. Topics addressed are: functional language for reversible computations, logic design, reversible circuits designed by a software toolkit called RevKit, application of reversible computation to the domain of quantum circuits, and physical realizations of reversible circuits in CMOS technologies."