Search Results (6)

Transformers are fundamental and among the most expensive electrical devices in any power transmission and distribution system. Therefore, it is essential to implement powerful maintenance methods to monitor and predict their condition. Due to its many advantages—such as early detection, accurate diagnosis, cost reduction, and rapid response time—dissolved gas analysis (DGA) is regarded as one of the most effective ways to assess a transformer’s condition. In this contribution, we propose a new probabilistic hierarchical intelligent system consisting of five subnetworks of the radial basis functions (RBF) type. Indeed, hierarchical classification minimizes the complexity of the discrimination task by employing a divide-and-conquer strategy, effectively addressing the issue of unbalanced data (a significant disparity between the categories to be predicted). This approach contributes to a more precise and sophisticated diagnosis of transformers. The first subnetwork detects the presence or absence of defects, separating defective samples from healthy ones. The second subnetwork further classifies the defective samples into three categories: electrical, thermal, and cellulosic decomposition. The samples in these categories are then precisely assigned to their respective subcategories by the third, fourth, and fifth subnetworks. To optimize the hyperparameters of the five models, the Linde–Buzo–Gray algorithm is implemented to reduce the number of centers (radial functions) in each subnetwork. Subsequently, a single-layer perceptron is trained to determine the optimal synaptic weights, which connect the intermediate layer to the output layer. The results obtained with our proposed system surpass those achieved with another implemented alternative (a single RBF), with an average sensitivity percentage as high as 96.85%. This superiority is validated by a Student’s t-test, showing a significant difference greater than 5% (p-value < 0.001). These findings demonstrate and highlight the relevance of the proposed hierarchical configuration. Full article

Vector quantization (VQ) is a block coding method that is famous for its high compression ratio and simple encoder and decoder implementation. Linde–Buzo–Gray (LBG) is a renowned technique for VQ that uses a clustering-based approach for finding the optimum codebook. Numerous algorithms, such as Particle Swarm Optimization (PSO), the Cuckoo search algorithm (CS), bat algorithm, and firefly algorithm (FA), are used for codebook design. These algorithms are primarily focused on improving the image quality in terms of the PSNR and SSIM but use exhaustive searching to find the optimum codebook, which causes the computational time to be very high. In our study, our algorithm enhances LBG by minimizing the computational complexity by reducing the total number of comparisons among the codebook and training vectors using a match function. The input image is taken as a training vector at the encoder side, which is initialized with the random selection of the vectors from the input image. Rescaling using bilinear interpolation through the nearest neighborhood method is performed to reduce the comparison of the codebook with the training vector. The compressed image is first downsized by the encoder, which is then upscaled at the decoder side during decompression. Based on the results, it is demonstrated that the proposed method reduces the computational complexity by 50.2% compared to LBG and above 97% compared to the other LBG-based algorithms. Moreover, a 20% reduction in the memory size is also obtained, with no significant loss in the image quality compared to the LBG algorithm. Full article

Vector Quantization (VQ) is a technique with a wide range of applications. For example, it can be used for image compression. The codebook design for VQ has great significance in the quality of the quantized signals and can benefit from the use of swarm intelligence. Initialization of the Linde–Buzo–Gray (LBG) algorithm, which is the most popular VQ codebook design algorithm, is a step that directly influences VQ performance, as the convergence speed and codebook quality depend on the initial codebook. A widely used initialization alternative is random initialization, in which the initial set of codevectors is drawn randomly from the training set. Other initialization methods can lead to a better quality of the designed codebooks. The present work evaluates the impacts of initialization strategies on swarm intelligence algorithms for codebook design in terms of the quality of the designed codebooks, assessed by the quality of the reconstructed images, and in terms of the convergence speed, evaluated by the number of iterations. Initialization strategies consist of a combination of codebooks obtained by initialization algorithms from the literature with codebooks composed of vectors randomly selected from the training set. The possibility of combining different initialization techniques provides new perspectives in the search for the quality of the VQ codebooks. Nine initialization strategies are presented, which are compared with random initialization. Initialization strategies are evaluated on the following algorithms for codebook design based on swarm clustering: modified firefly algorithm—Linde–Buzo–Gray (M-FA-LBG), modified particle swarm optimization—Linde–Buzo–Gray (M-PSO-LBG), modified fish school search—Linde–Buzo–Gray (M-FSS-LBG) and their accelerated versions (M-FA-LBGa, M-PSO-LBGa and M-FSS-LBGa) which are obtained by replacing the LBG with the accelerated LBG algorithm. The simulation results point out to the benefits of the proposed initialization strategies. The results show gains up to 4.43 dB in terms of PSNR for image Clock with M-PSO-LBG codebooks of size 512 and codebook design time savings up to 67.05% for image Clock, with M-FF-LBGa codebooks with size $N=512$, by using initialization strategies in substitution to Random initialization. Full article

For constructing the best local codebook for image compression, there are many Vector Quantization (VQ) procedures, but the simplest VQ procedure is the Linde–Buzo–Gray (LBG) procedure. Techniques such as the Gaussian Dissemination Function (GDF) are used for the searching process in generating a global codebook for particle swarm optimization (PSO), Honeybee mating optimization (HBMO), and Firefly (FA) procedures. However, when particle velocity is very high, FA encounters a problem when brighter fireflies are trivial, and PSO suffers uncertainty in merging. A novel procedure, Cuckoo Search–Kekre Fast Codebook Generation (CS-KFCG), is proposed that enhances Cuckoo Search–Linde–Buzo–Gray (CS-LBG) codebook by implementing a Flight Dissemination Function (FDF), which produces more speed than other states of the art algorithms with appropriate mutation expectations for the overall codebook. Also, CS-KFGC has generated a high Peak Signal Noise Ratio (PSNR) in terms of high duration (time) and better acceptability rate. Full article

This paper proposes an efficient channel information feedback scheme to reduce the feedback overhead of multi-user multiple-input multiple-output (MU-MIMO) hybrid beamforming systems. As massive machine type communication (mMTC) was considered in the deployments of 5G, a transmitter of the hybrid beamforming system should communicate with multiple devices at the same time. To communicate with multiple devices in the same time and frequency slot, high-dimensional channel information should be used to control interferences between the receivers. Therefore, the feedback overhead for the channels of the devices is impractically high. To reduce the overhead, this paper uses common sparsity of channel and nonlinear quantization. To find a common sparse part of a wide frequency band, the proposed system uses minimum mean squared error orthogonal matching pursuit (MMSE-OMP). After the search of the common sparse basis, sparse vectors of subcarriers are searched by using the basis. The sparse vectors are quantized by a nonlinear codebook that is generated by conditional random vector quantization (RVQ). For the conditional RVQ, the Linde–Buzo–Gray (LBG) algorithm is used in conditional vector space. Typically, elements of sparse vectors are sorted according to magnitude by the OMP algorithm. The proposed quantization scheme considers the property for the conditional RVQ. For feedback, indices of the common sparse basis and the quantized sparse vectors are delivered and the channel is recovered at a transmitter for precoding of MU-MIMO. The simulation results show that the proposed scheme achieves lower MMSE for the recovered channel than that of the linear quantization scheme. Furthermore, the transmitter can adopt analog and digital precoding matrix freely by the recovered channel and achieve higher sum rate than that of conventional codebook-based MU-MIMO precoding schemes. Full article

The goal of vector quantization is to use a few reproduction vectors to represent original vectors/data while maintaining the necessary fidelity of the data. Distributed signal processing has received much attention in recent years, since in many applications data are dispersedly collected/stored in distributed nodes over networks, but centralizing all these data to one processing center is sometimes impractical. In this paper, we develop a distributed vector quantization (VQ) algorithm based on Kullback-Leibler (K-L) divergence. We start from the centralized case and propose to minimize the K-L divergence between the distribution of global original data and the distribution of global reproduction vectors, and then obtain an online iterative solution to this optimization problem based on the Robbins-Monro stochastic approximation. Afterwards, we extend the solution to apply to distributed cases by introducing diffusion cooperation among nodes. Numerical simulations show that the performances of the distributed K-L–based VQ algorithm are very close to the corresponding centralized algorithm. Besides, both the centralized and distributed K-L–based VQ show more robustness to outliers than the (centralized) Linde-Buzo-Gray (LBG) algorithm and the (centralized) self-organization map (SOM) algorithm. Full article