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 39 for “"Quad-tree"”.

  1. Quad-tree motion models for scalable video coding applications

    … between frames by a single model and therefore a quad-tree structure is employed where smaller, variable size regions or blocks are allowed to take on separate motion models. Quad-tree structures however suffer from two fundamental forms of redundancy. First, quad-trees exhibit structural …

    unsw Repository record for Quad-tree motion models for scalable video coding applications (opens in a new tab)

  2. Two new parallel processors for real time classification of 3-D moving objects and quad tree generation

    … of real time image compaction is addressed. The quad tree data structure is described. Based on this structure, a parallel processor with a tree architecture is developed which is independent of the data entry process, i.e., data may be entered pixel by pixel or all at once. The hardware consists …

    portland-state Repository record for Two new parallel processors for real time classification of 3-D moving objects and quad tree generation (opens in a new tab)

  3. Binary shape coding and lossless image compression

    … a new approach to binary shape coding based on quad-tree block-based CAE coding. The original image is decomposed into different new images with different resolution. Coding is then performed on 3-symbol quad-tree blocks instead of the original binary pixels. The quad-tree structure can remove …

    unsw Repository record for Binary shape coding and lossless image compression (opens in a new tab)

  4. Image compression scheme for network transmission

    … A layered image compression scheme based on the quad tree decomposition technique (QTD) is developed. The image is decomposed into three layers, where layers are added to a base image to incrementally improve the quality of the reconstructed image. The performance of the QTD is enhanced by adding …

    nps Repository record for Image compression scheme for network transmission (opens in a new tab)

  5. Performance Analysis of a Binary-Tree-Based Algorithm for Computing Spatial Distance Histograms

    … called density map which is implemented via a quad tree index. An algorithm having density maps implemented via binary tree is proposed in this thesis. After carrying out many experiments and analysis of the data, we figure out that although the binary tree approach seems efficient in earlier …

    usf Repository record for Performance Analysis of a Binary-Tree-Based Algorithm for Computing Spatial Distance Histograms (opens in a new tab)

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

    … method, the process of SDH query takes quadratic time. Recently, a novel algorithm has been proposed to compute the SDH based on the concept of density map (DM), and it reduces the running time to ϴ(N(3/2)) for two-dimensional data and ϴ (N(5/3) ) for three-dimensional data, …

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

  7. 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)

  8. HEVC Fast CU Decision for Intra-Prediction by CNN

    … top depth 0 to bottom depth 3 on all possible quad-tree structures. Therefore this algorithm is considered to be very time consuming and computational expensive. In my research, I have compared two different methods of reducing the computational complexity for HEVC by using Neural Networks, and …

    tamu Repository record for HEVC Fast CU Decision for Intra-Prediction by CNN (opens in a new tab)

  9. Efficient Path Rendering For Low-End GPUs

    … to dynamic scenarios, we suggest using a linear quad tree or AABB tree instead of a uniform grid.

    chalmers Repository record for Efficient Path Rendering For Low-End GPUs (opens in a new tab)

  10. Collaborative Logistics in Vehicle Routing

    … for feasibility checks. The second phase uses a quad-tree search to locate facilities. Quad-tree search methods are popular in computer graphics, and for grid generation in fluid simulation. These methods are known to be efficient in partitioning a two-dimensional space for storage and …

    waterloo Repository record for Collaborative Logistics in Vehicle Routing (opens in a new tab)

  11. Optimal Block Encoding and Optimal Entropy for Lossless Image Compression

    … thesis, a novel approach is designed using a quad-tree stack structure to encode the image to determine the optimal block size at the optimal and effective entropy in the lossless image compression method. Proof is given through encoding of the predictor and randomly constructed planes. There …

    portland-state Repository record for Optimal Block Encoding and Optimal Entropy for Lossless Image Compression (opens in a new tab)

  12. Reducing HEVC Inter-Prediction Complexity: An Attention-Based Network

    … partly comes from the usage of the deeper coding quad-tree. The deeper coding quadtree provides HEVC the ability to encode higher resolution video and reduce more bit-rates, however, it significantly increases the time complexity at the meanwhile, since HEVC searches for best coding tree depth by …

    tamu Repository record for Reducing HEVC Inter-Prediction Complexity: An Attention-Based Network (opens in a new tab)

  13. Efficient Intersection of Terrain Geometry in Real-Time Applications

    … number of calculations required by utilizing a quadtree data structure to search the height map and discard triangles that do not lie inside quadtree leaf nodes along the path of the ray. This paper introduces an extension of this optimization by projecting the line through quad tree leaf nodes …

    chalmers Repository record for Efficient Intersection of Terrain Geometry in Real-Time Applications (opens in a new tab)

  14. X3D-Earth full globe coverage utilizing multiple datasets

    … terrain parsing software, creating the X3D-Earth quad-tree tiles into multiple level-of-detail (LOD) file archives. Finally, these pyramidal, locale scenes are grouped and connected to form an overall X3D-Earth globe. Preprocessing, processing and data storage are performed with the NPS Hamming …

    nps Repository record for X3D-Earth full globe coverage utilizing multiple datasets (opens in a new tab)

  15. A neutral network approach to automated classification of cracks in images of highway pavement using vectorized data

    … broken into smaller blocks, forming a quad-tree type structure. Each block in the image tree was then classified as to the major distress prevalent.</p> <p>This technique should allow for easier measurement of extent and severity. Also it allows records to be kept on individual pieces …

    ut-knoxville Repository record for A neutral network approach to automated classification of cracks in images of highway pavement using vectorized data (opens in a new tab)

  16. Integrating CAD Geometry and Scaled Boundary Finite Element Analysis

    … a mesh of scaled boundary finite elements. A quad-tree based mesh generation algorithm is developed. High quality mesh will be generated with the help of the algorithm and the computational cost will also be improved due to the utilization of the patterns in the quad-tree. Furthermore, no …

    unsw Repository record for Integrating CAD Geometry and Scaled Boundary Finite Element Analysis (opens in a new tab)

  17. Automated boundary detection of echocardiograms

    … Contour Following Algorithm and a variation of a QUAD-TREE/Pyramid Resolution data structure. Morphological operations of erosion and dilation were applied to give the closing effect necessary in handling boundary dropouts found in some echo images. An effort has been made to utilize the …

    rit Repository record for Automated boundary detection of echocardiograms (opens in a new tab)

  18. Reducing Time for Rate-Distortion Optimization in HEVC Using Attention Mechanism

    … standard. HEVC similar to AVC uses a recursive quad-tree-based algorithm on its Coding Tree Unit(CTU) to partition it into multiple Coding blocks(CB) for its encoding, where it uses a brute-force approach to find the best possible partition of CTU as a part of the Rate-Distortion …

    tamu Repository record for Reducing Time for Rate-Distortion Optimization in HEVC Using Attention Mechanism (opens in a new tab)

Page 1 of 2