Learning Vector Quantization-Based Fuzzy Rules Oversampling Method

Imbalanced datasets are common in practical applications,and oversampling methods using fuzzy rules have been shown to enhance the classification performance of imbalanced data by taking into account the relationship between data attributes.However,the creation of fuzzy rules typically depends on expert knowledge,which may not fully leverage the label information in training data and may be subjective.To address this issue,a novel fuzzy rule oversampling approach is developed based on the learning vector quantization(LVQ)algorithm.In this method,the label information of the training data is utilized to determine the antecedent part of If-Then fuzzy rules by dynamically dividing attribute intervals using LVQ.Subsequently,fuzzy rules are generated and adjusted to calculate rule weights.The number of new samples to be synthesized for each rule is then computed,and samples from the minority class are synthesized based on the newly generated fuzzy rules.This results in the establishment of a fuzzy rule oversampling method based on LVQ.To evaluate the effectiveness of this method,comparative experiments are conducted on 12 publicly available imbalance datasets with five other sampling techniques in combination with the support function machine.The experimental results demonstrate that the proposed method can significantly enhance the classification algorithm across seven performance indicators,including a boost of 2.15%to 12.34%in Accuracy,6.11%to 27.06%in G-mean,and 4.69%to 18.78%in AUC.These show that the proposed method is capable of more efficiently improving the classification performance of imbalanced data.

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.

An Efficient Information Hiding Scheme Based on Closest Paired Tree Structure Vector Quantization

Information hiding schemes based on vector quantization （VQ） usually require lengthy VQ encoding and decoding processes. In this paper, we propose an efficient information hiding method based on closest paired tree structure vector quantization （CPTSVQ）. The simulation result shows that the execution time of the proposed scheme is much shorter than that attained by previous approaches.

Lattice Vector Quantization Applied to Speech and Audio Coding

Lattice vector quantization （LVQ） has been used for real-time speech and audio coding systems. Compared with conventional vector quantization, LVQ has two main advantages： It has a simple and fast encoding process, and it significantly reduces the amount of memory required. Therefore, LVQ is suitable for use in low-complexity speech and audio coding. In this paper, we describe the basic concepts of LVQ and its advantages over conventional vector quantization. We also describe some LVQ techniques that have been used in speech and audio coding standards of international standards developing organizations （SDOs）.

Fast encoding algorithm for vector quantization based on subvector L_2-norm

A fast encoding algorithm based on the mean square error （MSE） distortion for vector quantization is introduced. The vector, which is effectively constructed with wavelet transform （WT） coefficients of images, can simplify the realization of the non-linear interpolated vector quantization （NLIVQ） technique and make the partial distance search （PDS） algorithm more efficient. Utilizing the relationship of vector L2-norm and its Euclidean distance, some conditions of eliminating unnecessary codewords are obtained. Further, using inequality constructed by the subvector L2-norm, more unnecessary codewords are eliminated. During the search process for code, mostly unlikely codewords can be rejected by the proposed algorithm combined with the non-linear interpolated vector quantization technique and the partial distance search technique. The experimental results show that the reduction of computation is outstanding in the encoding time and complexity against the full search method.

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.

A Novel Coding Method Based on Fuzzy Vector Quantization for Noised Image

In this paper a novel coding method based on fuzzy vector quantization for noised image with Gaussian white-noise pollution is presented. By restraining the high frequency subbands of wavelet image the noise is significantly removed and coded with fuzzy vector quantization. The experimental result shows that the method can not only achieve high compression ratio but also remove noise dramatically.

Learning Vector Quantization Neural Network Method for Network Intrusion Detection

A new intrusion detection method based on learning vector quantization （LVQ） with low overhead and high efficiency is presented. The computer vision system employs LVQ neural networks as classifier to recognize intrusion. The recognition process includes three stages： （1） feature selection and data normalization processing;（2） learning the training data selected from the feature data set; （3） identifying the intrusion and generating the result report of machine condition classification. Experimental results show that the proposed method is promising in terms of detection accuracy, computational expense and implementation for intrusion detection.

A VECTOR QUANTIZATION BASED APPROACH FOR CFA DATA COMPRESSION IN WIRELESS ENDOSCOPY CAPSULE

A novel approach for near-lossless compression of Color Filtering Array (CFA) data in wireless endoscopy capsule is proposed in this paper. The compression method is based on pre-processing and vector quantization. First, the CFA raw data are low pass filtered and rearranged during pre-processing. Then, pairs of pixels are vector quantized into macros of 9 bits by applying block par-tition and index mapping in succession. These macros are entropy compressed by Joint Photographic Experts Group-Lossless Standard (JPEG-LS) finally. The complex step of codeword searching in Vector Quantization (VQ) is avoided by a predefined partition rule, which is suitable for hardware imple-mentation. By control of the pre-processor and VQ scheme, either high quality compression under un- filtered case or high ratio compression under filtered case can be realized, with the average Peak Sig-nal-to-Noise Ratio (PSNR) more than 43dB and 37dB respectively. Compared with the state-of-the-art method and the previously proposed method, our compression approach outperforms in compression performance as well as in flexibility.

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.

A method to compress vibration signals using wavelet packet transformation combined with sub-band vector quantization

A novel compression method for mechanical vibrating signals,binding with sub-band vector quantization(SVQ) by wavelet packet transformation(WPT) and discrete cosine transformation(DCT) is proposed.Firstly,the vibrating signal is decomposed into sub-bands by WPT.Then DCT and adaptive bit allocation are done per sub-band and SVQ is performed in each sub-band.It is noted that,after DCT,we only need to code the first components whose numbers are determined by the bits allocated to that sub-band.Through an actual signal,our algorithm is proven to improve the signal-to-noise ratio(SNR) of the reconstructed signal effectively,especially in the situation of lowrate transmission.

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.

A hybrid quantum encoding algorithm of vector quantization for image compression

Many classical encoding algorithms of vector quantization （VQ） of image compression that can obtain global optimal solution have computational complexity O（N）. A pure quantum VQ encoding algorithm with probability of success near 100% has been proposed, that performs operations 45√N times approximately. In this paper, a hybrid quantum VQ encoding algorithm between the classical method and the quantum algorithm is presented. The number of its operations is less than √N for most images, and it is more efficient than the pure quantum algorithm.

One-Step interpolation Predictive Vector Quantization of LSP Parameters

A new spectral coding approach,one-step interpolation predictive vectorquantimtion of the LineSPectrum Pair(LSP)coding,is proposed. With the use of the sufficient correlation of successive LSP vectorsand because of relatively slow variation of the short term spectrum of the speech waveform, the idea ofpredictive vector quantization and DPCM techniques are used to reduce variance Of the parameters to be quantics.18 bit/home split vector quantization scheme is designed to quantize the prediction residual.The average spectral distortion of 1.178 dB can be achieved when frame period is 30ms.

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.

Linear Discriminant Analysis and Kernel Vector Quantization for Mandarin Digits Recognition

Linear discriminant analysis and kernel vector quantization are integrated into vector quantization based speech recognition system for improving the recognition accuracy of Mandarin digits. These techniques increase the class separability and optimize the clustering procedure. Speaker-dependent (SD) and speaker-independent (SI) experiments are performed to evaluate the performance of the proposed method. The experiment results show that the proposed method is capable of reaching the word error rate of 3.76% in SD case and 6.60 % in SI case. Such a system can be suitable for being embedded in personal digital assistant(PDA), mobile phone and so on to perform voice controlling such as digit dialing, calculating, etc.

REMOTE SENSING IMAGE CODING METHOD COMBINING WAVELET TRANSFORM WITH CLASSIFIED VECTOR QUANTIZATION

A new remote sensing image coding scheme based on the wavelet transform and classified vector quantization (CVQ) is proposed. The original image is first decomposed into a hierarchy of 3 layers including 10 subimages by DWT. The lowest frequency subimage is compressed by scalar quantization and ADPCM. The high frequency subimages are compressed by CVQ to utilize the similarity among different resolutions while improving the edge quality and reducing computational complexity. The experimental results show that the proposed scheme has a better performance than JPEG, and a PSNR of reconstructed image is 31～33 dB with a rate of 0.2 bpp.

Fast compression of computer-generated holographic images based on a GPU-accelerated skip-dimension vector quantization method

A method for fast and low bit-rate compression of digital holograms based on a new vector quantization （VQ） method known as the skip-dimension VQ （SDVQ） is proposed. Briefly, a complex hologram is converted into a real off-axis hologram, and partitioned into a set of image vectors. The image vectors are passed into a graphic processing unit （GPU）, and compressed through SDVQ into a set of code indices considerably smaller in data size than the source hologram. Experimental evaluation reveals that our scheme is capable of compressing a digital hologram to a compression ratio of over 500 times, in approximately 20-22 ms.

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.