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 27 for “"k-d tree"”.

  1. Sledování paprsku pomocí k-D tree

    Tato práce se zabývá metodami sledování paprsku a jejich akcelerací pomocí k-D stromu. Poskytuje částečný rozbor a přehled algoritmů od klasického střílení paprsku k rekurzivnímu přístupu až k distribuovanému sledování paprsku. Věnuje se rozboru struktury BSP stromu a dále jeho podtřídy k-D stromu, …

    brno-tech Repository record for Sledování paprsku pomocí k-D tree (opens in a new tab)

  2. Sledování paprsku pomocí k-D tree

    Práce se zabývá návrhem a implementací programu pro syntézu obrazu pomocí sledování parsků. Cílem je ověření vlastností optimalizační metody dělení prostoru pomocí KD stromu. Práce porovnává metody prostorového mediánu, objektového mediánu a cenového modelu použité pro určování dělících rovin při …

    brno-tech Repository record for Sledování paprsku pomocí k-D tree (opens in a new tab)

  3. Multicore construction of k-d trees with applications in graphics and vision

    The k-d tree is widely used in graphics and vision applications for accelerating retrieval from large sets of geometric entities in R^k. Despite speeding up an otherwise brute force search, the time to construct and traverse the k-d tree remain a bottleneck in many applications. Increasing …

    uiuc Repository record for Multicore construction of k-d trees with applications in graphics and vision (opens in a new tab)

  4. A Comparative Study of Dual-tree Algorithms for Computing Spatial Distance Histogram

    … DMs that can be plugged in for computation: Quad-tree (Oct-tree for three-dimensional data) and k-d tree data structure. In this thesis paper, by using the geometric method, we prove the unre- solvable ratios on the k-d tree. Further, we analyze and compare the difference in the performance in …

    usf Repository record for A Comparative Study of Dual-tree Algorithms for Computing Spatial Distance Histogram (opens in a new tab)

  5. An Investigation of Some New Tree Structures

    <p>A study of the tree structures developed by Finkel and Bentley (3 & 4) was done and the results are documented in this report. These tree structures, i.e. the quad tree and the k-d tree, were especially developed for associative retrieval. A comparison of the above tree structures and the well …

    mcmaster Repository record for An Investigation of Some New Tree Structures (opens in a new tab)

  6. Novel Gamma-Ray Imaging and Detection Methods

    … gamma-ray position estimation method called k-d tree search was explored. With the binary tree data structure and rules to prune branches while searching, the k-d tree search method can estimate interaction position rapidly, and 24 is also able to do position estimation accurately for detectors …

    arizona-thes Repository record for Novel Gamma-Ray Imaging and Detection Methods (opens in a new tab)

  7. A nearest neighbor search method suitable for low dimensions and location-dependent spatial queries in mobile computing

    … the grid space partitioning and the compact trie tree structure. A detailed implementation based on the Best-First-Nearest-Neighbor-Search scheme is presented and illustrated with sample data. Then k-nearest-neighbor search performance comparison is carried out among the proposed …

    lethbridge Repository record for A nearest neighbor search method suitable for low dimensions and location-dependent spatial queries in mobile computing (opens in a new tab)

  8. Searching nearest neighbor in high dimensional space

    … that our database organization is faster than R-tree [23], K-d tree [25] and the searching algorithm is also very efficient.

    ttu Repository record for Searching nearest neighbor in high dimensional space (opens in a new tab)

  9. E L U M I A ray tracer for rendering photo-realistic images

    … is parallelized and accelerated with a K-D tree, as well as optimized with shadow caches and a cache aware traversal pattern. To further improve the rendering speed, certain parts can be accelerated using the GPU. ELUMI is also capable of further enhancing the image quality by using …

    chalmers Repository record for E L U M I A ray tracer for rendering photo-realistic images (opens in a new tab)

  10. Accelerating Ray Casting Using Culling Techniques to Optimize K-D Trees

    … developed. One such development is the use of tree-like data structures to partition space for quick traversal when finding intersection points between rays and primitives. Even with this technique, ray-primitive intersection for large datasets is still the bottleneck for ray tracing. This …

    calpoly Repository record for Accelerating Ray Casting Using Culling Techniques to Optimize K-D Trees (opens in a new tab)

  11. Compact 3D Representations

    … The first is the multiresolution sphere-packing tree (MSP-tree). The MSP-tree is a multiresolution 3D hierarchy on regular grids based on sphere-packing arrangements. The grids of the MSP-tree compactly represent underlying point-sampled data by using more efficient grids than existing methods …

    queens Repository record for Compact 3D Representations (opens in a new tab)

  12. Classification using residual vector quantization

    … classifier unfeasibly costly. Although, the k-d tree structure offers a far more efficient implementation of 1-NN search, however, the cost of storing the data points can become prohibitive, especially in higher dimensionality. RVQ also offers a nice solution to a cost-effective implementation of …

    gatech Repository record for Classification using residual vector quantization (opens in a new tab)

  13. Fast and Scalable Structure-from-Motion for High-precision Mobile Augmented Reality Systems

    … authoring from a single 2D image, 3) Cached k-d tree generation for fast direct 2D-to-3D matching, 4) double-stage matching algorithm with a single indexed k-d tree, and 5) K-means Clustering of 3D physical models with geo-information. After discussing each solution with technical details, the …

    vt Repository record for Fast and Scalable Structure-from-Motion for High-precision Mobile Augmented Reality Systems (opens in a new tab)

  14. Endangered Privacy: Identification of VPN-protected Video Streams At Scale

    … videos. By leveraging a combination of k-d tree search and time series methods, our protocol-agnostic framework surpasses all existing methods and achieves over 99.5% accuracy in real-time video stream recognition, even in noisy environments. We complement our work with an analysis of the …

    chalmers Repository record for Endangered Privacy: Identification of VPN-protected Video Streams At Scale (opens in a new tab)

  15. Design and implementation of a content-based video retrieval system

    … data points. Then we choose adaptive bucket k-d tree to index the PCA-transformed data points. For the semantic annotation of video data, we propose a predicate-based annotation which has several advantage over the existing key word based annotation, including expressiveness and the ability to …

    ubc Repository record for Design and implementation of a content-based video retrieval system (opens in a new tab) Download PDF for Design and implementation of a content-based video retrieval system (opens in a new tab)

  16. Knowledge-driven multidimensional indexing for content-based information retrieval

    … the Entropy Balanced Statistical (EBS) k-d tree and the Entropy Balanced Bitmap (EBB) tree for knowledge-driven indexing of media. These indexing structures exploit domain knowledge present in a media database through analysis of the statistical entropy of the database with balanced entropy …

    missouri Repository record for Knowledge-driven multidimensional indexing for content-based information retrieval (opens in a new tab)

  17. Text-based document geolocation and its application to the digital humanities

    … I develop use both uniform and adaptive (k-d tree) grids over the Earth’s surface, culminating in a hierarchical logistic-regression-based technique that achieves state of the art results on well-known corpora (Twitter user feeds, Wikipedia articles and Flickr image tags). In the second part …

    texas Repository record for Text-based document geolocation and its application to the digital humanities (opens in a new tab)

  18. Multi-scale modelling of ice-structure interactions

    … search, region partitioning algorithm, K-d tree and R-tree algorithms) were tested and implemented together with parallelization of most time consuming parts of code. Finally, several numerical studies were considered in order to demonstrate ice-structure interaction via peridynamic …

    strathclyde Repository record for Multi-scale modelling of ice-structure interactions (opens in a new tab)

  19. A geometric hashing technique for star pattern recognition

    … a star catalog and the result is stored in a k-d tree. When an image of a star field is obtained, observed star quads are created and the index is searched for the best match using a nearest neighbor algorithm. A verification process is used to improve robustness. This thesis gives an extensive …

    wvu Repository record for A geometric hashing technique for star pattern recognition (opens in a new tab)

  20. Statistical Analysis of Biological Interactions from Homologous Proteins

    … was used for each cluster. Then a modified k-d tree algorithm was applied to facilitate the computation of identifying interfaces from crystals. The interface similarity functions were derived from Gaussian distributions fit to the data. Hierarchical clustering was used to cluster interfaces to …

    temple Repository record for Statistical Analysis of Biological Interactions from Homologous Proteins (opens in a new tab)

Page 1 of 2