Fractals everywhere
Unsupervised Optimal Fuzzy Clustering
IEEE Transactions on Pattern Analysis and Machine Intelligence
Introduction to data compression (2nd ed.)
Introduction to data compression (2nd ed.)
Pattern Recognition with Fuzzy Objective Function Algorithms
Pattern Recognition with Fuzzy Objective Function Algorithms
Near optimum estimation of local fractal dimension for image segmentation
Pattern Recognition Letters
Dynamic Programming
Multiple Resolution Texture Analysis and Classification
IEEE Transactions on Pattern Analysis and Machine Intelligence
Image compression with variable block size segmentation
IEEE Transactions on Signal Processing
A possibilistic approach to clustering
IEEE Transactions on Fuzzy Systems
Use of nonlinear principal component analysis and vector quantization for image coding
IEEE Transactions on Image Processing
IEEE Transactions on Image Processing
A fractal vector quantizer for image coding
IEEE Transactions on Image Processing
Efficient quadtree coding of images and video
IEEE Transactions on Image Processing
Improved batch fuzzy learning vector quantization for image compression
Information Sciences: an International Journal
Adaptive terrain-based memetic algorithms
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Medical image compression based on vector quantization with variable block sizes in wavelet domain
Computational Intelligence and Neuroscience - Special issue on Computational Intelligence in Biomedical Science and Engineering
Hi-index | 0.00 |
We proposed a vector quantization (VQ) with variable block size using local fractal dimensions (LFDs) of an image. A VQ with variable block size has so far been implemented using a quad tree (QT) decomposition algorithm. QT decomposition carries out image partitioning based on the homogeneity of local regions of an image. However, we think that the complexity of local regions of an image is more essential than the homogeneity, because we pay close attention to complex region than homogeneous region. Therefore, complex regions are essential for image compression. Since the complexity of regions of an image is quantified by values of LFD, we implemented variable block size using LFD values and constructed a codebook (CB) for a VQ. To confirm the performance of the proposed method, we only used a discriminant analysis and FGLA to construct a CB. Here, the FGLA is the algorithm to combine generalized Lloyd algorithm (GLA) and the fuzzy k means algorithm. Results of computational experiments showed that this method correctly encodes the regions that we pay close attention. This is a promising result for obtaining a well-perceived compressed image. Also, the performance of the proposed method is superior to that of VQ by FGLA in terms of both compression rate and decoded image quality. Furthermore, 1.0bpp and more than 30dB in PSNR by a CB with only 252 code-vectors were achieved using this method.