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

International Conference on computer Communications and Networks (ICCCN)

作者： Yi Ji Juncheng Jia Jin Wang Jingya Zhou Shukui Zhang Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou China

In cognitive radio networks (CRNs), secondary users need to first discover neighbours and form communication links, referred to as the rendezvous process. Rendezvous between any two secondary users can only be achieved on the same channel. However, the nature of the CRN makes this a challenging problem. Specifically in CRN, not only the network is multi- channel, but the channels available at different nodes may be different. While most of the existing works study pair-wise rendezvous and design channel hopping sequence, in this paper, we focus on the performance improvement of the rendezvous process based on the existing channel hopping sequences with multiple users in CRN. We propose a new strategy, called Group Based Strategy (GBS) to achieve the acceleration, which is flexible to incorporate the existing sequence generation algorithms. Our basic idea is to group the encountered users and schedule rendezvous for them. With the purpose to increase rendezvous diversity, other users or groups can join the group if they get the group rendezvous information. Experiments are conducted to evaluate the proposed scheme. Overall, the performance can be improved by more than 50% under symmetric model or asymmetric model using our accelerating strategy.

关键词： Acceleration Cognitive radio Protocols Schedules Message passing Synchronization Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

An automatic biomedical ontology meta-matching technique

Journal of Network Intelligence

引用

Journal of Network Intelligence 2019年第3期4卷 109-113页

作者： Xue, Xingsi Yang, Haiyan Zhang, Jie Zhang, Jing Chen, Dongxu College of Information Science and Engineering Intelligent Information Processing Research Center Fujian Key Lab for Automotive Electronics and Electric Drive Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology No.3 Xueyuan Road University Town Minhou Fuzhou CityFujian Province350118 China College of Information Science and Engineering Fujian University of Technology No.33 Xuefu South Road University Town Minhou Fuzhou CityFujian Province350118 China School of Computer Science and Engineering Yulin Normal University No.299 Education Middle Road Yulin CityGuanxi Province537000 China School of Computing Ulster University Jordanstown BT370QB United Kingdom Fujian Medical University Union Hospital No.29 Xinquan Road Gulou Fuzhou CityFujian Province350001 China

Biomedical ontology matching aims at determining the heterogeneous biomed-ical concepts, and bridging the semantic gap between heterogeneous biomedical ontologies. The foundation of a biomedical ontology matching technique is the Biomedical Concept Similarity Measure (BCSM), which calculates the similarity value between two biomed-ical concepts. Since various BCSMs have different advantages, usually several BCSMs are aggregated together to improve the result’s confidence. How to tune the aggregating weights to ensure the quality of the alignment is called biomedical ontology meta-matching problem, which is a challenge in the ontology matching domain. Currently, researchers mainly focus on how to tune the aggregating weights for various similarity measures to improve the quality of the ontology alignments. However, the ignorance of the effects brought about by different biomedical concept mapping’s preference on different similarity measures significantly reduces the alignment’s quality. To overcome this drawback, in this work, we formally define the biomedical ontology meta-matching problem, and then present an Ordered Weighted Average (OWA) based approach to automatically aggregate various biomedical concept similarity measures. In our method, the aggregating weights determined for each concept mapping is associated with the ordered position of the similarity value instead of a particular concept similarity measure. The experiment utilizes the large biomed track provided by Ontology Alignment Evaluation Initiative (OAEI) to test our proposal’s performance, and the experimental results show the effectiveness of our proposal. © 2019, Taiwan Ubiquitous information. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Weighted Feature Pyramid Networks for Object Detection

Weighted Feature Pyramid Networks for Object Detection

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Xiaohan Li Taotao Lai Shuaiyu Wang Quan Chen Changcai Yang Riqing Chen Jinxun Lin Fu Zheng Digital Fujian Institute of Big Data for Agriculture and Forestry College of Computer and information Sciences Fujian Agriculture and Forestry University Fuzhou China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Control Engineering Minjiang University Fuzhou China Fu Jian Shu Bo Xun Information Technology Co. Ltd

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

Feature Pyramid Networks (FPN) is a popular feature extraction. However, FPN and its variants do not investigate the influence of resolution information and semantic information in the object detection. Thus, FPN and its variants cannot detect some objects on challenging images. In this paper, based on FPN, we propose to use gaussian kernel function to assign different weight values to semantic information and resolution information for different images in the object detection. The proposed method, is called a Weighted Feature Pyramid Network (WFPN), and shows significant improvement over the traditional feature pyramids in several applications. Using WFPN in Faster R-CNN system, the proposed method achieves better performance on the PASCAL detection benchmark.

关键词： Feature extraction Kernel Object detection Agriculture Forestry Semantics Big Data

来源：评论

学校读者我要写书评

暂无评论

A Cascaded Co-evolutionary Model for Attribute Reduction and Classification Based on Coordinating Architecture with Bidirectional Elitist Optimization

引用

Chinese Journal of Electronics 2017年第1期26卷 13-21页

作者： DING Weiping WANG Jiandong LI Yuehua CHENG Xueyun School of Computer Science and Technology Nantong University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Provincial Key Laboratory for Computer Information Processing Technology Soochow University College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics

A cascaded co-evolutionary model for Attribute reduction and classification based on Coordinating architecture with bidirectional elitist optimization(ARC-CABEO) is proposed for the more practical applications. The regrouping and merging coordinating strategy of ordinary-elitist-role-based population is introduced to represent a more holistic cooperative co-evolutionary framework of different populations for attribute reduction. The master-slave-elitist-based subpopulations are constructed to coordinate the behaviors of different elitists, and meanwhile the elitist optimization vector with the strongest balancing between exploration and exploitation is selected out to expedite the bidirectional attribute co-evolutionary reduction process. In addition, two coupled coordinating architectures and the elitist optimization vector are tightly cascaded to perform the co-evolutionary classification of reduction subsets. Hence the preferring classification optimization goal can be achieved better. Some experimental results verify that the proposed ARC-CABEO model has the better feasibility and more superior classification accuracy on different UCI datasets, compared with representative algorithms.

关键词： Attribute reduction for classification Bidirectional elitist optimization Coordinating architecture Cascaded co-evolutionary model

来源：评论

学校读者我要写书评

暂无评论

Image Segmentation Using Fuzzy C-means Optimized by Ant Lion Optimization

Image Segmentation Using Fuzzy C-means Optimized by Ant Lion...

引用

IEEE International Conference on Intelligent Data Acquisition and Advanced Computing Systems

作者： Can Jin Zhiwei Ye Lingyu Yan Ye Cao Aixin Zhang Lie Ma Xiang Hu Jiwei Hu School of Computer Science Hubei University of Technology Wuhan China Fujian Provincial Key Laboratory of Data Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian Province University Wuhan Jingzhi Technology Co. Ltd. Wuhan China Wuhan FiberHome Technical Services Co. Ltd. Wuhan China

Image segmentation is the indispensable part in the field of computer vision. There are tremendous methods for handling this task such as Otsu-thresholding and Fuzzy C-means (FCM). However, the segmentation results of the images are occasionally unsatisfactory due to the presence of noise. In this paper, two kinds of spatial information consisting of the relative position information and the intensity information of the neighborhood pixels in an image are taken into consideration in constructing the objective function in FCM. Moreover, Ant Lion Optimization, one of the recently proposed optimization algorithms is utilized to optimize the relevant index. Bio-inspired ALO has the robust ability to find optimal parameters in search spaces. So the proposed approach to image segmentation based on Fuzzy C-Means (FCM) and Ant Lion Optimization (ALO) may alleviate this problem to a certain degree. A series of experimental validation has been implemented for demonstrating the performance of the proposed approach in the end of the paper.

关键词： Clustering algorithms Image segmentation Optimization Convergence Linear programming Standards Gaussian noise

来源：评论

学校读者我要写书评

暂无评论

Color Space Volume and Superpixel Based Leukocyte Image Segmentation

Color Space Volume and Superpixel Based Leukocyte Image Segm...

引用

IEEE International Symposium on information (IT) in Medicine and Education, ITME

作者： Xiaogen Zhou Zuoyong Li Chuansheng Wang Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou P.R. China College of Mathematics and Computer Science Fuzhou University Fuzhou P.R. China School of Computer Science and Technology Harbin University of Science and Technology Harbin P.R. China

In this paper, we propose a novel method based on color space volume and multimodal histogram thresholding (MHT) for leukocyte segmentation in human blood smear images under the rapid staining condition. The proposed method first defines a new color space volume to highlight the leukocyte's nucleus region, and it then uses the MHT method to extract the nucleus. Then, the proposed method takes the central region in the superpixel segmentation result as an initial leukocyte region, and it then uses the MHT method to extract the leukocyte region. Finally, the cytoplasm is obtained by subtracting the nucleus region from the leukocyte region. Experimental results on a dataset containing 300 leukocyte images under rapid staining condition show that the proposed method provides a higher segmentation accuracy than the counterparts.

关键词： Image segmentation Image color analysis Histograms White blood cells Clustering algorithms Shape

来源：评论

学校读者我要写书评

暂无评论

Constrained Multi-scale Dense Connections for Accurate Biomedical Image Segmentation

Constrained Multi-scale Dense Connections for Accurate Biome...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Jiawei Zhang Yanchun Zhang Shanfeng Zhu Xiaowei Xu Shanghai key Laboratory of Data Science School of Computer Science Fudan University Shanghai China Cyberspace Institute of Advanced Technology Guangzhou University Guangzhou China College of Engineering and Science Victoria University Melbourne Australia ISTBI and Shanghai Institute of Artificial Intelligence Algorithms Fudan University Shanghai China Nanjing University Institute of Artificial Intelligence Biomedicine Nanjing China Shanghai Key Lab of Intelligent Information Processing Fudan University Shanghai China Guangdong Provincial People’s Hospital Guangdong Cardiovascular Institute Guangzhou China

ISBN: (数字)9781728162157

ISBN: (纸本)9781728162164

Biomedical image segmentation plays a critical role in clinical diagnosis and medical intervention. Recently, a variety of deep neural networks have boosted the biomedical image segmentation performance with a large margin, which adopts dense connections to explore rich representations in multiple scales. In multi-scale dense connections, features from all or most scales are fused or iteratively aggregated. In this paper, we propose constrained multi-scale dense connections (CMDC) for accurate biomedical image segmentation, which only fuse features from the nearest scales containing the most relevant appearance or semantic information. Based on CMDC, we further construct constraint multi-scale dense networks (CMD-Net) by applying CMDC to existing segmentation networks. Experiments across various architectures (including FCN-8s, U-Net, and DeepLabV3) and datasets (including GlaS, CRAG, KID, and ECS) demonstrate that CMD-Net not only outperforms existing schemes on both accuracy and efficiency but also can be easily generalized to a variety of segmentation networks. In addition, CMD-Net achieves state-of-the-art performance on two instance segmentation datasets, GlaS and CRAG.

关键词： Decoding Image segmentation Image resolution Biomedical imaging Glands Fuses Cancer

来源：评论

学校读者我要写书评

暂无评论

Prof. Rudolf Emil Kalman OBITUARY

引用

IEEE CONTROL SYSTEMS MAGAZINE 2017年第1期37卷 151-152页

作者： Antoulas, Athanasios Georgiou, Tryphon T. Khargonekar, Pramod P. Ozguler, A. Bulent Sontag, Eduardo D. Yamamoto, Yutaka JiangSu Provincial Key Lab for Computer Information Processing Technology School of Computer Science and Technology Soochow University Suzhou China

Recounts the career and contributions of Professor Rudolf Emil Kalman.

关键词： Obituaries Kalman, Rudolf Emil

来源：评论

学校读者我要写书评

暂无评论

Systematic Resource Allocation in Cloud RAN with Caching as a Service under Two Timescales

Systematic Resource Allocation in Cloud RAN with Caching as ...

引用

作者： Tang, Jianhua Quek, Tony Q. S. Chang, Tsung-Hui Shim, Byonghyo Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China Institute of New Media and Communications Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore Department of Electronic Engineering Kyung Hee University Yongin17104 Korea Republic of School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China Department of Electrical and Computer Engineering Institute of New Media and Communications Seoul National University Seoul08826 Korea Republic of

Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactions of CCC in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e., computation and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool impacts on the short-term transmit beamforming at the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP) to minimize the system cost, including the server cost, VM cost and wireless transmission cost. After a series of approximation, including sample average approximation, successive convex approximation, and semidefinite relaxation, the SMINLP is approximated as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a parallel fashion. Simulation results verify the convergence of our proposed algorithm, and also confirm that the proposed scheme is more cost-saving than that without considering the integration of CCC. © 1972-2012 IEEE.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Trajectory Grouping with Curvature Regularization for Tubular Structure Tracking

arXiv

引用

arXiv 2020年

作者： Liu, Li Chen, Da Shu, Minglei Li, Baosheng Shu, Huazhong Paques, Michel Cohen, Laurent D. Qilu University of Technology Shandong Academy of Sciences Shandong Artificial Intelligence Institute Jinan250014 China Shandong's Key Laboratory of Radiation Oncology Shandong Cancer Hospital Shandong Academy of Medical Sciences Jinan China Department of Radiation Oncology Shandong Cancer Hospital & Institute Shandong Academy of Medical Sciences Jinan China Jiangsu Provincial Joint International Research Laboratory of Medical Information Processing School of Computer Science and Engineering Southeast University Nanjing210096 China The Centre Hospitalier National dOphtalmologie des Quinze-Vingts Paris France University Paris Dauphine PSL Research University CNRS UMR 7534 CEREMADE Paris75016 France

Tubular structure tracking is a crucial task in the fields of computer vision and medical image analysis. The minimal paths-based approaches have exhibited their strong ability in tracing tubular structures, by which a tubular structure can be naturally modeled as a minimal geodesic path computed with a suitable geodesic metric. However, existing minimal paths-based tracing approaches still suffer from difficulties such as the shortcuts and short branches combination problems, especially when dealing with the images involving complicated tubular tree structures or background. In this paper, we introduce a new minimal paths-based model for minimally interactive tubular structure centerline extraction in conjunction with a perceptual grouping scheme. Basically, we take into account the prescribed tubular trajectories and curvature-penalized geodesic paths to seek suitable shortest paths. The proposed approach can benefit from the local smoothness prior on tubular structures and the global optimality of the used graph-based path searching scheme. Experimental results on both synthetic and real images prove that the proposed model indeed obtains outperformance comparing with the state-of-the-art minimal paths-based tubular structure tracing algorithms. Copyright © 2020, The Authors. All rights reserved.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：