Results 1  10
of
496,591
Progressive Meshes
"... Highly detailed geometric models are rapidly becoming commonplace in computer graphics. These models, often represented as complex triangle meshes, challenge rendering performance, transmission bandwidth, and storage capacities. This paper introduces the progressive mesh (PM) representation, a new s ..."
Abstract

Cited by 1315 (11 self)
 Add to MetaCart
. In addition, we present a new mesh simplification procedure for constructing a PM representation from an arbitrary mesh. The goal of this optimization procedure is to preserve not just the geometry of the original mesh, but more importantly its overall appearance as defined by its discrete and scalar
Adapting to unknown smoothness via wavelet shrinkage
 JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION
, 1995
"... We attempt to recover a function of unknown smoothness from noisy, sampled data. We introduce a procedure, SureShrink, which suppresses noise by thresholding the empirical wavelet coefficients. The thresholding is adaptive: a threshold level is assigned to each dyadic resolution level by the princip ..."
Abstract

Cited by 1006 (18 self)
 Add to MetaCart
We attempt to recover a function of unknown smoothness from noisy, sampled data. We introduce a procedure, SureShrink, which suppresses noise by thresholding the empirical wavelet coefficients. The thresholding is adaptive: a threshold level is assigned to each dyadic resolution level
What Do Packet Dispersion Techniques Measure?
 IN PROCEEDINGS OF IEEE INFOCOM
, 2001
"... The packet pair technique estimates the capacity of a path (bottleneck bandwidth) from the dispersion (spacing) experienced by two backtoback packets [1][2][3]. We demonstrate that the dispersion of packet pairs in loaded paths follows a multimodal distribution, and discuss the queueing effects th ..."
Abstract

Cited by 313 (8 self)
 Add to MetaCart
that cause the multiple modes. We show that the path capacity is often not the global mode, and so it cannot be estimated using standard statistical procedures. The effect of the size of the probing packets is also investigated, showing that the conventional wisdom of using maximum sized packet pairs
Joint MAP registration and highresolution image estimation using a sequence of undersampled images
 IEEE Transactions on Image Processing
, 1997
"... Abstract — In many imaging systems, the detector array is not sufficiently dense to adequately sample the scene with the desired field of view. This is particularly true for many infrared focal plane arrays. Thus, the resulting images may be severely aliased. This paper examines a technique for esti ..."
Abstract

Cited by 219 (2 self)
 Add to MetaCart
image in a cyclic coordinatedescent optimization procedure. Experimental results are provided to illustrate the performance of the proposed MAP algorithm using both visible and infrared images. Quantitative error analysis is provided and several images are shown for subjective evaluation. Index Terms
Inverse Global Illumination: Recovering Reflectance Models of Real Scenes from Photographs
, 1999
"... In this paper we present a method for recovering the reflectance properties of all surfaces in a real scene from a sparse set of photographs, taking into account both direct and indirect illumination. The result is a lightingindependent model of the scene's geometry and reflectance properties, ..."
Abstract

Cited by 246 (12 self)
 Add to MetaCart
estimates of both the radiance and irradiance of each patch from the photographic data. The algorithm computes the expected location of specular highlights, and then analyzes the highlight areas in the images by running a novel iterative optimization procedure to recover the diffuse and specular reflectance
A BRANCHANDCUT ALGORITHM FOR THE RESOLUTION OF LARGESCALE SYMMETRIC TRAVELING SALESMAN PROBLEMS
, 1991
"... An algorithm is described for solving largescale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The core of the algorithm is a "polyhedral" cuttingplane procedure that exploits a subset of the system of linear inequalities defining the convex hull of the in ..."
Abstract

Cited by 205 (7 self)
 Add to MetaCart
An algorithm is described for solving largescale instances of the Symmetric Traveling Salesman Problem (STSP) to optimality. The core of the algorithm is a "polyhedral" cuttingplane procedure that exploits a subset of the system of linear inequalities defining the convex hull
MultipleValued Problem Solvers – Comparison of Several Approaches
"... Abstract—Solving a multiplevalued problem means to assign values to a given set of multiplevalued variables such that certain conditions are satisfied. The solution of a multiplevalued problem is a subset of vk vvalued tuples of the length k, where k is the number of variables and v is the numbe ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract—Solving a multiplevalued problem means to assign values to a given set of multiplevalued variables such that certain conditions are satisfied. The solution of a multiplevalued problem is a subset of vk vvalued tuples of the length k, where k is the number of variables and v
A Sparse Signal Reconstruction Perspective for Source Localization With Sensor Arrays
, 2005
"... We present a source localization method based on a sparse representation of sensor measurements with an overcomplete basis composed of samples from the array manifold. We enforce sparsity by imposing penalties based on the 1norm. A number of recent theoretical results on sparsifying properties of ..."
Abstract

Cited by 231 (6 self)
 Add to MetaCart
of 1 penalties justify this choice. Explicitly enforcing the sparsity of the representation is motivated by a desire to obtain a sharp estimate of the spatial spectrum that exhibits superresolution. We propose to use the singular value decomposition (SVD) of the data matrix to summarize multiple time
Results 1  10
of
496,591