检索结果-内蒙古大学图书馆

No reference video quality assessment based on 3D convolutional neural network

Ruan Jian Xue Bao/Journal of Software 2016年 27卷 103-112页

作者： Wang, Chun-Feng Su, Li Zhang, Wei-Gang Huang, Qing-Ming Key Laboratory on Big Data Mining and Knowledge Management University of Chinese Academy of Sciences Beijing100049 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology The Chinese Academy of Sciences Beijing100190 China Weihai264209 China

No reference video quality assessment (NR-VQA) measures distorted videos quantitatively without the reference of original high quality videos. Conventional NR-VQA methods are generally designed for specific types of distortions, or not consistent with human's perception. This paper innovatively introduces 3D deep convolutional neural network (3D-CNN) into VQA and proposes a 3D-CNN based NR-VQA method, which is universal for non-specific types of distortions. First, the proposed method utilizes 3D patches to learn spatio-temporal features that represent video content effectively. Second, the original 3D-CNN model is modified which is used to classify videos to make it adapt to VQA task. Experiments demonstrate that the proposed method is highly consistent with human's perception across numerous distortions and metrics. Compared with other state-of-the-art no-reference VQA methods, the proposed method runs much faster while keeping the similar performance. As a no-reference VQA method, it is even comparable with many of the state-of-the-art full-reference VQA methods, which provides the proposed method with better application prospects. © Copyright 2016, Institute of Software, the Chinese Academy of Sciences. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Adaptive sparse recovery based on difference algorithm

引用

Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics 2015年第6期27卷 1047-1052页

作者： Zhang, Fengzhen Zhao, Ruizhen Cen, Yigang Hu, Shaohai Zhang, Yongdong Institute of Information Science Beijing Jiaotong University Beijing100044 China Key Laboratory of Advanced Information Science and Network Technology of Beijing Beijing100044 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China

To improve the disadvantages that iterative reconstruction algorithms of compressed sensing need priori knowledge of the sparsity of original signal or iterative threshold, an adaptive sparse recovery based on difference algorithm is proposed. When the sparsity of original signal is unknown, the proposed algorithm takes advantage of unbalance of correlation coefficient between the measurement matrix and residual. With those properties, the proposed algorithm can select the support set of the original signal, and approach the sparsity of the original signal. Simulation results show that the proposed algorithm obtains better recovery results under the same conditions. Especially in the lower sampling rate, the advantage is more obvious. ©, 2015, Institute of computing technology. All right reserved.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

The Liver Tumor Segmentation Benchmark (LiTS)

arXiv

引用

arXiv 2019年

作者： Bilic, Patrick Christ, Patrick Li, Hongwei Bran Vorontsov, Eugene Ben-Cohen, Avi Kaissis, Georgios Szeskin, Adi Jacobs, Colin Mamani, Gabriel Efrain Humpire Chartrand, Gabriel Lohöfer, Fabian Holch, Julian Walter Sommer, Wieland Hofmann, Felix Hostettler, Alexandre Lev-Cohain, Naama Drozdzal, Michal Amitai, Michal Marianne Vivanti, Refael Sosna, Jacob Ezhov, Ivan Sekuboyina, Anjany Navarro, Fernando Kofler, Florian Paetzold, Johannes C. Shit, Suprosanna Hu, Xiaobin Lipková, Jana Rempfler, Markus Piraud, Marie Kirschke, Jan Wiestler, Benedikt Zhang, Zhiheng Hülsemeyer, Christian Beetz, Marcel Ettlinger, Florian Antonelli, Michela Bae, Woong Bellver, Míriam Bi, Lei Chen, Hao Chlebus, Grzegorz Dam, Erik B. Dou, Qi Fu, Chi-Wing Georgescu, Bogdan Giró-I-Nieto, Xavier Gruen, Felix Han, Xu Heng, Pheng-Ann Hesser, Jürgen Moltz, Jan Hendrik Igel, Christian Isensee, Fabian Jäger, Paul Jia, Fucang Kaluva, Krishna Chaitanya Khened, Mahendra Kim, Ildoo Kim, Jae-Hun Kim, Sungwoong Kohl, Simon Konopczynski, Tomasz Kori, Avinash Krishnamurthi, Ganapathy Li, Fan Li, Hongchao Li, Junbo Li, Xiaomeng Lowengrub, John Ma, Jun Maier-Hein, Klaus Maninis, Kevis-Kokitsi Meine, Hans Merhof, Dorit Pai, Akshay Perslev, Mathias Petersen, Jens Pont-Tuset, Jordi Qi, Jin Qi, Xiaojuan Rippel, Oliver Roth, Karsten Sarasua, Ignacio Schenk, Andrea Shen, Zengming Torres, Jordi Wachinger, Christian Wang, Chunliang Weninger, Leon Wu, Jianrong Xu, Daguang Yang, Xiaoping Yu, Simon Chun-Ho Yuan, Yading Yue, Miao Zhang, Liping Cardoso, Jorge Bakas, Spyridon Braren, Rickmer Heinemann, Volker Pal, Christopher Tang, An Kadoury, Samuel Soler, Luc van Ginneken, Bram Greenspan, Hayit Joskowicz, Leo Menze, Bjoern Department of Informatics Technical University of Munich Germany Department of Quantitative Biomedicine University of Zurich Switzerland Ecole Polytechnique de Montréal Canada Department of Medical Imaging Radboud University Medical Center Nijmegen Netherlands Department of Biomedical Engineering Tel-Aviv University Israel Germany Pattern Analysis and Learning Group Department of Radiation Oncology Heidelberg University Hospital Heidelberg Germany Philips Research China Philips China Innovation Campus Shanghai China School of Biomedical Engineering & Imaging Sciences King0s College London London United Kingdom Institute for AI in Medicine Technical University of Munich Germany Department of Computer Science Guangdong University of Foreign Studies China Institute for diagnostic and interventional radiology Klinikum rechts der Isar Technical University of Munich Germany Institute for Diagnostic and Interventional Neuroradiology Klinikum Rechts der Isar Technical University of Munich Germany Department of Hepatobiliary Surgery The Affiliated Drum Tower Hospital Nanjing University Medical School China Department of Computing Imperial College London London United Kingdom Institute for Tissue Engineering and Regenerative Medicine Helmholtz Zentrum München Neuherberg Germany Brigham and Women's Hospital Harvard Medical School United States School of Computer Science and Engineering The Hebrew University of Jerusalem Israel University of Pennsylvania PA United States Pte. Ltd. Singapore Medical Imaging and Reconstruction Lab Department of Engineering Design Indian Institute of Technology Madras India Sensetime Shanghai China Department of Radiology Perelman School of Medicine University of Pennsylvania United States Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania PA United States Co. Ltd China MontréalQC Canada Department of Radiology Radiation Oncology and Nuclear Medicine University of Montréal

In this work, we report the set-up and results of the Liver Tumor Segmentation Benchmark (LiTS), which was organized in conjunction with the IEEE International Symposium on Biomedical Imaging (ISBI) 2017 and the International Conferences on Medical Image computing and Computer-Assisted Intervention (MICCAI) 2017 and 2018. The image dataset is diverse and contains primary and secondary tumors with varied sizes and appearances with various lesion-to-background levels (hyper-/hypo-dense), created in collaboration with seven hospitals and research institutions. Seventy-five submitted liver and liver tumor segmentation algorithms were trained on a set of 131 computed tomography (CT) volumes and were tested on 70 unseen test images acquired from different patients. We found that not a single algorithm performed best for both liver and liver tumors in the three events. The best liver segmentation algorithm achieved a Dice score of 0.963, whereas, for tumor segmentation, the best algorithms achieved Dices scores of 0.674 (ISBI 2017), 0.702 (MICCAI 2017), and 0.739 (MICCAI 2018). Retrospectively, we performed additional analysis on liver tumor detection and revealed that not all top-performing segmentation algorithms worked well for tumor detection. The best liver tumor detection method achieved a lesion-wise recall of 0.458 (ISBI 2017), 0.515 (MICCAI 2017), and 0.554 (MICCAI 2018), indicating the need for further research. LiTS remains an active benchmark and resource for research, e.g., contributing the liver-related segmentation tasks in http://***/. In addition, both data and online evaluation are accessible via ***. © 2019, CC BY-NC-ND.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Social-relational topic model for social networks 15

Social-relational topic model for social networks

引用

24th ACM International Conference on information and Knowledge Management, CIKM 2015

作者： Guo, Weiyu Wu, Shu Wang, Liang Tan, Tieniu Center for Research on Intelligent Perception and Computing National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing100190 China College of Engineering and Information Technology University of Chinese Academy of Sciences Beijing100049 China

ISBN: (纸本)9781450337946

Social networking services, such as Twitter and Sina Weibo, have tremendous popularity in recent years. Mass of short texts and social links are aggregated into these service platforms. To realize personalized services on social network, topic inference from both short texts and social links plays more and more important role. Most conventional topic modeling methods focus on analyzing formal texts, e.g., papers, news and blogs, and usually assume that the links are only generated by topical factors. As a result, on social network, the learned topics of these methods are usually affected by topic-irrelevant links. Recently, a few approaches use artificial priors to recognize the links generated by the popularity factor in topic modeling. However, employing global priors, these methods can not well capture the distinct properties of each link and still suffer from the effect of topic-irrelevant links. To address the above limitations, we propose a novel Social-Relational Topic Model (SRTM), which can alleviate the effect of topic-irrelevant links by analyzing relational users' topics of each link. SRTM jointly models texts and social links for learning the topic distribution and topical influence of each user. The experimental results show that, our model outperforms the state-of-the-arts in topic modeling and social link prediction. © 2015 ACM.

关键词： User profile

来源：评论

学校读者我要写书评

暂无评论

A kind of binary image complete level authentication method based on hamming code and digital watermark

引用

Journal of information and Computational Science 2015年第1期12卷 181-190页

作者： Li, Min Deng, Shaobo Scholar of Information Engineering Nanchang Institute of Technology Nanchang China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China

Each pixel of the binary image can be viewed as a binary number. Base on this characteristic, we design a supervisory relationship. A detection image is gotten from the supervisory relationship and binary image. Based on this, a kind of pixel level digital watermark complete authentication method is put forward. This method is able to conduct binary image pixel authentication. When authenticating, only from the detection image, people can accurately identify whether a pixel point is falsified or not, furthermore, it has falsification localization and repair capacity.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Improving vehicle detection accuracy based on vehicle shadow and superposition elimination

引用

Open Mechanical Engineering Journal 2015年第1期9卷 1039-1044页

作者： Zhu, Hongjin Fan, Honghui Ye, Feiyue Zhao, Xiaorong School of Computer Engineering Jiangsu University of Technology Changzhou China Key Laboratory of Cloud Computing and Intelligent Information Changzhou China

Vehicle shadow and superposition have a great influence on the accuracy of vehicles detection in traffic video. Many background models have been proposed and improved to deal with detection moving object. This paper presented a method which improves Gaussian mixture model to get adaptive background. The HSV color space was used to eliminate vehicle shadow, it was based on a computational colour space that makes use of our shadow model. Vehicle superposition elimination was discussed based on vehicle contour dilation and erosion method. Experiments were performed to verify that the proposed technique is effective for vehicle detection based traffic surveillance systems. Detection results showed that our approach was robust to widely different background and illuminations. © Cao et al.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

Diffie-Hellman key exchange protocol based on ring-LWE

引用

Open Cybernetics and Systemics Journal 2015年第1期9卷 1033-1037页

作者： Zhi-Min, Yu Zheng-Jun, Jing Shi-Cun, Li Key Laboratory of Cloud Computing and Intelligent Information Processing of Changzhou City Jiangsu University of Technology ChangzhouJiangsu213001 China

In this paper, we first construct a one-round Diffie-Hellman key exchange protocol based on Ring-LWE. The security of our construction is based on the hardness of the Ring-LWE problem. Second, we adaptively extend our construction from Ring-LWE to LWE. Finally, we efficiently implement our key exchange protocols based on Ring-LWE and LWE. © Zhi-Min et al.

关键词： Diffie-Hellman key exchange LWE Ring-LWE Security

来源：评论

学校读者我要写书评

暂无评论

Discriminant Analysis on Riemannian Manifold of Gaussian Distributions for Face Recognition with Image Sets

Discriminant Analysis on Riemannian Manifold of Gaussian Dis...

引用

IEEE Conference on Computer Vision and Pattern Recognition

作者： Wen Wang Ruiping Wang Zhiwu Huang Shiguang Shan Xilin Chen Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS

ISBN: (纸本)9781467369657

This paper presents a method named Discriminant Analysis on Riemannian manifold of Gaussian distributions (DARG) to solve the problem of face recognition with image sets. Our goal is to capture the underlying data distribution in each set and thus facilitate more robust classification. To this end, we represent image set as Gaussian Mixture Model (GMM) comprising a number of Gaussian components with prior probabilities and seek to discriminate Gaussian components from different classes. In the light of information geometry, the Gaussians lie on a specific Riemannian manifold. To encode such Riemannian geometry properly, we investigate several distances between Gaussians and further derive a series of provably positive definite probabilistic kernels. Through these kernels, a weighted Kernel Discriminant Analysis is finally devised which treats the Gaussians in GMMs as samples and their prior probabilities as sample weights. The proposed method is evaluated by face identification and verification tasks on four most challenging and largest databases, YouTube Celebrities, COX, YouTube Face DB and Point-and-Shoot Challenge, to demonstrate its superiority over the state-of-the-art.

关键词： Kernel Manifolds Gaussian distribution Face recognition Covariance matrices Data models Adaptation models

来源：评论

学校读者我要写书评

暂无评论

Build emotion lexicon from microblogs by combining effects of seed words and emoticons in a heterogeneous graph 15

Build emotion lexicon from microblogs by combining effects o...

引用

26th ACM Conference on Hypertext and Social Media, HT 2015

作者： Song, Kaisong Feng, Shi Gao, Wei Wang, Daling Chen, Ling Zhang, Chengqi School of Information Science and Engineering Northeastern University Shenyang China Key Laboratory of Medical Image Computing Northeastern University Ministry of Education China Qatar Computing Research Institute Hamad Bin Khalifa University Doha Qatar Centre for Quantum Computation and Intelligent Systems University of Technology Sydney Australia

ISBN: (纸本)9781450333955

As an indispensable resource for emotion analysis, emotion lexicons have attracted increasing attention in recent years. Most existing methods focus on capturing the single emotional effect of words rather than the emotion distributions which are helpful to model multiple complex emotions in a subjective text. Meanwhile, automatic lexicon building methods are overly dependent on seed words but neglect the effect of emoticons which are natural graphical labels of fine-grained emotion. In this paper, we propose a novel emotion lexicon building framework that leverages both seed words and emoticons simultaneously to capture emotion distributions of candidate words more accurately. Our method overcomes the weakness of existing methods by combining the effects of both seed words and emoticons in a unified three-layer heterogeneous graph, in which a multi-label random walk (MLRW) algorithm is performed to strengthen the emotion distribution estimation. Experimental results on real-world data reveal that our constructed emotion lexicon achieves promising results for emotion classification compared to the state-of-the-art lexicons. © 2015 ACM.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Noisy image super-resolution reconstruction based on sparse representation

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2015年第4期52卷 943-951页

作者： Dou, Nuo Zhao, Ruizhen Cen, Yigang Hu, Shaohai Zhang, Yongdong Institute of Information Science Beijing Jiaotong University Beijing100044 China Beijing Key Laboratory of Advanced Information Science and Network Technology Institute of Information Science Beijing Jiaotong University Beijing100044 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China

Denoising and super-resolution reconstruction are performed separately in traditional methods for noisy image super-resolution reconstruction, while in the noisy image super-resolution reconstruction method based on sparse representation and dictionary learning the two processes are compounded together. Since an image patch can be well represented as a sparse linear combination of elements from an appropriately chosen over-complete dictionary, two dictionaries are trained respectively from noisy low-and clean high-resolution image patches by enforcing the similarity of two sparse representations with respect to their own dictionary. Given a noisy low-resolution image, sparse representations of low-resolution patches via trained low-dictionary are computed, then the high-resolution image can be reconstructed from high-resolution patches with the help of the related low-resolution sparse representations and trained high-dictionary, after global optimization a clean high-resolution is obtained to accomplish the goal of image super-resolution and denosing simultaneously. The experiments show that zooming low-resolution image to a middle-resolution using locally adaptive zooming algorithm for extracting features can get a better reconstructed image than bicubic interpolation algorithm. By setting the parameter λ, we can obtain the best performance both in super-resolution and denoising with absolute advantages in image quality and visual effect, which demonstrates the validity and robustness of our algorithm. ©, 2015, Science Press. All right reserved.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：