based on a multi-depth output network

被引:3
作者
Sang, Qingbing [1 ,2 ]
Su, Chenfei [1 ,2 ]
Zhu, Lingying [1 ,2 ]
Liu, Lixiong [3 ]
Wu, Xiaojun [1 ,2 ]
Bovik, Alan C. [4 ]
机构
[1] Jiangnan Univ, Sch Artificial Intelligence & Comp Sci, Wuxi, Jiangsu, Peoples R China
[2] Jiangsu Prov Engn Lab Pattern Recognit & Computat, Wuxi, Jiangsu, Peoples R China
[3] Beijing Inst Technol, Sch Comp Sci & Technol, Beijing, Peoples R China
[4] Univ Texas Austin, Lab Image & Video Engn, Austin, TX 78712 USA
基金
中国国家自然科学基金;
关键词
no-reference; image quality assessment; multi-depth output convolutional neural network; ensemble learning; IMAGE QUALITY ASSESSMENT; NATURAL SCENE STATISTICS;
D O I
10.1117/1.JEI.30.4.043007
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
When deep convolutional neural networks perform feature extraction, the features computed at each layer express different abstractions of visual information. The earlier layers extract highly compact low-level features such as bandpass and directional primitives, whereas deeper layers extract structural features of increasing abstraction, similar to contours, shapes, and edges, becoming less effable as the depth increases. We propose a different kind of end-to-end no-reference (NR) image quality assessment (IQA) model, which is defined as a multi-depth output convolutional neural network (MoNET). It accomplishes this by mapping both shallow and deep features to perceived quality. MoNET delivers three outputs that express shallow (lower-level) and deep (high-level) features, and maps them to subjective quality scores. The multiple outputs are combined into a single, final quality score. MoNET does this by combining the responses of three learning machines, so it may be viewed as a form of ensemble learning. The experimental results on three public image quality databases show that our proposed model achieves better performance than other state-of-the-art NR IQA algorithms. (c) 2021 SPIE and IS&T [DOI: 10.1117/1.JEI.30.4.043007]
引用
收藏
页数:17
相关论文
共 32 条
[11]   Convolutional Neural Networks for No-Reference Image Quality Assessment [J].
Kang, Le ;
Ye, Peng ;
Li, Yi ;
Doermann, David .
2014 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2014, :1733-1740
[12]   Fully Deep Blind Image Quality Predictor [J].
Kim, Jongyoo ;
Lee, Sanghoon .
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2017, 11 (01) :206-220
[13]   RankIQA: Learning from Rankings for No-reference Image Quality Assessment [J].
Liu, Xialei ;
Van de Weijer, Joost ;
Bagdanov, Andrew D. .
2017 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2017, :1040-1049
[14]   End-to-End Blind Image Quality Assessment Using Deep Neural Networks [J].
Ma, Kede ;
Liu, Wentao ;
Zhang, Kai ;
Duanmu, Zhengfang ;
Wang, Zhou ;
Zuo, Wangmeng .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2018, 27 (03) :1202-1213
[15]   Blind Quality Assessment Based on Pseudo-Reference Image [J].
Min, Xiongkuo ;
Gu, Ke ;
Zhai, Guangtao ;
Liu, Jing ;
Yang, Xiaokang ;
Chen, Chang Wen .
IEEE TRANSACTIONS ON MULTIMEDIA, 2018, 20 (08) :2049-2062
[16]   No-Reference Image Quality Assessment in the Spatial Domain [J].
Mittal, Anish ;
Moorthy, Anush Krishna ;
Bovik, Alan Conrad .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2012, 21 (12) :4695-4708
[17]   Blind Image Quality Assessment: From Natural Scene Statistics to Perceptual Quality [J].
Moorthy, Anush Krishna ;
Bovik, Alan Conrad .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2011, 20 (12) :3350-3364
[18]   A Two-Step Framework for Constructing Blind Image Quality Indices [J].
Moorthy, Anush Krishna ;
Bovik, Alan Conrad .
IEEE SIGNAL PROCESSING LETTERS, 2010, 17 (05) :513-516
[19]   Image database TID2013: Peculiarities, results and perspectives [J].
Ponomarenko, Nikolay ;
Jin, Lina ;
Ieremeiev, Oleg ;
Lukin, Vladimir ;
Egiazarian, Karen ;
Astola, Jaakko ;
Vozel, Benoit ;
Chehdi, Kacem ;
Carli, Marco ;
Battisti, Federica ;
Kuo, C. -C. Jay .
SIGNAL PROCESSING-IMAGE COMMUNICATION, 2015, 30 :57-77
[20]   THE STATISTICS OF NATURAL IMAGES [J].
RUDERMAN, DL .
NETWORK-COMPUTATION IN NEURAL SYSTEMS, 1994, 5 (04) :517-548