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

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 8,795
Next 10 →

Efficient graph-based image segmentation.

by Pedro F Felzenszwalb , Daniel P Huttenlocher - International Journal of Computer Vision, , 2004
"... Abstract. This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an efficient segmentation algorithm based on this predicate, and show ..."
Abstract - Cited by 940 (1 self) - Add to MetaCart
that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties. We apply the algorithm to image segmentation using two different kinds of local neighborhoods in constructing the graph, and illustrate the results with both real and synthetic images. The algorithm

Performance of optical flow techniques

by J. L. Barron, D. J. Fleet, S. S. Beauchemin - INTERNATIONAL JOURNAL OF COMPUTER VISION , 1994
"... While different optical flow techniques continue to appear, there has been a lack of quantitative evaluation of existing methods. For a common set of real and synthetic image sequences, we report the results of a number of regularly cited optical flow techniques, including instances of differential, ..."
Abstract - Cited by 1325 (32 self) - Add to MetaCart
While different optical flow techniques continue to appear, there has been a lack of quantitative evaluation of existing methods. For a common set of real and synthetic image sequences, we report the results of a number of regularly cited optical flow techniques, including instances of differential

Determining Optical Flow

by Berthold K. P. Horn, Brian G. Schunck - ARTIFICIAL INTELLIGENCE , 1981
"... Optical flow cannot be computed locally, since only one independent measurement is available from the image sequence at a point, while the flow velocity has two components. A second constraint is needed. A method for finding the optical flow pattern is presented which assumes that the apparent veloc ..."
Abstract - Cited by 2404 (9 self) - Add to MetaCart
velocity of the brightness pattern varies smoothly almost everywhere in the image. An iterative implementation is shown which successfully computes the optical flow for a number of synthetic image sequences. The algorithm is robust in that it can handle image sequences that are quantized rather coarsely

Real-time human pose recognition in parts from single depth images

by Jamie Shotton, Andrew Fitzgibbon, Mat Cook, Toby Sharp, Mark Finocchio, Richard Moore, Alex Kipman, Andrew Blake - IN CVPR , 2011
"... We propose a new method to quickly and accurately predict 3D positions of body joints from a single depth image, using no temporal information. We take an object recognition approach, designing an intermediate body parts representation that maps the difficult pose estimation problem into a simpler p ..."
Abstract - Cited by 568 (17 self) - Add to MetaCart
We propose a new method to quickly and accurately predict 3D positions of body joints from a single depth image, using no temporal information. We take an object recognition approach, designing an intermediate body parts representation that maps the difficult pose estimation problem into a simpler

Learning low-level vision

by William T. Freeman, Egon C. Pasztor - International Journal of Computer Vision , 2000
"... We show a learning-based method for low-level vision problems. We set-up a Markov network of patches of the image and the underlying scene. A factorization approximation allows us to easily learn the parameters of the Markov network from synthetic examples of image/scene pairs, and to e ciently prop ..."
Abstract - Cited by 579 (30 self) - Add to MetaCart
We show a learning-based method for low-level vision problems. We set-up a Markov network of patches of the image and the underlying scene. A factorization approximation allows us to easily learn the parameters of the Markov network from synthetic examples of image/scene pairs, and to e ciently

Rendering Synthetic Objects into Real Scenes: Bridging Traditional and Image-based Graphics with Global Illumination and High Dynamic Range Photography

by Paul Debevec , 1998
"... We present a method that uses measured scene radiance and global illumination in order to add new objects to light-based models with correct lighting. The methodusesahighdynamicrangeimagebasedmodelofthescene, ratherthansyntheticlightsources,toilluminatethe new objects. Tocomputetheillumination,thesc ..."
Abstract - Cited by 438 (17 self) - Add to MetaCart
We present a method that uses measured scene radiance and global illumination in order to add new objects to light-based models with correct lighting. The methodusesahighdynamicrangeimagebasedmodelofthescene, ratherthansyntheticlightsources,toilluminatethe new objects. Tocomputetheillumination,thesceneis consideredasthreecomponents:thedistantscene, the localscene, andthesyntheticobjects. The distant scene is assumed tobephotometricallyunaffectedbytheobjects, obviatingtheneedforreflectancemodelinformation. Thelocalsceneisendowedwithestimatedreflectancemodel informationsothatitcancatchshadows andreceivereflectedlightfromthenewobjects. Renderings are createdwithastandardglobalilluminationmethodby simulating theinteractionoflightamongstthethreecomponents. A differentialrenderingtechniqueallowsforgoodresults to be obtained when only an estimate ofthelocalscenereflectancepropertiesisknown. Weapplythegeneralmethodtotheproblemofrendering syntheticobjectsintorealscenes. The light-based model is constructed from an approximategeometricmodelofthesceneandbyusinga lightprobetomeasuretheincidentilluminationatthe locationof thesyntheticobjects. Theglobalilluminationsolutionisthen compositedintoaphotographofthesceneusing thedifferentialrenderingtechnique. Weconcludebydiscussingtherelevance of the technique to recovering surface reflectance properties in uncontrolled lighting situations. Applications of the method include visual effects, interior design, and architectural visualization.

The Lumigraph

by Steven J. Gortler, Radek Grzeszczuk, Richard Szeliski, Michael F. Cohen - IN PROCEEDINGS OF SIGGRAPH 96 , 1996
"... This paper discusses a new method for capturing the complete appearanceof both synthetic and real world objects and scenes, representing this information, and then using this representation to render images of the object from new camera positions. Unlike the shape capture process traditionally used ..."
Abstract - Cited by 1025 (39 self) - Add to MetaCart
This paper discusses a new method for capturing the complete appearanceof both synthetic and real world objects and scenes, representing this information, and then using this representation to render images of the object from new camera positions. Unlike the shape capture process traditionally used

Compressed sensing

by Yaakov Tsaig, David L. Donoho , 2004
"... We study the notion of Compressed Sensing (CS) as put forward in [14] and related work [20, 3, 4]. The basic idea behind CS is that a signal or image, unknown but supposed to be compressible by a known transform, (eg. wavelet or Fourier), can be subjected to fewer measurements than the nominal numbe ..."
Abstract - Cited by 3625 (22 self) - Add to MetaCart
the object has all coefficients nonzero, but the coefficients obey an `p bound, for some p ∈ (0, 1]. These experiments show that the basic inequalities behind the CS method seem to involve reasonable constants. We next consider synthetic examples modelling problems in spectroscopy and image pro-

K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation

by Michal Aharon, et al. , 2006
"... In recent years there has been a growing interest in the study of sparse representation of signals. Using an overcomplete dictionary that contains prototype signal-atoms, signals are described by sparse linear combinations of these atoms. Applications that use sparse representation are many and inc ..."
Abstract - Cited by 935 (41 self) - Add to MetaCart
is flexible and can work with any pursuit method (e.g., basis pursuit, FOCUSS, or matching pursuit). We analyze this algorithm and demonstrate its results both on synthetic tests and in applications on real image data.

Producing Anaglyphs from Synthetic Images

by William Sanders, William S, David F. Mcallister - Proc. SPIE 5006 , 2003
"... Distance learning and virtual laboratory applications have motivated the use of inexpensive visual stereo solutions for computer displays. The anaglyph method is such a solution. Several techniques have been proposed for the production of anaglyphs. We discuss three approaches: the Photoshop algorit ..."
Abstract - Cited by 7 (0 self) - Add to MetaCart
Distance learning and virtual laboratory applications have motivated the use of inexpensive visual stereo solutions for computer displays. The anaglyph method is such a solution. Several techniques have been proposed for the production of anaglyphs. We discuss three approaches: the Photoshop algorithm and its variants, the least squares algorithm proposed by Eric Dubois that optimizes in the CIE color space, and the midpoint algorithm that minimizes the sum of the distances between the anagylph color and the left and right eye colors in CIEL*a*b*. Our results show that each method has its advantages and disadvantages in faithful color representation and in stereo quality as it relates to region merging and ghosting.
Next 10 →
Results 1 - 10 of 8,795
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