Results 1 - 10 of 12,079

Factoring wavelet transforms into lifting steps

by Ingrid Daubechies, Wim Sweldens - J. FOURIER ANAL. APPL , 1998
"... This paper is essentially tutorial in nature. We show how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed into a finite sequence of simple filtering steps, which we call lifting steps but that are also known as ladder structures. This decompositio ..."
Abstract - Cited by 584 (8 self) - Add to MetaCart
in the biorthogonal, i.e, non-unitary case. Like the lattice factorization, the decomposition presented here asymptotically reduces the computational complexity of the transform by a factor two. It has other applications, such as the possibility of defining a wavelet-like transform that maps integers to integers.

Shape Matching and Object Recognition Using Shape Contexts

by Serge Belongie, Jitendra Malik, Jan Puzicha - IEEE Transactions on Pattern Analysis and Machine Intelligence , 2001
"... We present a novel approach to measuring similarity between shapes and exploit it for object recognition. In our framework, the measurement of similarity is preceded by (1) solv- ing for correspondences between points on the two shapes, (2) using the correspondences to estimate an aligning transform ..."
Abstract - Cited by 1809 (21 self) - Add to MetaCart
similar shapes will have similar shape con- texts, enabling us to solve for correspondences as an optimal assignment problem. Given the point correspondences, we estimate the transformation that best aligns the two shapes; reg- ularized thin plate splines provide a flexible class of transformation maps

Mapping the Margins: Intersectionality, Identity Politics, and Violence against Women of Color

by Kimberlé Williams Crenshaw - Stanford Law Review , 1991
"... Over the last two decades, women have organized against the almost routine violence that shapes their lives. Drawing from the strength of shared experience, women have recognized that the political demands of millions speak more powerfully than the pleas of a few isolated voices. This politicization ..."
Abstract - Cited by 482 (0 self) - Add to MetaCart
. This politicization in turn has transformed the way we understand violence against women. For

Representing Moving Images with Layers

by John Y.A. Wang, Edward H. Adelson , 1994
"... We describe a system for representing moving images with sets of overlapping layers. Each layer contains an intensity map that defines the additive values of each pixel, along with an alpha map that serves as a mask indicating the transparency. The layers are ordered in depth and they occlude each o ..."
Abstract - Cited by 542 (11 self) - Add to MetaCart
other in accord with the rules of compositing. Velocity maps define how the layers are to be warped over time. The layered representation is more flexible than standard image transforms and can capture many important properties of natural image sequences. We describe some methods for decomposing image

Efficient similarity search in sequence databases

by Rakesh Agrawal, Christos Faloutsos, Arun Swami , 1994
"... We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation being that, for most sequences of practical interest, only the first few frequencies are strong. Anot ..."
Abstract - Cited by 515 (19 self) - Add to MetaCart
We propose an indexing method for time sequences for processing similarity queries. We use the Discrete Fourier Transform (DFT) to map time sequences to the frequency domain, the crucial observation being that, for most sequences of practical interest, only the first few frequencies are strong

AFNI: software for analysis and visualization of functional magnetic resonance neuroimages

by Robert W Cox - Computers and Biomedical Research , 1996
"... email rwcoxmcwedu A package of computer programs for analysis and visualization of threedimensional human brain functional magnetic resonance imaging FMRI results is described The software can color overlay neural activation maps onto higher resolution anatomical scans Slices in each cardinal pl ..."
Abstract - Cited by 807 (3 self) - Add to MetaCart
email rwcoxmcwedu A package of computer programs for analysis and visualization of threedimensional human brain functional magnetic resonance imaging FMRI results is described The software can color overlay neural activation maps onto higher resolution anatomical scans Slices in each cardinal

A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR PROGRAMMING

by N. Karmarkar - COMBINATORICA , 1984
"... We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than the ell ..."
Abstract - Cited by 860 (3 self) - Add to MetaCart
the ellipsoid algorithm by a factor of O(n~'~). We prove that given a polytope P and a strictly in-terior point a E P, there is a projective transformation of the space that maps P, a to P', a ' having the following property. The ratio of the radius of the smallest sphere with center a

Mean shift, mode seeking, and clustering

by Yizong Cheng - IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1995
"... Mean shift, a simple iterative procedure that shifts each data point to the average of data points in its neighborhood, is generalized and analyzed in this paper. This generalization makes some k-means like clustering algorithms its special cases. It is shown that mean shift is a mode-seeking proce ..."
Abstract - Cited by 624 (0 self) - Add to MetaCart
-seeking process on a surface constructed with a “shadow ” kernel. For Gaussian kernels, mean shift is a gradient mapping. Convergence is studied for mean shift iterations. Cluster analysis is treated as a deterministic problem of finding a fixed point of mean shift that characterizes the data. Applications

Image registration methods: a survey.

by Barbara Zitová , Jan Flusser , 2003
"... Abstract This paper aims to present a review of recent as well as classic image registration methods. Image registration is the process of overlaying images (two or more) of the same scene taken at different times, from different viewpoints, and/or by different sensors. The registration geometrical ..."
Abstract - Cited by 760 (10 self) - Add to MetaCart
geometrically align two images (the reference and sensed images). The reviewed approaches are classified according to their nature (areabased and feature-based) and according to four basic steps of image registration procedure: feature detection, feature matching, mapping function design, and image

Bandera: Extracting Finite-state Models from Java Source Code

by James C. Corbett, Matthew B. Dwyer, John Hatcliff, Shawn Laubach, Corina S. Pasareanu, Hongjun Zheng - IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING , 2000
"... Finite-state verification techniques, such as model checking, have shown promise as a cost-effective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract - Cited by 654 (33 self) - Add to MetaCart
), and difficult to optimize (which is necessary to combat the exponential complexity of verification algorithms). In this paper, we describe an integrated collection of program analysis and transformation components, called Bandera, that enables the automatic extraction of safe, compact finite-state models from
Results 1 - 10 of 12,079