William A. P. Smith

Bio: William A. P. Smith is an academic researcher from University of York. The author has contributed to research in topics: Statistical model & Facial recognition system. The author has an hindex of 35, co-authored 198 publications receiving 4489 citations. Previous affiliations of William A. P. Smith include Imperial College London & Daresbury Laboratory.

DL_POLY_3: new dimensions in molecular dynamics simulations via massive parallelism

Abstract: DL_POLY_3 is a general-purpose massively parallel molecular dynamics simulation package embedding a highly efficient set of methods and algorithms such as: Domain Decomposition (DD), Linked Cells (LC), Daresbury Advanced Fourier Transform (DAFT), Trotter derived Velocity Verlet (VV) integration and RATTLE. Written to support academic research, it has a wide range of applications and can run on a wide range of computers; from single processor workstations to multi-processor computers. The code development has placed particular emphasis on the efficient utilization of multi-processor power by optimised memory workload and distribution, which makes it possible to simulate systems of the order of tens of millions of particles and beyond. In this paper we discuss the new DL_POLY_3 design, and report on the performance, capability and scalability. We also discuss new features implemented to simulate highly non-equilibrium processes of radiation damage and analyse the structural damage during such processes.

3D Morphable Face Models—Past, Present, and Future

Abstract: In this article, we provide a detailed survey of 3D Morphable Face Models over the 20 years since they were first proposed. The challenges in building and applying these models, namely, capture, modeling, image formation, and image analysis, are still active research topics, and we review the state-of-the-art in each of these areas. We also look ahead, identifying unsolved challenges, proposing directions for future research, and highlighting the broad range of current and future applications.

Inverse Rendering of Faces with a 3D Morphable Model

Abstract: In this paper, we present a complete framework to inverse render faces with a 3D Morphable Model (3DMM). By decomposing the image formation process into geometric and photometric parts, we are able to state the problem as a multilinear system which can be solved accurately and efficiently. As we treat each contribution as independent, the objective function is convex in the parameters and a global solution is guaranteed. We start by recovering 3D shape using a novel algorithm which incorporates generalization error of the model obtained from empirical measurements. We then describe two methods to recover facial texture, diffuse lighting, specular reflectance, and camera properties from a single image. The methods make increasingly weak assumptions and can be solved in a linear fashion. We evaluate our findings on a publicly available database, where we are able to outperform an existing state-of-the-art algorithm. We demonstrate the usability of the recovered parameters in a recognition experiment conducted on the CMU-PIE database.

A short description of DL_POLY

Abstract: DL_POLY is a general purpose molecular dynamics simulation package with in-built parallel algorithms. It may be run on a wide selection of distributed memory parallel computers, from national supercomputers with thousands of processors, to single processor workstations and can simulate small systems with order 100 atoms, to systems with millions of atoms. This introduction provides an outline of the features of the package and the underlying methodology.

3D Morphable Face Models -- Past, Present and Future

Abstract: In this paper, we provide a detailed survey of 3D Morphable Face Models over the 20 years since they were first proposed. The challenges in building and applying these models, namely capture, modeling, image formation, and image analysis, are still active research topics, and we review the state-of-the-art in each of these areas. We also look ahead, identifying unsolved challenges, proposing directions for future research and highlighting the broad range of current and future applications.

Fast parallel algorithms for short-range molecular dynamics

Abstract: Three parallel algorithms for classical molecular dynamics are presented. The first assigns each processor a fixed subset of atoms; the second assigns each a fixed subset of inter-atomic forces to compute; the third assigns each a fixed spatial region. The algorithms are suitable for molecular dynamics models which can be difficult to parallelize efficiently—those with short-range forces where the neighbors of each atom change rapidly. They can be implemented on any distributed-memory parallel machine which allows for message-passing of data between independently executing processors. The algorithms are tested on a standard Lennard-Jones benchmark problem for system sizes ranging from 500 to 100,000,000 atoms on several parallel supercomputers--the nCUBE 2, Intel iPSC/860 and Paragon, and Cray T3D. Comparing the results to the fastest reported vectorized Cray Y-MP and C90 algorithm shows that the current generation of parallel machines is competitive with conventional vector supercomputers even for small problems. For large problems, the spatial algorithm achieves parallel efficiencies of 90% and a 1840-node Intel Paragon performs up to 165 faster than a single Cray C9O processor. Trade-offs between the three algorithms and guidelines for adapting them to more complex molecular dynamics simulations are also discussed.

GROMACS 4: Algorithms for highly efficient, load-balanced, and scalable molecular simulation

Abstract: Molecular simulation is an extremely useful, but computationally very expensive tool for studies of chemical and biomolecular systems Here, we present a new implementation of our molecular simulation toolkit GROMACS which now both achieves extremely high performance on single processors from algorithmic optimizations and hand-coded routines and simultaneously scales very well on parallel machines The code encompasses a minimal-communication domain decomposition algorithm, full dynamic load balancing, a state-of-the-art parallel constraint solver, and efficient virtual site algorithms that allow removal of hydrogen atom degrees of freedom to enable integration time steps up to 5 fs for atomistic simulations also in parallel To improve the scaling properties of the common particle mesh Ewald electrostatics algorithms, we have in addition used a Multiple-Program, Multiple-Data approach, with separate node domains responsible for direct and reciprocal space interactions Not only does this combination of a

Computer vision : a modern approach = 计算机视觉 : 一种现代的方法

Abstract: From the Publisher: The accessible presentation of this book gives both a general view of the entire computer vision enterprise and also offers sufficient detail to be able to build useful applications. Users learn techniques that have proven to be useful by first-hand experience and a wide range of mathematical methods. A CD-ROM with every copy of the text contains source code for programming practice, color images, and illustrative movies. Comprehensive and up-to-date, this book includes essential topics that either reflect practical significance or are of theoretical importance. Topics are discussed in substantial and increasing depth. Application surveys describe numerous important application areas such as image based rendering and digital libraries. Many important algorithms broken down and illustrated in pseudo code. Appropriate for use by engineers as a comprehensive reference to the computer vision enterprise.