Results 1 - 10 of 2,003

Fast texture synthesis using tree-structured vector quantization

by Li-yi Wei, Marc Levoy , 2000
"... Figure 1: Our texture generation process takes an example texture patch (left) and a random noise (middle) as input, and modifies this random noise to make it look like the given example texture. The synthesized texture (right) can be of arbitrary size, and is perceived as very similar to the given ..."
Abstract - Cited by 561 (12 self) - Add to MetaCart
Figure 1: Our texture generation process takes an example texture patch (left) and a random noise (middle) as input, and modifies this random noise to make it look like the given example texture. The synthesized texture (right) can be of arbitrary size, and is perceived as very similar to the given

Efficient and Effective Querying by Image Content

by C. Faloutsos, W. Equitz, M. Flickner, W. Niblack, D. Petkovic, R. Barber - Journal of Intelligent Information Systems , 1994
"... In the QBIC (Query By Image Content) project we are studying methods to query large on-line image databases using the images' content as the basis of the queries. Examples of the content we use include color, texture, and shape of image objects and regions. Potential applications include med ..."
Abstract - Cited by 503 (13 self) - Add to MetaCart
In the QBIC (Query By Image Content) project we are studying methods to query large on-line image databases using the images' content as the basis of the queries. Examples of the content we use include color, texture, and shape of image objects and regions. Potential applications include

A Parametric Texture Model based on Joint Statistics of Complex Wavelet Coefficients

by Javier Portilla, Eero P. Simoncelli - INTERNATIONAL JOURNAL OF COMPUTER VISION , 2000
"... We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed on pairs of coefficients corresponding to basis functions at adjacent spatial locations, orientations, and scales. We de ..."
Abstract - Cited by 424 (13 self) - Add to MetaCart
set by showing examples of texture synthesis that fail when those parameters are removed from the set. We also demonstrate the power of our model by successfully synthesizing examples drawn from a diverse collection of artificial and natural textures.

"GrabCut” -- interactive foreground extraction using iterated graph cuts

by Carsten Rother, Vladimir Kolmogorov, Andrew Blake - ACM TRANS. GRAPH , 2004
"... The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors. Recently ..."
Abstract - Cited by 1130 (36 self) - Add to MetaCart
The problem of efficient, interactive foreground/background segmentation in still images is of great practical importance in image editing. Classical image segmentation tools use either texture (colour) information, e.g. Magic Wand, or edge (contrast) information, e.g. Intelligent Scissors

Image analogies

by Aaron Hertzmann , 2001
"... Figure 1 An image analogy. Our problem is to compute a new “analogous ” image B ′ that relates to B in “the same way ” as A ′ relates to A. Here, A, A ′ , and B are inputs to our algorithm, and B ′ is the output. The full-size images are shown in Figures 10 and 11. This paper describes a new framewo ..."
Abstract - Cited by 455 (8 self) - Add to MetaCart
; texture transfer, in which images are “texturized ” with some arbitrary source texture; artistic filters, in which various drawing and painting styles are synthesized based on scanned real-world examples; and texture-by-numbers, in which realistic scenes, composed of a variety of textures, are created

Example-based super-resolution

by William T. Freeman, Thouis R. Jones, Egon C. Pasztor - IEEE COMPUT. GRAPH. APPL , 2001
"... The Problem: Pixel representations for images do not have resolution independence. When we zoom into a bitmapped image, we get a blurred image. Figure 1 shows the problem for a teapot image, rich with real-world detail. We know the teapot’s features should remain sharp as we zoom in on them, yet sta ..."
Abstract - Cited by 349 (5 self) - Add to MetaCart
processing could benefit from such pixel resolution independence, such as texture mapping, enlarging consumer photographs, and converting NTSC video content to HDTV. We don’t expect perfect resolution independence—even the polygon representation doesn’t have that—but increasing the resolution independence

A comparative study of energy minimization methods for Markov random fields

by Richard Szeliski, Ramin Zabih, Daniel Scharstein, Olga Veksler, Aseem Agarwala, Carsten Rother, et al. - IN ECCV , 2006
"... One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with some quantity such as depth or texture. While many such problems can be elegantly expressed in the language of Markov Ran ..."
Abstract - Cited by 415 (36 self) - Add to MetaCart
One of the most exciting advances in early vision has been the development of efficient energy minimization algorithms. Many early vision tasks require labeling each pixel with some quantity such as depth or texture. While many such problems can be elegantly expressed in the language of Markov

Combined Object Categorization and Segmentation With An Implicit Shape Model

by Bastian Leibe, Ales Leonardis, Bernt Schiele - In ECCV workshop on statistical learning in computer vision , 2004
"... We present a method for object categorization in real-world scenes. Following a common consensus in the field, we do not assume that a figure-ground segmentation is available prior to recognition. However, in contrast to most standard approaches for object class recognition, our approach automatical ..."
Abstract - Cited by 406 (10 self) - Add to MetaCart
needing one order of magnitude less training examples. Finally, we present results for articulated objects, which show that the proposed method can categorize and segment unfamiliar objects in different articulations and with widely varying texture patterns, even under significant partial occlusion.

A general framework for object detection

by Constantine P. Papageorgiou, Michael Oren, Tomaso Poggio - Sixth International Conference on , 1998
"... This paper presents a general trainable framework for object detection in static images of cluttered scenes. The detection technique we develop is based on a wavelet representation of an object class derived from a statistical analysis of the class instances. By learning an object class in terms of ..."
Abstract - Cited by 395 (21 self) - Add to MetaCart
in unconstrained environments. We demonstrate the capabilities of the technique in two domains whose inherent information content differs significantly. The first system is face detection and the second is the domain of people which, in contrast to faces, vary greatly in color, texture, and patterns. Unlike

Robust object recognition with cortex-like mechanisms

by Thomas Serre, Lior Wolf, Stanley Bileschi, Maximilian Riesenhuber, Tomaso Poggio - IEEE Trans. Pattern Analysis and Machine Intelligence , 2007
"... Abstract—We introduce a new general framework for the recognition of complex visual scenes, which is motivated by biology: We describe a hierarchical system that closely follows the organization of visual cortex and builds an increasingly complex and invariant feature representation by alternating b ..."
Abstract - Cited by 389 (47 self) - Add to MetaCart
shape-based as well as texture-based objects. Given the biological constraints that the system had to satisfy, the approach performs surprisingly well: It has the capability of learning from only a few training examples and competes with state-of-the-art systems. We also discuss the existence of a
Results 1 - 10 of 2,003