Results 31 to 40 of about 52,311 (259)
A Very Compact AES-SPIHT Selective Encryption Computer Architecture Design with Improved S-Box
The “S-box” algorithm is a key component in the Advanced Encryption Standard (AES) due to its nonlinear property. Various implementation approaches have been researched and discussed meeting stringent application goals (such as low power, high throughput,
Jia Hao Kong +2 more
doaj +1 more source
Adaptive two-step method for providing the desired visual quality for SPIHT
Lossy compression has been widely used in various applications due to its variable compression ratio. However, distortions are introduced unavoidably, and this decreases the image quality.
Fangfang Li
doaj +1 more source
Squarepants in a Tree: Sum of Subtree Clustering and Hyperbolic Pants Decomposition
We provide efficient constant factor approximation algorithms for the problems of finding a hierarchical clustering of a point set in any metric space, minimizing the sum of minimimum spanning tree lengths within each cluster, and in the hyperbolic or ...
Alstrup S. +5 more
core +1 more source
In this paper, a multi-wavelet transform with decimated frequency bands is proposed to be used in the Set Partitioning in Hierarchical Trees (SPIHT) algorithm to improve fingerprint image compression.
N R Rema, P Mythili
doaj +1 more source
Multidimensional Range Queries on Modern Hardware
Range queries over multidimensional data are an important part of database workloads in many applications. Their execution may be accelerated by using multidimensional index structures (MDIS), such as kd-trees or R-trees.
Leser, Ulf +2 more
core +1 more source
Joint Image Compression and Encryption Using IWT with SPIHT, Kd-Tree and Chaotic Maps
Confidentiality and efficient bandwidth utilization require a combination of compression and encryption of digital images. In this paper, a new method for joint image compression and encryption based on set partitioning in hierarchical trees (SPIHT) with
Nasrullah +5 more
doaj +1 more source
Adaptive Hierarchical Clustering Using Ordinal Queries
In many applications of clustering (for example, ontologies or clusterings of animal or plant species), hierarchical clusterings are more descriptive than a flat clustering.
Emamjomeh-Zadeh, Ehsan, Kempe, David
core +1 more source
Method for pre-processing of level crossing image [PDF]
Actuality of problem in the improvement of transport safety at level crossings (LC) is caused by increasing the number of vehicles and reducing discipline of vehicle drivers.
Roman RYBALKA, Konstantin HONCHAROV
doaj
Multiresolution source coding using entropy constrained dithered scalar quantization [PDF]
In this paper, we build multiresolution source codes using entropy constrained dithered scalar quantizers. We demonstrate that for n-dimensional random vectors, dithering followed by uniform scalar quantization and then by entropy coding achieves ...
Effros, Michelle +2 more
core
Nearest neighbor searching of large databases in high-dimensional spaces is inherently difficult due to the curse of dimensionality. A flavor of approximation is, therefore, necessary to practically solve the problem of nearest neighbor search.
Arora, Akhil +3 more
core +1 more source

