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 26 for “"Hierarchical Trees"”.
-
In search of more stable hierarchical trees: devising new algorithms to improve upon the stability of neighbor joining
The standard method of constructing hierarchical trees – neighbour joining – while commonly used, has some major flaws. For most data sets not derived from a common descent process, it produces trees that are highly unstable. Adding or deleting a point can cause dramatic shifts in the tree …
-
Low bit-rate wavelet based video codec for internet applications
… performance of the 3D-Color Set Partitioning In Hierarchical Trees (3D-CSPIHT) scheme in the context of 3D wavelet based video coding. The 3D-CSPIHT exploits the correlation between temporal and spatial wavelet coefficients and the inter-dependency between luminance and chrominance components in …
-
Secure Wavelet-based Coding of Images, and Application to Privacy Protected Video Surveillance
… image coder, called Secure Set Partitioning in Hierarchical Trees (SecSPIHT), is proposed. It combines wavelet-based image coding (compression) with efficient encryption. The encryption is applied to a small number of selected bits in the code domain, to achieve complete confidentiality of all …
-
Uždengtų objektų atkirtimas /
… computation is performed on CPU or GPU, whether hierarchical trees are used, whether we compute and use results right now or use results from the previous frame, etc. This thesis proposes a new hybrid occlusion culling method, which combines both, CPU and GPU, and uses some information from the …
-
Image coding using wavelets, interval wavelets and multi- layered wedgelets
… of the wavelet-based color set partitioning in hierarchical trees (CSPIHT) algorithm for embedded color image encoding, which is able to achieve comparable or better performance than other state-of-the-art techniques. In finite signal analysis, we design several new interval wavelets that allow …
-
Wavelet packet decomposition for the SPIHT
… IMAGE CODING ALGORITHM SET PARTITIONING IN HIERARCHICAL TREES (SPIHT) AND THE WAVELET PACKET TRANSFORM (WPT), WHICH SIGNIFICANTLY IMPROVES THE CODING EFFICIENCY OF THE SPIHT ALGORITHM. </P><P>AIMING AT IMPROVING SPIHT BY MERELY A SLIGHT MODIFICATION, THE WPT AND THE SPIHT ARE MATCHED IN A …
-
Využití vlnkové transformace při kompresi videosignálu
… Jedná se o algoritmus SPIHT (Set Partitioning In Hierarchical Trees), určený pro kompresi statických obrazových dat. Algoritmus je modifikován na použití při kompresi videosignálu, který je charakteristický svou časovou redundancí. Protože algoritmus pracuje v prostorové i časové doméně, je …
-
Fast and efficient progressive image coding and transmission using wavelet decomposition
… by a new technique SPHIT (Set Partitioning in Hierarchical Trees). This technique works on the principles of partial ordering by magnitude utilizing a sci partitioning sorting algorithms, ordered bit plane transmission, and exploitation of selfsimilarity across different scales of an image …
-
Joint Source-Channel Coding for Image Transmission over Underlay Multichannel Cognitive Radio Networks
… access. The setup features a Set Partitioning in Hierarchical Trees (SPIHT) source encoder, and Reed-Solomon forward error correction channel coding, and uses their properties to devise an ULP framework that maximizes the quality of the received image.
-
Multiple symbol decoding of differential space-time codes
… through simulations. Set partitioning in hierarchical trees (SPIHT) coupled with rate compatible punctured convolution code (RCPC) and cyclic redundancy check (CRC) is employed as a generalized multiple description source coder with robustness to channel errors. We propose a serial …
-
Komprese a hodnocení kvality signálů EKG
… který využívá metodu „Set Partitioning in Hierarchical Trees (SPIHT)“. Postup testování zároveň slouží jako příklad, jak by měl vypadat standard hodnocení výkonu kompresních algoritmů. Dále bylo statisticky prokázáno, že existuje rozdíl mezi kompresí fyziologických a patologických signálů. …
-
Wavelets in Intelligent Transportation Systems: Data Compression and Incident Detection
… Zero Tree (EZW) encoding and Set Partitioning in Hierarchical Trees (SPIHT) algorithm for compression of the traffic data. In the second section of thesis, we focus on regression model for dichotomous data, i.e. logistic regression. This model is suitable when the outcome can takes only limited …
-
Continued investigations into the relationship between stability, hierarchical clustering algorithm and data set
… work, we established that the stability of trees produced by different methods generated variable stability results. A more comprehensive selection of data sets was tested to better understand the relationship between data and algorithm and the resultant stability, and additional clustering …
-
Computational Representation, Analysis and Verification of Requirements in Engineering Design and Systems Engineering
… Requirement Specification Documents (SyRSDs) as trees. Leaf nodes represent individual requirements, branch nodes reflect components and functions, and edges capture the decomposition hierarchy, mirroring the requirement allocation process. A dataset is introduced with three inter-convertible …
-
Low-complexity block dividing coding method for image compression using wavelets : a thesis presented in partial fulfillment of the requirements for the degree of Master of Engineering in Computer Systems Engineering at Massey University, Palmerston North, New Zealand
… Wavelet) and the SPIHT (Set Partitioning in Hierarchical Trees) have played an important role. The EZW algorithm was the first breakthrough in wavelet based image coding. The SPIHT algorithm achieves similar performance to EBCOT, but with fewer features. The other very important algorithm is …
-
Error control for scalable image and video coding
… tested on the wavelet-based Set Partitioning in Hierarchical Trees(SPIHT) scalable image coder. Performance gains and losses in lossy and lossless environments are studied for both the original coder and the error-controlled coders. The results show performance advantages of all three methods …
-
Significance linked connected component analysis plus
… of Wavelet Date (MEWD), and Set Partitioning in Hierarchical Trees (SPIHT). They exploit either inter-subband relation among zero wavelet coefficients or within-subband clustering. SLCCA, on the other hand, outperforms these three coders by exploring both the inter- subband coefficients relations …
-
Performance analysis from rate distortion theory of wavelet domain vector quantization encoding
… zerotree wavelet (EZW) and set partitioning in hierarchical trees (SPIHT) algorithms, several attempts have been made recently to adopt similar methodologies to discard insignificant coefficients (or zerotrees) prior to employing traditional vector partitioning. This latter approach to combine …
-
Programming framework supporting the rapid application development of highly-interactive, collaborative applications
… Property object. Properties are created in hierarchical trees to form the “scaffolding” for collaborative applications. Each Property governs a single value, or datum, and controls the access, replication, security, viewing, locking, and persistence of its value. Properties are layered with …
-
DESIGN PRINCIPLES FOR EFFICIENT TRANSPORT IN PHYSICAL NETWORKS
… to networks that combine features of both hierarchical trees and uniform meshes. This trade-off is mainly controlled by the vessels' metabolism. Surprisingly, by comparing the optimal architectures with experimentally measured networks in the rat mesentery we can extrapolate the oxygen …
Page 1 of 2