IMIST


Affiner votre recherche

Votre recherche a retourné 40 résultats.

Adaptive blind signal and image processing : learning algorithms and applications / par Cichocki, Andrzej. Publication : Chichester ; | New York : J. Wiley, 2002 . xxxi, 554 p. : 25 cm. + Date : 2002 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1),

Advanced data structures par Brass,, Peter. Publication : Cambridge | New York Cambrige University Press 2008 . xvi, 456 pages 24 cm. Date : 2008 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1),

Advances in Digital Image Processing and Information Technology First International Conference on Digital Image Processing and Pattern Recognition, DPPR 2011, Tirunelveli, Tamil Nadu, India, September 23-25, 2011. Proceedings / par Nagamalai, Dhinaharan. Publication : Berlin, Heidelberg : Springer Berlin Heidelberg : | Springer e-books : | Imprint: Springer : | Springer e-books, 2011 . 1 online resource. Date : 2011 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1),

Algorithmic adventures from knowledge to magic par Hromkovič, Juraj Publication : Berlin | London Springer 2009 . xiii, 363 pages 24 cm Date : 2009 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1),

Algorithms for image processing and computer vision par Parker, J. R. Publication : [S.l.] Wiley 2011 . 480 p. , A cookbook of algorithms for common image processing applications Thanks to advances in computer hardware and software, algorithms have been developed that support sophisticated image processing without requiring an extensive background in mathematics. This bestselling book has been fully updated with the newest of these, including 2D vision methods in content-based searches and the use of graphics cards as image processing computational aids. It’s an ideal reference for software engineers and developers, advanced programmers, graphics programmers, scientists, and other specialists who require highly specialized image processing. Algorithms now exist for a wide variety of sophisticated image processing applications required by software engineers and developers, advanced programmers, graphics programmers, scientists, and related specialists This bestselling book has been completely updated to include the latest algorithms, including 2D vision methods in content-based searches, details on modern classifier methods, and graphics cards used as image processing computational aids Saves hours of mathematical calculating by using distributed processing and GPU programming, and gives non-mathematicians the shortcuts needed to program relatively sophisticated applications. Algorithms for Image Processing and Computer Vision, 2nd Edition provides the tools to speed development of image processing applications. 24 cm. Date : 2011 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1),

Algorithms, complexity analysis and vlsi architectures for mpeg-4 motion estimation par Kuhn,, Peter M. Publication : [S.l.] Springer 2010 . 239 p. , MPEG-4 is the multimedia standard for combining interactivity, natural and synthetic digital video, audio and computer-graphics. Typical applications are: internet, video conferencing, mobile videophones, multimedia cooperative work, teleteaching and games. With MPEG-4 the next step from block-based video (ISO/IEC MPEG-1, MPEG-2, CCITT H.261, ITU-T H.263) to arbitrarily-shaped visual objects is taken. This significant step demands a new methodology for system analysis and design to meet the considerably higher flexibility of MPEG-4. Motion estimation is a central part of MPEG-2-1-4 and H.261/H.263 video compression standards and has attracted much attention in research and industry, for the following reasons: it is computationally the most demanding algorithm of a video encoder (about 60-80% of the total computation time), it has a high impact on the visual quality of a video encoder, and it is not standardized, thus being open to competition. Algorithms, Complexity Analysis, and VLSI Architectures for MPEG-4 Motion Estimation covers in detail every single step in the design of a MPEG-2-1-4 or H.261/H.263 compliant video encoder: Fast motion estimation algorithms Complexity analysis tools Detailed complexity analysis of a software implementation of MPEG-4 video Complexity and visual quality analysis of fast motion estimation algorithms within MPEG-4 Design space on motion estimation VLSI architectures Detailed VLSI design examples of (1) a high throughput and (2) a low-power MPEG-4 motion estimator. Algorithms, Complexity Analysis and VLSI Architectures for MPEG-4 Motion Estimation is an important introduction to numerous algorithmic, architectural and system design aspects of the multimedia standard MPEG-4. As such, all researchers, students and practitioners working in image processing, video coding or system and VLSI design will find this book of interest. 23 cm. Date : 2010 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1),

An introduction to 3d computer vision techniques and algorithms par Cyganek, Boguslaw Publication : Chichester Wiley 2009 . xx, 483 p. , Computer vision encompasses the construction of integrated vision systems and the application of vision to problems of real-world importance. The process of creating 3D models is still rather difficult, requiring mechanical measurement of the camera positions or manual alignment of partial 3D views of a scene. However using algorithms, it is possible to take a collection of stereo-pair images of a scene and then automatically produce a photo-realistic, geometrically accurate digital 3D model. This book provides a comprehensive introduction to the methods, theories and algorithms of 3D computer vision. Almost every theoretical issue is underpinned with practical implementation or a working algorithm using pseudo-code and complete code written in C++ and MatLab. There is the additional clarification of an accompanying website with downloadable software, case studies and exercises. Organised in three parts, Cyganek and Siebert give a brief history of vision research, and subsequently: present basic low-level image processing operations for image matching, including a separate chapter on image matching algorithms; explain scale-space vision, as well as space reconstruction and multiview integration; demonstrate a variety of practical applications for 3D surface imaging and analysis; provide concise appendices on topics such as the basics of projective geometry and tensor calculus for image processing, distortion and noise in images plus image warping procedures. An Introduction to 3D Computer Vision Algorithms and Techniques is a valuable reference for practitioners and programmers working in 3D computer vision, image processing and analysis as well as computer visualisation. It would also be of interest to advanced students and researchers in the fields of engineering, computer science, clinical photography, robotics, graphics and mathematics. 25 cm. Date : 2009 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1),

An Introduction to quantum computing / par Kaye, Phillip. Publication : [S.l.] : Oxford University Press, USA, 2007 . 288 p. ; , This concise, accessible text provides a thorough introduction to quantum computing - an exciting emergent field at the interface of the computer, engineering, mathematical and physical sciences. Aimed at advanced undergraduate and beginning graduate students in these disciplines, the text is technically detailed and is clearly illustrated throughout with diagrams and exercises. Some prior knowledge of linear algebra is assumed, including vector spaces and inner products. However, prior familiarity with topics such as tensor products and spectral decomposition is not required, as the necessary material is reviewed in the text. 24 cm. Date : 2007 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1),

Computer vision : algorithms and applications / par Szeliski, Richard, Publication : London ; | New York : Springer, 2011 . xx, 812 pages : 29 cm. Date : 2011 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (2),

Differential evolution : a practical approach to global optimization par Price, Kenneth V. Publication : Berlin | New York Springer 2005 . xix, 538 pages 24 cm. + Date : 2005 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1),

Digital geometry : geometric methods for digital picture analysis par Klette,, Reinhard. Publication : [S.l.] Morgan Kaufmann 2004 . 672 p. , Digital geometry is about deriving geometric information from digital pictures. The field emerged from its mathematical roots some forty-years ago through work in computer-based imaging, and it is used today in many fields, such as digital image processing and analysis (with applications in medical imaging, pattern recognition, and robotics) and of course computer graphics. Digital Geometry is the first book to detail the concepts, algorithms, and practices of the discipline. This comphrehensive text and reference provides an introduction to the mathematical foundations of digital geometry, some of which date back to ancient times, and also discusses the key processes involved, such as geometric algorithms as well as operations on pictures. *A comprehensive text and reference written by pioneers in digital geometry, image processing and analysis, and computer vision *Provides a collection of state-of-the-art algorithms for a wide variety of geometrical picture analysis tasks, including extracting data from digital images and making geometric measurements on the data *Includes exercises, examples, and references to related or more advanced work. 24 cm. Date : 2004 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1),

Distributed algorithms par Lynch, Nancy A. Publication : [S.l.] Morgan Kaufmann 1996 . 872 p. , In Distributed Algorithms , Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers, and researchers. Distributed Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automata-theoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed processes, data consistency, deadlock detection, leader election, global snapshots, and many others. The material is organized according to the system model-first by the timing model and then by the interprocess communication mechanism. The material on system models is isolated in separate chapters for easy reference. The presentation is completely rigorous, yet is intuitive enough for immediate comprehension. This book familiarizes readers with important problems, algorithms, and impossibility results in the area: readers can then recognize the problems when they arise in practice, apply the algorithms to solve them, and use the impossibility results to determine whether problems are unsolvable. The book also provides readers with the basic mathematical tools for designing new algorithms and proving new impossibility results. In addition, it teaches readers how to reason carefully about distributed algorithms-to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures. 24 cm. Date : 1996 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1),

Distributed search by constrained agents : algorithms, performance, communication / par Meisels, Amnon. Publication : London : Springer, 2008 . xx, 216 pages : 25 cm. Date : 2008 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1),

Evaluating Learning Algorithms a classification perspective par Japkowicz, Nathalie. Publication : Cambridge | New York Cambridge University Press 2011 . xvi, 406 pages , "The field of machine learning has matured to the point where many sophisticated learning approaches can be applied to practical applications. Thus it is of critical importance that researchers have the proper tools to evaluate learning approaches and understand the underlying issues. This book examines various aspects of the evaluation process with an emphasis on classification algorithms. The authors describe several techniques for classifier performance assessment, error estimation and resampling, obtaining statistical significance as well as selecting appropriate domains for evaluation. They also present a unified evaluation framework and highlight how different components of evaluation are both significantly interrelated and interdependent. The techniques presented in the book are illustrated using R and WEKA facilitating better practical insight as well as implementation. Aimed at researchers in the theory and applications of machine learning, this book offers a solid basis for conducting performance evaluations of algorithms in practical settings"-- | "Technological advances, in recent decades, have made it possible to automate many tasks that previously required signi.cant amounts of manual time, performing regular or repetitive activities. Certainly, computing machines have proven to be a great asset in improving on human speed and e.ciency as well as in reducing errors in these essentially mechanical tasks. More impressively, however, the emergence of computing technologies has also enabled the automation of tasks that require signi.cant understanding of intrinsically human domains that can, in no way, be qualified as merely mechanical. While we, humans, have maintained an edge in performing some of these tasks, e.g. recognizing pictures or delineating boundaries in a given picture, we have been less successful at others, e.g., fraud or computer network attack detection, owing to the sheer volume of data involved, and to the presence of nonlinear patterns to be discerned and analyzed simultaneously within these data. Machine Learning and Data Mining, on the other hand, have heralded significant advances, both theoretical and applied, in this direction, thus getting us one step closer to realizing such goals"-- 24 cm Date : 2011 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (2),

FAIR flexible algorithms for image registration par Modersitzki,, Jan. Publication : Philadelphia Society for Industrial and Applied Mathematics 2009 . xxi, 189 pages 26 cm. Date : 2009 Disponibilité : Exemplaires disponibles: La bibliothèque des sciences de l'ingénieur (1),

Vous ne trouvez pas ce que vous cherchez ?
© Tous droits résérvés IMIST/CNRST
Angle Av. Allal Al Fassi et Av. des FAR, Hay Ryad, BP 8027, 10102 Rabat, Maroc
Tél:(+212) 05 37.56.98.00
CNRST / IMIST

Propulsé par Koha