首页 > 最新文献

Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence最新文献

英文 中文
A Single Task Migration Strategy Based on Ant Colony Algorithm in Mobile-Edge Computing 移动边缘计算中一种基于蚁群算法的单任务迁移策略
Juan Fang, Weihao Xu
Mobile user devices, such as smartphones or laptops, run increasingly complex applications that require more computing power and more computing resources. However, the battery capacity and energy consumption of mobile devices limit these developments. Mobile-Edge Computing (MEC) is a technology that utilizes wireless network to provide IT and cloud computing services for nearby users. IT can build a network environment with low latency and high bandwidth and accelerate the response speed of network services. Transferring computing tasks of mobile devices to MEC server through task migration technology can effectively relieve computing pressure of devices. Efficient task migration method can minimize the energy consumption of mobile devices on the basis of ensuring the data delay requirement. According to the characteristics of coarse-grained task migration in current mobile edge computing, this paper proposes a finegrained task migration scheme based on Ant Colony Algorithm(ACO), aiming to minimize the energy consumption of mobile devices on the basis of strict delay constraints in mobile applications. Finally, experimental results show that the method used in this paper can effectively reduce the energy consumption of mobile devices by 26%, compared to the static strategy.
移动用户设备,如智能手机或笔记本电脑,运行越来越复杂的应用程序,需要更多的计算能力和计算资源。然而,移动设备的电池容量和能量消耗限制了这些发展。移动边缘计算(MEC)是利用无线网络为附近用户提供IT和云计算服务的技术。IT可以构建低延迟、高带宽的网络环境,加快网络业务的响应速度。通过任务迁移技术将移动设备的计算任务转移到MEC服务器上,可以有效缓解设备的计算压力。高效的任务迁移方法可以在保证数据延迟要求的基础上,将移动设备的能耗降到最低。针对当前移动边缘计算中粗粒度任务迁移的特点,提出了一种基于蚁群算法(蚁群算法)的细粒度任务迁移方案,在移动应用中严格的时延约束的基础上,最大限度地降低移动设备的能耗。最后,实验结果表明,与静态策略相比,本文所采用的方法可有效降低移动设备的能耗26%。
{"title":"A Single Task Migration Strategy Based on Ant Colony Algorithm in Mobile-Edge Computing","authors":"Juan Fang, Weihao Xu","doi":"10.1145/3404555.3404586","DOIUrl":"https://doi.org/10.1145/3404555.3404586","url":null,"abstract":"Mobile user devices, such as smartphones or laptops, run increasingly complex applications that require more computing power and more computing resources. However, the battery capacity and energy consumption of mobile devices limit these developments. Mobile-Edge Computing (MEC) is a technology that utilizes wireless network to provide IT and cloud computing services for nearby users. IT can build a network environment with low latency and high bandwidth and accelerate the response speed of network services. Transferring computing tasks of mobile devices to MEC server through task migration technology can effectively relieve computing pressure of devices. Efficient task migration method can minimize the energy consumption of mobile devices on the basis of ensuring the data delay requirement. According to the characteristics of coarse-grained task migration in current mobile edge computing, this paper proposes a finegrained task migration scheme based on Ant Colony Algorithm(ACO), aiming to minimize the energy consumption of mobile devices on the basis of strict delay constraints in mobile applications. Finally, experimental results show that the method used in this paper can effectively reduce the energy consumption of mobile devices by 26%, compared to the static strategy.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133436137","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Intrusion Detection of Abnormal Objects for Railway Scenes Using Infrared Images 基于红外图像的铁路场景异常物体入侵检测
Yi Liu, Han Dong, Yundong Li
Intrusion detection of abnormal objects is critical to avoid traffic accidents and ensure the safety of train operations. Computer-vision based approaches using RGB images have been intensively investigated for intrusion detection at daytime. However, the abnormal object detection using infrared images at nighttime remains more challenging because training samples of infrared images are limited to address this issue, we propose a data augmentation strategy motivated by image style transfer using CycleGAN. First, the synthetic images are generated which conditioned on railway scene images at daytime and non-railway scene images at nighttime. Then, a SSD object detection model is trained using the generated synthetic samples. Finally, the trained SSD model is used to detect abnormal objects for infrared images at nighttime. Experimental results demonstrate that the proposed data augmentation strategy and the object detection method for nighttime scene is effective.
异常物体的入侵检测对于避免交通事故、保证列车运行安全至关重要。利用RGB图像的基于计算机视觉的方法已被广泛研究用于白天的入侵检测。然而,由于红外图像的训练样本有限,在夜间使用红外图像进行异常目标检测仍然更具挑战性,因此我们提出了一种基于CycleGAN图像风格转移的数据增强策略。首先,以白天的铁路场景图像和夜间的非铁路场景图像为条件,生成合成图像;然后,使用生成的合成样本训练SSD目标检测模型。最后,将训练好的SSD模型用于夜间红外图像的异常目标检测。实验结果表明,所提出的数据增强策略和夜景目标检测方法是有效的。
{"title":"Intrusion Detection of Abnormal Objects for Railway Scenes Using Infrared Images","authors":"Yi Liu, Han Dong, Yundong Li","doi":"10.1145/3404555.3404579","DOIUrl":"https://doi.org/10.1145/3404555.3404579","url":null,"abstract":"Intrusion detection of abnormal objects is critical to avoid traffic accidents and ensure the safety of train operations. Computer-vision based approaches using RGB images have been intensively investigated for intrusion detection at daytime. However, the abnormal object detection using infrared images at nighttime remains more challenging because training samples of infrared images are limited to address this issue, we propose a data augmentation strategy motivated by image style transfer using CycleGAN. First, the synthetic images are generated which conditioned on railway scene images at daytime and non-railway scene images at nighttime. Then, a SSD object detection model is trained using the generated synthetic samples. Finally, the trained SSD model is used to detect abnormal objects for infrared images at nighttime. Experimental results demonstrate that the proposed data augmentation strategy and the object detection method for nighttime scene is effective.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114727607","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Markov-Based Transmission Power Control in Wireless Body Area Network 基于马尔可夫的无线体域网络发射功率控制
Wenjing Guo, Mengxing Xu, Ting Lu
Reliability and energy consumption are the two important metrics in wireless body area network (WBAN) for medical application, and they are also the difficulties and key points in network research. In this article, we propose a new adaptive Markov-based transmission power control algorithm (MBPC) for a better compromise between energy consumption and reliability. The algorithm applies the Markov model to the link quality prediction using the grading strategy. Based on the prediction results, a new power adjustment strategy is proposed to extend the lifetime of the network while ensuring reliable transmission. In addition, we also incorporate open-loop thinking into the design of the algorithm to ensure the accuracy of the algorithm. The algorithm is simulated on the Castalia software platform. The simulation results show that the proposed algorithm has achieved good results in reliable transmission and energy consumption.
可靠性和能耗是医疗用无线体域网(WBAN)的两个重要指标,也是网络研究的难点和重点。在本文中,我们提出了一种新的自适应基于马尔可夫的传输功率控制算法(MBPC),以更好地平衡能量消耗和可靠性。该算法将马尔可夫模型应用于分级策略的链路质量预测。根据预测结果,提出了一种新的功率调整策略,在保证可靠传输的同时延长网络寿命。此外,我们还将开环思维融入到算法的设计中,以保证算法的准确性。该算法在Castalia软件平台上进行了仿真。仿真结果表明,该算法在可靠传输和能耗方面取得了较好的效果。
{"title":"Markov-Based Transmission Power Control in Wireless Body Area Network","authors":"Wenjing Guo, Mengxing Xu, Ting Lu","doi":"10.1145/3404555.3404584","DOIUrl":"https://doi.org/10.1145/3404555.3404584","url":null,"abstract":"Reliability and energy consumption are the two important metrics in wireless body area network (WBAN) for medical application, and they are also the difficulties and key points in network research. In this article, we propose a new adaptive Markov-based transmission power control algorithm (MBPC) for a better compromise between energy consumption and reliability. The algorithm applies the Markov model to the link quality prediction using the grading strategy. Based on the prediction results, a new power adjustment strategy is proposed to extend the lifetime of the network while ensuring reliable transmission. In addition, we also incorporate open-loop thinking into the design of the algorithm to ensure the accuracy of the algorithm. The algorithm is simulated on the Castalia software platform. The simulation results show that the proposed algorithm has achieved good results in reliable transmission and energy consumption.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117166552","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Intrusion Detection Feature Selection Method Based on Improved Fireworks Algorithm 基于改进Fireworks算法的入侵检测特征选择方法
Shuangyue Niu, Xiang Ji, Jingmei Li, Di Xue, Weifei Wu
With the rapid development of network technology, network intrusion has become increasingly frequent. In network intrusion detection technology, how to reduce feature dimensions and reduce redundant information is the key to improve the detection accuracy. To solve this problem, this paper proposes a new feature selection method SIFWA for intrusion detection based on improved fireworks algorithm. SIFWA optimized and improved the selection strategy of fireworks algorithm, which adopted the selection strategy based on fitness value to screen the next generation of fireworks, which could greatly improve the ability of fireworks algorithm to find the optimal solution and search efficiency to select more effective features for intrusion detection. Simulation experiments were conducted using UCI data. Simulation results show that SIFWA has higher detection accuracy than the benchmark algorithm.
随着网络技术的飞速发展,网络入侵日益频繁。在网络入侵检测技术中,如何降低特征维数,减少冗余信息是提高检测精度的关键。为了解决这一问题,本文提出了一种基于改进fireworks算法的入侵检测特征选择方法SIFWA。SIFWA对烟花算法的选择策略进行了优化和改进,采用基于适应度值的选择策略来筛选下一代烟花,可以大大提高烟花算法寻找最优解的能力和搜索效率,从而选择更有效的特征进行入侵检测。利用UCI数据进行了模拟实验。仿真结果表明,该算法比基准算法具有更高的检测精度。
{"title":"An Intrusion Detection Feature Selection Method Based on Improved Fireworks Algorithm","authors":"Shuangyue Niu, Xiang Ji, Jingmei Li, Di Xue, Weifei Wu","doi":"10.1145/3404555.3404556","DOIUrl":"https://doi.org/10.1145/3404555.3404556","url":null,"abstract":"With the rapid development of network technology, network intrusion has become increasingly frequent. In network intrusion detection technology, how to reduce feature dimensions and reduce redundant information is the key to improve the detection accuracy. To solve this problem, this paper proposes a new feature selection method SIFWA for intrusion detection based on improved fireworks algorithm. SIFWA optimized and improved the selection strategy of fireworks algorithm, which adopted the selection strategy based on fitness value to screen the next generation of fireworks, which could greatly improve the ability of fireworks algorithm to find the optimal solution and search efficiency to select more effective features for intrusion detection. Simulation experiments were conducted using UCI data. Simulation results show that SIFWA has higher detection accuracy than the benchmark algorithm.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122480337","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
ECycleGAN
Xianchao Zhang, Changjia Zhou
Unsupervised image-to-image translation, which aims in translating two irrelevant domains of images, has increased substantially in recent years with the success of Generative Adversarial Networks (GANs) based on the cycle-consistency assumption. Especially, the Cycle-Consistent Generative Adversarial Network (CycleGAN) has shown remarkable success for two domains translation. However, the details about texture and style are often accompanied with unpleasant artifacts. To further enhance the translational quality, we thoroughly study the key components of CycleGAN - network architecture and adversarial loss, and improve each of them to derive an Enhanced CycleGAN (ECycleGAN). In particular, we propose a perceptual loss function which motivated by perceptual similarity instead of similarity in pixel space. Moreover, we introduce the Residual Dense Normalization Block (RDNB) to replace the residual blocks as the basic network building unit. Finally, we borrow the idea from WGAN-GP as the adversarial loss functions. The ECycleGAN, thanks to these changes, demonstrates appealing visual quality with more realistic and natural textures than any state-of-the-art methods.
{"title":"ECycleGAN","authors":"Xianchao Zhang, Changjia Zhou","doi":"10.1145/3404555.3404597","DOIUrl":"https://doi.org/10.1145/3404555.3404597","url":null,"abstract":"Unsupervised image-to-image translation, which aims in translating two irrelevant domains of images, has increased substantially in recent years with the success of Generative Adversarial Networks (GANs) based on the cycle-consistency assumption. Especially, the Cycle-Consistent Generative Adversarial Network (CycleGAN) has shown remarkable success for two domains translation. However, the details about texture and style are often accompanied with unpleasant artifacts. To further enhance the translational quality, we thoroughly study the key components of CycleGAN - network architecture and adversarial loss, and improve each of them to derive an Enhanced CycleGAN (ECycleGAN). In particular, we propose a perceptual loss function which motivated by perceptual similarity instead of similarity in pixel space. Moreover, we introduce the Residual Dense Normalization Block (RDNB) to replace the residual blocks as the basic network building unit. Finally, we borrow the idea from WGAN-GP as the adversarial loss functions. The ECycleGAN, thanks to these changes, demonstrates appealing visual quality with more realistic and natural textures than any state-of-the-art methods.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123240899","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Attention-based Joint Representation Learning Network for Short text Classification 基于注意力的短文本分类联合表示学习网络
Xinyue Liu, Yexuan Tang
Deep neural networks have gained success recently in learning distributed representations for text classification. However, due to the sparsity of information in user-generated comments, existing approaches still suffer from the problem of exploiting the semantic information by halves to classify current sentence. In this paper, we propose a novel attention-based joint representation learning network (AJRLN). The proposed model provides two attention-based subnets to extract different attentive features of the sentence embedding. Then, these features are combined by the representation combination layer to get the joint representation of the whole sentence for classification. We conduct extensive experiments on SST, TREC and SUBJ datasets. The experimental results demonstrate that our model achieved comparable or better performance than other state-of-the-art methods.
近年来,深度神经网络在学习文本分类的分布式表示方面取得了成功。然而,由于用户评论信息的稀疏性,现有的方法仍然存在对语义信息进行半挖掘的问题。本文提出了一种新的基于注意的联合表征学习网络(AJRLN)。该模型提供了两个基于注意的子网来提取句子嵌入的不同注意特征。然后,通过表示组合层对这些特征进行组合,得到整个句子的联合表示进行分类。我们在SST, TREC和SUBJ数据集上进行了广泛的实验。实验结果表明,我们的模型达到了与其他最先进的方法相当或更好的性能。
{"title":"Attention-based Joint Representation Learning Network for Short text Classification","authors":"Xinyue Liu, Yexuan Tang","doi":"10.1145/3404555.3404578","DOIUrl":"https://doi.org/10.1145/3404555.3404578","url":null,"abstract":"Deep neural networks have gained success recently in learning distributed representations for text classification. However, due to the sparsity of information in user-generated comments, existing approaches still suffer from the problem of exploiting the semantic information by halves to classify current sentence. In this paper, we propose a novel attention-based joint representation learning network (AJRLN). The proposed model provides two attention-based subnets to extract different attentive features of the sentence embedding. Then, these features are combined by the representation combination layer to get the joint representation of the whole sentence for classification. We conduct extensive experiments on SST, TREC and SUBJ datasets. The experimental results demonstrate that our model achieved comparable or better performance than other state-of-the-art methods.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131159021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Efficient Optimized Strategy of Big Data Retrieval 大数据检索的高效优化策略
Jinfeng Dou, Lei Chu, Jiabao Cao, Yang Qiu, Baolin Zhao
With the development of new information technologies, the accumulation of data volume has been exploding, and big data retrieval has played an increasingly important role in big data technology. The challenge of data retrieval are the improvement of retrieval accuracy and retrieval speed. Aiming at the demand of big data platform for efficient data retrieval, an efficient optimized strategy is proposed. We found when the primary key query is used, the query response can be quick. However, when using a non-primary key query, the cache table needs to be comprehensively scanned and the longer response delay may be induced. This paper proposes a secondary index based on Solr to increase the accuracy of information retrieval and the quality of user experience. Then a cache-heat evaluation algorithm categorizes data according to access frequency to reduce query latency. Moreover, an index optimization method based on memory cache updates the cache to save space and enhance utilization. The experiments and simulation demonstrate that the proposed strategy can effectively improves the big data retrieval.
随着新信息技术的发展,数据量的积累呈爆炸式增长,大数据检索在大数据技术中发挥着越来越重要的作用。数据检索面临的挑战是提高检索精度和检索速度。针对大数据平台对高效数据检索的需求,提出了一种高效的优化策略。我们发现,当使用主键查询时,查询响应可以很快。但是,当使用非主键查询时,需要对缓存表进行全面扫描,并且可能导致较长的响应延迟。为了提高信息检索的准确性和用户体验的质量,本文提出了一种基于Solr的二级索引。然后,cache-heat评估算法根据访问频率对数据进行分类,减少查询延迟。此外,基于内存缓存的索引优化方法更新缓存,以节省空间和提高利用率。实验和仿真结果表明,该策略能够有效提高大数据检索的效率。
{"title":"Efficient Optimized Strategy of Big Data Retrieval","authors":"Jinfeng Dou, Lei Chu, Jiabao Cao, Yang Qiu, Baolin Zhao","doi":"10.1145/3404555.3404630","DOIUrl":"https://doi.org/10.1145/3404555.3404630","url":null,"abstract":"With the development of new information technologies, the accumulation of data volume has been exploding, and big data retrieval has played an increasingly important role in big data technology. The challenge of data retrieval are the improvement of retrieval accuracy and retrieval speed. Aiming at the demand of big data platform for efficient data retrieval, an efficient optimized strategy is proposed. We found when the primary key query is used, the query response can be quick. However, when using a non-primary key query, the cache table needs to be comprehensively scanned and the longer response delay may be induced. This paper proposes a secondary index based on Solr to increase the accuracy of information retrieval and the quality of user experience. Then a cache-heat evaluation algorithm categorizes data according to access frequency to reduce query latency. Moreover, an index optimization method based on memory cache updates the cache to save space and enhance utilization. The experiments and simulation demonstrate that the proposed strategy can effectively improves the big data retrieval.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126857672","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An Improved Breast Cancer Nuclei Segmentation Method Based on UNet++ 一种改进的基于unet++的乳腺癌细胞核分割方法
Hong Wang, Yinhan Li, Zhiyi Luo
Nuclei segmentation plays an important role in medical image analysis but it is also a challenging area due to the tiny size of nuclei especially for breast cancer nuclei. To address these challenges, in this paper we present an improved UNet++ architecture, a more powerful architecture for nuclei segmentation. The original UNet++, which is an encoder-decoder architecture with a series of nested and dense skip pathways, is used as the framework in our work. The main reason for the increase in ability is that the Inception-ResNet-V2 network is added as backbone, which is a very deep network with brilliant performance in object detection. We have evaluated our improved UNet++ in comparison with UNet and the original UNet++ architectures in breast cancer nuclei segmentation dataset. The experiments demonstrate that our improved UNet++ is superior to U-Net and the original U-Net++.
细胞核分割在医学图像分析中起着重要的作用,但由于细胞核体积小,尤其是乳腺癌细胞核的分割也是一个具有挑战性的领域。为了解决这些问题,本文提出了一种改进的UNet++架构,这是一种更强大的核分割架构。原始的UNet++是一个编码器-解码器架构,具有一系列嵌套和密集的跳过路径,在我们的工作中用作框架。能力提升的主要原因是增加了Inception-ResNet-V2网络作为主干,这是一个非常深的网络,在目标检测方面表现出色。在乳腺癌细胞核分割数据集中,我们将改进的unet++与UNet和原始的unet++架构进行了比较。实验表明,改进后的unet++比原有的unet++和U-Net都要优越。
{"title":"An Improved Breast Cancer Nuclei Segmentation Method Based on UNet++","authors":"Hong Wang, Yinhan Li, Zhiyi Luo","doi":"10.1145/3404555.3404577","DOIUrl":"https://doi.org/10.1145/3404555.3404577","url":null,"abstract":"Nuclei segmentation plays an important role in medical image analysis but it is also a challenging area due to the tiny size of nuclei especially for breast cancer nuclei. To address these challenges, in this paper we present an improved UNet++ architecture, a more powerful architecture for nuclei segmentation. The original UNet++, which is an encoder-decoder architecture with a series of nested and dense skip pathways, is used as the framework in our work. The main reason for the increase in ability is that the Inception-ResNet-V2 network is added as backbone, which is a very deep network with brilliant performance in object detection. We have evaluated our improved UNet++ in comparison with UNet and the original UNet++ architectures in breast cancer nuclei segmentation dataset. The experiments demonstrate that our improved UNet++ is superior to U-Net and the original U-Net++.","PeriodicalId":220526,"journal":{"name":"Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129187617","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
期刊
Proceedings of the 2020 6th International Conference on Computing and Artificial Intelligence
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1