Sciweavers

728 search results - page 121 / 146
» Compressing combinatorial objects
Sort
View
TVCG
2008
104views more  TVCG 2008»
13 years 9 months ago
A Generic Scheme for Progressive Point Cloud Coding
In this paper, we propose a generic point cloud encoder that provides a unified framework for compressing different attributes of point samples corresponding to 3D objects with an ...
Yan Huang, Jingliang Peng, C. C. Jay Kuo, M. Gopi
ICASSP
2010
IEEE
13 years 8 months ago
Human detection in images via L1-norm Minimization Learning
In recent years, sparse representation originating from signal compressed sensing theory has attracted increasing interest in computer vision research community. However, to our b...
Ran Xu, Baochang Zhang, Qixiang Ye, Jianbin Jiao
ICASSP
2011
IEEE
13 years 1 months ago
A multi-exposure image fusion algorithm without ghost effect
This paper proposes a new multi-exposure fusion algorithm for HDR imaging. The advantage of the fusion based method is that it does not actually generate HDR images so that the co...
Jaehyun An, Sang Heon Lee, Jung Gap Kuk, Nam Ik Ch...
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
14 years 3 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál
MOR
2002
94views more  MOR 2002»
13 years 9 months ago
The Complexity of Generic Primal Algorithms for Solving General Integer Programs
ngly better objective function value until an optimal solution is reached. From an abstract point of view, an augmentation problem is solved in each iteration. That is, given a fea...
Andreas S. Schulz, Robert Weismantel