Efficient intra- and inter-night linking of asteroid detections using kd-trees
نویسندگان
چکیده
منابع مشابه
Efficient Representation and Extraction of 2-Manifold Isosurfaces Using kd-Trees
In this paper, we propose the utilization of a kd-tree based hierarchy as an implicit object representation. Compared to an octree, the kd-tree based hierarchy is superior in terms of adaptation to the object surface. In consequence, we obtain considerably more compact implicit representations especially in case of thin object structures. We describe a new isosurface extraction algorithm for th...
متن کاملNearest Neighbor Search using Kd-trees
We suggest a simple modification to the kd-tree search algorithm for nearest neighbor search resulting in an improved performance. The Kd-tree data structure seems to work well in finding nearest neighbors in low dimensions but its performance degrades even if the number of dimensions increases to more than three. Since the exact nearest neighbor search problem suffers from the curse of dimensi...
متن کاملFast Gaussian Process Regression using KD-Trees
The computation required for Gaussian process regression with n training examples is about O(n) during training and O(n) for each prediction. This makes Gaussian process regression too slow for large datasets. In this paper, we present a fast approximation method, based on kd-trees, that significantly reduces both the prediction and the training times of Gaussian process regression.
متن کاملEfficient Encryption of Intra and Inter Frames in MPEG Video
The growth in multimedia based Internet applications can be seen in the quantity of growth in video telephony, video on demand, media server etc. With the current cyber threats, sensitive video need to be protected before transmission. Streaming video applications requires high security as well as high computational performance. The need for video data protection is on rise hence encryption of ...
متن کاملKinetic Medians and kd-Trees
We propose algorithms for maintaining two variants of kd-trees of a set of moving points in the plane. A pseudo kd-tree allows the number of points stored in the two children to differ. An overlapping kd-tree allows the bounding boxes of two children to overlap. We show that both of them support range search operations in O(n) time, where 2 only depends on the approximation precision. When the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Icarus
سال: 2007
ISSN: 0019-1035
DOI: 10.1016/j.icarus.2007.01.008