Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Matthew Uyttendaele

dblp:83/3020 · also Matt Uyttendaele · DBLP profile ↗
← Back
22ranked-venue papers
1as first author
2since 2021 · last 2023
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 19 · 1 first-author · 2 since 2021Artificial intelligence and machine learning · 11 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 2Human-computer interaction and ubiquitous computing · 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.

Artificial intelligence
5 papers
3D vision · 51% Representation and self-supervised learning · 28% Efficient and distributed learning · 14%
Computer graphics and multimedia
16 papers
Image and video processing · 40% Computational photography and imaging · 30% Rendering · 19%

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

TopicWeightPapersLastEvidence papers
Rendering
novel view synthesis
0.722023
A Practical Stereo Depth System for Smart Glasses · CVPR 2023
Deep photo: model-based photograph enhancement and viewing · ACM Trans. Graph. 2008
Computer vision › 3D vision
depth estimation
0.712023
A Practical Stereo Depth System for Smart Glasses · CVPR 2023
Machine learning › Representation and self-supervised learning › representation learning › domain-aware representation learning
geospatial representation learning
0.712023
Scale-MAE: A Scale-Aware Masked Autoencoder for Multiscale Geospatial Representation Learning · ICCV 2023
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning
masked autoencoder
0.712023
Scale-MAE: A Scale-Aware Masked Autoencoder for Multiscale Geospatial Representation Learning · ICCV 2023
Computer vision › 3D vision
remote sensing
0.712023
Scale-MAE: A Scale-Aware Masked Autoencoder for Multiscale Geospatial Representation Learning · ICCV 2023
Computer vision › 3D vision › depth estimation
stereo depth estimation
0.712023
A Practical Stereo Depth System for Smart Glasses · CVPR 2023
Computational photography and imaging
computational photography
0.712023
A Practical Stereo Depth System for Smart Glasses · CVPR 2023
Image and video processing › image restoration › image denoising › camera noise removal
burst denoising
0.522018
Deep Burst Denoising · ECCV (15) 2018
Fast burst images denoising · ACM Trans. Graph. 2014
Image and video processing › image restoration
image denoising
0.522018
Deep Burst Denoising · ECCV (15) 2018
Fast burst images denoising · ACM Trans. Graph. 2014
Machine learning › Efficient and distributed learning
model compression
0.412019
ChamNet: Towards Efficient Network Design Through Platform-Aware Model Adaptation · CVPR 2019
Machine learning › Efficient and distributed learning › automated machine learning
neural architecture search
0.412019
ChamNet: Towards Efficient Network Design Through Platform-Aware Model Adaptation · CVPR 2019
Image and video processing
image registration
0.222014
Fast burst images denoising · ACM Trans. Graph. 2014
High dynamic range video · ACM Trans. Graph. 2003
Image and video processing › image sequence processing
frame selection
0.212015
Real-time hyperlapse creation via optimal frame selection · ACM Trans. Graph. 2015
Computational photography and imaging › time-lapse imaging
hyperlapse
0.212015
Real-time hyperlapse creation via optimal frame selection · ACM Trans. Graph. 2015
Image and video processing
video stabilization
0.212015
Real-time hyperlapse creation via optimal frame selection · ACM Trans. Graph. 2015
Rendering
image-based rendering
0.232008
Deep photo: model-based photograph enhancement and viewing · ACM Trans. Graph. 2008
Capturing and viewing gigapixel images · ACM Trans. Graph. 2007
High-quality video view interpolation using a layered representation · ACM Trans. Graph. 2004
Computer vision › 3D vision › depth estimation
monocular depth estimation
0.212023
A Practical Stereo Depth System for Smart Glasses · CVPR 2023
Machine learning › Representation and self-supervised learning › representation learning
multi-scale representation learning
0.212023
Scale-MAE: A Scale-Aware Masked Autoencoder for Multiscale Geospatial Representation Learning · ICCV 2023
Embedded and real-time systems
on-device inference
0.212023
A Practical Stereo Depth System for Smart Glasses · CVPR 2023
Information retrieval › search interfaces
search result presentation
0.212014
Mining text snippets for images on the web · KDD 2014
Computational photography and imaging › image acquisition
burst photography
0.212014
Fast burst images denoising · ACM Trans. Graph. 2014
Multimedia analysis and retrieval › cross-modal alignment
text-image alignment
0.212014
Mining text snippets for images on the web · KDD 2014
Computational photography and imaging
high dynamic range imaging
0.232007
Capturing and viewing gigapixel images · ACM Trans. Graph. 2007
Probability Models for High Dynamic Range Imaging · CVPR (2) 2004
High dynamic range video · ACM Trans. Graph. 2003
Computer vision › 3D vision
3d reconstruction
0.112012
Real-time image-based 6-DOF localization in large-scale environments · CVPR 2012
Computer vision › 3D vision
object pose estimation
0.112012
Real-time image-based 6-DOF localization in large-scale environments · CVPR 2012
Computer vision › 3D vision
structure from motion
0.112012
Real-time image-based 6-DOF localization in large-scale environments · CVPR 2012
Computer vision › 3D vision
visual localization
0.112012
Real-time image-based 6-DOF localization in large-scale environments · CVPR 2012
Visual content generation and editing › image animation
cinemagraph generation
0.112012
Cliplets: juxtaposing still and dynamic imagery · UIST 2012
Visual content generation and editing
video editing
0.112012
Cliplets: juxtaposing still and dynamic imagery · UIST 2012
Computational photography and imaging
image stitching
0.132007
Seamless Image Stitching of Scenes with Large Motions and Exposure Differences · CVPR (2) 2006
Eliminating Ghosting and Exposure Artifacts in Image Mosaics · CVPR (2) 2001
Capturing and viewing gigapixel images · ACM Trans. Graph. 2007

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

stereo rectification · 2.0monocular depth estimation · 2.0latency prediction · 0.8gaussian process · 0.8bayesian optimization · 0.8accuracy prediction · 0.8positional encoding · 0.7masked image modeling · 0.7deep learning · 0.7machine-learned relevance scoring · 0.4combinatorial subset selection · 0.4matting · 0.3optimal frame selection · 0.2camera motion smoothing · 0.2temporal fusion · 0.2homography flow · 0.2looping optimization · 0.1laplacian blending · 0.1
YearPublicationVenuePosition
2023 A Practical Stereo Depth System for Smart Glasses
abstract
We present the design of a productionized end-to-end stereo depth sensing system that does pre-processing, online stereo rectification, and stereo depth estimation with a fallback to monocular depth estimation when rectification is unreliable. The output of our depth sensing system is then used in a novel view generation pipeline to create 3D computational photography effects using point-of-view images captured by smart glasses. All these steps are executed on-device on the stringent compute budget of a mobile phone, and because we expect the users can use a wide range of smartphones, our design needs to be general and cannot be dependent on a particular hardware or ML accelerator such as a smartphone GPU. Although each of these steps is well studied, a description of a practical system is still lacking. For such a system, all these steps need to work in tandem with one another and fallback gracefully on failures within the system or less than ideal input data. We show how we handle unforeseen changes to calibration, e.g., due to heat, robustly support depth estimation in the wild, and still abide by the memory and latency constraints required for a smooth user experience. We show that our trained models are fast, and run in less than 1s on a six-year-old Samsung Galaxy S8 phone's CPU. Our models generalize well to unseen data and achieve good results on Middlebury and in-the-wild images captured from the smart glasses.
Jialiang Wang 0001, Daniel Scharstein, Akash Bapat, Kevin Matzen, Matthew Yu, Jonathan Lehman, Suhib Alsisan, Yanghan Wang, Sam S. Tsai, Jan-Michael Frahm, Peter Vajda, Michael F. Cohen, Matthew Uyttendaele
CVPR14
2023 Scale-MAE: A Scale-Aware Masked Autoencoder for Multiscale Geospatial Representation Learning
abstract
Large, pretrained models are commonly finetuned with imagery that is heavily augmented to mimic different conditions and scales, with the resulting models used for various tasks with imagery from a range of spatial scales. Such models overlook scale-specific information in the data for scale-dependent domains, such as remote sensing. In this paper, we present Scale-MAE, a pretraining method that explicitly learns relationships between data at different, known scales throughout the pretraining process. Scale-MAE pre-trains a network by masking an input image at a known input scale, where the area of the Earth covered by the image determines the scale of the ViT positional encoding, not the image resolution. Scale-MAE encodes the masked image with a standard ViT backbone, and then decodes the masked image through a bandpass filter to reconstruct low/high frequency images at lower/higher scales. We find that tasking the network with reconstructing both low/high frequency images leads to robust multiscale representations for remote sensing imagery. Scale-MAE achieves an average of a 2.4 − 5.6% non-parametric kNN classification improvement across eight remote sensing datasets compared to current state-of-the-art and obtains a 0.9 mIoU to 1.7 mIoU improvement on the SpaceNet building segmentation transfer task for a range of evaluation scales.
Colorado Reed, Ritwik Gupta, Sarah Brockman, Christopher Funk, Brian Clipp, Kurt Keutzer, Salvatore Candido, Matthew Uyttendaele, Trevor Darrell
ICCV9
2019 ChamNet: Towards Efficient Network Design Through Platform-Aware Model Adaptation
abstract
This paper proposes an efficient neural network (NN) architecture design methodology called Chameleon that honors given resource constraints. Instead of developing new building blocks or using computationally-intensive reinforcement learning algorithms, our approach leverages existing efficient network building blocks and focuses on exploiting hardware traits and adapting computation resources to fit target latency and/or energy constraints. We formulate platform-aware NN architecture search in an optimization framework and propose a novel algorithm to search for optimal architectures aided by efficient accuracy and resource (latency and/or energy) predictors. At the core of our algorithm lies an accuracy predictor built atop Gaussian Process with Bayesian optimization for iterative sampling. With a one-time building cost for the predictors, our algorithm produces state-of-the-art model architectures on different platforms under given constraints in just minutes. Our results show that adapting computation resources to building blocks is critical to model performance. Without the addition of any special features, our models achieve significant accuracy improvements relative to state-of-the-art handcrafted and automatically designed architectures. We achieve 73.8% and 75.3% top-1 accuracy on ImageNet at 20ms latency on a mobile CPU and DSP. At reduced latency, our models achieve up to 8.2% (4.8%) and 6.7% (9.3%) absolute top-1 accuracy improvements compared to MobileNetV2 and MnasNet, respectively, on a mobile CPU (DSP), and 2.7% (4.6%) and 5.6% (2.6%) accuracy gains over ResNet-101 and ResNet-152, respectively, on an Nvidia GPU (Intel CPU).
Xiaoliang Dai, Peizhao Zhang, Bichen Wu, Hongxu Yin, Fei Sun 0002, Yanghan Wang, Marat Dukhan, Yunqing Hu, Yiming Wu 0013, Yangqing Jia, Peter Vajda, Matthew Uyttendaele, Niraj K. Jha
CVPR12
2018 Deep Burst Denoising
Clément Godard, Kevin Matzen, Matthew Uyttendaele
ECCV (15)3
2015 Real-time hyperlapse creation via optimal frame selection
abstract
Long videos can be played much faster than real-time by recording only one frame per second or by dropping all but one frame each second, i.e., by creating a timelapse. Unstable hand-held moving videos can be stabilized with a number of recently described methods. Unfortunately, creating a stabilized timelapse, or hyperlapse , cannot be achieved through a simple combination of these two methods. Two hyperlapse methods have been previously demonstrated: one with high computational complexity and one requiring special sensors. We present an algorithm for creating hyperlapse videos that can handle significant high-frequency camera motion and runs in real-time on HD video. Our approach does not require sensor data, thus can be run on videos captured on any camera. We optimally select frames from the input video that best match a desired target speed-up while also resulting in the smoothest possible camera motion. We evaluate our approach using several input videos from a range of cameras and compare these results to existing methods.
Neel Joshi, Wolf Kienzle, Mike Toelle, Matthew Uyttendaele, Michael F. Cohen
ACM Trans. Graph.4
2014 Mining text snippets for images on the web
abstract
Images are often used to convey many different concepts or illustrate many different stories. We propose an algorithm to mine multiple diverse, relevant, and interesting text snippets for images on the web. Our algorithm scales to all images on the web. For each image, all webpages that contain it are considered. The top-K text snippet selection problem is posed as combinatorial subset selection with the goal of choosing an optimal set of snippets that maximizes a combination of relevancy, interestingness, and diversity. The relevancy and interestingness are scored by machine learned models. Our algorithm is run at scale on the entire image index of a major search engine resulting in the construction of a database of images with their corresponding text snippets. We validate the quality of the database through a large-scale comparative study. We showcase the utility of the database through two web-scale applications: (a) augmentation of images on the web as webpages are browsed and (b)~an image browsing experience (similar in spirit to web browsing) that is enabled by interconnecting semantically related images (which may not be visually related) through shared concepts in their corresponding text snippets.
Anitha Kannan, Simon Baker, Krishnan Ramnath, Juliet Fiss, Dahua Lin, Lucy Vanderwende, Rizwan Ansary, Ashish Kapoor, Qifa Ke, Matthew Uyttendaele, Xin-Jing Wang, Lei Zhang 0001
KDD10
2014 AutoStyle: Automatic Style Transfer from Image Collections to Users' Images
abstract
Abstract Stylizing photos, to give them an antique or artistic look, has become popular in recent years. The available stylization filters, however, are usually created manually by artists, resulting in a narrow set of choices. Moreover, it can be difficult for the user to select a desired filter, since the filters’ names often do not convey their functions. We investigate an approach to photo filtering in which the user provides one or more keywords, and the desired style is defined by the set of images returned by searching the web for those keywords. Our method clusters the returned images, allows the user to select a cluster, then stylizes the user's photos by transferring vignetting, color, and local contrast from that cluster. This approach vastly expands the range of available styles, and gives each filter a meaningful name by default. We demonstrate that our method is able to robustly transfer a wide range of styles from image collections to users’ photos.
Yiming Liu 0001, Michael F. Cohen, Matthew Uyttendaele, Szymon Rusinkiewicz
Comput. Graph. Forum3
2014 Fast burst images denoising
abstract
This paper presents a fast denoising method that produces a clean image from a burst of noisy images. We accelerate alignment of the images by introducing a lightweight camera motion representation called homography flow . The aligned images are then fused to create a denoised output with rapid per-pixel operations in temporal and spatial domains. To handle scene motion during the capture, a mechanism of selecting consistent pixels for temporal fusion is proposed to "synthesize" a clean, ghost-free image, which can largely reduce the computation of tracking motion between frames. Combined with these efficient solutions, our method runs several orders of magnitude faster than previous work, while the denoising quality is comparable. A smartphone prototype demonstrates that our method is practical and works well on a large variety of real examples.
Ziwei Liu 0002, Lu Yuan 0001, Xiaoou Tang, Matthew Uyttendaele, Jian Sun 0001
ACM Trans. Graph.4
2012 Real-time image-based 6-DOF localization in large-scale environments
abstract
We present a real-time approach for image-based localization within large scenes that have been reconstructed offline using structure from motion (Sfm). From monocular video, our method continuously computes a precise 6-DOF camera pose, by efficiently tracking natural features and matching them to 3D points in the Sfm point cloud. Our main contribution lies in efficiently interleaving a fast keypoint tracker that uses inexpensive binary feature descriptors with a new approach for direct 2D-to-3D matching. The 2D-to-3D matching avoids the need for online extraction of scale-invariant features. Instead, offline we construct an indexed database containing multiple DAISY descriptors per 3D point extracted at multiple scales. The key to the efficiency of our method lies in invoking DAISY descriptor extraction and matching sparingly during localization, and in distributing this computation over a window of successive frames. This enables the algorithm to run in real-time, without fluctuations in the latency over long durations. We evaluate the method in large indoor and outdoor scenes. Our algorithm runs at over 30 Hz on a laptop and at 12 Hz on a low-power, mobile computer suitable for onboard computation on a quadrotor micro aerial vehicle.
Hyon Lim, Sudipta N. Sinha, Michael F. Cohen, Matthew Uyttendaele
CVPR4
2012 Cliplets: juxtaposing still and dynamic imagery
abstract
We explore creating ""cliplets"", a form of visual media that juxtaposes still image and video segments, both spatially and temporally, to expressively abstract a moment. Much as in ""cinemagraphs"", the tension between static and dynamic elements in a cliplet reinforces both aspects, strongly focusing the viewer's attention. Creating this type of imagery is challenging without professional tools and training. We develop a set of idioms, essentially spatiotemporal mappings, that characterize cliplet elements, and use these idioms in an interactive system to quickly compose a cliplet from ordinary handheld video. One difficulty is to avoid artifacts in the cliplet composition without resorting to extensive manual input. We address this with automatic alignment, looping optimization and feathering, simultaneous matting and compositing, and Laplacian blending. A key user-interface challenge is to provide affordances to define the parameters of the mappings from input time to output time while maintaining a focus on the cliplet being created. We demonstrate the creation of a variety of cliplet types. We also report on informal feedback as well as a more structured survey of users.
Neel Joshi, Sisil Mehta, Steven Mark Drucker, Eric J. Stollnitz, Hugues Hoppe, Matthew Uyttendaele, Michael F. Cohen
UIST6
2011 Fast Poisson blending using multi-splines
abstract
We present a technique for fast Poisson blending and gradient domain compositing. Instead of using a single piecewise-smooth offset map to perform the blending, we associate a separate map with each input source image. Each individual offset map is itself smoothly varying and can therefore be represented using a low-dimensional spline. The resulting linear system is much smaller than either the original Poisson system or the quadtree spline approximation of a single (unified) offset map. We demonstrate the speed and memory improvements available with our system and apply it to large panoramas. We also show how robustly modeling the multiplicative gain rather than the offset between overlapping images leads to improved results, and how adding a small amount of Laplacian pyramid blending improves the results in areas of inconsistent texture.
Richard Szeliski, Matthew Uyttendaele, Drew Steedly
ICCP2
2008 Low-cost orthographic imagery
abstract
Commercial aerial imagery websites, such as Google Maps, MapQuest, Microsoft Virtual Earth, and Yahoo! Maps, provide high- seamless orthographic imagery for many populated areas, employing sophisticated equipment and proprietary image postprocessing pipelines. There are many areas of the world with poor coverage where locals might benefit from recent, high-resolution orthographic imagery, but which do not fit into the schedules and scaling model of the big sites.
Péter Pesti, Jeremy Elson, Jon Howell, Drew Steedly, Matthew Uyttendaele
GIS5
2008 Deep photo: model-based photograph enhancement and viewing
abstract
In this paper, we introduce a novel system for browsing, enhancing, and manipulating casual outdoor photographs by combining them with already existing georeferenced digital terrain and urban models. A simple interactive registration process is used to align a photograph with such a model. Once the photograph and the model have been registered, an abundance of information, such as depth, texture, and GIS data, becomes immediately available to our system. This information, in turn, enables a variety of operations, ranging from dehazing and relighting the photograph, to novel view synthesis, and overlaying with geographic information. We describe the implementation of a number of these applications and discuss possible extensions. Our results show that augmenting photographs with already available 3D models of the world supports a wide variety of new ways for us to experience and interact with our everyday snapshots.
Johannes Kopf 0001, Boris Neubert, Billy Chen, Michael F. Cohen, Daniel Cohen-Or, Oliver Deussen, Matthew Uyttendaele, Dani Lischinski
ACM Trans. Graph.7
2007 Joint bilateral upsampling
abstract
Image analysis and enhancement tasks such as tone mapping, colorization, stereo depth, and photomontage, often require computing a solution (e.g., for exposure, chromaticity, disparity, labels) over the pixel grid. Computational and memory costs often require that a smaller solution be run over a downsampled image. Although general purpose upsampling methods can be used to interpolate the low resolution solution to the full resolution, these methods generally assume a smoothness prior for the interpolation. We demonstrate that in cases, such as those above, the available high resolution input image may be leveraged as a prior in the context of a joint bilateral upsampling procedure to produce a better high resolution solution. We show results for each of the applications above and compare them to traditional upsampling methods.
Johannes Kopf 0001, Michael F. Cohen, Dani Lischinski, Matthew Uyttendaele
ACM Trans. Graph.4
2007 Capturing and viewing gigapixel images
abstract
We present a system to capture and view "Gigapixel images": very high resolution, high dynamic range, and wide angle imagery consisting of several billion pixels each. A specialized camera mount, in combination with an automated pipeline for alignment, exposure compensation, and stitching, provide the means to acquire Gigapixel images with a standard camera and lens. More importantly, our novel viewer enables exploration of such images at interactive rates over a network, while dynamically and smoothly interpolating the projection between perspective and curved projections, and simultaneously modifying the tone-mapping to ensure an optimal view of the portion of the scene being viewed.
Johannes Kopf 0001, Matthew Uyttendaele, Oliver Deussen, Michael F. Cohen
ACM Trans. Graph.2
2006 Seamless Image Stitching of Scenes with Large Motions and Exposure Differences
abstract
This paper presents a technique to automatically stitch multiple images at varying orientations and exposures to create a composite panorama that preserves the angular extent and dynamic range of the inputs. The main contribution of our method is that it allows for large exposure differences, large scene motion or other misregistrations between frames and requires no extra camera hardware. To do this, we introduce a two-step graph cut approach. The purpose of the first step is to fix the positions of moving objects in the scene. In the second step, we fill in the entire available dynamic range. We introduce data costs that encourage consistency and higher signal-to-noise ratios, and seam costs that encourage smooth transitions. Our method is simple to implement and effective. We demonstrate the effectiveness of our approach on several input sets with varying exposures and camera orientations.
Ashley Eden, Matthew Uyttendaele, Richard Szeliski
CVPR (2)2
2006 Video and Image Bayesian Demosaicing with a Two Color Image Prior
Eric P. Bennett, Matthew Uyttendaele, C. Lawrence Zitnick, Richard Szeliski, Sing Bing Kang
ECCV (1)2
2006 Interactive local adjustment of tonal values
abstract
This paper presents a new interactive tool for making local adjustments of tonal values and other visual parameters in an image. Rather than carefully selecting regions or hand-painting layer masks, the user quickly indicates regions of interest by drawing a few simple brush strokes and then uses sliders to adjust the brightness, contrast, and other parameters in these regions. The effects of the user's sparse set of constraints are interpolated to the entire image using an edge-preserving energy minimization method designed to prevent the propagation of tonal adjustments to regions of significantly different luminance. The resulting system is suitable for adjusting ordinary and high dynamic range images, and provides the user with much more creative control than existing tone mapping algorithms. Our tool is also able to produce a tone mapping automatically, which may serve as a basis for further local adjustments, if so desired. The constraint propagation approach developed in this paper is a general one, and may also be used to interactively control a variety of other adjustments commonly performed in the digital darkroom.
Dani Lischinski, Zeev Farbman, Matthew Uyttendaele, Richard Szeliski
ACM Trans. Graph.3
2004 Probability Models for High Dynamic Range Imaging
Christopher Joseph Pal, Richard Szeliski, Matthew Uyttendaele, Nebojsa Jojic
CVPR (2)3
2004 High-quality video view interpolation using a layered representation
abstract
The ability to interactively control viewpoint while watching a video is an exciting application of image-based rendering. The goal of our work is to render dynamic scenes with interactive viewpoint control using a relatively small number of video cameras. In this paper, we show how high-quality video-based rendering of dynamic scenes can be accomplished using multiple synchronized video streams combined with novel image-based modeling and rendering algorithms. Once these video streams have been processed, we can synthesize any intermediate view between cameras at any time, with the potential for space-time manipulation.In our approach, we first use a novel color segmentation-based stereo algorithm to generate high-quality photoconsistent correspondences across all camera views. Mattes for areas near depth discontinuities are then automatically extracted to reduce artifacts during view synthesis. Finally, a novel temporal two-layer compressed representation that handles matting is developed for rendering at interactive rates.
C. Lawrence Zitnick, Sing Bing Kang, Matthew Uyttendaele, Simon A. J. Winder, Richard Szeliski
ACM Trans. Graph.3
2003 High dynamic range video
abstract
Typical video footage captured using an off-the-shelf camcorder suffers from limited dynamic range. This paper describes our approach to generate high dynamic range (HDR) video from an image sequence of a dynamic scene captured while rapidly varying the exposure of each frame. Our approach consists of three parts: automatic exposure control during capture, HDR stitching across neighboring frames, and tonemapping for viewing. HDR stitching requires accurately registering neighboring frames and choosing appropriate pixels for computing the radiance map. We show examples for a variety of dynamic scenes. We also show how we can compensate for scene and camera movement when creating an HDR still from a series of bracketed still photographs.
Sing Bing Kang, Matthew Uyttendaele, Simon A. J. Winder, Richard Szeliski
ACM Trans. Graph.2
2001 Eliminating Ghosting and Exposure Artifacts in Image Mosaics
abstract
As panoramic photography becomes increasingly popular, there is a greater need for high-quality software to automatically create panoramic images. Existing algorithms either produce a rough "stitch" that cannot deal with common artifacts, or require user input. This paper presents methods for dealing with two artifacts that often occur in practice. Our first contribution is a method for dealing with objects that move between different views of a dynamic scene. If such moving objects are left in, they will appear blurry and "ghosted". Treating such regions as nodes in a graph, we use a vertex cover algorithm to selectively remove all but one instance of each object. Our second contribution is a method for continuously adjusting exposure across multiple images in order to eliminate visible shifts in brightness or hue. We compute exposure corrections on a block-by block basis, then smoothly interpolate the parameters using a spline to get spatially continuous exposure adjustment. Our enhancements, combined with previously published techniques for automatic image stitching, result in a high-quality automated stitcher that exhibits far fewer artifacts than existing software.
Matthew Uyttendaele, Ashley Eden, Richard Szeliski
CVPR (2)1