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

2016 4th IEEE International Conference on Cloud Computing and Intelligence Systems（IEEE CCIS2016）

作者： Linghui Li Junping Du Meiyu Liang JangM yung Lee Luoming Meng Beijing Key Laboratory of Intelligent Telecommunication Software and Multimedia School of Computer ScienceBeijing University of Posts and Telecommunications Department of Electronics Engineering Pusan National University State Key Laboratory Network & Switching Technology Beijing University of Posts and Telecommunications

ISBN: (纸本)9781509012572

Aiming at recovering lost detailed information in low-resolution videos, a novel video super-resolution algorithm based on nonlinear mapping and patch similarity was proposed in this paper. Taking advantage of the strong fitting ability of the convolutional neural network for the nonlinear relationship, this algorithm utilizes the learned reconstruction parameters to pad missing structures and make the low-resolution video approach to the ground truth. However, it is unavoidable to introduce irrelevant information and amplify noises in this process. The patch similarity is imported to improve the spatial-temporal consistency and anti-noise ability of this algorithm. Moreover, instead of considering the nonlocal self-similarity only, this algorithm combines the nonlocal external sparsity and spatial-temporal similarity to enrich the prior information. All these patch similarities are used to optimize the intermediate video achieved from the mapping process. Experimental results demonstrated that the proposed algorithm achieves a competitive super-resolution quality on both the subjective and the objective evaluations, when compared to other state-of-the-art algorithms.

关键词： video super-resolution reconstruction convolutional neural network nonlocal similarity

来源：评论

学校读者我要写书评

暂无评论

A simple probabilistic extension of modal Mu-calculus 24

A simple probabilistic extension of modal Mu-calculus

引用

24th International Joint Conference on Artificial Intelligence, IJCAI 2015

作者： Liu, Wanwei Song, Lei Wang, Ji Zhang, Lijun School of Computer Science National University of Defense Technology Changsha China University of Technology Sydney Australia State Key Lab. of HPC National University of Defense Technology Changsha China State Key Lab. of Computer Science Institute of Software CAS Beijing China

ISBN: (纸本)9781577357384

Probabilistic systems are an important theme in AI domain. As the specification language, PCTL is the most frequently used logic for reasoning about probabilistic properties. In this paper, we present a natural and succinct probabilistic extension of μ-calculus, another prominent logic in the concurrency theory. We study the relationship with PCTL. Surprisingly, the expressiveness is highly orthogonal with PCTL. The proposed logic captures some useful properties which cannot be expressed in PCTL. We investigate the model checking and satisfiability problem, and show that the model checking problem is in UP ∩co-UP, and the satisfiability checking can be decided via reducing into solving parity games. This is in contrast to PCTL as well, whose satisfiability checking is still an open problem.

关键词： Specification languages

来源：评论

学校读者我要写书评

暂无评论

Single image-based data-driven indoor scene modeling

引用

computers & Graphics 2015年 53卷 210-223页

作者： Yan Zhang Zicheng Liu Zheng Miao Wentao Wu Kai Liu Zhengxing Sun State Key Lab for Novel Software Technology Nanjing University China Department of Computer Science and Technology Nanjing University China

With a single input indoor image (including sofa, tea table, etc.), a 3D scene can be reconstructed from a single image using an existing model library in three stages: image analysis, model retrieval and relevance feedback. In the image analysis stage, we obtain the object information from the input image using geometric reasoning technology combined with an image segmentation method. In the model retrieval stage, line drawings are extracted from 2D objects and 3D models by using different line rendering methods. We exploit various tokens to represent local features and then organize them together as a star-graph to show a global description. By comparing similarity among the encoded line drawings, models are retrieved from the model library. Also, for a better user experience, we add a relevance feedback stage following the retrieval stage. The Support Vector Machine method is used to conduct the feedback operation. After this stage, the retrieved models are in conformance with the image semantic. The 3D scene is then reconstructed. Experimental results show that, driven by the given model library, indoor scenes modeling from a single image could be achieved automatically and efficiently.

关键词： Data-driven Indoor scenes modeling Single image Image analysis Model retrieval Relevance feedback

来源：评论

学校读者我要写书评

暂无评论

Text detection in born-digital images by mass estimation 3

Text detection in born-digital images by mass estimation

引用

3rd IAPR Asian Conference on Pattern Recognition, ACPR 2015

作者： Xu, Jiamin Shivakumara, Palaiahnakote Lu, Tong Tan, Chew Lim Blumenstein, Michael National Key Lab for Novel Software Technology Nanjing University Nanjing China Faculty of Computer Science and Information Technology University of Malaya Kuala Lumpur Malaysia School of Computing National University of Singapore Singapore Griffith University Gold CoastQLD4222 Australia

ISBN: (纸本)9781479961009

There is a need for effective web-document understanding due to the explosive progress of internet and network technologies. In this paper, we propose a new method for text detection in born-digital images by introducing a mass estimation concept. We propose to explore super-pixel information of different color channels to identify text atoms in images. The proposed method uses similarity graphs and spectral clustering to identify candidate text regions. We propose a new idea of mapping Gabor responses of a candidate text region to a spatial circle to study the spatial coherency of pixels. We introduce a mass estimation concept to identify text candidates from the pixel distribution in a spatial circle. The linear linkage graphs help in grouping text candidates to obtain full text lines. The same Gabor responses are used as features to eliminate false positives with an SVM classifier. We evaluate the proposed method for the testing on standard datasets, such as ICDAR 2013 (challenge-1) and the Situ et al. dataset. Experimental results on both the datasets show that the proposed method outperforms the existing methods. © 2015 IEEE.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Solving the Data Imbalance Problem of P300 Detection via Random Under-Sampling Bagging SVMs

Solving the Data Imbalance Problem of P300 Detection via Ran...

引用

International Joint Conference on Neural Networks

作者： Xiaofeng Shi Guoqiang Xu Furao Shen Jinxi Zhao The National Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University China

ISBN: (纸本)9781479919611

The imbalance problem exists in P300 EEG data sets because P300 potential are collected under the condition of Oddball experimental paradigm. Hence, a P300 detection method, namely RUSBagging SVMs, is proposed in this paper to solve the imbalance problem and make an improvement. This algorithm re-samples the data sets at first to generate a rebalanced training set in one round of iteration and trains an SVM classifier based on the training set. Next, the SVM classifiers are integrated to make a final decision. In the integration of several classifiers, the information that is lost in the under-sampling process is generally considered. Therefore, the method is relatively robust. The experiments of character recognition based on P300 EEG data signals are conducted to examine the method. It is concluded from the experiments that RUSBagging method can indeed improve the performance of P300 detection by solving the imbalance problem in EEG data sets.

关键词： Data Imbalance Problem P300 Detection Random Under-Sampling Bagging SVMs Balance impairment Classifiers Representation of data Dataset Electroencephalography Random bagging PURSE Character recognition Support Vector Network data signal iterative methods

来源：评论

学校读者我要写书评

暂无评论

PFrauDetector: A Parallelized Graph Mining Approach for Efficient Fraudulent Phone Call Detection

PFrauDetector: A Parallelized Graph Mining Approach for Effi...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Josh Jia-Ching Ying Ji Zhang Che-Wei Huang Kuan-Ta Chen Vincent S. Tseng Department of Computer Science and Information Engineering Feng Chia University Taiwan ROC Faculty of Health University of Southern Queensland Australia Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China Department of Computer Science and Information Engineering National Cheng Kung University Taiwan ROC Institute of Information Science Academia Sinica Taiwan ROC Department of Computer Science National Chiao Tung University Taiwan ROC

ISBN: (纸本)9781509053827

In recent years, fraud is becoming more rampant internationally with the development of modern technology and global communication. Due to the rapid growth in the volume of call logs, the task of fraudulent phone call detection is confronted with Big Data issues in real-world implementations. While our previous work, FrauDetector, has addressed this problem and achieved some promising results, it can be further enhanced as it focuses on the fraud detection accuracy while the efficiency and scalability are not on the top priority. Meanwhile, other known approaches suffer from long training time and/or cannot accurately detect fraudulent phone calls in real time. In this paper, we propose a highly-efficient parallelized graph-mining-based fraudulent phone call detection framework, namely PFrauDetector, which is able to automatically label fraudulent phone numbers with a "fraud" tag, a crucial prerequisite for distinguishing fraudulent phone call numbers from the normal ones. PFrauDetector generates smaller, more manageable sub-networks from the original graph and performs a parallelized weighted HITS algorithm for significant speed acceleration in the graph learning module. It adopts a novel aggregation approach to generate the trust (or experience) value for each phone number (or user) based on their respective local values. We conduct a comprehensive experimental study based on a real dataset collected through an anti-fraud mobile application, Whoscall. The results demonstrate a significantly improved efficiency of our approach compared to FrauDetector and superior performance against other major classifier-based methods.

关键词： Communications technology Training Real-time systems Feature extraction computer science Training data Parallel processing

来源：评论

学校读者我要写书评

暂无评论

The 5th International Conference on Biomedical Engineering and Biotechnology (ICBEB 2016) Abstracts

引用

BMC MEDICAL IMAGING 2016年第SUPPL 1期16卷 65-65页

作者： [Anonymous] Department of MRI Shandong Medical Imaging Research Institute Affiliated to Shandong University Jinan Shandong 250021 People’s Republic of China Department of Interventional Radiology Shandong Provincial Hospital Affiliated to Shandong University Jinan Shandong 250021 People’s Republic of China College of Information Science and Technology Engr. Research Center of Digitized Textile & Fashion Tech. for Ministry of Education Donghua University Shanghai 201620 China Intelligent multimedia information processing Lab College of Software Northeastern University Shenyang Liaoning Province 110004 China Institute of Biomedical and Health Engineering Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen 518055 China School of Computer Science and Technology Nanjing Normal University Nanjing China Department of Electrical Engineering The City College of New York CUNY New York USA Jiangsu Key Laboratory of 3D Printing Equipment and Manufacturing Nanjing China School of Electronic Science and Engineering Nanjing University Nanjing Jiangsu 210046 China College of Engineering Nanyang Technological University Singapore 639798 Singapore School of Electronic Information Shanghai Dianji University Shanghai China School of Natural Sciences and Mathematics Shepherd University Shepherdstown WV 25443 USA Davis College of Agriculture Natural Resources and Design West Virginia University Morgantown WV 26505 USA State Key Laboratory of Millimeter Waves Southeast University Nanjing 210096 China Center of Medical Physics and Technology Hefei Institutes of Physical Science Chinese Academy of Sciences Hefei China College of Agricultural and Life Sciences University of Florida Gainesville FL 32611 USA Courant Institute of Mathematical Sciences New York University New York NY 10012 USA Translational Imaging Division & MRI Unit Columbia University and New York State Psychiatric Institute New York NY 10032 USA Guangxi Key Laboratory of Manufacturing System & Adv

来源：评论

学校读者我要写书评

暂无评论

Hardware-assisted fine-grained code-reuse attack detection 18th

Hardware-assisted fine-grained code-reuse attack detection

引用

18th International Symposium on Research in Attacks, Intrusions, and Defenses, RAID 2015

作者： Yuan, Pinghai Zeng, Qingkai Ding, Xuhua State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Department of Computer Science and Technology Nanjing University Nanjing China School of Information Systems Singapore Management University Singapore Singapore

ISBN: (纸本)9783319263618

Code-reuse attacks have become the primary exploitation technique for system compromise despite of the recently introduced Data Execution Prevention technique in modern platforms. Different from code injection attacks, they result in unintended control-flow transfer to victim programs without adding malicious code. This paper proposes a practical scheme named as CFI Guard to detect code-reuse attacks on user space applications. CFI Guard traces every branch execution by leveraging hardware features of commodity processors, and then validates the traces based on fine-grained control flow graphs. We have implemented a prototype of CFI Guard on Linux and the experiments show that it only incurs around 2.9% runtime overhead for a set of typical server applications. © Springer International Publishing Switzerland 2015.

关键词： Space applications

来源：评论

学校读者我要写书评

暂无评论

Analyzing eventual leader election protocols for dynamic systems by probabilistic model checking 1st

Analyzing eventual leader election protocols for dynamic sys...

引用

1st International Conference on Cloud Computing and Security, ICCCS 2015

作者： Gu, Jiayi Zhou, Yu Wu, Weigang Chen, Taolue College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing210016 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China Department of Computer Science Sun Yat-sen University Guangzhou510006 China Department of Computer Science Middlesex University London United Kingdom

ISBN: (纸本)9783319270500

Leader election protocols have been intensively studied in distributed computing, mostly in the static setting. However, it remains a challenge to design and analyze these protocols in the dynamic setting, due to its high uncertainty, where typical properties include the average steps of electing a leader eventually, the scalability etc. In this paper, we propose a novel model-based approach for analyzing leader election protocols of dynamic systems based on probabilistic model checking. In particular, we employ a leading probabilistic model checker, PRISM, to simulate representative protocol executions. We also relax the assumptions of the original model to cover unreliable channels which requires the introduction of probability to our model. The experiments confirm the feasibility of our approach. © Springer International Publishing Switzerland 2015.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Spatial mixing and the connective constant: Optimal bounds 26

Spatial mixing and the connective constant: Optimal bounds

引用

26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015

作者： Sinclair, Alistair Srivastava, Piyush Štefankovič, Daniel Yin, Yitong Computer Science Division UC Berkeley United States Center for the Mathematics of Information Caltech United States Department of Computer Science University of Rochester United States State Key Laboratory for Novel Software Technology Nanjing University China

ISBN: (纸本)9781611973747

We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model (which is defined as a weighted sum over all matchings where each matching is given a weight λ|v|-2lMl in terms of a fixed parameter λ called the monomer activity) and the hard core model (which is defined as a weighted sum over all independent sets where an independent set I is given a weight λ|I| in terms of a fixed parameter λ called the vertex activity). The connective constant is a natural measure of the average degree of a graph which has been studied extensively in combinatorics and mathematical physics, and can be bounded by a constant even for certain unbounded degree graphs such as those sampled from the sparse Erdös-Rényi model Q (n, djn). Our main technical contribution is to prove the best possible rates of decay of correlations in the natural probability distributions induced by both the hard core model and the monomer-dimer model in graphs with a given bound on the connective constant. These results on decay of correlations are obtained using a new framework based on the so-called message approach that has been extensively used recently to prove such results for bounded degree graphs. We then use these optimal decay of correlations results to obtain FPTASs for the two problems on graphs of bounded connective constant. In particular, for the monomer-dimer model, we give a deterministic FPTAS for the partition function on all graphs of bounded connective constant for any given value of the monomer activity. The best previously known deterministic algorithm was due to Bayati, Gamarnik, Katz, Nair and Tetali [STOC 2007], and gave the same runtime guarantees as our results but only for the case of bounded degree graphs. For the hard core model, we give an FPTAS for graphs of connective constant Δ whenever the vertex acti

关键词： Monomers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：