Results 11 - 20 of 42,887

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
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

Svm-knn: Discriminative nearest neighbor classification for visual category recognition

by Hao Zhang, Alexander C. Berg, Michael Maire, Jitendra Malik - in CVPR , 2006
"... We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is quite flexible, and permits recognition based on color, texture, and particularly shape, in a homogeneous framework. While n ..."
Abstract - Cited by 342 (10 self) - Add to MetaCart
.05%(±0.56%) at 15 training images per class, and 66.23%(±0.48%) at 30 training images. 1.

Multiscale vessel enhancement filtering

by Alejandro F. Frangi, Wiro J. Niessen, Koen L. Vincken, Max A. Viergever , 1998
"... The multiscale second order local structure of an image (Hessian) isexamined with the purpose of developing a vessel enhancement filter. A vesselness measure is obtained on the basis of all eigenvalues of the Hessian. This measure is tested on two dimensional DSA and three dimensional aortoiliac an ..."
Abstract - Cited by 318 (8 self) - Add to MetaCart
The multiscale second order local structure of an image (Hessian) isexamined with the purpose of developing a vessel enhancement filter. A vesselness measure is obtained on the basis of all eigenvalues of the Hessian. This measure is tested on two dimensional DSA and three dimensional aortoiliac

Pyramidal implementation of the Lucas Kanade feature tracker

by Jean-yves Bouguet - Intel Corporation, Microprocessor Research Labs , 2000
"... grayscale value of the two images are the location x = [x y] T, where x and y are the two pixel coordinates of a generic image point x. The image I will sometimes be referenced as the first image, and the image J as the second image. For practical issues, the images I and J are discret function (or ..."
Abstract - Cited by 308 (0 self) - Add to MetaCart
arrays), and the upper left corner pixel coordinate vector is [0 0] T. Let nx and ny be the width and height of the two images. Then the lower right pixel coordinate vector is [nx − 1 ny − 1] T. Consider an image point u = [ux uy] T on the first image I. The goal of feature tracking is to find

Lost in quantization: Improving particular object retrieval in large scale image databases

by James Philbin, Michael Isard, Josef Sivic, Andrew Zisserman - In CVPR , 2008
"... The state of the art in visual object retrieval from large databases is achieved by systems that are inspired by text retrieval. A key component of these approaches is that local regions of images are characterized using high-dimensional descriptors which are then mapped to “visual words ” selected ..."
Abstract - Cited by 253 (8 self) - Add to MetaCart
The state of the art in visual object retrieval from large databases is achieved by systems that are inspired by text retrieval. A key component of these approaches is that local regions of images are characterized using high-dimensional descriptors which are then mapped to “visual words ” selected

Improved Localization of Cortical Activity by Combining EEG and MEG with MRI Cortical Surface Reconstruction: A Linear Approach

by Anders M. Dale, Martin I. Sereno - J. Cogn. Neurosci , 1993
"... We describe a comprehensive linear approach to the prob- lem of imaging brain activity with high temporal as well as spatial resolution based on combining EEG and MEG data with anatomical constraints derived from MRI images. The "inverse problem" of estimating the distribution of dipole st ..."
Abstract - Cited by 263 (19 self) - Add to MetaCart
formulation. ;m explicit polygonal model of the cortical manifold is first constructed :,s follows: (1) slice data in three onhogon;,l pJ:,ncs of section (needle-shaped voxels) are combined with a linear aleblurring technique to make a single high.resolution 3-D image (cubic voxels), (2) the image

Algorithms for scheduling imprecise computations

by Jane W. S. Liu, Kwei-jay Lin, Wei-kuan Shih, Albert Chuang-shi Yu - IEEE Computer , 1991
"... n a hard real-time cyctem, every time-T critical task must meet its timing con-1 straint, typically specified as its deadline. (A task is a granule of computa-tion treated by the scheduler as a unit of work to be allocated processor time, or scheduled.) If any time-critical task fails to complete an ..."
Abstract - Cited by 256 (17 self) - Add to MetaCart
n a hard real-time cyctem, every time-T critical task must meet its timing con-1 straint, typically specified as its deadline. (A task is a granule of computa-tion treated by the scheduler as a unit of work to be allocated processor time, or scheduled.) If any time-critical task fails to complete

Computing geodesics and minimal surfaces via graph cuts

by Yuri Boykov - in International Conference on Computer Vision , 2003
"... Geodesic active contours and graph cuts are two standard image segmentation techniques. We introduce a new segmentation method combining some of their benefits. Our main intuition is that any cut on a graph embedded in some continuous space can be interpreted as a contour (in 2D) or a surface (in 3D ..."
Abstract - Cited by 251 (26 self) - Add to MetaCart
Geodesic active contours and graph cuts are two standard image segmentation techniques. We introduce a new segmentation method combining some of their benefits. Our main intuition is that any cut on a graph embedded in some continuous space can be interpreted as a contour (in 2D) or a surface (in 3

Numerical methods for image registration

by Eldad Haber, Jan Modersitzki, Eldad Haber , 2004
"... In this paper we introduce a new framework for image registration. Our formulation is based on consistent discretization of the optimization problem coupled with a multigrid solution of the linear system which evolve in a Gauss-Newton iteration. We show that our discretization is h-elliptic independ ..."
Abstract - Cited by 209 (29 self) - Add to MetaCart
problem. 1 Introduction and problem setup Image registration is one of today’s challenging image processing problems. Given a so-called reference R and a so-called template image T, the basic idea is to find a “reasonable ” transformation such that a transformed version of the template image becomes

Adaptive Segmentation of MRI data

by W.M. Wells, III, W.E.L. Grimson, R. Kikinis, F. A. Jolesz , 1995
"... Intensity-based classification of MR images has proven problematic, even when advanced techniques are used. Intra-scan and inter-scan intensity inhomogeneities are a common source of difficulty. While reported methods have had some success in correcting intra-scan inhomogeneities, such methods requi ..."
Abstract - Cited by 224 (15 self) - Add to MetaCart
-echo T1-weighted) all using a conventional head coil; and a sagittal section acquired using a surf...
Results 11 - 20 of 42,887