Quality Prediction of Compressed Images via Classification

Author(s):  
Jevgenij Tichonov ◽  
Olga Kurasova ◽  
Ernestas Filatovas
2014 ◽  
Vol 2014 ◽  
pp. 1-15 ◽  
Author(s):  
Hongxu Jiang ◽  
Kai Yang ◽  
Tingshan Liu ◽  
Yongfei Zhang

Accurate assessment and prediction of visual quality are of fundamental importance to lossy compression of remote sensing image, since it is not only a basic indicator of coding performance, but also an important guide to optimize the coding procedure. In the paper, a novel quality prediction model based on multiscale and multilevel distortion (MSMLD) assessment metric is preferred for DWT-based coding of remote sensing image. Firstly, we propose an image quality assessment metric named MSMLD, which assesses quality by calculating distortions in three levels and multiscale sampling between original images and compressed images. The MSMLD method not only has a better consistency with subjective perception values, but also shows the distortion features and visual quality of compressed image well. Secondly, some significant characteristics in spatial and wavelet domain that link well with quality criteria of MSMLD are chosen with multiple linear regression and used to establish a compression quality prediction model of MSMLD. Finally, the quality prediction model is extended to a wider range of compression ratios from 4 : 1 to 20 : 1 and tested with experiment. The experimental results show that the prediction accuracy of the proposed model is up to 98.33%, and its mean prediction error is less than state-of-the-art methods.


2016 ◽  
Author(s):  
Stephan Gelinsky ◽  
Sze-Fong Kho ◽  
Irene Espejo ◽  
Matthias Keym ◽  
Jochen Näth ◽  
...  

1992 ◽  
Author(s):  
D. D. Murphy ◽  
W. M. Thomas ◽  
W. M. Evanco ◽  
W. W. Agresti

2021 ◽  
pp. 1-11
Author(s):  
Kusan Biswas

In this paper, we propose a frequency domain data hiding method for the JPEG compressed images. The proposed method embeds data in the DCT coefficients of the selected 8 × 8 blocks. According to the theories of Human Visual Systems  (HVS), human vision is less sensitive to perturbation of pixel values in the uneven areas of the image. In this paper we propose a Singular Value Decomposition based image roughness measure (SVD-IRM) using which we select the coarse 8 × 8 blocks as data embedding destinations. Moreover, to make the embedded data more robust against re-compression attack and error due to transmission over noisy channels, we employ Turbo error correcting codes. The actual data embedding is done using a proposed variant of matrix encoding that is capable of embedding three bits by modifying only one bit in block of seven carrier features. We have carried out experiments to validate the performance and it is found that the proposed method achieves better payload capacity and visual quality and is more robust than some of the recent state-of-the-art methods proposed in the literature.


2021 ◽  
Vol 40 (5) ◽  
pp. 9361-9382 ◽  
Author(s):  
Naeem Iqbal ◽  
Rashid Ahmad ◽  
Faisal Jamil ◽  
Do-Hyeun Kim

Quality prediction plays an essential role in the business outcome of the product. Due to the business interest of the concept, it has extensively been studied in the last few years. Advancement in machine learning (ML) techniques and with the advent of robust and sophisticated ML algorithms, it is required to analyze the factors influencing the success of the movies. This paper presents a hybrid features prediction model based on pre-released and social media data features using multiple ML techniques to predict the quality of the pre-released movies for effective business resource planning. This study aims to integrate pre-released and social media data features to form a hybrid features-based movie quality prediction (MQP) model. The proposed model comprises of two different experimental models; (i) predict movies quality using the original set of features and (ii) develop a subset of features based on principle component analysis technique to predict movies success class. This work employ and implement different ML-based classification models, such as Decision Tree (DT), Support Vector Machines with the linear and quadratic kernel (L-SVM and Q-SVM), Logistic Regression (LR), Bagged Tree (BT) and Boosted Tree (BOT), to predict the quality of the movies. Different performance measures are utilized to evaluate the performance of the proposed ML-based classification models, such as Accuracy (AC), Precision (PR), Recall (RE), and F-Measure (FM). The experimental results reveal that BT and BOT classifiers performed accurately and produced high accuracy compared to other classifiers, such as DT, LR, LSVM, and Q-SVM. The BT and BOT classifiers achieved an accuracy of 90.1% and 89.7%, which shows an efficiency of the proposed MQP model compared to other state-of-art- techniques. The proposed work is also compared with existing prediction models, and experimental results indicate that the proposed MQP model performed slightly better compared to other models. The experimental results will help the movies industry to formulate business resources effectively, such as investment, number of screens, and release date planning, etc.


Author(s):  
Nicoletta Cantarini ◽  
Fabrizio Caselli ◽  
Victor Kac

AbstractGiven a Lie superalgebra $${\mathfrak {g}}$$ g with a subalgebra $${\mathfrak {g}}_{\ge 0}$$ g ≥ 0 , and a finite-dimensional irreducible $${\mathfrak {g}}_{\ge 0}$$ g ≥ 0 -module F, the induced $${\mathfrak {g}}$$ g -module $$M(F)={\mathcal {U}}({\mathfrak {g}})\otimes _{{\mathcal {U}}({\mathfrak {g}}_{\ge 0})}F$$ M ( F ) = U ( g ) ⊗ U ( g ≥ 0 ) F is called a finite Verma module. In the present paper we classify the non-irreducible finite Verma modules over the largest exceptional linearly compact Lie superalgebra $${\mathfrak {g}}=E(5,10)$$ g = E ( 5 , 10 ) with the subalgebra $${\mathfrak {g}}_{\ge 0}$$ g ≥ 0 of minimal codimension. This is done via classification of all singular vectors in the modules M(F). Besides known singular vectors of degree 1,2,3,4 and 5, we discover two new singular vectors, of degrees 7 and 11. We show that the corresponding morphisms of finite Verma modules of degree 1,4,7, and 11 can be arranged in an infinite number of bilateral infinite complexes, which may be viewed as “exceptional” de Rham complexes for E(5, 10).


Sign in / Sign up

Export Citation Format

Share Document