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.

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.

Improvement of the prediction performance of a soft sensor model based on support vector regression for production of ultra-low sulfur diesel

A novel data-driven, soft sensor based on support vector regression （SVR） integrated with a data compression technique was developed to predict the product quality for the hydrodesulfurization （HDS） process. A wide range of experimental data was taken from a HDS setup to train and test the SVR model. Hyper-parameter tuning is one of the main challenges to improve predictive accuracy of the SVR model. Therefore, a hybrid approach using a combination of genetic algorithm （GA） and sequential quadratic programming （SQP） methods （GA-SQP） was developed. Performance of different optimization algorithms including GA-SQP, GA, pattern search （PS）, and grid search （GS） indicated that the best average absolute relative error （AARE）, squared correlation coefficient （R2）, and computation time （CT） （AARE = 0.0745, R2 = 0.997 and CT = 56 s） was accomplished by the hybrid algorithm. Moreover, to reduce the CT and improve the accuracy of the SVR model, the vector quantization （VQ） technique was used. The results also showed that the VQ technique can decrease the training time and improve prediction performance of the SVR model. The proposed method can provide a robust, soft sensor in a wide range of sulfur contents with good accuracy.

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.

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.

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.

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

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.

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.

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.

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.

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.

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.

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.

Comparative Study on VQ-Based Efficient Mandarin Speech Recognition Method

A VQ based efficient speech recognition method is introduced, and the key parameters of this method are comparatively studied. This method is especially designed for mandarin speaker dependent small size word set recognition. It has less complexity, less resource consumption but higher ARR (accurate recognition rate) compared with traditional HMM or NN approach. A large scale test on the task of 11 mandarin digits recognition shows that the WER(word error rate) can reach 3 86%. This method is suitable for being embedded in PDA (personal digital assistant), mobile phone and so on to perform voice controlling like digits dialing, name dialing, calculating, voice commanding, etc.