DNA Computing with Water Strider Based Vector Quantization for Data Storage Systems

The exponential growth of data necessitates an effective data storage scheme,which helps to effectively manage the large quantity of data.To accomplish this,Deoxyribonucleic Acid(DNA)digital data storage process can be employed,which encodes and decodes binary data to and from synthesized strands of DNA.Vector quantization(VQ)is a commonly employed scheme for image compression and the optimal codebook generation is an effective process to reach maximum compression efficiency.This article introduces a newDNAComputingwithWater StriderAlgorithm based Vector Quantization(DNAC-WSAVQ)technique for Data Storage Systems.The proposed DNAC-WSAVQ technique enables encoding data using DNA computing and then compresses it for effective data storage.Besides,the DNAC-WSAVQ model initially performsDNA encoding on the input images to generate a binary encoded form.In addition,aWater Strider algorithm with Linde-Buzo-Gray(WSA-LBG)model is applied for the compression process and thereby storage area can be considerably minimized.In order to generate optimal codebook for LBG,the WSA is applied to it.The performance validation of the DNAC-WSAVQ model is carried out and the results are inspected under several measures.The comparative study highlighted the improved outcomes of the DNAC-WSAVQ model over the existing methods.

Metaheuristics with Vector Quantization Enabled Codebook Compression Model for Secure Industrial Embedded Environment

At the present time,the Industrial Internet of Things(IIoT)has swiftly evolved and emerged,and picture data that is collected by terminal devices or IoT nodes are tied to the user's private data.The use of image sensors as an automa-tion tool for the IIoT is increasingly becoming more common.Due to the fact that this organisation transfers an enormous number of photographs at any one time,one of the most significant issues that it has is reducing the total quantity of data that is sent and,as a result,the available bandwidth,without compromising the image quality.Image compression in the sensor,on the other hand,expedites the transfer of data while simultaneously reducing bandwidth use.The traditional method of protecting sensitive data is rendered less effective in an environment dominated by IoT owing to the involvement of third parties.The image encryp-tion model provides a safe and adaptable method to protect the confidentiality of picture transformation and storage inside an IIoT system.This helps to ensure that image datasets are kept safe.The Linde–Buzo–Gray(LBG)methodology is an example of a vector quantization algorithm that is extensively used and a rela-tively new form of picture reduction known as vector quantization(VQ).As a result,the purpose of this research is to create an artificial humming bird optimi-zation approach that combines LBG-enabled codebook creation and encryption(AHBO-LBGCCE)for use in an IIoT setting.In the beginning,the AHBO-LBGCCE method used the LBG model in conjunction with the AHBO algorithm in order to construct the VQ.The Burrows-Wheeler Transform(BWT)model is used in order to accomplish codebook compression.In addition,the Blowfish algorithm is used in order to carry out the encryption procedure so that security may be attained.A comprehensive experimental investigation is carried out in order to verify the effectiveness of the proposed algorithm in comparison to other algorithms.The experimental values ensure that the suggested approach and the outcomes are examined in a variety of different perspectives in order to further enhance them.

FAST IMAGE ENCODING ALGORITHM BASED ON MEAN-MATCH CORRELATION VECTOR QUANTIZATION

A mean-match correlation vector quantizer (MMCVQ) was presented for fast image encoding. In this algorithm, a sorted codebook is generated regarding the mean values of all codewords. During the encoding stage, high correlation of the adjacent image blocks is utilized, and a searching range is obtained in the sorted codebook according to the mean value of the current processing vector. In order to gain good performance, proper THd and NS are predefined on the basis of experimental experiences and additional distortion limitation. The expermental results show that the MMCVQ algorithm is much faster than the full-search VQ algorithm, and the encoding quality degradation of the proposed algorithm is only 0.3～0.4 dB compared to the full-search VQ.

Efficient gray-level digital image watermarking based on vector quantization

Digital watermarking has been presented as a new method for copyright protection by embedding a secret signal in a digital image or video sequence. Common digital image watermarking techniques are based on the concept of spread spectrum communications, which can be classified in two catalogues: spatial domain and transform domain based. Most of transform domain watermarking methods are based on discrete cosine transforms (DCT) and robust to JPEG lossy compression. Recently, digital image watermarking based on another important lossy compression technique, vector quantization (VQ), has been presented, which carries watermark information by codeword indices. It is secret and efficient, and is robust to VQ compression with the same codebook. However, the embedded information is less and the extraction process requires the original image. This paper presents a more efficient VQ based image watermarking method, which can embed a large gray level watermark into the original image with less extra distortion and perform the watermark extraction without the original image. In addition, the proposed watermarking algorithm is very secret because two keys are required for watermark extraction. Experimental results demonstrate the effectiveness of the proposed technique.

Photon Structure and Wave Function from the Vector Potential Quantization

A photon structure is advanced based on the experimental evidence and the vector potential quantization at a single photon level. It is shown that the photon is neither a point particle nor an infinite wave but behaves rather like a local “wave-corpuscle” extended over a wavelength, occupying a minimum quantization volume and guided by a non-local vector potential real wave function. The quantized vector potential oscillates over a wavelength with circular left or right polarization giving birth to orthogonal magnetic and electric fields whose amplitudes are proportional to the square of the frequency. The energy and momentum are carried by the local wave-corpuscle guided by the non-local vector potential wave function suitably normalized.

Split vector quantization for sinusoidal amplitude and frequency

In this paper, we suggest applying tree structure on the sinusoidal parameters. The suggested sinusoidal coder is targeted to find the coded sinusoidal parameters obtained by minimizing a likelihood function in a least square (LS) sense. From a rate-distortion standpoint, we address the problem of how to allocate available bits among different frequency bands to code sinusoids at each frame. For further analyzing the quantization behavior of the proposed method, we assess the quantization performance with respect to other methods: the short-time Fourier transform (STFT) based coder commonly used for speech enhancement or separation, and the line spectral frequency (LSF) coder used in speech coding. Through extensive simulations, we show that the proposed quantizer leads to less spectral distortion as well as higher perceived quality for the re-synthesized signals based on the coded parameters in a model-based approach with respect to previous STFT-based methods. The proposed method lowers the complexity, and, due to its tree-structure, leads to a rapid search capability. It provides flexibility for use in many speaker-independent applications by finding the most likely frequency vectors selected from a list of frequency candidates. Therefore, the proposed quantizer can be considered an attractive candidate for model-based speech applications in both speaker-dependent and speaker-independent scenarios.

Speech compression scheme based on wavelet transform and vector quantization

A coding method of speech compression, which is based on Wavlet Transform and Vector Quantization (VQ), is developed and studied. The Wavlet Thansform or Wavlet Packet Thansform is used to process the speech signal, then VQ is used to compress the coefficients of Wavlet Thansform, and the entropy coding is used to decrease the bit rate. The experimental results show that the speech signal, sampled by 8 kHz sampling rate and 8 bit quatisation,i.e., 64 kbit/s bit rate, can be compressed to 6 - 8 kbit/s, and still have high speech quality,and the low-delay, only 8 ms.

UCAV situation assessment method based on C-LSHADE-Means and SAE-LVQ

The unmanned combat aerial vehicle(UCAV)is a research hot issue in the world,and the situation assessment is an important part of it.To overcome shortcomings of the existing situation assessment methods,such as low accuracy and strong dependence on prior knowledge,a datadriven situation assessment method is proposed.The clustering and classification are combined,the former is used to mine situational knowledge,and the latter is used to realize rapid assessment.Angle evaluation factor and distance evaluation factor are proposed to transform multi-dimensional air combat information into two-dimensional features.A convolution success-history based adaptive differential evolution with linear population size reduc-tion-means(C-LSHADE-Means)algorithm is proposed.The convolutional pooling layer is used to compress the size of data and preserve the distribution characteristics.The LSHADE algorithm is used to initialize the center of the mean clustering,which over-comes the defect of initialization sensitivity.Comparing experi-ment with the seven clustering algorithms is done on the UCI data set,through four clustering indexes,and it proves that the method proposed in this paper has better clustering performance.A situation assessment model based on stacked autoen-coder and learning vector quantization(SAE-LVQ)network is constructed,and it uses SAE to reconstruct air combat data fea-tures,and uses the self-competition layer of the LVQ to achieve efficient classification.Compared with the five kinds of assess-ments models,the SAE-LVQ model has the highest accuracy.Finally,three kinds of confrontation processes from air combat maneuvering instrumentation(ACMI)are selected,and the model in this paper is used for situation assessment.The assessment results are in line with the actual situation.

An Improved HVQ Algorithm for Compression and Rendering of Space Environment Volume Data with Multi-correlated Variables

Volume visualization can not only illustrate overall distribution but also inner structure and it is an important approach for space environment research.Space environment simulation can produce several correlated variables at the same time.However,existing compressed volume rendering methods only consider reducing the redundant information in a single volume of a specific variable,not dealing with the redundant information among these variables.For space environment volume data with multi-correlated variables,based on the HVQ-1d method we propose a further improved HVQ method by compositing variable-specific levels to reduce the redundant information among these variables.The volume data associated with each variable is divided into disjoint blocks of size 43 initially.The blocks are represented as two levels,a mean level and a detail level.The variable-specific mean levels and detail levels are combined respectively to form a larger global mean level and a larger global detail level.To both global levels,a splitting based on a principal component analysis is applied to compute initial codebooks.Then,LBG algorithm is conducted for codebook refinement and quantization.We further take advantage of progressive rendering based on GPU for real-time interactive visualization.Our method has been tested along with HVQ and HVQ-1d on high-energy proton flux volume data,including>5,>10,>30 and>50 MeV integrated proton flux.The results of our experiments prove that the method proposed in this paper pays the least cost of quality at compression,achieves a higher decompression and rendering speed compared with HVQ and provides satisficed fidelity while ensuring interactive rendering speed.

Codebook design using improved particle swarm optimization based on selection probability of artificial bee colony algorithm

In the paper, a new selection probability inspired by artificial bee colony algorithm is introduced into standard particle swarm optimization by improving the global extremum updating condition to enhance the capability of its overall situation search. The experiment result shows that the new scheme is more valuable and effective than other schemes in the convergence of codebook design and the performance of codebook, and it can avoid the premature phenomenon of the particles.

Application of Hidden Markov Models in Speech Command Recognition

In this study,vector quantization and hidden Markov models were used to achieve speech command recognition.Pre-emphasis,a hamming window,and Mel-frequency cepstral coefficients were first adopted to obtain feature values.Subsequently,vector quantization and HMMs(hidden Markov models)were employed to achieve speech command recognition.The recorded speech length was three Chinese characters,which were used to test the method.Five phrases pronounced mixing various human voices were recorded and used to test the models.The recorded phrases were then used for speech command recognition to demonstrate whether the experiment results were satisfactory.

Age-Based Automatic Voice Conversion Using Blood Relation for Voice Impaired

The present work presents a statistical method to translate human voices across age groups,based on commonalities in voices of blood relations.The age-translated voices have been naturalized extracting the blood relation features e.g.,pitch,duration,energy,using Mel Frequency Cepstrum Coefficients(MFCC),for social compatibility of the voice-impaired.The system has been demonstrated using standard English and an Indian language.The voice samples for resynthesis were derived from 12 families,with member ages ranging from 8–80 years.The voice-age translation,performed using the Pitch synchronous overlap and add(PSOLA)approach,by modulation of extracted voice features,was validated by perception test.The translated and resynthesized voices were correlated using Linde,Buzo,Gray(LBG),and Kekre’s Fast Codebook generation(KFCG)algorithms.For translated voice targets,a strong(θ>∼93%andθ>∼96%)correlation was found with blood relatives,whereas,a weak(θ<∼78%andθ<∼80%)correlation range was found between different families and different gender from same families.The study further subcategorized the sampling and synthesis of the voices into similar or dissimilar gender groups,using a support vector machine(SVM)choosing between available voice samples.Finally,∼96%,∼93%,and∼94%accuracies were obtained in the identification of the gender of the voice sample,the age group samples,and the correlation between the original and converted voice samples,respectively.The results obtained were close to the natural voice sample features and are envisaged to facilitate a near-natural voice for speech-impaired easily.

Intelligent Satin Bowerbird Optimizer Based Compression Technique for Remote Sensing Images

Due to latest advancements in the field of remote sensing,it becomes easier to acquire high quality images by the use of various satellites along with the sensing components.But the massive quantity of data poses a challenging issue to store and effectively transmit the remote sensing images.Therefore,image compression techniques can be utilized to process remote sensing images.In this aspect,vector quantization(VQ)can be employed for image compression and the widely applied VQ approach is Linde–Buzo–Gray(LBG)which creates a local optimum codebook for image construction.The process of constructing the codebook can be treated as the optimization issue and the metaheuristic algorithms can be utilized for resolving it.With this motivation,this article presents an intelligent satin bowerbird optimizer based compression technique(ISBO-CT)for remote sensing images.The goal of the ISBO-CT technique is to proficiently compress the remote sensing images by the effective design of codebook.Besides,the ISBO-CT technique makes use of satin bowerbird optimizer(SBO)with LBG approach is employed.The design of SBO algorithm for remote sensing image compression depicts the novelty of the work.To showcase the enhanced efficiency of ISBO-CT approach,an extensive range of simulations were applied and the outcomes reported the optimum performance of ISBO-CT technique related to the recent state of art image compression approaches.

Distinguish Fritillaria cirrhosa and nonFritillaria cirrhosa using laser-induced breakdown spectroscopy

As traditional Chinese medicines,Fritillaria from different origins are very similar and it is difficult to distinguish them.In this study,the laser-induced breakdown spectroscopy combined with learning vector quantization(LIBS-LVQ)was proposed to distinguish the powdered samples of Fritillaria cirrhosa and non-Fritillaria cirrhosa.We also studied the performance of linear discriminant analysis,and support vector machine on the same data set.Among these three classifiers,LVQ had the highest correct classification rate of 99.17%.The experimental results demonstrated that the LIBS-LVQ model could be used to differentiate the powdered samples of Fritillaria cirrhosa and non-Fritillaria cirrhosa.

An accelerated K-means clustering algorithm using selection and erasure rules

The K-means method is a well-known clustering algorithm with an extensive range of applications,such as biological classification,disease analysis,data mining,and image compression.However,the plain K-means method is not fast when the number of clusters or the number of data points becomes large.A modified K-means algorithm was presented by Fahim et al.(2006).The modified algorithm produced clusters whose mean square error was very similar to that of the plain K-means,but the execution time was shorter.In this study,we try to further increase its speed.There are two rules in our method:a selection rule,used to acquire a good candidate as the initial center to be checked,and an erasure rule,used to delete one or many unqualified centers each time a specified condition is satisfied.Our clustering results are identical to those of Fahim et al.(2006).However,our method further cuts computation time when the number of clusters increases.The mathematical reasoning used in our design is included.