Mike Roberts
Stanford University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Mike Roberts.
Medical Image Analysis | 2015
Verena Kaynig; Amelio Vázquez-Reina; Seymour Knowles-Barley; Mike Roberts; Thouis R. Jones; Narayanan Kasthuri; Eric L. Miller; Jeff W. Lichtman; Hanspeter Pfister
Automated sample preparation and electron microscopy enables acquisition of very large image data sets. These technical advances are of special importance to the field of neuroanatomy, as 3D reconstructions of neuronal processes at the nm scale can provide new insight into the fine grained structure of the brain. Segmentation of large-scale electron microscopy data is the main bottleneck in the analysis of these data sets. In this paper we present a pipeline that provides state-of-the art reconstruction performance while scaling to data sets in the GB-TB range. First, we train a random forest classifier on interactive sparse user annotations. The classifier output is combined with an anisotropic smoothing prior in a Conditional Random Field framework to generate multiple segmentation hypotheses per image. These segmentations are then combined into geometrically consistent 3D objects by segmentation fusion. We provide qualitative and quantitative evaluation of the automatic segmentation and demonstrate large-scale 3D reconstructions of neuronal processes from a 27,000 μm(3) volume of brain tissue over a cube of 30 μm in each dimension corresponding to 1000 consecutive image sections. We also introduce Mojo, a proofreading tool including semi-automated correction of merge errors based on sparse user scribbles.
international conference on computer graphics and interactive techniques | 2010
Mike Roberts; Mario Costa Sousa; Joseph Ross Mitchell
We present a novel GPU level set segmentation algorithm that is both work-efficient and step-efficient. Our algorithm: (1) has linear work-complexity and logarithmic step-complexity, both of which depend only on the size of the active computational domain and do not depend on the size of the level set field; (2) limits the active computational domain to the minimal set of changing elements by examining both the temporal and spatial derivatives of the level set field; (3) tracks the active computational domain at the granularity of individual level set field elements instead of tiles without performance penalty; and (4) employs a novel parallel method for removing duplicate elements from unsorted data streams in a constant number of steps. We apply our algorithm to 3D medical images and we demonstrate that in typical clinical scenarios, our algorithm reduces the total number of processed level set field elements by 16× and is 14× faster than previous GPU algorithms with no reduction in segmentation accuracy.
IEEE Transactions on Visualization and Computer Graphics | 2014
Daniel Haehn; Seymour Knowles-Barley; Mike Roberts; Johanna Beyer; Narayanan Kasthuri; Jeff W. Lichtman; Hanspeter Pfister
Proofreading refers to the manual correction of automatic segmentations of image data. In connectomics, electron microscopy data is acquired at nanometer-scale resolution and results in very large image volumes of brain tissue that require fully automatic segmentation algorithms to identify cell boundaries. However, these algorithms require hundreds of corrections per cubic micron of tissue. Even though this task is time consuming, it is fairly easy for humans to perform corrections through splitting, merging, and adjusting segments during proofreading. In this paper we present the design and implementation of Mojo, a fully-featured single-user desktop application for proofreading, and Dojo, a multi-user web-based application for collaborative proofreading. We evaluate the accuracy and speed of Mojo, Dojo, and Raveler, a proofreading tool from Janelia Farm, through a quantitative user study. We designed a between-subjects experiment and asked non-experts to proofread neurons in a publicly available connectomics dataset. Our results show a significant improvement of corrections using web-based Dojo, when given the same amount of time. In addition, all participants using Dojo reported better usability. We discuss our findings and provide an analysis of requirements for designing visual proofreading software.
international conference on computer graphics and interactive techniques | 2015
Niels Joubert; Mike Roberts; Anh Truong; Floraine Berthouzoz; Pat Hanrahan
Cameras attached to small quadrotor aircraft are rapidly becoming a ubiquitous tool for cinematographers, enabling dynamic camera movements through 3D environments. Currently, professionals use these cameras by flying quadrotors manually, a process which requires much skill and dexterity. In this paper, we investigate the needs of quadrotor cinematographers, and build a tool to support video capture using quadrotor-based camera systems. We begin by conducting semi-structured interviews with professional photographers and videographers, from which we extract a set of design principles. We present a tool based on these principles for designing and autonomously executing quadrotor-based camera shots. Our tool enables users to: (1) specify shots visually using keyframes; (2) preview the resulting shots in a virtual environment; (3) precisely control the timing of shots using easing curves; and (4) capture the resulting shots in the real world with a single button click using commercially available quadrotors. We evaluate our tool in a user study with novice and expert cinematographers. We show that our tool makes it possible for novices and experts to design compelling and challenging shots, and capture them fully autonomously.
medical image computing and computer assisted intervention | 2011
Mike Roberts; Won-Ki Jeong; Amelio Vázquez-Reina; Markus Unger; Horst Bischof; Jeff W. Lichtman; Hanspeter Pfister
We present a novel semi-automatic method for segmenting neural processes in large, highly anisotropic EM (electron microscopy) image stacks. Our method takes advantage of sparse scribble annotations provided by the user to guide a 3D variational segmentation model, thereby allowing our method to globally optimally enforce 3D geometric constraints on the segmentation. Moreover, we leverage a novel algorithm for propagating segmentation constraints through the image stack via optimal volumetric pathways, thereby allowing our method to compute highly accurate 3D segmentations from very sparse user input. We evaluate our method by reconstructing 16 neural processes in a 1024 x 1024 x 50 nanometer-scale EM image stack of a mouse hippocampus. We demonstrate that, on average, our method is 68% more accurate than previous state-of-the-art semi-automatic methods.
Computers & Graphics | 2010
Stefan Bruckner; Peter Rautek; Ivan Viola; Mike Roberts; Mario Costa Sousa; M. Eduard Gröller
In this paper, we introduce a novel framework for the compositing of interactively rendered 3D layers tailored to the needs of scientific illustration. Currently, traditional scientific illustrations are produced in a series of composition stages, combining different pictorial elements using 2D digital layering. Our approach extends the layer metaphor into 3D without giving up the advantages of 2D methods. The new compositing approach allows for effects such as selective transparency, occlusion overrides, and soft depth buffering. Furthermore, we show how common manipulation techniques such as masking can be integrated into this concept. These tools behave just like in 2D, but their influence extends beyond a single viewpoint. Since the presented approach makes no assumptions about the underlying rendering algorithms, layers can be generated based on polygonal geometry, volumetric data, point-based representations, or others. Our implementation exploits current graphics hardware and permits real-time interaction and rendering.
Computer Methods and Programs in Biomedicine | 2013
Mong Dang; Jayesh Modi; Mike Roberts; Christopher Chan; J. Ross Mitchell
UNLABELLED Precision and accuracy are sometimes sacrificed to ensure that medical image processing is rapid. To address this, our lab had developed a novel level set segmentation algorithm that is 16× faster and >96% accurate on realistic brain phantoms. METHODS This study reports speed, precision and estimated accuracy of our algorithm when measuring MRIs of meningioma brain tumors and compares it to manual tracing and modified MacDonald (MM) ellipsoid criteria. A repeated-measures study allowed us to determine measurement precisions (MPs) - clinically relevant thresholds for statistically significant change. RESULTS Speed: the level set, MM, and trace methods required 1:20, 1:35, and 9:35 (mm:ss) respectively on average to complete a volume measurement (p<0.05). Accuracy: the level set was not statistically different to the estimated true lesion volumes (p>0.05). Precision: the MMs within-operator and between-operator MPs were significantly higher (worse) than the other methods (p<0.05). The observed difference in MP between the level set and trace methods did not reach statistical significance (p>0.05). CONCLUSION Our level set is faster on average than MM, yet has accuracy and precision comparable to manual tracing.
international conference on computer graphics and interactive techniques | 2016
Mike Roberts; Pat Hanrahan
When designing trajectories for quadrotor cameras, it is important that the trajectories respect the dynamics and physical limits of quadrotor hardware. We refer to such trajectories as being feasible. In this paper, we introduce a fast and user-friendly algorithm for generating feasible quadrotor camera trajectories. Our algorithm takes as input an infeasible trajectory designed by a user, and produces as output a feasible trajectory that is as similar as possible to the users input. By design, our algorithm does not change the spatial layout or visual contents of the input trajectory. Instead, our algorithm guarantees the feasibility of the output trajectory by re-timing the input trajectory, perturbing its timing as little as possible while remaining within velocity and control force limits. Our choice to perturb the timing of a shot, while leaving the spatial layout and visual contents of the shot intact, leads to a well-behaved non-convex optimization problem that can be solved at interactive rates. We implement our algorithm in an open-source tool for designing quadrotor camera shots, where we achieve interactive performance across a wide range of camera trajectories. We demonstrate that our algorithm is between 25x and 45x faster than a spacetime constraints approach implemented using a commercially available solver. As we scale to more finely discretized trajectories, this performance gap widens, with our algorithm outperforming spacetime constraints by between 90x and 180x. Finally, we fly 5 feasible trajectories generated by our algorithm on a real quadrotor camera, producing video footage that is faithful to Google Earth shot previews, even when the trajectories are at the quadrotors physical limits.
ACM Sigmis Database | 1972
John W. Gwynn; Mike Roberts; Lyle Settle
COBOL is the principal language for programming OASIS Tailored Networks and in this capacity assumes a key role in OASIS Stanfords On-line Administrative Information System. In this article we discuss the operation, design, and Programming of tailored networks and attempt to show how the OASIS network mechanism supports COBOL as a programming language for on-line applications. The network mechanism, in conjunction with the OASIS service routines, enables the accomplishment of both general and tailored data management processes and the containment of several simultaneously running terminal support programs within limited memory.
Cell | 2015
Narayanan Kasthuri; Kenneth J. Hayworth; Daniel R. Berger; Richard Schalek; José Angel Conchello; Seymour Knowles-Barley; Dongil Lee; Amelio Vázquez-Reina; Verena Kaynig; Thouis R. Jones; Mike Roberts; Josh Morgan; Juan Carlos Tapia; H. Sebastian Seung; William Gray Roncal; Joshua T. Vogelstein; Randal C. Burns; Daniel L. Sussman; Carey E. Priebe; Hanspeter Pfister; Jeff W. Lichtman