Results 1  10
of
4,441
Localityconstrained linear coding for image classification
 IN: IEEE CONFERENCE ON COMPUTER VISION AND PATTERN CLASSIFICATOIN
, 2010
"... The traditional SPM approach based on bagoffeatures (BoF) requires nonlinear classifiers to achieve good image classification performance. This paper presents a simple but effective coding scheme called Localityconstrained Linear Coding (LLC) in place of the VQ coding in traditional SPM. LLC util ..."
Abstract

Cited by 443 (20 self)
 Add to MetaCart
, achieving stateoftheart performance on several benchmarks. Compared with the sparse coding strategy [22], the objective function used by LLC has an analytical solution. In addition, the paper proposes a fast approximated LLC method by first performing a Knearestneighbor search and then solving a
A Fast Algorithm for Particle Simulations
, 1987
"... this paper to the case where the potential (or force) at a point is a sum of pairwise An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles interactions. More specifically, we consider potentials of whose interactions a ..."
Abstract

Cited by 1152 (19 self)
 Add to MetaCart
are Coulombic or gravitational in nature. For a the form system of N particles, an amount of work of the order O(N 2 ) has traditionally been required to evaluate all pairwise interactions, un F5F far 1 (F near 1F external ), less some approximation or truncation method is used. The algorithm of the present
Fast and robust fixedpoint algorithms for independent component analysis
 IEEE TRANS. NEURAL NETW
, 1999
"... Independent component analysis (ICA) is a statistical method for transforming an observed multidimensional random vector into components that are statistically as independent from each other as possible. In this paper, we use a combination of two different approaches for linear ICA: Comon’s informat ..."
Abstract

Cited by 884 (34 self)
 Add to MetaCart
Independent component analysis (ICA) is a statistical method for transforming an observed multidimensional random vector into components that are statistically as independent from each other as possible. In this paper, we use a combination of two different approaches for linear ICA: Comon’s
Numerical integration of the Cartesian equations of motion of a system with constraints: molecular dynamics of nalkanes
 J. Comput. Phys
, 1977
"... A numerical algorithm integrating the 3N Cartesian equations of motion of a system of N points subject to holonomic constraints is formulated. The relations of constraint remain perfectly fulfilled at each step of the trajectory despite the approximate character of numerical integration. The method ..."
Abstract

Cited by 704 (6 self)
 Add to MetaCart
A numerical algorithm integrating the 3N Cartesian equations of motion of a system of N points subject to holonomic constraints is formulated. The relations of constraint remain perfectly fulfilled at each step of the trajectory despite the approximate character of numerical integration. The method
Reconstruction and Representation of 3D Objects with Radial Basis Functions
 Computer Graphics (SIGGRAPH ’01 Conf. Proc.), pages 67–76. ACM SIGGRAPH
, 2001
"... We use polyharmonic Radial Basis Functions (RBFs) to reconstruct smooth, manifold surfaces from pointcloud data and to repair incomplete meshes. An object's surface is defined implicitly as the zero set of an RBF fitted to the given surface data. Fast methods for fitting and evaluating RBFs al ..."
Abstract

Cited by 505 (1 self)
 Add to MetaCart
We use polyharmonic Radial Basis Functions (RBFs) to reconstruct smooth, manifold surfaces from pointcloud data and to repair incomplete meshes. An object's surface is defined implicitly as the zero set of an RBF fitted to the given surface data. Fast methods for fitting and evaluating RBFs
Fast Bilateral Filtering for the Display of HighDynamicRange Images
, 2002
"... We present a new technique for the display of highdynamicrange images, which reduces the contrast while preserving detail. It is based on a twoscale decomposition of the image into a base layer, encoding largescale variations, and a detail layer. Only the base layer has its contrast reduced, the ..."
Abstract

Cited by 453 (10 self)
 Add to MetaCart
. This results in a speedup of two orders of magnitude. The method is fast and requires no parameter setting.
A fast and flexible statistical model for largescale population genotype data: Applications to inferring missing genotypes and haplotype phase
 American Journal of Human Genetics
, 2005
"... We present a statistical model for patterns of genetic variation in samples of unrelated individuals from natural populations. This model is based on the idea that, over short regions, haplotypes in a population tend to cluster into groups of similar haplotypes. To capture the fact that, because of ..."
Abstract

Cited by 408 (10 self)
 Add to MetaCart
computed using the model are approximately well calibrated. The methods described in this article are implemented in a software package, fastPHASE, which is available from the
Efficient Implementation of Weighted ENO Schemes
, 1995
"... In this paper, we further analyze, test, modify and improve the high order WENO (weighted essentially nonoscillatory) finite difference schemes of Liu, Osher and Chan [9]. It was shown by Liu et al. that WENO schemes constructed from the r th order (in L¹ norm) ENO schemes are (r +1) th order accur ..."
Abstract

Cited by 412 (38 self)
 Add to MetaCart
accurate. We propose a new way of measuring the smoothness of a numerical solution, emulating the idea of minimizing the total variation of the approximation, which results in a 5th order WENO scheme for the case r = 3, instead of the 4th order with the original smoothness measurement by Liu et al. This 5
Meshless methods: An overview and recent developments
 Computer Methods in Applied Mechanics and Engineering
, 1996
"... Meshless approximations based on moving least squares, kernels, and partitions of unity are examined. It is shown that the three methods are in most cases identical except for the important fact that partitions of unity enablepadaptivity to be achieved. Methods for constructing discontinuous approx ..."
Abstract

Cited by 333 (19 self)
 Add to MetaCart
Meshless approximations based on moving least squares, kernels, and partitions of unity are examined. It is shown that the three methods are in most cases identical except for the important fact that partitions of unity enablepadaptivity to be achieved. Methods for constructing discontinuous
Fast Approximation Algorithms for Fractional Packing and Covering Problems
, 1995
"... This paper presents fast algorithms that find approximate solutions for a general class of problems, which we call fractional packing and covering problems. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniques developed ..."
Abstract

Cited by 260 (13 self)
 Add to MetaCart
This paper presents fast algorithms that find approximate solutions for a general class of problems, which we call fractional packing and covering problems. The only previously known algorithms for solving these problems are based on general linear programming techniques. The techniques
Results 1  10
of
4,441