GPU Computing Gems, Jade Edition, offers hands-on, proven techniques for general purpose GPU programming based on the successful application experiences of leading researchers and developers. One of few resources avai...
详细信息
ISBN:
(数字)9780123859648
ISBN:
(纸本)9780123859631
GPU Computing Gems, Jade Edition, offers hands-on, proven techniques for general purpose GPU programming based on the successful application experiences of leading researchers and developers. One of few resources available that distills the best practices of the community of CUDA programmers, this second edition contains 100% new material of interest across industry, including finance, medicine, imaging, engineering, gaming, environmental science, and green computing. It covers new tools and frameworks for productive GPU computing application development and provides immediate benefit to researchers developing improved programming environments for GPUs. Divided into five sections, this book explains how GPU execution is achieved with algorithm implementation techniques and approaches to data structure layout. More specifically, it considers three general requirements: high level of parallelism, coherent memory access by threads within warps, and coherent control flow within warps. Chapters explore topics such as accelerating database searches; how to leverage the Fermi GPU architecture to further accelerate prefix operations; and GPU implementation of hash tables. There are also discussions on the state of GPU computing in interactive physics and artificial intelligence; programming tools and techniques for GPU computing; and the edge and node parallelism approach for computing graph centrality metrics. In addition, the book proposes an alternative approach that balances computation regardless of node degree variance. Software engineers, programmers, hardware engineers, and advanced students will find this book extremely usefull. For useful source codes discussed throughout the book, the editors invite readers to the following website:
Results of research and development of the device for measurement of diffraction efficiency of diffraction optical elements (DOE) simultaneously in many diffraction orders and in the large dynamic range are presented....
详细信息
As space agencies are currently looking at Near Earth Asteroids as a next step on their exploration roadmap, high precision autonomous landing control schemes will be required for upcoming missions. In this paper, an ...
详细信息
As space agencies are currently looking at Near Earth Asteroids as a next step on their exploration roadmap, high precision autonomous landing control schemes will be required for upcoming missions. In this paper, an intelligent simulator is proposed to reproduce all of the visual and dynamic aspects required to test an autonomous Simultaneous Localization and Mapping (SLAM) system. The proposed simulator provides position and attitude information to a spacecraft during its approach descent and Landing phase toward the surface of an asteroid or other small celestial bodies. Because the SLAM system makes use of navigation cameras and a range sensor moving with the spacecraft as it approaches the surface, the simulator is also developed to reproduce a fully integrated 3D environment using computer graphics technology that mimics the noise, image detail and real-time performances of the navigation cameras and the range sensors. This paper describes the architecture and capability of the developed simulator and the SLAM system for which it is designed. The developed simulator is evaluated by using the specifications of the onboard sensors used in the Hayabusa spacecraft sent by JAXA/ISAS to the Itokawa asteroid in 2003.
This volume demonstrates the power of the Markov random field (MRF) in vision, treating the MRF both as a tool for modeling image data and, utilizing recently developed algorithms, as a means of making inferences abou...
详细信息
ISBN:
(数字)9780262298353
ISBN:
(纸本)9780262015776
This volume demonstrates the power of the Markov random field (MRF) in vision, treating the MRF both as a tool for modeling image data and, utilizing recently developed algorithms, as a means of making inferences about images. These inferences concern underlying image and scene structure as well as solutions to such problems as image reconstruction, image segmentation, 3D vision, and object labeling. It offers key findings and state-of-the-art research on both algorithms and *** an introduction to the fundamental concepts used in MRFs, the book reviews some of the main algorithms for performing inference with MRFs; presents successful applications of MRFs, including segmentation, super-resolution, and image restoration, along with a comparison of various optimization methods; discusses advanced algorithmic topics; addresses limitations of the strong locality assumptions in the MRFs discussed in earlier chapters; and showcases applications that use MRFs in more complex ways, as components in bigger systems or with multiterm energy functions. The book will be an essential guide to current research on these powerful mathematical tools.
The proceedings contain 56 papers. The topics discussed include: an improved color mood blending between images via fuzzy relationship;automatic combination of feature descriptors for effective 3D shape retrieval;inte...
详细信息
ISBN:
(纸本)3540714561
The proceedings contain 56 papers. The topics discussed include: an improved color mood blending between images via fuzzy relationship;automatic combination of feature descriptors for effective 3D shape retrieval;interactive hierarchical level of detail level selection algorithm for point based rendering;an applicable hierarchical clustering algorithm for content-based image retrieval;clouds and atmospheric phenomena simulation in real-time 3D graphics;feature points detection using combined character along principal orientation;fast virtual cloth energy minimization;interactive system for efficient video cartooning;virtual reality technology used to develop didactic models;the multiresolution analysis of triangle surface meshes with lifting scheme;re-mapping animation parameters between multiple types of facial model;and facial feature point extraction using the adaptive mean shape in active shape model.
The traditional complicated shells design of architecture applies mathematics lofting on the base of experience formula. The method is complicated, which result curve has no unambiguous implication. The traditional si...
详细信息
ISBN:
(纸本)9781612844589
The traditional complicated shells design of architecture applies mathematics lofting on the base of experience formula. The method is complicated, which result curve has no unambiguous implication. The traditional single aperture mesh modeling, which generally applies Delaunay triangulation, has difficulty in interaction control. A mixed subdivision modeling of single aperture mesh is represented in this paper. The method has an unambiguous implication with 3 cluster curve which is C 2 continuous after fairing. The method is a completely simple one without constructing and solving equations. The example of British Museum shell design show the great flexibility advantage of mixed subdivision design method in net shell architecture.
Region filling algorithm is widely used in GIS,remote sensing,image processing,and plays an important *** are problems that seeds are filled into stacks repeatedly and redundant information is for traditional 4-connec...
详细信息
Region filling algorithm is widely used in GIS,remote sensing,image processing,and plays an important *** are problems that seeds are filled into stacks repeatedly and redundant information is for traditional 4-connected region filling *** this paper,we present a new fast region filling algorithm based on "Marking Method" to solve these problems that seeds are filled into stacks repeatedly,and then,change the scanning order and uses the "Cross Method" to search the filling *** with the traditional algorithm,this algorithm not only can improve 7 times more efficiency,but also can make it simple and filling correctly.
To synthesize a variety of texture images from examples in common PCs is an important topic in computer graphics. This paper proposed a novel patch-based image hybrids synthesis method, which can generate plausible re...
详细信息
To synthesize a variety of texture images from examples in common PCs is an important topic in computer graphics. This paper proposed a novel patch-based image hybrids synthesis method, which can generate plausible results with visual diversity. First, image analysis was performed to build an effective data structure for synthesizing samples in a fast way which can maintain the texture structure. In the image analysis phase, the candidate patch set was built for each position. Then, various hybrid images were generated using patch-based texture synthesis method. Poisson editing algorithm and deblurring techniques were further adopted to optimize the results. Various experiments showed that this new method can hybrid sample images with large color difference, which can also overcome the less smooth boundary problem of the conventional synthesis methods.
The polygon orientation identification and point-in-polygon query algorithm for GIS polygon is in the course of improvement. Robust algorithms are presented in this paper. By comparing the serial number of polygon'...
详细信息
The polygon orientation identification and point-in-polygon query algorithm for GIS polygon is in the course of improvement. Robust algorithms are presented in this paper. By comparing the serial number of polygon's four (or three, two) extreme points, the polygon's orientation can be identified, the main computation in the new algorithm is only integers' comparison. By finding the shortest point to subtense edge's approximate distance of the query point to all the polygon edges, and comparing its' cross product with that of a extreme point, the inclusion between the point and the polygon can be identified. The algorithms overcome the shortage of the past algorithms, treat the special cases as the ordinary ones. The algorithms' time complexity and space complexity is linear to the number of polygon's vertices. No special cases should be pay more attention to. They are easy to understand and straight forward to implement. Analyses show that they are robust, highly efficient.
暂无评论