Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 42 for “"kd-tree"”.
-
An integrated KD-Tree cutter size determination method for 3-Axis finish machining of sculptured surface parts
In this research, an integrated KD-Tree cutter size search model is proposed to quickly determine the largest cutters and their accessible surface regions for 3-axis finish machining, without gouging and interference. By using these cutters, the highest material removal rate can be achieved, while …
-
A comparative analysis of multi-dimensional indexing structures for "eigenimages"
… multi-dimensional indexing structures (quad trees, KD-trees, R-trees, gridfile, and multipaging), selecting three of them (bucket adaptive KD-tree, gridfile, R-tree) for further empirical comparisons. Tests show that the bucket adaptive KD-tree uses the least storage and peforms the best …
-
Efficient Rendering of Scenes with Dynamic Lighting Using a Photons Queue and Incremental Update Algorithm
… the re-construction at each rendered frame ofa kd-tree for the photons. We developed a novel approach based on the idea that storing the photons data along with the kd-tree leaf nodes data and implemented new incremental update scheme to improve the performance for dynamic lighting. The …
-
MASSIVELY PARALLEL ALGORITHMS FOR POINT CLOUD BASED OBJECT RECOGNITION ON HETEROGENEOUS ARCHITECTURE
… parallel construction of k-dimensional tree (KD-tree) and the forest of KD-trees for descriptor indexing, parallel approximate nearest neighbor search (ANNS) and buffered ANNS (BANNS) on the KD-tree and the forest of KD-trees for descriptor matching. The results show that the proposed …
-
Automatické třídění fotografií podle obsahu
… k-means, mapování na slova přes strukturu kd-tree. Vytváří se vlastní hodnocení na základě kterého se klasifikuje. Je zde popsáno jak byly jednotlivé kroky implementovány s pomocí knihoven OpenCV a Qt. A taktéž jsou ukázány výsledky pro různá nastavení běhu aplikace a snahy o zlepšení …
-
Point cloud classification for water surface identification in Lidar datasets
… of a Gaussian kernel. In computer science, a kd-tree is a space-partitioning data structure used for organizing points in a k dimensional space. The 3D point cloud is segmented by using a kd-tree and following this segmentation the neighborhood of each point is identified and Laplacian …
-
Large Scale Multi-Objective Optimization for Dynamic Airspace Sectorization
… I also propose three additional models using KD-Tree, Support Plane Bisection (SPBM) and Constrained Voronoi Diagrams (CVDM) in 3D, to partition the airspace to satisfy the convexity constraint and overcome high computational cost inherent in agent-based approaches. I then look into optimizing …
-
Example-Based Fluid Simulation
… approach, and construct our data structure as a kd-tree by treating each fragment as a point in this subspace. Our method has been implemented in synthesizing both two-dimensional (2D) and three-dimensional (3D) fluid’s velocity fields.
-
Multidimensional query based routing for massively multiuser virtual environments
… a new architecture based on Z-order curve and KD-tree that can efficiently handle update message distribution to interested entities' locations in three-dimensional (3D) virtual environments where locations are naturally described in terms of 3D coordinates. We also aim to minimize the number …
-
Image search with LSH and shape context
… the same original image from a large database. Kd-tree have a good performance to address this problem when data dimension is low, but not good enough for high dimension. In our paper, we present locality sensitive hashing for image search, it is a randomized algorithms, which does not guarantee …
-
Implementing approximate voronoi diagrams for approximate nearest neighbor searching
… ακρίβεια σε σχέση με την καλυτερη υλοποίηση KD tree σε μικρές διαστάσεις.
-
Astrometry.net: Automatic Recognition and Calibration of Astronomical Images
… by using a new fast and space-efficient kd-tree implementation. The Astrometry.net system is available via a web interface, and the software is released under an open-source license. It is being used by hundreds of individual astronomers and several large-scale projects, so we have at …
-
Fast and Efficient Classification, Tracking, and Simulation in Wireless Sensor Networks
… of a Bayesian classifier and a condensed kd-tree classifier for identifying events of interest on resource-lean embedded sensors. The first approach uses preprocessed sensor readings to derive a multi-dimensional Bayesian classifier used to classify sensor data in real-time. The second …
-
Software Simulation of 5-Axis CNC Milling using Multidirectional Heightmaps
… precisely, a multidirectional heightmap is a kD-tree with the property that all cells are functional: each cell contains a heightmap that represents a functional portion of the stock. To improve accuracy, each regular heightmap can be replaced by a 3-Way Heightmap, a new type of heightmap that …
-
Efficient Algorithms for Clustering and Interpolation of Large Spatial Data Sets
… on the ISODATA clustering algorithm employs the kd-tree data structure and the filtering algorithm to speed up distance and nearest neighbor calculations. In the case of kriging interpolation, I applied techniques from scientific computing including iterative methods, tapering, fast multipole …
-
Reinforcement learning using the game of soccer
… by recursively subdividing each volume with a KD-tree. Identifying if an abstract state should be split, which dimension should be split, and where that dimension should be split is done by collecting statistics on the previous effects of actions. Continuous actions are dealt with by giving …
-
Deep Learning Approaches for Robust Image-Based Localisation of Mobile Platforms
… the CVST with a particle filter and a 3D KD-tree data structure to achieve near-real time performance. Further improvement in robustness is achieved through a mathematical formulation of the particle filter likelihood that incorporates knowledge of the road network, thereby improving the …
-
LiDAR Based Perception System: Pioneer Technology for Safety Driving
… Nearest Neighbor (RBNN) method on the static Kd-tree. To identify the object, a supervised learning approach based on our LiDAR sensor for vehicle type classification is proposed. The proposed classification algorithm is used to classify the object into four different types: ``Sedan'', …
-
Ευφυή συστήματα αναγνώρισης εικόνας με τη χρήση αμετάβλητων χαρακτηριστικών
… are tested and a data structure based on a KD-Tree is employed, as the most efficient. Matching results are subsequently tested for geometrical consistency, using a generalised Hough transform (GHT) for feature clustering and RANSAC method for query and model images homography estimation. In …
-
Query Authentication and processing on outsourced databases
… of the approach are studied :( 1) Verifiable KD-tree (VKDtree) that is based on space partitioning, and (2)Verifiable R-tree (VR-tree) that is based on data partitioning. The schemes are evaluated on window queries, and results show that VR-tree is highly precise, meaning that few data points …
Page 1 of 3