Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Michael Gleicher is active.

Publication


Featured researches published by Michael Gleicher.


international conference on computer graphics and interactive techniques | 2002

Motion graphs

Lucas Kovar; Michael Gleicher; Frédéric H. Pighin

In this paper we present a novel method for creating realistic, controllable motion. Given a corpus of motion capture data, we automatically construct a directed graph called a motion graph that encapsulates connections among the database. The motion graph consists both of pieces of original motion and automatically generated transitions. Motion can be generated simply by building walks on the graph. We present a general framework for extracting particular graph walks that meet a users specifications. We then show how this framework can be applied to the specific problem of generating different styles of locomotion along arbitrary paths.


international conference on computer graphics and interactive techniques | 2009

Content-preserving warps for 3D video stabilization

Feng Liu; Michael Gleicher; Hailin Jin; Aseem Agarwala

We describe a technique that transforms a video from a hand-held video camera so that it appears as if it were taken with a directed camera motion. Our method adjusts the video to appear as if it were taken from nearby viewpoints, allowing 3D camera movements to be simulated. By aiming only for perceptual plausibility, rather than accurate reconstruction, we are able to develop algorithms that can effectively recreate dynamic scenes from a single source video. Our technique first recovers the original 3D camera motion and a sparse set of 3D, static scene points using an off-the-shelf structure-from-motion system. Then, a desired camera path is computed either automatically (e.g., by fitting a linear or quadratic path) or interactively. Finally, our technique performs a least-squares optimization that computes a spatially-varying warp from each input video frame into an output frame. The warp is computed to both follow the sparse displacements suggested by the recovered 3D structure, and avoid deforming the content in the video frame. Our experiments on stabilizing challenging videos of dynamic scenes demonstrate the effectiveness of our technique.


interactive 3d graphics and games | 1997

Motion editing with spacetime constraints

Michael Gleicher

In this paper, we present a method for editing a pre-existing motion such that it meets new needs yet preserves as much of the original quality as possible. Our approach enables the user to interactively position characters using direct manipulation. A spacetime constraints solver finds these positions while considering the entire motion. This paper discusses the three central challenges of creating such an approach: defining a constraint formulation that is rich enough to be effective, yet simple enough to afford fast solution; providing a solver that is fast enough to solve the constraint problems at interactive rates; and creating an interface that allows users to specify and visualize changes to entire motions. We present examples with a prototype system that permits interactive motion editing for articulated 3D characters on personal computers. I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism – Animation; I.3.6 [Computer Graphics]: Methodology and Techniques Interaction Techniques; G.1.6 [Numerical Analysis]: Optimization. Spacetime Constraints, Motion Displacement Mapping.


international conference on computer graphics and interactive techniques | 1992

Through-the-lens camera control

Michael Gleicher; artd Andrew Witkin

In this paper we introduce through-the-lens camera control, a body of techniques that permit a user to manipulate a virtual camera by controlling and constraining features in the image seen through its lens. Rather than solving for camera parameters directly, constrained optimization is used to compute their time derivatives based on desired changes in user-defined controls. This effectively permits new controls to be defined independent of the underlying parameterization. The controls can also serve as constraints, maintaining their values as others are changed. We describe the techniques in general and work through a detailed example of a specific camera model. Our implementation demonstrates a gallery of useful controls and constraints and provides some examples of how these may be used in composing images and animations.


ACM Transactions on Graphics | 2001

Computer puppetry: An importance-based approach

Hyun Joon Shin; Jehee Lee; Sung Yong Shin; Michael Gleicher

Computer puppetry maps the movements of a performer to an animated character in real-time. In this article, we provide a comprehensive solution to the problem of transferring the observations of the motion capture sensors to an animated character whose size and proportion may be different from the performers. Our goal is to map as many of the important aspects of the motion to the target character as possible, while meeting the online, real-time demands of computer puppetry. We adopt a Kalman filter scheme that addresses motion capture noise issues in this setting. We provide the notion of dynamic importance of an end-effector that allows us to determine what aspects of the performance must be kept in the resulting motion. We introduce a novel inverse kinematics solver that realizes these important aspects within tight real-time constraints. Our approach is demonstrated by its application to broadcast television performances.


symposium on computer animation | 2003

Flexible automatic motion blending with registration curves

Lucas Kovar; Michael Gleicher

Many motion editing algorithms, including transitioning and multitarget interpolation, can be represented as instances of a more general operation called motion blending. We introduce a novel data structure called a registration curve that expands the class of motions that can be successfully blended without manual input. Registration curves achieve this by automatically determining relationships involving the timing, local coordinate frame, and constraints of the input motions. We show how registration curves improve upon existing automatic blending methods and demonstrate their use in common blending operations.


Information Visualization | 2011

Visual comparison for information visualization

Michael Gleicher; Danielle Albers; Richard L. Walker; Ilir Jusufi; Charles D. Hansen; Jonathan C. Roberts

Data analysis often involves the comparison of complex objects. With the ever increasing amounts and complexity of data, the demand for systems to help with these comparisons is also growing. Increasingly, information visualization tools support such comparisons explicitly, beyond simply allowing a viewer to examine each object individually. In this paper, we argue that the design of information visualizations of complex objects can, and should, be studied in general, that is independently of what those objects are. As a first step in developing this general understanding of comparison, we propose a general taxonomy of visual designs for comparison that groups designs into three basic categories, which can be combined. To clarify the taxonomy and validate its completeness, we provide a survey of work in information visualization related to comparison. Although we find a great diversity of systems and approaches, we see that all designs are assembled from the building blocks of juxtaposition, superposition and explicit encodings. This initial exploration shows the power of our model, and suggests future challenges in developing a general understanding of comparative visualization and facilitating the development of more comparative visualization tools.


symposium on computer animation | 2002

Footskate cleanup for motion capture editing

Lucas Kovar; John Schreiner; Michael Gleicher

While motion capture is commonplace in character animation, often the raw motion data itself is not used. Rather, it is first fit onto a skeleton and then edited to satisfy the particular demands of the animation. This process can introduce artifacts into the motion. One particularly distracting artifact is when the characters feet move when they ought to remain planted, a condition known as footskate. In this paper we present a simple, efficient algorithm for removing footskate. Our algorithm exactly satisfies footplant constraints without introducing disagreeable artifacts.


eurographics | 2004

Scalable behaviors for crowd simulation

Mankyu Sung; Michael Gleicher; Stephen Chenney

Crowd simulation for virtual environments offers many challenges centered on the trade‐offs between rich behavior, control and computational cost. In this paper we present a new approach to controlling the behavior of agents in a crowd. Our method is scalable in the sense that increasingly complex crowd behaviors can be created without a corresponding increase in the complexity of the agents. Our approach is also more authorable; users can dynamically specify which crowd behaviors happen in various parts of an environment. Finally, the character motion produced by our system is visually convincing. We achieve our aims with a situation‐based control structure. Basic agents have very limited behaviors. As they enter new situations, additional, situation‐specific behaviors are composed on the fly to enable agents to respond appropriately. The composition is done using a probabilistic mechanism. We demonstrate our system with three environments including a city street and a theater.


acm multimedia | 2006

Video retargeting: automating pan and scan

Feng Liu; Michael Gleicher

When a video is displayed on a smaller display than originally intended, some of the information in the video is necessarily lost. In this paper, we introduce Video Retargeting that adapts video to better suit the target display, minimizing the important information lost. We define a framework that measures the preservation of the source material, and methods for estimating the important information in the video. Video retargeting crops each frame and scales it to fit the target display. An optimization process minimizes information loss by balancing the loss of detail due to scaling with the loss of content and composition due to cropping. The cropping window can be moved during a shot to introduce virtual pans and cuts, subject to constraints that ensure cinematic plausibility. We demonstrate results of adapting a variety of source videos to small display sizes.

Collaboration


Dive into the Michael Gleicher's collaboration.

Top Co-Authors

Avatar

Feng Liu

Portland State University

View shared research outputs
Top Co-Authors

Avatar

Bilge Mutlu

University of Wisconsin-Madison

View shared research outputs
Top Co-Authors

Avatar

Michael Correll

University of Wisconsin-Madison

View shared research outputs
Top Co-Authors

Avatar

Daniel Rakita

University of Wisconsin-Madison

View shared research outputs
Top Co-Authors

Avatar

Sean Andrist

University of Wisconsin-Madison

View shared research outputs
Top Co-Authors

Avatar

Alper Sarikaya

University of Wisconsin-Madison

View shared research outputs
Top Co-Authors

Avatar

Danielle Albers

University of Wisconsin-Madison

View shared research outputs
Top Co-Authors

Avatar

Lucas Kovar

University of Wisconsin-Madison

View shared research outputs
Top Co-Authors

Avatar

Andrew P. Witkin

Carnegie Mellon University

View shared research outputs
Top Co-Authors

Avatar

Tomislav Pejsa

University of Wisconsin-Madison

View shared research outputs
Researchain Logo
Decentralizing Knowledge