Results 1 - 10
of
7,885
Image Quilting for Texture Synthesis and Transfer
, 2001
"... We present a simple image-based method of generating novel visual appearance in which a new image is synthesized by stitching together small patches of existing images. We call this process image quilting. First, we use quilting as a fast and very simple texture synthesis algorithm which produces s ..."
Abstract
-
Cited by 699 (18 self)
- Add to MetaCart
We present a simple image-based method of generating novel visual appearance in which a new image is synthesized by stitching together small patches of existing images. We call this process image quilting. First, we use quilting as a fast and very simple texture synthesis algorithm which produces
Open information extraction from the web
- IN IJCAI
, 2007
"... Traditionally, Information Extraction (IE) has focused on satisfying precise, narrow, pre-specified requests from small homogeneous corpora (e.g., extract the location and time of seminars from a set of announcements). Shifting to a new domain requires the user to name the target relations and to ma ..."
Abstract
-
Cited by 373 (39 self)
- Add to MetaCart
Traditionally, Information Extraction (IE) has focused on satisfying precise, narrow, pre-specified requests from small homogeneous corpora (e.g., extract the location and time of seminars from a set of announcements). Shifting to a new domain requires the user to name the target relations
The tandem affinity purification (TAP) method: a general procedure of protein complex purification. Methods 24
, 2001
"... Identification of components present in biological complexes requires their purification to near homogeneity. Methods of purification vary from protein to protein, making it impossible to design a general purification strategy valid for all cases. We have devel-oped the tandem affinity purification ..."
Abstract
-
Cited by 353 (3 self)
- Add to MetaCart
Identification of components present in biological complexes requires their purification to near homogeneity. Methods of purification vary from protein to protein, making it impossible to design a general purification strategy valid for all cases. We have devel-oped the tandem affinity purification
Creating efficient codebooks for visual recognition
- In Proceedings of the IEEE International Conference on Computer Vision
, 2005
"... Visual codebook based quantization of robust appearance descriptors extracted from local image patches is an effective means of capturing image statistics for texture analysis and scene classification. Codebooks are usually constructed by using a method such as k-means to cluster the descriptor vect ..."
Abstract
-
Cited by 276 (22 self)
- Add to MetaCart
vectors of patches sampled either densely (‘textons’) or sparsely (‘bags of features ’ based on keypoints or salience measures) from a set of training images. This works well for texture analysis in homogeneous images, but the images that arise in natural object recognition tasks have far less uniform
Sampling strategies for bag-of-features image classification
- In Proc. ECCV
, 2006
"... Abstract. Bag-of-features representations have recently become popular for content based image classification owing to their simplicity and good performance. They evolved from texton methods in texture analysis. The basic idea is to treat images as loose collections of independent patches, sampling ..."
Abstract
-
Cited by 266 (14 self)
- Add to MetaCart
equal or better classifiers than the sophisticated multiscale interest operators that are in common use. Although interest operators work well for small numbers of samples, the single most important factor governing performance is the number of patches sampled from the test image and ultimately interest
Make3D: Learning 3D Scene Structure from a Single Still Image
"... We consider the problem of estimating detailed 3-d structure from a single still image of an unstructured environment. Our goal is to create 3-d models which are both quantitatively accurate as well as visually pleasing. For each small homogeneous patch in the image, we use a Markov Random Field (M ..."
Abstract
-
Cited by 158 (19 self)
- Add to MetaCart
We consider the problem of estimating detailed 3-d structure from a single still image of an unstructured environment. Our goal is to create 3-d models which are both quantitatively accurate as well as visually pleasing. For each small homogeneous patch in the image, we use a Markov Random Field
Patch dynamics with buffers for homogenization problems
- J. Computational Physics
, 2006
"... An important class of problems exhibits smooth behaviour on macroscopic space and time scales, while only a microscopic evolution law is known. For such time-dependent multi-scale problems, an “equation-free ” framework has been proposed, of which patch dynamics is an essential component. Patch dyna ..."
Abstract
-
Cited by 14 (4 self)
- Add to MetaCart
dynamics is designed to perform numerical simulations of an unavailable macroscopic equation on macroscopic time and length scales; it uses appropriately initialized simulations of the available microscopic model in a number of small boxes (patches), which cover only a fraction of the space-time domain
Robust Fragments-based Tracking using the Integral Histogram
- In IEEE Conf. Computer Vision and Pattern Recognition (CVPR
, 2006
"... We present a novel algorithm (which we call “Frag-Track”) for tracking an object in a video sequence. The template object is represented by multiple image fragments or patches. The patches are arbitrary and are not based on an object model (in contrast with traditional use of modelbased parts e.g. l ..."
Abstract
-
Cited by 224 (0 self)
- Add to MetaCart
We present a novel algorithm (which we call “Frag-Track”) for tracking an object in a video sequence. The template object is represented by multiple image fragments or patches. The patches are arbitrary and are not based on an object model (in contrast with traditional use of modelbased parts e
Finite difference patch dynamics for advection homogenization problems
- Model Reduction and Coarse-Graining Approaches for Multiscale Phenomena
, 2006
"... Summary. We consider problems in which there is a separation between the (mi-croscopic) scale at which the available model is defined, and the (macroscopic) scale of interest. For time-dependent multi-scale problems of this type, an “equation-free” framework has been proposed, of which patch dynamic ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
dynamics is an essential component. Patch dynamics is designed to perform numerical simulations of an unavailable macroscopic equation on macroscopic time and length scales; it only uses appro-priately initialized simulations of the available microscopic model in a number of small boxes (patches), which
Results 1 - 10
of
7,885