John C. Anderson

dblp:74/2386 · DBLP profile ↗
← Back
11ranked-venue papers
5as first author
0since 2021 · last 2013
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 8 · 4 first-authorHuman-computer interaction and ubiquitous computing · 2 · 2 first-authorSystems, architecture and hardware · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
4 papers
Visualization and visual analytics · 79% Geometric modeling and processing · 21%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Visualization and visual analytics › interactive data exploration › visual exploration
query-driven visualization
0.332011
An Application of Multivariate Statistical Analysis for Query-Driven Visualization · IEEE Trans. Vis. Comput. Graph. 2011
Query-Driven Visualization of Time-Varying Adaptive Mesh Refinement Data · IEEE Trans. Vis. Comput. Graph. 2008
Variable Interactions in Query-Driven Visualization · IEEE Trans. Vis. Comput. Graph. 2007
Geometric modeling and processing › 3d reconstruction
material interface reconstruction
0.112010
Smooth, Volume-Accurate Material Interface Reconstruction · IEEE Trans. Vis. Comput. Graph. 2010
Visualization and visual analytics
multivariate data visualization
0.012011
An Application of Multivariate Statistical Analysis for Query-Driven Visualization · IEEE Trans. Vis. Comput. Graph. 2011
Visualization and visual analytics
scientific visualization
0.012010
Smooth, Volume-Accurate Material Interface Reconstruction · IEEE Trans. Vis. Comput. Graph. 2010
Visualization and visual analytics › data visualization
GPU-based visualization
0.012008
Query-Driven Visualization of Time-Varying Adaptive Mesh Refinement Data · IEEE Trans. Vis. Comput. Graph. 2008
Visualization and visual analytics › scientific visualization › multifield visualization
correlation field
0.012007
Variable Interactions in Query-Driven Visualization · IEEE Trans. Vis. Comput. Graph. 2007
Visualization and visual analytics › information visualization › quantitative data visualization
statistical visualization
0.012007
Variable Interactions in Query-Driven Visualization · IEEE Trans. Vis. Comput. Graph. 2007

Methods — techniques the papers use, named apart from their topics

segmentation · 0.1nonparametric distribution estimation · 0.1volumetric forces · 0.1smoothing · 0.1active interface model · 0.1GPU indexing structure · 0.1cumulative distribution function · 0.1correlation analysis · 0.1
YearPublicationVenuePosition
2013 Simulating Cortical Development as a Self Constructing Process: A Novel Multi-Scale Approach Combining Molecular and Physical Aspects
abstract
Current models of embryological development focus on intracellular processes such as gene expression and protein networks, rather than on the complex relationship between subcellular processes and the collective cellular organization these processes support. We have explored this collective behavior in the context of neocortical development, by modeling the expansion of a small number of progenitor cells into a laminated cortex with layer and cell type specific projections. The developmental process is steered by a formal language analogous to genomic instructions, and takes place in a physically realistic three-dimensional environment. A common genome inserted into individual cells control their individual behaviors, and thereby gives rise to collective developmental sequences in a biologically plausible manner. The simulation begins with a single progenitor cell containing the artificial genome. This progenitor then gives rise through a lineage of offspring to distinct populations of neuronal precursors that migrate to form the cortical laminae. The precursors differentiate by extending dendrites and axons, which reproduce the experimentally determined branching patterns of a number of different neuronal cell types observed in the cat visual cortex. This result is the first comprehensive demonstration of the principles of self-construction whereby the cortical architecture develops. In addition, our model makes several testable predictions concerning cell migration and branching mechanisms.
Frederic Zubler, Andreas Hauri, Sabina S. Pfister, Roman Bauer 0001, John C. Anderson, Adrian M. Whatley, Rodney J. Douglas
PLoS Comput. Biol.5
2011 An Application of Multivariate Statistical Analysis for Query-Driven Visualization
abstract
Driven by the ability to generate ever-larger, increasingly complex data, there is an urgent need in the scientific community for scalable analysis methods that can rapidly identify salient trends in scientific data. Query-Driven Visualization (QDV) strategies are among the small subset of techniques that can address both large and highly complex data sets. This paper extends the utility of QDV strategies with a statistics-based framework that integrates nonparametric distribution estimation techniques with a new segmentation strategy to visually identify statistically significant trends and features within the solution space of a query. In this framework, query distribution estimates help users to interactively explore their query's solution and visually identify the regions where the combined behavior of constrained variables is most important, statistically, to their inquiry. Our new segmentation strategy extends the distribution estimation analysis by visually conveying the individual importance of each variable to these regions of high statistical significance. We demonstrate the analysis benefits these two strategies provide and show how they maybe used to facilitate the refinement of constraints over variables expressed in a user's query. We apply our method to data sets from two different scientific domains to demonstrate its broad applicability.
Luke J. Gosink, Christoph Garth, John C. Anderson, E. Wes Bethel, Kenneth I. Joy
IEEE Trans. Vis. Comput. Graph.3
2010 Smooth, Volume-Accurate Material Interface Reconstruction
abstract
A new material interface reconstruction method for volume fraction data is presented. Our method is comprised of two components: first, we generate initial interface topology; then, using a combination of smoothing and volumetric forces within an active interface model, we iteratively transform the initial material interfaces into high-quality surfaces that accurately approximate the problem's volume fractions. Unlike all previous work, our new method produces material interfaces that are smooth, continuous across cell boundaries, and segment cells into regions with proper volume. These properties are critical during visualization and analysis. Generating high-quality mesh representations of material interfaces is required for accurate calculations of interface statistics, and dramatically increases the utility of material boundary visualizations.
John C. Anderson, Christoph Garth, Mark A. Duchaineau, Kenneth I. Joy
IEEE Trans. Vis. Comput. Graph.1
2009 Interactive Visualization of Function Fields by Range-Space Segmentation
abstract
Abstract We present a dimension reduction and feature extraction method for the visualization and analysis of function field data. Function fields are a class of high‐dimensional, multi‐variate data in which data samples are one‐dimensional scalar functions. Our approach focuses upon the creation of high‐dimensional range‐space segmentations, from which we can generate meaningful visualizations and extract separating surfaces between features. We demonstrate our approach on high‐dimensional spectral imagery, and particulate pollution data from air quality simulations.
John C. Anderson, Luke J. Gosink, Mark A. Duchaineau, Kenneth I. Joy
Comput. Graph. Forum1
2008 Discrete Multi-Material Interface Reconstruction for Volume Fraction Data
abstract
Abstract Material interface reconstruction (MIR) is the task of constructing boundary interfaces between regions of homogeneous material, while satisfying volume constraints, over a structured or unstructured spatial domain. In this paper, we present a discrete approach to MIR based upon optimizing the labeling of fractional volume elements within a discretization of the problem's original domain. We detail how to construct and initially label a discretization, and introduce a volume conservative swap move for optimization. Furthermore, we discuss methods for extracting and visualizing material interfaces from the discretization. Our technique has significant advantages over previous methods: we produce interfaces between multiple materials that are continuous across cell boundaries for time‐varying and static data in arbitrary dimension with bounded error.
John C. Anderson, Christoph Garth, Mark A. Duchaineau, Kenneth I. Joy
Comput. Graph. Forum1
2008 Caustic Forecasting: Unbiased Estimation of Caustic Lighting for Global Illumination
abstract
Abstract We present an unbiased method for generating caustic lighting using importance sampled Path Tracing with Caustic Forecasting. Our technique is part of a straightforward rendering scheme which extends the Illumination by Weak Singularities method to allow for fully unbiased global illumination with rapid convergence. A photon shooting preprocess, similar to that used in Photon Mapping, generates photons that interact with specular geometry. These photons are then clustered, effectively dividing the scene into regions which will contribute similar amounts of caustic lighting to the image. Finally, the photons are stored into spatial data structures associated with each cluster, and the clusters themselves are organized into a spatial data structure for fast searching. During rendering we use clusters to decide the caustic energy importance of a region, and use the local photons to aid in importance sampling, effectively reducing the number of samples required to capture caustic lighting.
B. C. Budge, John C. Anderson, Kenneth I. Joy
Comput. Graph. Forum2
2008 Query-Driven Visualization of Time-Varying Adaptive Mesh Refinement Data
abstract
The visualization and analysis of AMR-based simulations is integral to the process of obtaining new insight in scientific research. We present a new method for performing query-driven visualization and analysis on AMR data, with specific emphasis on time-varying AMR data. Our work introduces a new method that directly addresses the dynamic spatial and temporal properties of AMR grids that challenge many existing visualization techniques. Further, we present the first implementation of query-driven visualization on the GPU that uses a GPU-based indexing structure to both answer queries and efficiently utilize GPU memory. We apply our method to two different science domains to demonstrate its broad applicability.
Luke J. Gosink, John C. Anderson, E. Wes Bethel, Kenneth I. Joy
IEEE Trans. Vis. Comput. Graph.2
2007 Feature Identification and Extraction in Function Fields
abstract
We present interactive techniques for identifying and extracting features in function fields. Function fields map points in n-dimensional Euclidean space to 1-dimensional scalar functions. Visual feature identification is ac- complished by interactively rendering scalar distance fields, constructed by applying a function-space distance metric over the function field. Combining visual exploration with feature extraction queries, formulated as a set of function-space constraints, facilitates quantitative analysis and annotation. Numerous application domains give rise to function fields. We present results for two-dimensional hyperspectral images, and a simulated time-varying, three-dimensional air quality dataset.
John C. Anderson, Luke J. Gosink, Mark A. Duchaineau, Kenneth I. Joy
EuroVis1
2007 Variable Interactions in Query-Driven Visualization
abstract
Our ability to generate ever-larger, increasingly-complex data, has established the need for scalable methods that identify, and provide insight into, important variable trends and interactions. Query-driven methods are among the small subset of techniques that are able to address both large and highly complex datasets. This paper presents a new method that increases the utility of query-driven techniques by visually conveying statistical information about the trends that exist between variables in a query. In this method, correlation fields, created between pairs of variables, are used with the cumulative distribution functions of variables expressed in a user's query. This integrated use of cumulative distribution functions and correlation fields visually reveals, with respect to the solution space of the query, statistically important interactions between any three variables, and allows for trends between these variables to be readily identified. We demonstrate our method by analyzing interactions between variables in two flame-front simulations.
Luke J. Gosink, John C. Anderson, E. Wes Bethel, Kenneth I. Joy
IEEE Trans. Vis. Comput. Graph.2
2005 Marching Diamonds for Unstructured Meshes
abstract
We present a higher-order approach to the extraction of isosurfaces from unstructured meshes. Existing methods use linear interpolation along each mesh edge to find isosurface intersections. In contrast, our method determines intersections by performing barycentric interpolation over diamonds formed by the tetrahedra incident to each edge. Our method produces smoother, more accurate isosurfaces. Additionally, interpolating over diamonds, rather than linearly interpolating edge endpoints. enables us to identify up to two isosurface intersections per edge. This paper details how our new technique extracts isopoints, and presents a simple connection strategy for forming a triangle mesh isosurface.
John C. Anderson, Janine Bennett, Kenneth I. Joy
IEEE Visualization1
1990 An experimental study on reject ratio prediction for VLSI circuits: Kokomo revisited
abstract
The authors report on an experiment to verify the accuracy of reject ratio predictions by the available approaches. The data collection effort includes instrumenting the wafer probe test to obtain chip failures as a function of applied vectors and running a fault simulator to obtain the cumulative fault coverage of these vectors. The accuracy of reject ratio predictions is judged by assuming earlier stopping points for the wafer probe, thereby gaining a measure of confidence in the final predicted value. The results of five different analyses are reported for over 70000 tested dies of a CMOS VLSI device. The five methods discussed predicted values for the reject ratio that vary by an order of magnitude at high values of fault coverage. It is shown that, with only an incremental effort during wafer probe, data collection that can be used to compare the relative accuracy of different models over a range of fault coverage is possible.>
Dharam Vir Das, Sharad C. Seth, Paul T. Wagner, John C. Anderson, Vishwani D. Agrawal
ITC4