There is a growing need to be able to accurately and efficiently search visual data sets, and in particular, 3D shape data sets. This paper proposes a novel technique, called Topology Matching, in which similarity between polyhedral models is quickly, accurately, and automatically calculated by comparing Multiresolutional Reeb Graphs (MRGs). The MRG thus operates well as a search key for 3D shape data sets. In particular, the MRG represents the skeletal and topological structure of a 3D shape at various levels of resolution. The MRG is constructed using a continuous function on the 3D shape, which may preferably be a function of geodesic distance because this function is invariant to translation and rotation and is also robust against changes in connectivities caused by a mesh simplification or subdivision. The similarity calculation between 3D shapes is processed using a coarse-to-fine strategy while preserving the consistency of the graph structures, which results in establishing a correspondence between the parts of objects. The similarity calculation is fast and efficient because it is not necessary to determine the particular pose of a 3D shape, such as a rotation, in advance. Topology Matching is particularly useful for interactively searching for a 3D object because the results of the search fit human intuition well.

/pdf/topology-matching-for-fully-automatic-similarity-estimation-2pui3z62og.pdf

Topology matching for fully automatic similarity estimation of 3D shapes

A morphable model for the synthesis of 3D faces

The rapid increase in the performance of graphics hardware, coupled with recent improvements in its programmability, have made graphics hardware a compelling platform for computationally demanding tasks in a wide variety of application domains. In this report, we describe, summarize, and analyze the latest research in mapping general-purpose computation to graphics hardware. We begin with the technical motivations that underlie general-purpose computation on graphics processors (GPGPU) and describe the hardware and software developments that have led to the recent interest in this field. We then aim the main body of this report at two separate audiences. First, we describe the techniques used in mapping general-purpose computation to graphics hardware. We believe these techniques will be generally useful for researchers who plan to develop the next generation of GPGPU algorithms and techniques. Second, we survey and categorize the latest developments in general-purpose application development on graphics hardware. This survey should be of particular interest to researchers who are interested in using the latest GPGPU applications in their systems of interest.

/pdf/a-survey-of-general-purpose-computation-on-graphics-hardware-2phx1q9xxr.pdf

A Survey of General-Purpose Computation on Graphics Hardware

A Survey of General-Purpose Computation on Graphics Hardware.

Computer algebra systems are now ubiquitous in all areas of science and engineering. This highly successful textbook, widely regarded as the “bible of computer algebra”, gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems. Designed to accompany oneor two-semester courses for advanced undergraduate or graduate students in computer science or mathematics, its comprehensiveness and reliability has also made it an essential reference for professionals in the area. Special features include: detailed study of algorithms including time analysis; implementation reports on several topics; complete proofs of the mathematical underpinnings; and a wide variety of applications (among others, in chemistry, coding theory, cryptography, computational logic, and the design of calendars and musical scales). A great deal of historical information and illustration enlivens the text. In this third edition, errors have been corrected and much of the Fast Euclidean Algorithm chapter has been renovated.

Modern computer algebra

Due to the impressive capabilities of human visual processing, interactive visualization methods have become essential tools for scientists to explore and analyze large, complex datasets. However, traditional approaches do not account for the increased size or latency of data retrieval when interacting with these often remote datasets. In this dissertation, I discuss two novel design paradigms, based on accepted models of the information visualization process and graphics hardware pipeline, that are appropriate for interactive visualization of large remote datasets. In particular, I discuss novel solutions aimed at improving the performance of interactive visualization systems when working with large numeric datasets and large terrain (elevation and imagery) datasets by using data reduction and asynchronous retrieval of view-prioritized data, respectively. 
First I present a modified version of the standard information visualization model that accounts for the challenges presented by interacting with large, remote datasets. I also provide the details of a software framework implemented using this model and discuss several different visualization applications developed within this framework. 
Next I present a novel technique for leveraging the hardware graphics pipeline to provide asynchronous, view-prioritized data retrieval to support interactive visualization of remote terrain data. I provide the results of statistical analysis of performance metrics to demonstrate the effectiveness of this approach. 
Finally I present the details of two novel visualization techniques, and the results of evaluating these systems using controlled user studies and expert evaluation. The results of these qualitative and quantitative evaluation mechanisms demonstrate improved visual analysis task performance for large numeric datasets.

View-dependent visualization for analysis of large datasets

Advances in high-resolution, high-throughput 3D microscopy techniques are enabling subcellular investigation of whole small animal organs such as the mouse brain. Knife-Edge Scanning Microscopy (KESM) is one such technique based on physical (or serial) sectioning to overcome diffraction limited imaging in optical sectioning approaches. However, due to the physical sectioning process depending on a mechanical process, vibration (chatter) and obstruction of the light path by floating debris can cause a varying degrees of image error. In this paper, we present a change-detection-based error detection method to minimize such errors. Change detection is done in three steps: preprocessing (subsampling and illumination equalization), change detection, and postprocessing (morphology-based operation). Based on the change detection results, a finite state machine is used to alert a human operator or stop the machine. The method has been tested on three KESM data sets, demonstrating its effectiveness. The approach is expected to be widely applicable to other physical sectioning microscopy techniques.

Real-time detection of imaging errors in the Knife-Edge Scanning Microscope through change detection

Interactive Rule-Based Design

In this paper, we present a method that allows designers to interactively create partially self-similar manifold surfaces without relying on shape grammars or fractal methods. The modellers that are based on traditional fractal methods or shape grammars usually create disconnected surfaces and restrict the creative freedom of users. In most cases, the shapes through conventional fractal or shape grammar methods are defined by hard coded schemes that allow limited interactivity for the design process. We present a new approach for modelling such shapes. With this approach, we have developed a simple generative tool with given adjustable parameters to achieve variety of conceptual forms. Using this tool, designers can interactively create a variety of partially self-similar manifold surfaces.

Interactive Rule-Based Design - An experimental interface for conceptual design

We present a novel real-time method for simulating aeolian sand transport and dune propagation. Our method is a GPU-based extension of the Desertscapes Simulation sand propagation model to additionally capture echo dunes and obstacle interaction. We validate our method by comparing it against an existing study of echo dune evolution in a wind tunnel environment. Additionally, we demonstrate the significantly improved performance of our method via comparison to the existing, CPU-based method. Lastly, we validate our method by comparing it to a published study exploring the evolution of dunes in a bidirectional wind environment driven by an offline, cellular autonoma based method. We conclude that the presented method is a simple and helpful tool for users in multiple domains who wish to capture physically plausible desertscape evolution in real time.

/pdf/real-time-sand-dune-simulation-35ko16zv.pdf

John Keyser

Papers

View-dependent visualization for analysis of large datasets

Real-time detection of imaging errors in the Knife-Edge Scanning Microscope through change detection

Interactive Rule-Based Design

Interactive Rule-Based Design - An experimental interface for conceptual design

Real-Time Sand Dune Simulation