Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,442
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 point-cloud 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 point-cloud 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
Illusion and well-being: A social psychological perspective on mental health.
- Psychological Bulletin,
, 1988
"... Many prominent theorists have argued that accurate perceptions of the self, the world, and the future are essential for mental health. Yet considerable research evidence suggests that overly positive selfevaluations, exaggerated perceptions of control or mastery, and unrealistic optimism are charac ..."
Abstract
-
Cited by 988 (20 self)
- Add to MetaCart
are characteristic of normal human thought. Moreover, these illusions appear to promote other criteria of mental health, including the ability to care about others, the ability to be happy or contented, and the ability to engage in productive and creative work. These strategies may succeed, in large part, because
Surface Reconstruction by Voronoi Filtering
- Discrete and Computational Geometry
, 1998
"... We give a simple combinatorial algorithm that computes a piecewise-linear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled ..."
Abstract
-
Cited by 405 (11 self)
- Add to MetaCart
We give a simple combinatorial algorithm that computes a piecewise-linear approximation of a smooth surface from a finite set of sample points. The algorithm uses Voronoi vertices to remove triangles from the Delaunay triangulation. We prove the algorithm correct by showing that for densely sampled
Defining Point-Set Surfaces
, 2005
"... The MLS surface [Levin 2003], used for modeling and rendering with point clouds, was originally defined algorithmically as the output of a particular meshless construction. We give a new explicit definition in terms of the critical points of an energy function on lines determined by a vector field. ..."
Abstract
-
Cited by 180 (2 self)
- Add to MetaCart
. This definition reveals connections to research in computer vision and computational topology. Variants of the MLS surface can be created by varying the vector field and the energy function. As an example, we define a similar surface determined by a cloud of surfels (points equipped with normals), rather than
Pointshop 3D: An Interactive System for Point-Based Surface Editing
, 2002
"... We present a system for interactive shape and appearance editing of 3D point-sampled geometry. By generalizing conventional 2D pixel editors, our system supports a great variety of different interaction techniques to alter shape and appearance of 3D point models, including cleaning, texturing, sculp ..."
Abstract
-
Cited by 171 (17 self)
- Add to MetaCart
, sculpting, carving, filtering, and resampling. One key ingredient of our framework is a novel concept for interactive point cloud parameterization allowing for distortion minimal and aliasing-free texture mapping. A second one is a dynamic, adaptive resampling method which builds upon a continuous
Learning Invariant Features through Topographic Filter Maps
"... Several recently-proposed architectures for highperformance object recognition are composed of two main stages: a feature extraction stage that extracts locallyinvariant feature vectors from regularly spaced image patches, and a somewhat generic supervised classifier. The first stage is often compos ..."
Abstract
-
Cited by 119 (20 self)
- Add to MetaCart
composed of three main modules: (1) a bank of filters (often oriented edge detectors); (2) a non-linear transform, such as a point-wise squashing functions, quantization, or normalization; (3) a spatial pooling operation which combines the outputs of similar filters over neighboring regions. We propose a
Ensemble Kalman Filter Assimilation of Doppler Radar Data with a Compressible Nonhydrostatic Model: OSS Experiments
, 2004
"... A Doppler radar data assimilation system is developed based on ensemble Kalman filter (EnKF) method and tested with simulated radar data from a supercell storm. As a first implementation, we assume the forward models are perfect and radar data are sampled at the analysis grid points. A general pur ..."
Abstract
-
Cited by 130 (79 self)
- Add to MetaCart
A Doppler radar data assimilation system is developed based on ensemble Kalman filter (EnKF) method and tested with simulated radar data from a supercell storm. As a first implementation, we assume the forward models are perfect and radar data are sampled at the analysis grid points. A general
Difference of normals as a multi-scale operator in unorganized point clouds
- In Proc. 3DIMPVT
, 2012
"... A novel multi-scale operator for unorganized 3D point clouds is introduced. The Difference of Normals (DoN) pro-vides a computationally efficient, multi-scale approach to processing large unorganized 3D point clouds. The appli-cation of DoN in the multi-scale filtering of two different real-world ou ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
A novel multi-scale operator for unorganized 3D point clouds is introduced. The Difference of Normals (DoN) pro-vides a computationally efficient, multi-scale approach to processing large unorganized 3D point clouds. The appli-cation of DoN in the multi-scale filtering of two different real
Spectral Processing of Point-Sampled Geometry
, 2001
"... We present a new framework for processing point-sampled objects using spectral methods. By establishing a concept of local frequencies on geometry, we introduce a versatile spectral representation that provides a rich repository of signal processing algorithms. Based on an adaptive tesselation of th ..."
Abstract
-
Cited by 98 (10 self)
- Add to MetaCart
error control. Our algorithms operate directly on points and normals, requiring no vertex connectivity information. They are computationally efficient, robust and amenable to hardware acceleration. We demonstrate the performance of our framework on a selection of example applications including noise
Effect of temporal envelope smearing on speech reception.
- International Journal of Bioelectromagnetism
, 2011
"... The effect of smearing the temporal envelope on the speech-reception threshold (SRT) for sentences in noise and on phoneme identification was investigated for normal-hearing listeners. For this purpose, the speech signal was split up into a series of frequency bands (width of The ear's resolut ..."
Abstract
-
Cited by 145 (0 self)
- Add to MetaCart
the original band (fine structure) by the ratio of the filtered envelope and the original envelope at each corresponding point in time. As a result of the envelope filtering (especially at low cutoff frequencies), parts of the original band signal having low amplitude are amplified in the modified band signal
Results 1 - 10
of
1,442
