Abstract: We consider multi-input multi-output (MIMO) transmit beamforming under the uniform elemental power constraint. This is a nonconvex optimization problem, and it is usually difficult to find the optimal transmit beamformer. First, we show that for the multi-input single-output (MISO) case, the optimal solution has a closed-form expression. Then we propose a cyclic algorithm for the MIMO case which uses the closed-form MISO optimal solution iteratively. The cyclic algorithm has a low computational complexity and is locally convergent under mild conditions. Moreover, we consider finite-rate feedback methods needed for transmit beamforming. We propose a simple scalar quantization method, as well as a novel vector quantization method. For the latter method, the codebook is constructed under the uniform elemental power constraint and the method is referred as VQ-UEP. We analyze VQ-UEP performance for the MISO case. Specifically, we obtain an approximate expression for the average degradation of the receive signal-to-noise ratio (SNR) caused by VQ-UEP. Numerical examples are provided to demonstrate the effectiveness of our proposed transmit beamformer designs and the finite-rate feedback techniques.

Abstract: In this paper, we propose two efficient low-complexity quantization methods for multiple-input multiple-output (MIMO) systems with finite-rate feedback based on proper parameterization of the information to be fed back followed by quantization in the new parameter domain For a MIMO channel which has multiple orthonormal vectors as channel spatial information, we exploit the geometrical structure of orthonormality while quantizing the spatial information matrix The parameterization is of two types: one is in terms of a set of unit-norm vectors with different lengths, and the other is in terms of a minimal number of scalar parameters These parameters are shown to be independent for the iid flat-fading Rayleigh channel, facilitating efficient quantization In the first scheme, each of the unit-norm vectors is independently quantized with a finite number of bits using an optimal vector quantization (VQ) technique Bit allocation is needed between the vectors, and the optimum bit allocation depends on the operating SNR of the system In the second scheme, the scalar parameters are quantized In slowly time-varying channels, the scalar parameters are also found to be smoothly changing over time, leading to the development of a simple quantization and feedback method using adaptive delta modulation The results show that the proposed feedback scheme has a channel tracking feature and achieves a capacity very close to perfect feedback with a reasonable feedback rate

Abstract: This article develops an evolutional fuzzy particle swarm optimization (FPSO) learning algorithm to self extract the near optimum codebook of vector quantization (VQ) for carrying on image compression. The fuzzy particle swarm optimization vector quantization (FPSOVQ) learning schemes, combined advantages of the adaptive fuzzy inference method (FIM), the simple VQ concept and the efficient particle swarm optimization (PSO), are considered at the same time to automatically create near optimum codebook to achieve the application of image compression. The FIM is known as a soft decision to measure the relational grade for a given sequence. In our research, the FIM is applied to determine the similar grade between the codebook and the original image patterns. In spite of popular usage of Linde–Buzo–Grey (LBG) algorithm, the powerful evolutional PSO learning algorithm is taken to optimize the fuzzy inference system, which is used to extract appropriate codebooks for compressing several input testing grey-level images. The proposed FPSOVQ learning scheme compared with LBG based VQ learning method is presented to demonstrate its great result in several real image compression examples.

Abstract: This paper considers the development of a general framework for the analysis of transmit beamforming methods in multiple-antenna systems with finite-rate feedback. Inspired by the results of classical high-resolution quantization theory, the problem of finite-rate quantized communication system is formulated as a general fixed-rate vector quantization problem with side information available at the encoder (or the quantizer) but unavailable at the decoder. The framework of the quantization problem is sufficiently general to include quantization schemes with general non-mean-squared distortion functions and constrained source vectors. Asymptotic distortion analysis of the proposed general quantization problem is provided by extending the vector version of the Bennett's integral. Specifically, tight lower and upper bounds of the average asymptotic distortion are proposed. Sufficient conditions for the achievability of the distortion bounds are also provided and related to corresponding classical fixed-rate quantization problems. The proposed general methodology provides a powerful analytical tool to study a wide range of finite-rate feedback systems. To illustrate the utility of the framework, we consider the analysis of a finite-rate feedback multiple-input single-output (MISO) beamforming system over independent and identically distributed (i.i.d.) Rayleigh flat-fading channels. Numerical and simulation results are presented that further confirm the accuracy of the analytical results

Abstract: This paper proposes to compare the performance of neural network classifiers between back propagation (BP) and learning vector quantization (LVQ) for pattern analyses of features selection in a non-intrusive load monitoring (NILM) system. Load recognition for identifying loads being connected and disconnected is applied to a NILM by using a neural network, especially for industrial electrical loads, even though some loads are activated at the nearly same time. In order to accurately decompose the aggregate load into its components, a feature-based model for describing the signatures of individual appliances and load combinations is used. The model will suggest the certain signatures which can be detected for all loads in order to indicate the activities of the separate components. To verify the performance of the model for the features selection, the data sets of the electrical loads and the load recognition techniques apply an electromagnetic transient program (EMTP) and a neural network, respectively. The effectiveness and computation equipment of load recognition are analyzed and compared by using the back propagation classifier and the learning vector quantization classifier. To obtain a maximum recognition accuracy rate, the calculation of the turn-on transient energy signature employs a window of samples, At, to adaptively segment a transient representative of a class of loads. Experiments performed with a variety of model data sets which reveal the back propagation classifier is superior to the learning quantization classifier in the effectiveness and computation equipment of load recognition.

Abstract: This paper presents a fast codebook search method for improving the quantization complexity of full-search vector quantization (VQ). The proposed method is built on the planar Voronoi diagram to label a ripple search domain. Then, the appropriate codeword can easily be found just by searching the local region instead of global exploration. In order to take a step further and obtain the close result full-search VQ would, we equip the proposed method with a duplication mechanism that helps to bring down the possible quantizing distortion to its lowest level. According to the experimental results, the proposed method is indeed capable of providing better outcome at a faster quantization speed than the existing partial-search methods. Moreover, the proposed method only requires a little extra storage for duplication

Abstract: Compressive sensing (CS) is a new signal acquisition technique for sparse and compressible signals. Rather than uniformly sampling the signal, CS computes inner products with randomized basis functions; the signal is then recovered by a convex optimization. Random CS measurements are universal in the sense that the same acquisition system is sufficient for signals sparse in any representation. This paper examines the quantization of strictly sparse, power-limited signals and concludes that CS with scalar quantization uses its allocated rate inefficiently. The results complement related work on the quantization of CS measurements of compressible signals.

Abstract: An efficient approach for face compression is introduced. Restricting a family of images to frontal facial mug shots enables us to first geometrically deform a given face into a canonical form in which the same facial features are mapped to the same spatial locations. Next, we break the image into tiles and model each image tile in a compact manner. Modeling the tile content relies on clustering the same tile location at many training images. A tree of vector-quantization dictionaries is constructed per location, and lossy compression is achieved using bit-allocation according to the significance of a tile. Repeating this modeling/coding scheme over several scales, the resulting multiscale algorithm is demonstrated to compress facial images at very low bit rates while keeping high visual qualities, outperforming JPEG-2000 performance significantly.

Abstract: In the present contribution we propose two recently developed classification algorithms for the analysis of mass-spectrometric data-the supervised neural gas and the fuzzy-labeled self-organizing map. The algorithms are inherently regularizing, which is recommended, for these spectral data because of its high dimensionality and the sparseness for specific problems. The algorithms are both prototype-based such that the principle of characteristic representants is realized. This leads to an easy interpretation of the generated classifcation model. Further, the fuzzy-labeled self-organizing map is able to process uncertainty in data, and classification results can be obtained as fuzzy decisions. Moreover, this fuzzy classification together with the property of topographic mapping offers the possibility of class similarity detection, which can be used for class visualization. We demonstrate the power of both methods for two exemplary examples: the classification of bacteria (listeria types) and neoplastic and non-neoplastic cell populations in breast cancer tissue sections.

Abstract: Multiple description (MD) coding is a promising alternative for robust transmission of information over non-prioritized and unpredictable networks. In this paper, an effective MD image coding scheme is introduced based on the MD lattice vector quantization (MDLVQ) for the wavelet transformed images. In view of the characteristics of wavelet coefficients in different frequency subbands, MDLVQ is applied in an optimized way, including an appropriate construction of wavelet coefficient vectors, the optimization of MDLVQ encoding parameters such as the choice of sublattice index values and the quantization accuracy for different subbands. More importantly, optimized side decoding is employed to predict lost information based on inter-vector correlation and an alternative transmission way for further reducing side distortion. Experimental results validate the effectiveness of the proposed scheme with better performance than some other tested MD image codecs including that based on optimized MD scalar quantization.

Abstract: The problem of quantization in an Euclidean space with unitary constraints can be formulated as an unconstrained problem on a Grassmann manifold. Such constraints arise in areas such as wireless communication with multiple antennas at the transmitter and at the receiver. Due to the constraints, the distortion rate analysis developed for Euclidean spaces cannot be applied directly. This paper extends Gersho's asymptotic (large rate, small distortion) distortion bounds to the case when the source is distributed on the complex Grassmann manifold. The special structure of the Grassmann manifold and the distortion measures defined on it differentiate this problem from the traditional vector quantization in Euclidean spaces.

Abstract: Lossy image compression techniques allow arbitrarily high compression rates but at the price of poor image quality. We applied maximum likelihood difference scaling to evaluate image quality of nine images, each compressed via vector quantization to ten different levels, within two different color spaces, RGB and CIE 1976 L*a*b*. In L*a*b* space, images could be compressed on average by 32% more than in RGB space, with little additional loss in quality. Further compression led to marked perceptual changes. Our approach permits a rapid, direct measurement of the consequences of image compression for human observers.

Abstract: We consider the design and analysis of quantizers for equal gain transmission (EGT) systems with finite rate feedback-based communication in flat-fading multiple input single output (MISO) systems. EGT is a beamforming technique that maximizes the MISO channel capacity when there is an equal power-per-antenna constraint at the transmitter, and requires the feedback of t-1 phase angles, when there are t antennas at the transmitter. In this paper, we contrast two popular approaches for quantizing the phase angles: vector quantization (VQ) and scalar quantization (SQ). On the VQ side, using the capacity loss with respect to EGT with perfect channel information at transmitter as performance metric, we develop a criterion for designing the beamforming codebook for quantized EGT (Q-EGT). We also propose an iterative algorithm based on the well-known generalized Lloyd algorithm, for computing the beamforming vector codebook. On the analytical side, we study the performance of Q-EGT and derive closed-form expressions for the performance in terms of capacity loss and outage probability in the case of i.i.d. Rayleigh flat-fading channels. On the SQ side, assuming uniform scalar quantization and i.i.d. Rayleigh flat-fading channels, we derive the high-resolution performance of quantized EGT and contrast the performance with that of VQ. We find that although both VQ and SQ achieve the same rate of convergence (to the capacity with perfect feedback) as the number of feedback bits B increases, there exists a fixed gap between the two

Abstract: Sheet metal stamping process is widely used in industry due to its high accuracy and productivity. However, monitoring the process is a difficult task since the monitoring signals are typically non-stationary transient signals. In this paper, empirical mode decomposition (EMD) is applied to extract the main features of the strain signals. First, the signal is decomposed by EMD into intrinsic mode functions (IMF). Then the signal energy and the Hilbert marginal spectrum, which reflects the working condition and the fault pattern of the process, are computed. Finally, to identify the faulty conditions of process, the learning vector quantization (LVQ) network is used as a classifier with the Hilbert marginal spectrum as the input vectors. The performance of this method is tested by 107 experiments derived from different conditions in the sheet metal stamping process. The artificially created defects can be detected with a success rate of 96.3%. The method seems to be useful to monitor a sheet metal stamping process in practice.

Abstract: We propose a fragile watermarking scheme in the wavelet transform domain that is sensitive to all kinds of manipulations and has the ability to localize the tampered regions. To achieve high transparency (i.e., low embedding distortion) while providing protection to all coefficients, the embedder involves all the coefficients within a hierarchical neighborhood of each sparsely selected watermarkable coefficient during the watermark embedding process. The way the nonwatermarkable coefficients are involved in the embedding process is content-dependent and nondeterministic, which allows the proposed scheme to put up resistance to the so-called vector quantization attack, Holliman-Memon attack, collage attack, and transplantation attack.

Abstract: We apply the cross-entropy (CE) method to problems in clustering and vector quantization. The CE algorithm for clustering involves the following iterative steps: (a) generate random clusters according to a specified parametric probability distribution, (b) update the parameters of this distribution according to the Kullback---Leibler cross-entropy. Through various numerical experiments, we demonstrate the high accuracy of the CE algorithm and show that it can generate near-optimal clusters for fairly large data sets. We compare the CE method with well-known clustering and vector quantization methods such as K-means, fuzzy K-means and linear vector quantization, and apply each method to benchmark and image analysis data.

Abstract: A novel framework involving both a detection module and a classification module is proposed for the recognition of the six main types of process signals. In particular, a multi-scale wavelet filter is used for denoising and its performance is compared with that of single-scale linear filters. Moreover, two kinds of competitive neural networks, based on learning vector quantization (LVQ) and adaptive resonance theory (ART), are adopted for the task of pattern classification and benchmarking. Our results show that denoising through a wavelet filter is best for pattern classification, and the classification accuracy with respect to six predefined categories using a LVQ-X network is a little better than using an ART network. However, when an unexpected novel pattern occurs within the process, LVQ will force the novel pattern to be classified into one of those predefined categories that is most similar to the novel pattern. On the contrary, ART will automatically construct a new class when the similarity measu...

Abstract: Block diagonalization is a linear precoding technique for the multiple antenna broadcast (downlink) channel that involves transmission of multiple data streams to each receiver such that no multi-user interference is experienced at any of the receivers. This low-complexity scheme operates only a few dB away from capacity but does require very accurate channel knowledge at the transmitter, which can be very difficult to obtain in fading scenarios. We consider a limited feedback system where each receiver knows its channel perfectly, but the transmitter is only provided with a finite number of channel feedback bits from each receiver. Using a random vector quantization argument, we quantify the throughput loss due to imperfect channel knowledge as a function of the feedback level. The quality of channel knowledge must improve proportional to the SNR in order to prevent interference-limitations, and we show that scaling the number of feedback bits linearly with the system SNR is sufficient to maintain a bounded rate loss. Finally, we investigate a simple scalar quantization scheme that is seen to achieve the same scaling behavior as vector quantization.

Abstract: Speaker Recognition is the process of identifying a speaker by analyzing spectral shape of the voice signal This is done by extracting & matching the feature of voice signal Mel-frequency Cepstrum Co-efficient (MFCC) is the feature extraction technique in which we will get some coefficients named Mel-Frequency Cepstrum coefficient This Cepstrum Co-efficient is extracted feature This extracted feature is taken as the input of Vector Quantization process Vector Quantization (VQ) is the typical feature matching technique in which VQ codebook is generated by providing pre-defined spectral vectors for each speaker to cluster the training vectors in a training session Finally test data are provided for searching the nearest neighbor to match that data with the trained data The result is to recognize correctly the speakers where music & speech data (Both in English & Bengali format) are taken for the recognition process The correct recognition is almost ninety percent It is comparatively better than Hidden Markov model (HMM) & Artificial Neural network (ANN)

Abstract: A new adaptive single pixel based lossless intra coding technique employs pixel based DPCM(Differential Pulse Code Modulation) is presented as an enhancement of H.264/MPEG-4 AVC(Advanced Video Coding) standard.. In this paper, we have addressed a technique to trace a single significant pixel in the source block adaptively based on perceptual considerations, applied pixel wise DP CM for spatial prediction for residual transform coding. However, the block style ofH.264/AVC is not troubled for the transform encoding and decoding process. From the experiments, it follows that the new adaptive single pixel based lossless intra coding technique offers a better image quality and good compression ratio as compared with the current standard. If the visual significance of source block is considered for spatial prediction, it offers better results. In this paper, we highlight the exclusion of excess visual data present in both Luma and Chromo components of a video frame for lossless Intra coding of H.264/AVC

Abstract: We propose a new matrix learning scheme to extend Generalized Relevance Learning Vector Quantization (GRLVQ). By introducing a full matrix of relevance factors in the distance measure, correlations between different features and their importance for the classification scheme can be taken into account. In comparison to the weighted euclidean metric used for GRLVQ, this metric is more powerful to represent the internal structure of the data appropriately while maintaining its excellent generalization ability as large margin optimizer. The algorithm is tested and compared to alternative LVQ schemes using an artificial dataset and the image segmentation data from the UCI repository.

Abstract: In many speech-coding-related problems, there is available information and lost information that must be recovered. When there is significant correlation between the available and the lost information source, coding with side information (CSI) can be used to benefit from the mutual information between the two sources. In this paper, we consider CSI as a special VQ problem which will be referred to as conditional vector quantization (CVQ). A fast two-step divide-and-conquer solution is proposed. CVQ is then used in two applications: the recovery of highband (4-8 kHz) spectral envelopes for speech spectrum expansion and the recovery of lost narrowband spectral envelopes for voice over IP. Comparisons with alternative approaches like estimation and simple VQ-based schemes show that CVQ provides significant distortion reductions at very low bit rates. Subjective evaluations indicate that CVQ provides noticeable perceptual improvements over the alternative approaches