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

arXiv 2017年

作者： Fan, Zhun Lu, Jiewei Li, Wenji Wei, Caimin Huang, Han Cai, Xinye Chen, Xinjian Guangdong Provincial Key Laboratory of Digital Signal and Image Processing College of Engineering Shantou University Shan'tou515063 China Department of Mathematics Shantou University Shan'tou515063 China School of Software Engineering South China University of Technology Guang'zhou510006 China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Jiang'su210016 China Medical Image Processing and Analysis Lab School of Electronics and Information Engineering Soochow University Su'zhou215006 China

In this paper, a hierarchical image matting model is proposed to extract blood vessels from fundus images. More specifically, a hierarchical strategy utilizing the continuity and extendibility of retinal blood vessels is integrated into the image matting model for blood vessel segmentation. Normally the matting models require the user specified trimap, which separates the input image into three regions manually: the foreground, background and unknown regions. However, since creating a user specified trimap is a tedious and time-consuming task, region features of blood vessels are used to generate the trimap automatically in this paper. The proposed model has low computational complexity and outperforms many other state-of-art supervised and unsupervised methods in terms of accuracy, which achieves a vessel segmentation accuracy of 96.0%, 95.7% and 95.1% in an average time of 10.72s, 15.74s and 50.71s on images from three publicly available fundus image datasets DRIVE, STARE, and CHASE_DB1, respectively. Copyright © 2017, The Authors. All rights reserved.

关键词： Blood vessels

来源：评论

学校读者我要写书评

暂无评论

ONLINE PERSONALIZED QOS PREDICTION APPROACH FOR CLOUD SERVICES

ONLINE PERSONALIZED QOS PREDICTION APPROACH FOR CLOUD SERVIC...

引用

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

作者： Jianlong Xu Zibin Zheng Zhun Fan Wenhua Liu Guangdong Provincial Key Laboratory of Digital Signal and Image Processing Department of Electronics EngineeringShantou University College of Science Shantou University School of Data and Computer Science Sun Yat-sen University

ISBN: (纸本)9781509012572

Personalized Quality-of-Service(Qo S) prediction is an indispensable technique to select suitable services for service-based cloud applications. Considering the dynamic nature of services, efficiently and accurately predicting Qo S value becomes an urgent and crucial research issue. In this paper, we propose an online personalized Qo S prediction approach for cloud service, namely online learning based matrix factorization(OLMF). We build the objective function of online matrix factorization and use stochastic gradient descent algorithm to solve the function. Extensive experiments are conducted on real world public datasets, which verify the effectiveness and efficiency of our proposed approach.

关键词： Cloud service Online learning QoS prediction Matrix factorization Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Author Correction: Why rankings of biomedical image analysis competitions should be interpreted with care

引用

Nature communications 2019年第1期10卷 588页

作者： Lena Maier-Hein Matthias Eisenmann Annika Reinke Sinan Onogur Marko Stankovic Patrick Scholz Tal Arbel Hrvoje Bogunovic Andrew P Bradley Aaron Carass Carolin Feldmann Alejandro F Frangi Peter M Full Bram van Ginneken Allan Hanbury Katrin Honauer Michal Kozubek Bennett A Landman Keno März Oskar Maier Klaus Maier-Hein Bjoern H Menze Henning Müller Peter F Neher Wiro Niessen Nasir Rajpoot Gregory C Sharp Korsuk Sirinukunwattana Stefanie Speidel Christian Stock Danail Stoyanov Abdel Aziz Taha Fons van der Sommen Ching-Wei Wang Marc-André Weber Guoyan Zheng Pierre Jannin Annette Kopp-Schneider Division of Computer Assisted Medical Interventions (CAMI) German Cancer Research Center (DKFZ) 69120 Heidelberg Germany. l.maier-hein@dkfz.de. Division of Computer Assisted Medical Interventions (CAMI) German Cancer Research Center (DKFZ) 69120 Heidelberg Germany. Centre for Intelligent Machines McGill University Montreal QC H3A0G4 Canada. Christian Doppler Laboratory for Ophthalmic Image Analysis Department of Ophthalmology Medical University Vienna 1090 Vienna Austria. Science and Engineering Faculty Queensland University of Technology Brisbane QLD 4001 Australia. Department of Electrical and Computer Engineering Department of Computer Science Johns Hopkins University Baltimore MD 21218 USA. CISTIB - Center for Computational Imaging & Simulation Technologies in Biomedicine The University of Leeds Leeds Yorkshire LS2 9JT UK. Department of Radiology and Nuclear Medicine Medical Image Analysis Radboud University Center 6525 GA Nijmegen The Netherlands. Institute of Information Systems Engineering TU Wien 1040 Vienna Austria. Complexity Science Hub Vienna 1080 Vienna Austria. Heidelberg Collaboratory for Image Processing (HCI Heidelberg University 69120 Heidelberg Germany. Centre for Biomedical Image Analysis Masaryk University 60200 Brno Czech Republic. Electrical Engineering Vanderbilt University Nashville TN 37235-1679 USA. Institute of Medical Informatics Universität zu Lübeck 23562 Lübeck Germany. Division of Medical Image Computing (MIC) German Cancer Research Center (DKFZ) 69120 Heidelberg Germany. Institute for Advanced Studies Department of Informatics Technical University of Munich 80333 Munich Germany. Information System Institute HES-SO Sierre 3960 Switzerland. Departments of Radiology Nuclear Medicine and Medical Informatics Erasmus MC 3015 GD Rotterdam The Netherlands. Department of Computer Science University of Warwick Coventry CV4 7AL UK. Department of Radiation Oncology Massachusetts General Hospital Boston MA

In the original version of this Article the values in the rightmost column of Table 1 were inadvertently shifted relative to the other columns. This has now been corrected in the PDF and HTML versions of the Article.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improving the detection of mtbi via complexity analysis in resting - state magnetoencephalography

Improving the detection of mtbi via complexity analysis in r...

引用

IEEE International Workshop on Imaging Systems and Techniques (IST)

作者： Marios Antonakakis Stavros I. Dimitriadis Andrew C. Papanicolaou George Zouridakis Michalis Zervakis Digital Image and Signal Processing Laboratory School of Electronic and Computer Engineering Technical University of Crete Chania Greece Neuroinformatics Group Aristotle University Thessaloniki Greece Cardiff University Brain Research Imaging Centre (CUBRIC) School of Psychology Cardiff University Cardiff United Kingdom Departments of Pediatrics and Anatomy and Neurobiology University of Tennessee Health Science Center Memphis TN USA Neuroscience Institute Le Bonheur Children's Hospital Memphis TN USA Departments of Engineering Technology Computer Science Biomedical Engineering and Electrical and Computer Engineering University of Houston Houston TX USA

ISBN: (纸本)9781509018185

Diagnosis of mild Traumatic Brain Injury (mTBI) is difficult due to the variability of obvious brain lesions using imaging scans. A promising tool for exploring potential biomarkers for mTBI is magnetoencephalography which has the advantage of high spatial and temporal resolution. By adopting proper analytic tools from the field of symbolic dynamics like Lempel-Ziv complexity, we can objectively characterize neural network alterations compared to healthy control by enumerating the different patterns of a symbolic sequence. This procedure oversimplifies the rich information of brain activity captured via MEG. For that reason, we adopted neural-gas algorithm which can transform a time series into more than two symbols by learning brain dynamics with a small reconstructed error. The proposed analysis was applied to recordings of 30 mTBI patients and 50 normal controls in δ frequency band. Our results demonstrated that mTBI patients could be separated from normal controls with more than 97% classification accuracy based on high complexity regions corresponding to right frontal areas. In addition, a reverse relation between complexity and transition rate was demonstrated for both groups. These findings indicate that symbolic complexity could have a significant predictive value in the development of reliable biomarkers to help with the early detection of mTBI.

关键词： Complexity theory Time series analysis Sensitivity Integrated circuits Indexes Brain Laplace equations

来源：评论

学校读者我要写书评

暂无评论

An Improved Epsilon Constraint Handling Method Embedded in MOEA/D for Constrained Multi-objective Optimization Problems

An Improved Epsilon Constraint Handling Method Embedded in M...

引用

IEEE Symposium Series on Computational Intelligence

作者： Zhun Fan Wenji Li Xinye Cai Hui Li Han Huang Zhaoquan Cai Caimin Wei Guangdong Provincial Key Laboratory of Digital Signal and Image Processing Department of Electronic Engineering Shantou University 515063 China School of Mathematics and Statistics Xi'an Jiaotong University Shaanxi 710049 China Department of Mathematics Shantou University Guangdong 515063 China Department of Electronic Engineering Shantou University Guangdong 515063 China School of Software Engineering South China University of Technology Guangdong Guangzhou 510006 China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Jiangsu 210016 China Department of Computer Science Huizhou University Guangdong 516007 China

ISBN: (纸本)9781509042418

This paper proposes an improved epsilon constraint handling method embedded in the multi-objective evolutionary algorithm based on decomposition (MOEA/D) to solve constrained multi-objective optimization problems (CMOPs). More specifically, it dynamically adjusts the epsilon level, which is a critical parameter in the epsilon constraint method, according to the feasible ratio of solutions in the current population. In order to verify the effect of the improved epsilon constraint handling method, three algorithms - MOEA/D-CDP, MOEA/D-Epsilon, and MOEA/D-IEpsilon (MOEA/D with the improved epsilon constraint handling mechanism) are tested on nine CMOPs (CMOP1-CMOP9). The comprehensive experimental results indicate that the proposed epsilon constraint handling method is very effective on the performance of both convergence and diversity.

关键词： improved epsilon constraint

来源：评论

学校读者我要写书评

暂无评论

Detecting Optic Disk Based on Structured Learning

Detecting Optic Disk Based on Structured Learning

引用

IEEE International Conference on Robotics and Biomimetics

作者： Zhun Fan Yibiao Rong Xinye Cai Wenji Li Huibiao Lin Zefeng Yu Jiewei Lu Key Laboratory of Digital Signal and Image Processing of Guangdong Provincial College of Engineering Shantou University. 515063 Shantou China College of Engineering Shantou University. 515063 Shantou China school of computer science and technology Nanjing University of Aeronautics and Astronautics Jiangsu China

ISBN: (纸本)9781467396769

Optic Disk (OD) detection plays an important role for fundus image analysis. In this paper, we propose an algorithm for detecting OD mainly based on a classifier model trained by structured learning. Then we use the model to achieve the edge map of OD. Thresholding is performed on the edge map to obtain a binary image. Finally, circle Hough transform is carried out to approximate the boundary of OD by a circle. The proposed algorithm has been evaluated on the public database and obtained promising results. The results (an area overlap and Dices coefficients of 0.8636 and 0.9196, respectively, an accuracy of 0.9770, and a true positive and false positive fraction of 0.9212 and 0.0106) show that the proposed method is a robust tool for the segmentation of OD and is very competitive with the stage-of-the-art methods.

关键词： algorithm detecting method

来源：评论

学校读者我要写书评

暂无评论

A Secure and Efficient Scheme for digital Gift Certificates

引用

Journal of Information Hiding and Multimedia signal processing 2015年第3期6卷 416-429页

作者： Liu, Yanjun Chang, Chin-Chen Sun, Chin-Yu Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Department of Electrical Engineering Anhui University 111 Jiu-Long road Hefei230039 China Department of Computer Science and Information Engineering Asia University 500 Liou-feng Road Taichung413 Taiwan Department of Information Engineering and Computer Science Feng Chia University 100 Wen-hwa Road Taichung407 Taiwan Department of Computer Science National Tsing-Hua University 101 Kuang-Fu Road Hsinchu300 Taiwan

With the increasingly rapid developments in e-commerce, schemes for digital gift certificates have become prevalent electronic payment systems due to their practicality and simplicity. In 2002, Chan and Chang introduced the concept of digital gift certificates and proposed the first scheme associated with them. Recently, Chang and Chang (2005) proposed a more practical scheme, called DGC-US (digital gift certificates with unconstrained spending), which can reduce the computational cost of all entities involved in Chan and Chang‘s scheme, especially the computational cost of the electronic department store. However, the asymmetric encryption/decryption operations required in the DGC-US scheme still waste a significant amount of time. In this paper, we propose a novel authentication scheme for digital gift certificates based on Chebyshev chaotic maps and the blind signature. Our proposed scheme can satisfy the essential security requirements and withstand various well-known attacks. Our analyses have shown that our proposed scheme maintains all of the merits of the DGC-US scheme but is more efficient in terms of computational cost. © 2015, Ubiquitous International. All rights reserved.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Dense Invariant Feature Based Support Vector Ranking for Person Re-identification

Dense Invariant Feature Based Support Vector Ranking for Per...

引用

IEEE Global Conference on signal and Information processing

作者： Shoubiao Tan Feng Zheng Ling Shao Key Laboratory of Intelligent Computing & Signal Processing Ministry of Education Anhui University Hefei 230039 China Department of Electronic and Electrical Engineering The University of Sheffield Mappin Street Sheffield S1 3JD UK Department of Computer Science and Digital Technologies Northumbria University Newcastle upon Tyne NE1 8ST UK

ISBN: (纸本)9781479975921

Recently, support vector ranking has been adopted to address the challenging person re-identification problem. However, the ranking model based on ordinary global features cannot represent the significant variation of pose and viewpoint across camera views. Thus, a novel ranking method which fuses the dense invariant features is proposed in this paper to model the variation of images across camera views. By maximizing the margin and minimizing the error score for the fused features, an optimal space for ranking has been learned. Due to the invariance of the dense invariant features and the fusion of the bidirectional features, the proposed method significantly outperforms the original support vector ranking algorithm and is competitive with state-of-the-art techniques on two challenging datasets, showing its potential for real-world person re-identification.

关键词： Person Re-identification Dense Invariant Feature Support Vector Ranking Feature Fusion

来源：评论

学校读者我要写书评

暂无评论

Robust Multimodal Biometric Identification System Using Finger-Knuckle-Print features

Robust Multimodal Biometric Identification System Using Fing...

引用

International Conference on Control, engineering & Information Technology

作者： Abdallah Meraoumia Salim Chitroub Ahmed Bouridane Univ Ouargla Fac. des nouvelles technologies de l'information et de la communication Lab. de Genie Electrique Signal and Image Processing Laboratory Electronics and Computer Science Faculty USTHB School of Computing Engineering and Information Sciences Northumbria University

ISBN: (纸本)9781479982134

Automatic personal identification is becoming an increasingly important requirement in a variety of applications like access control, surveillance systems and physical buildings. In recent years, biometric systems are used in these fields, offering greater convenience and several advantages over traditional security. In this paper, we propose an efficient online personal identification system based on Finger-Knuckle-Print (FKP) images. In this study, the finger image is characterized by the two dimensional Bloc based Discrete Cosine Transform (2D-BDCT) coefficients. Then, we use the Hidden Markov Model (HMM) for modeling the observation vector. In addition, the same finger is transformed by the two dimensional Discrete Fourier Transform (2D-DFT). The response of this transformation is directly used to create another observation vector. Subsequently, the two sub-systems are integrated in order to construct an efficient multi-modal identification system based on matching score level fusion. The results on a medium-size database, 150 users, show good identification performance based on individual modalities as well as after fusing multiple finger types.

关键词： Biometrics Identification FKP 2D-BDCT 2D-DFT HMM Data fusion

来源：评论

学校读者我要写书评

暂无评论

Hybridizing infeasibility driven and constrained-domination principle with MOEA/D for constrained multiobjective evolutionary optimization

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8916卷 249-261页

作者： Lin, Huibiao Fan, Zhun Cai, Xinye Li, Wenji Wang, Sheng Li, Jian Zhang, Chengdian School of Engineering Shantou University Guangdong515063 China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics NanjingJiangsu210016 China College of Science Shantou University Guangdong515063 China Guangdong Provincial Key Laboratory of Digital Signal and Image Processing Techniques Shantou University Guangdong515063 China

This paper presents a novel multiobjective constraint handling approach, named as MOEA/D-CDP-ID, to tackle constrained optimization problems. In the proposed method, two mechanisms, namely infeasibility driven (ID) and constrained-domination principle (CDP) are embedded into a prominent multiobjective evolutionary algorithm called MOEA/D. Constraineddomination principle defined a domination relation of two solutions in constraint handling problem. Infeasibility driven preserves a proportion of marginally infeasible solutions to join the searching process to evolve offspring. Such a strategy allows the algorithm to approach the constraint boundary from both the feasible and infeasible side of the search space, thus resulting in gaining a Pareto solution set with better distribution and convergence. The efficiency and effectiveness of the proposed approach are tested on several well-known benchmark test functions. In addition, the proposed MOEA/D-CDP-ID is applied to a real world application, namely design optimization of the two-stage planetary gear transmission system. Experimental results suggest that MOEA/D-CDP-ID can outperform other state-of-the-art algorithms for constrained multiobjective evolutionary optimization. © Springer International Publishing Switzerland 2014.

关键词： Constraint handling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：