These [4, 5] methods has produced better image quality than JPEG in higher compression ratios.Sanjeev Kumar et al  described the usage of SVMregression to minimize the compression artifacts.
Since the hyper parameter searchcomplexity, The model being concluded as fewer efficient inlarge dataCompression based on DCT has some drawbacks asdescribed in the following section. The modern and papular still image compression standard called JPEG2000 uses DWTtechnology with the view of overcoming these limitations.It is also quite considerable that in color (RGB) imagecompression, it is a well-known fact that independentcompression of the R, G, B channels is sub-optimal as itignores the inherent coupling between the channels.Commonly, the RGB images are converted to YCbCr or someother unrelated color space followed by independentcompression in each channel, which is also part of theJPEG/JPEG-2000 standard. This limit encourages us to findefficient image and signal coding model particularly in RGBImages.To optimize these DWT based compression models, animage compression algorithm based on wavelet technologyand machine learning technique LS-SVM regression is proposed. The aim of the work is to describe the usage of novel mathematical models to optimize FHT is one of the popular DWT technique, QPSO is one of the effective hyper parameter search technique for SVM. The result of compression is considerable and comparative study withJPEG2000 standard concluding the significance of the proposed model.III.
HAAR and Fast HAAR Wavelet Transformation
The DWT is one of the fundamental processes in theJPEG2000 image compression algorithm. The DWT is atransform which can map a block of data in the spatial domaininto the frequency domain. The DWT returns informationabout the localized frequencies in the data set. A two-dimensional (2D) DWT is used for images. The 2D DWTdecomposes an image into four blocks, the approximationcoefficients and three detail coefficients. The details includethe horizontal, vertical, and diagonal coefficients. The lower frequency (approximation) portion of the image can be preserved, while the higher frequency portions may beapproximated more loosely without much visible quality loss.The DWT can be applied once to the image and then again tothe coefficients which the first DWT produced. It can bevisualized as an inverted treelike structure. The original imagesits at the top. The first level DWT decomposes the image intofour parts or branches, as previously mentioned. Each of thosefour parts can then have the DWT applied to them individually;splitting each into four distinct parts or branches. This methodis commonly known as wavelet packet decomposition
The Properties of the Haar and FHT Transform
Haar Transform is real and orthogonal. ThereforeHr=Hr* ……. (1)Hr
Haar Transform is a very fast transf orm.
The basis vectors of the Haar matrix are sequenceordered.
Haar Transform has poor energy compaction for images.
Orthogonal property: The original signal is split intoa low and a high frequency part, and filters enablingthe splitting without duplicating information are saidto be orthogonal.
Linear Phase: To obtain linear phase, symmetricfilters would have to be used.
Compact support: The magnitude response of thefilter should be exactly zero outside the frequencyrange covered by the transform. If this property issatisfied, the transform is energy invariant.
Perfect reconstruction: If the input signal istransformed and inversely transformed using a set of weighted basis functions, and the reproduced samplevalues are identical to those of the input signal, thetransform is said to have the perfect reconstruction property. If, in addition no information redundancy is present in the sampled signal, the wavelet transformis, as stated above, ortho normal. No wavelets can possess all these properties, so the choiceof the wavelet is decided based on the consideration of whichof the above points are important for a particular application.Haar-wavelet, Daubechies-wavelets and bi-orthogonalwavelets are popular choices. These wavelets have propertieswhich cover the requirements for a range of applications.
Quantitative Particle Swarm Optimization
The development in the field of quantum mechanics ismainly due to the findings of Bohr, de Broglie, Schrödinger,Heisenberg and Bohn in the early twentieth century. Their studies forced the scientists to rethink the applicability of classical mechanics and the traditional understanding of thenature of motions of microscopic objects .As per classical PSO, a particle is stated by its positionvector xi and velocity vector vi, which determine the trajectoryof the particle. The particle moves along a determinedtrajectory following Newtonian mechanics. However if weconsider quantum mechanics, then the term trajectory ismeaningless, because xi and vi of a particle cannot bedetermined simultaneously according to uncertainty principle.Therefore, if individual particles in a PSO system havequantum behavior, the performance of PSO will be far fromthat of classical PSO .In the quantum model of a PSO, the state of a particle isdepicted by wave function
, instead of position andvelocity. The dynamic behavior of the particle is widelydivergent from that of the particle in traditional PSO systems.In this context, the probability of the particle’s appearing in
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 9, No. 7, July 201153http://sites.google.com/site/ijcsis/ISSN 1947-5500