• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Image Mosaicing and Super-Resolution. (2004)

by D Capel
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 66
Next 10 →

Computer Vision: Algorithms and Applications

by Richard Szeliski , 2010
"... ..."
Abstract - Cited by 252 (2 self) - Add to MetaCart
Abstract not found

Super-Resolution from a Single Image

by Daniel Glasner, Shai Bagon, Michal Irani
"... Methods for super-resolution can be broadly classified into two families of methods: (i) The classical multi-image super-resolution (combining images obtained at subpixel misalignments), and (ii) Example-Based super-resolution (learning correspondence between low and high resolution image patches fr ..."
Abstract - Cited by 139 (5 self) - Add to MetaCart
Methods for super-resolution can be broadly classified into two families of methods: (i) The classical multi-image super-resolution (combining images obtained at subpixel misalignments), and (ii) Example-Based super-resolution (learning correspondence between low and high resolution image patches from a database). In this paper we propose a unified framework for combining these two families of methods. We further show how this combined approach can be applied to obtain super resolution from as little as a single image (with no database or prior examples). Our approach is based on the observation that patches in a natural image tend to redundantly recur many times inside the image, both within the same scale, as well as across different scales. Recurrence of patches within the same image scale (at subpixel misalignments) gives rise to the classical super-resolution, whereas recurrence of patches across different scales of the same image gives rise to example-based super-resolution. Our approach attempts to recover at each pixel its best possible resolution increase based on its patch redundancy within and across scales. 1.
(Show Context)

Citation Context

... Methods for SR can be broadly classified into two families of methods: (i) The classical multi-image super-resolution, and (ii) Example-Based super-resolution. In the classical multi-image SR (e.g., =-=[12, 5, 8]-=- to name just a few) a set of low-resolution images of the same scene are taken (at subpixel misalignments). Each low resolution image imposes a set of linear constraints on the unknown highresolution...

Image superresolution as sparse representation of raw image patches

by Jianchao Yang, John Wright, Yi Ma, Thomas Huang , 2008
"... This paper addresses the problem of generating a superresolution (SR) image from a single low-resolution input image. We approach this problem from the perspective of compressed sensing. The low-resolution image is viewed as downsampled version of a high-resolution image, whose patches are assumed t ..."
Abstract - Cited by 135 (19 self) - Add to MetaCart
This paper addresses the problem of generating a superresolution (SR) image from a single low-resolution input image. We approach this problem from the perspective of compressed sensing. The low-resolution image is viewed as downsampled version of a high-resolution image, whose patches are assumed to have a sparse representation with respect to an over-complete dictionary of prototype signalatoms. The principle of compressed sensing ensures that under mild conditions, the sparse representation can be correctly recovered from the downsampled signal. We will demonstrate the effectiveness of sparsity as a prior for regularizing the otherwise ill-posed super-resolution problem. We further show that a small set of randomly chosen raw patches from training images of similar statistical nature to the input image generally serve as a good dictionary, in the sense that the computed representation is sparse and the recovered high-resolution image is competitive or even superior in quality to images produced by other SR methods.
(Show Context)

Citation Context

....t. DHX = Y . (9) The solution to this optimization problem can be efficiently computed using the back-projection method, originally developed in computer tomography and applied to superresolution in =-=[15, 4]-=-. The update equation for this iterative method is Xt+1 = Xt + ((Y − DHXt) ↑ s) ∗ p, (10) where Xt is the estimate of the high-resolution image after the t-th iteration, p is a “backprojection” filter...

Super-resolution from multiple views using learnt image models,”

by D Capel, A Zisserman - in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, , 2001
"... ..."
Abstract - Cited by 73 (3 self) - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...idly than the IS-MAP, which is parameterized in terms of the actual super-resolution pixels f . 4 Examples using real images The behaviour of the estimators is examined in detail on synthetic data in =-=[5-=-]. Here we only include results on real 5 Figure 7: Five frames from a sequence of 25 showing a moving face. The face occupies 40 40 pixels in these images. (a) (b) (c) Figure 8: For the sequence sho...

Space-time super-resolution

by Eli Shechtman, Yaron Caspi, Michal Irani - PAMI , 2005
"... We propose a method for constructing a video sequence of high space-time resolution by combining information from multiple low-resolution video sequences of the same dynamic scene. Super-resolution is performed simultaneously in time and in space. By “temporal super-resolution” we mean recoverin ..."
Abstract - Cited by 65 (2 self) - Add to MetaCart
We propose a method for constructing a video sequence of high space-time resolution by combining information from multiple low-resolution video sequences of the same dynamic scene. Super-resolution is performed simultaneously in time and in space. By “temporal super-resolution” we mean recovering rapid dynamic events that occur faster than regular frame-rate. Such dynamic events are not visible (or else observed incorrectly) in any of the input sequences, even if these are played in “slow-motion”. The spatial and temporal dimensions are very different in nature, yet are interrelated. This leads to interesting visual tradeoffs in time and space, and to new video applications. These include: (i) treatment of spatial artifacts (e.g., motionblur) by increasing the temporal resolution, and (ii) combination of input sequences of different space-time resolutions (e.g., NTSC, PAL, and even high quality still images) to generate a high quality video sequence. We further analyze and compare characteristics of temporal super-resolution to those of spatial super-resolution. These include: How many video cameras are needed to obtain increased resolution? What is the upper bound on resolution improvement via super-resolution? What is the optimal camera configuration for various scenarios? What is the temporal analogue to the spatial “ringing” effect?
(Show Context)

Citation Context

...tion holds wherever the discrete values in the left-hand side are defined. To obtain a linear equation in terms of the discrete unknown values of Sh ,we used a discrete approximation of (1). See [7], =-=[8]-=- for a discussion of the different spatial discretization techniques in the context of image-based SR. In our implementation, we used a nonisotropic approximation in the temporal dimension and an isot...

Computer Vision Applied to Super-Resolution”,

by D Capel, A Zisserman - IEEE Signal Processing Magazine, , 2003
"... ..."
Abstract - Cited by 61 (0 self) - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...fects, along with a robust method for computing the parameters given a set of geometrically registered views, can be sufficient to allow successful application to image mosaicing and super-resolution =-=-=-[6]. The examples shown here employ a model which allows for an affine transformation (contrast and brightness) per RGB channel, 0 @ r 2 g 2 b 2 1 A = 2 4 r 0 0 0 g 0 0 0 b 3 5 0 @ r 1 g 1 b 1 1 A ...

Robust fusion of irregularly sampled data using adaptive normalized convolution

by Tuan Q. Pham, Lucas J. Van Vliet, Klamer Schutte - EURASIP Journal on Applied Signal Processing , 2006
"... We present a novel algorithm for image fusion from irregularly sampled data. The method is based on the framework of normalized convolution (NC), in which the local signal is approximated through a projection onto a subspace. The use of polynomial basis functions in this paper makes NC equivalent to ..."
Abstract - Cited by 38 (5 self) - Add to MetaCart
We present a novel algorithm for image fusion from irregularly sampled data. The method is based on the framework of normalized convolution (NC), in which the local signal is approximated through a projection onto a subspace. The use of polynomial basis functions in this paper makes NC equivalent to a local Taylor series expansion. Unlike the traditional framework, however, the window function of adaptive NC is adapted to local linear structures. This leads to more samples of the same modality being gathered for the analysis, which in turn improves signal-to-noise ratio and reduces diffusion across discontinuities. A robust signal certainty is also adapted to the sample intensities to minimize the influence of outliers. Excellent fusion capability of adaptive NC is demonstrated through an application of super-resolution image reconstruction. Copyright © 2006 Hindawi Publishing Corporation. All rights reserved. 1.
(Show Context)

Citation Context

... is an important step in computer vision toincrease spatial resolution of captured images for subsequent detection, classification, and identification tasks. Extensive literature on this topic exists =-=[2, 4, 6, 9, 12, 13, 15, 23, 30]-=-, of which there are two main approaches: one with an integrated fusion and deblurring process [12, 13, 30] and the other with three separate steps: registration, fusion, and deconvolution [6, 9, 15]....

A sampled texture prior for image super-resolution

by Lyndsey C. Pickup, Stephen J. Roberts, Andrew Zisserman - in Advances in Neural Information Processing Systems (NIPS
"... Super-resolution aims to produce a high-resolution image from a set of one or more low-resolution images by recovering or inventing plausible high-frequency image content. Typical approaches try to reconstruct a high-resolution image using the sub-pixel displacements of several low-resolution images ..."
Abstract - Cited by 32 (3 self) - Add to MetaCart
Super-resolution aims to produce a high-resolution image from a set of one or more low-resolution images by recovering or inventing plausible high-frequency image content. Typical approaches try to reconstruct a high-resolution image using the sub-pixel displacements of several low-resolution images, usually regularized by a generic smoothness prior over the high-resolution image space. Other methods use training data to learn low-to-high-resolution matches, and have been highly successful even in the single-input-image case. Here we present a domain-specific im-age prior in the form of a p.d.f. based upon sampled images, and show that for certain types of super-resolution problems, this sample-based prior gives a significant improvement over other common multiple-image super-resolution techniques. 1
(Show Context)

Citation Context

...eration of the low-resolution inputs can then be expressed as a degradation of the super-resolution image, usually by applying an image homography, convolving with blurring functions, and subsampling =-=[3, 4, 5, 6, 7, 8, 9]-=-. Unfortunately, the ML (maximum likelihood) super-resolution images obtained by reversing the generative process above tend to be poorly conditioned and susceptible to highfrequency noise. Most appro...

Super Resolution of Images and Video

by Aggelos K. Katsaggelos, Rafael Molina, Javier Mateos
"... ..."
Abstract - Cited by 32 (10 self) - Add to MetaCart
Abstract not found

Unwrap mosaics: A new representation for video editing

by Alex Rav-Acha, Pushmeet Kohli, Carsten Rother, Andrew Fitzgibbon - PROC. SIGGRAPH ’08 , 2008
"... We introduce a new representation for video which facilitates a number of common editing tasks. The representation has some of the power of a full reconstruction of 3D surface models from video, but is designed to be easy to recover from a priori unseen and uncalibrated footage. By modelling the ima ..."
Abstract - Cited by 23 (2 self) - Add to MetaCart
We introduce a new representation for video which facilitates a number of common editing tasks. The representation has some of the power of a full reconstruction of 3D surface models from video, but is designed to be easy to recover from a priori unseen and uncalibrated footage. By modelling the image-formation process as a 2D-to-2D transformation from an object’s texture map to the image, modulated by an object-space occlusion mask, we can recover a representation which we term the “unwrap mosaic”. Many editing operations can be performed on the unwrap mosaic, and then re-composited into the original sequence, for example resizing objects, repainting textures, copying/cutting/pasting objects, and attaching effects layers to deforming objects.
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University