Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
3,707
Live dense reconstruction with a single moving camera
- IEEE Conference on Computer Vision and pattern Recognition
, 2010
"... We present a method which enables rapid and dense reconstruction of scenes browsed by a single live camera. We take point-based real-time structure from motion (SFM) as our starting point, generating accurate 3D camera pose estimates and a sparse point cloud. Our main novel contribution is to use an ..."
Abstract
-
Cited by 107 (5 self)
- Add to MetaCart
We present a method which enables rapid and dense reconstruction of scenes browsed by a single live camera. We take point-based real-time structure from motion (SFM) as our starting point, generating accurate 3D camera pose estimates and a sparse point cloud. Our main novel contribution is to use
Measurement and Analysis of Online Social Networks
- In Proceedings of the 5th ACM/USENIX Internet Measurement Conference (IMC’07
, 2007
"... Online social networking sites like Orkut, YouTube, and Flickr are among the most popular sites on the Internet. Users of these sites form a social network, which provides a powerful means of sharing, organizing, and finding content and contacts. The popularity of these sites provides an opportunity ..."
Abstract
-
Cited by 698 (14 self)
- Add to MetaCart
of multiple online social networks. We examine data gathered from four popular online social networks: Flickr, YouTube, LiveJournal, and Orkut. We crawled the publicly accessible user links on each site, obtaining a large portion of each social network’s graph. Our data set contains over 11.3 million users
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
Mesh Optimization
, 1993
"... We present a method for solving the following problem: Given a set of data points scattered in three dimensions and an initial triangular mesh wH, produce a mesh w, of the same topological type as wH, that fits the data well and has a small number of vertices. Our approach is to minimize an energy f ..."
Abstract
-
Cited by 392 (8 self)
- Add to MetaCart
function that explicitly models the competing desires of conciseness of representation and fidelity to the data. We show that mesh optimization can be effectively used in at least two applications: surface reconstruction from unorganized points, and mesh simplification (the reduction of the number
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
, 2003
"... In this paper we present PEAS, a robust energyconserving protocol that can build long-lived, resilient sensor networks using a very large number of small sensors with short battery lifetime. PEAS extends the network lifetime by maintaining a necessary set of working nodes and turning o redundant one ..."
Abstract
-
Cited by 349 (5 self)
- Add to MetaCart
In this paper we present PEAS, a robust energyconserving protocol that can build long-lived, resilient sensor networks using a very large number of small sensors with short battery lifetime. PEAS extends the network lifetime by maintaining a necessary set of working nodes and turning o redundant
Stories of experience and narrative inquiry
- Educational Researcher
, 1990
"... Although narrative inquiry has a long intellectual history both in and out of education, it is increasingly used in studies of educational experience. One theory in educational research holds that humans are storytelling organisms who, individually and socially, lead storied lives. Thus, the study o ..."
Abstract
-
Cited by 368 (2 self)
- Add to MetaCart
and other's stories. In this paper we briefly survey forms of nar-rative inquiry in educational studies and outline certain criteria, methods, and writing forms, which we describe in terms of begin-ning the story, living the story, and selecting stories to construct and reconstruct narrative plots
KinectFusion: Real-Time Dense Surface Mapping and Tracking
"... We present a system for accurate real-time mapping of complex and arbitrary indoor scenes in variable lighting conditions, using only a moving low-cost depth camera and commodity graphics hardware. We fuse all of the depth data streamed from a Kinect sensor into a single global implicit surface mo ..."
Abstract
-
Cited by 280 (25 self)
- Add to MetaCart
model of the observed scene in real-time. The current sensor pose is simultaneously obtained by tracking the live depth frame relative to the global model using a coarse-to-fine iterative closest point (ICP) algorithm, which uses all of the observed depth data available. We demonstrate the advantages
Incremental mapping of large cyclic environments
- In Computational Intelligence in Robotics and Automation
, 1999
"... Mobile robots can use geometric or topological maps of their environment to navigate reliably. Automatic creation of such maps is still an unrealized goal, especially in environments that have large cyclical structures. Drawing on recent techniques of global registration and correlation, we present ..."
Abstract
-
Cited by 332 (19 self)
- Add to MetaCart
a method, called Local Registration and Global Correlation (LRGC), for reliable reconstruction of consistent global maps from dense range data. The method is attractive because it is incremental, producing an updated map with every new sensor input; and runs in constant time independent of the size
A Simple Algorithm for Homeomorphic Surface Reconstruction
- International Journal of Computational Geometry and Applications
, 2000
"... The problem of computing a piecewise linear approximation to a surface from a set of sample points is important in solid modeling, computer graphics and computer vision. A recent algorithm [1] using the Voronoi diagram of the sample points gave a guarantee on the distance of the output surface from ..."
Abstract
-
Cited by 233 (29 self)
- Add to MetaCart
the original sampled surface assuming the sample was `suciently dense'. We give a similar algorithm, simplifying the computation and the proof of the geometric guarantee. In addition, we guarantee that our output surface is homeomorphic to the original surface; to our knowledge this is the rst
Nonuniform Sampling and Reconstruction in Shift-Invariant Spaces
, 2001
"... This article discusses modern techniques for nonuniform sampling and reconstruction of functions in shift-invariant spaces. It is a survey as well as a research paper and provides a unified framework for uniform and nonuniform sampling and reconstruction in shift-invariant spaces by bringing togeth ..."
Abstract
-
Cited by 218 (13 self)
- Add to MetaCart
of shift-invariant spaces. (b) The general theory works in arbitrary dimension and for a broad class of generators. (c) The reconstruction of a function from any sufficiently dense nonuniform sampling set is obtained by efficient iterative algorithms. These algorithms converge geometrically and are robust
Results 1 - 10
of
3,707
