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

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Li, Cuiyuan Zhang, Fa Hu, Kai Cui, Xuefeng Shandong University School of Computer Science and Technology Qingdao China Beijing Institute of Technology School of Medical Technology Beijing China Xiangtan University Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan China Xiangnan University Key Laboratory of Medical Imaging and Artificial Intelligence of Hunan Province Chenzhou China

ISBN: (纸本)9798350337488

Spatial transcriptomics data provides a unique opportunity to investigate both gene expression and spatial structure in tissues at the same time. However, incorporating spatial information to accurately identify spatial domains is difficult due to factors such as high-dimensionality, sparsity, noise, and dropout events. To address these issues, we introduce vGraphST, a novel graph-based deep learning approach tailored for spatial transcriptomics data. Our method combines auto-encoder and contrastive learning techniques to process high-dimensional data and generate meaningful low-dimensional embeddings. Additionally, we use continuous distributions instead of discrete values in both the latent space and the denoised gene expression space. Specifically, Gaussian distributions are used to model the latent space, while zero-inflated Poisson distributions are used to model the denoised gene expression space. Experimental results demonstrate the effectiveness of vGraphST in accurately representing and analyzing spatial transcriptomics data. When compared to other methods using the DLPFC dataset, vGraphST achieves an average Adjusted Rand Index (ARI) of 0.58, demonstrating its superiority in segmenting spatial domains and recognizing biologically relevant spatiotemporal patterns. © 2023 IEEE.

关键词： clustering contrastive learning denoising spatial transcriptomics variational auto-encoder

来源：评论

学校读者我要写书评

暂无评论

A New Dual-Population Evolutionary Algorithm Leveraging Objective-Constraint Relationships for Constrained Multi-Objective Optimization

SSRN

引用

SSRN 2025年

作者： Ye, Jialu Tan, Chaogui Xia, Yizhang Hou, Zhanglu Liu, Yuan Zou, Juan Hunan Engineering Research Center of intelligent System Optimization and Security Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Hunan National Applied Mathematics Center China Xiangtan University China

Population co-evolution strategies are widely used to handle constrained multi-objective optimization problems (CMOPs). However, existing coevolutionary algorithms oversimplify population collaboration and are rigid in evolving the auxiliary population, ignoring the importance of maintaining population diversity, especially for CMOPs with irregular feasible regions. To tackle this issue, we propose a new dual-population evolutionary algorithm, denoted as AACMO, which attempts to mine the relational features between the unconstrained Pareto front (UPF) and the constrained Pareto front (CPF) to better adapt to CMOPs with various constraints. Specifically, the method is categorized into two phases: a learning phase and an evolving phase. First, the main population (MP) aims to quickly learn the relationships between the UPF and the CPF by leveraging the advantages of different operators, namely, genetic algorithm operators and differential evolution operators, during the learning phase. Secondly, two auxiliary strategies are designed to collaborate with the MP during the evolving phase. These strategies are capable of employing a more effective co-evolution method to assist the MP in maintaining diversity, based on the degree of alignment between the learned UPF and CPF at the end of the learning phase. The effectiveness of AACMO is confirmed through comparative analysis with eight state-of-the-art algorithms across four CMOP benchmark suites. © 2025, The Authors. All rights reserved.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Correction to: Singular value decomposition compressed ghost imaging

引用

Applied Physics B 2022年第4期128卷 1-2页

作者： Zhang, Cheng Tang, Jun Zhou, Jiaxuan Wei, Sui Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei China Key Laboratory of Modern Imaging and Displaying Technology Anhui University Hefei China

来源：评论

学校读者我要写书评

暂无评论

Alignment-Free RGB-T Salient Object Detection: A Large-scale Dataset and Progressive Correlation Network

arXiv

引用

arXiv 2024年

作者： Wang, Kunpeng Chen, Keke Li, Chenglong Tu, Zhengzheng Luo, Bin Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University China Anhui Provincial Key Laboratory of Security Artificial Intelligence School of Artificial Intelligence Anhui University China

Alignment-free RGB-Thermal (RGB-T) salient object detection (SOD) aims to achieve robust performance in complex scenes by directly leveraging the complementary information from unaligned visible-thermal image pairs, without requiring manual alignment. However, the labor-intensive process of collecting and annotating image pairs limits the scale of existing benchmarks, hindering the advancement of alignment-free RGB-T SOD. In this paper, we construct a large-scale and high-diversity unaligned RGB-T SOD dataset named UVT20K, comprising 20,000 image pairs, 407 scenes, and 1256 object categories. All samples are collected from real-world scenarios with various challenges, such as low illumination, image clutter, complex salient objects, and so on. To support the exploration for further research, each sample in UVT20K is annotated with a comprehensive set of ground truths, including saliency masks, scribbles, boundaries, and challenge attributes. In addition, we propose a Progressive Correlation Network (PCNet), which models inter- and intra-modal correlations on the basis of explicit alignment to achieve accurate predictions in unaligned image pairs. Extensive experiments conducted on unaligned and aligned datasets demonstrate the effectiveness of our method. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SGCN: A Scalable Graph Convolutional Network with Graph-Shaped Kernels and Multi-Channels

SSRN

引用

SSRN 2023年

作者： Huang, Zhenhua Zhou, Wenhao Li, Kunhao Jia, Zhaohong School of Internet Anhui University Feixi Road Hefei230039 China Key Lab of Intelligent Computing and Signal Processing of Ministry of Education Hefei China

Graph neural networks (GNNs) have shown great success in graph processing. However, current message-passing-based GNNs have limitations in feature aggregations and update mechanisms that rely on a fixed mode, resulting in inadequate representations of the neighborhood structure's richness. Furthermore, the convolution layer in most GNNs lacks flexibility and multi-channels compared to convolutional neural networks (CNNs). CNNs employ multiple channels, where different kernels capture shared patterns of images. To address the limitations, we propose a novel scalable graph convolution network (SGCN). SGCN enhances structural information learning by introducing an expressive feature aggregation mechanism. Drawing inspiration from the design of CNNs, SGCN designs graph-shaped kernels to perform multi-channel convolutions on the subgraph structure. A sampler based on degree centrality is employed to simplify the computation costs. Extensive experiments demonstrate that SGCN achieved state-of-the-art performances on various scales of graph datasets (accuracy improved up to 5.38%). © 2023, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Exploiting Multi-Decision and Deep Refinement for Ultrasound Image Segmentation

Exploiting Multi-Decision and Deep Refinement for Ultrasound...

引用

International Conference on Acoustics, Speech, and signal processing (ICASSP)

作者： Wenjing Liu Xuanya Li Kai Hu Xieping Gao Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan China Baidu Inc Beijing China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China

In this paper, we propose a novel convolutional neural network (MDR-Net) for ultrasound image segmentation by exploiting multi-decision and deep refinement of the target. Our MDR-Net consists of two main parts, i.e., a multi-decision module (MDM) and a deep refinement module (DRM). Specifically, the MDM effectively addresses the issue of inconspicuous target regions in ultrasound images by combining multi-scale features and multi-receptive field self-attention to enhance the discriminative representation of features and diagnose feature points multiple times. In addition, to alleviate the problem of blurred boundaries and severe speckle noise, the DRM progressively fuses multi-scale features and makes the fused features interact with higher-level features to refine the target details step by step. Finally, we evaluate the proposed method on two publicly available datasets, namely BUSI and UDIAT. We achieve a Dice of 0.8265 and 0.8827 on the two datasets, which are at least 2% and 1.24% higher than other state-of-the-art ultrasound image segmentation methods.

关键词： Deep learning Image segmentation Visualization Ultrasonic imaging Fuses Neural networks Speckle

来源：评论

学校读者我要写书评

暂无评论

Understanding the Robustness of 3D Object Detection with Bird'View Representations in Autonomous Driving

Understanding the Robustness of 3D Object Detection with Bir...

引用

2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition, CVPR 2023

作者： Zhu, Zijian Zhang, Yichi Chen, Hai Dong, Yinpeng Zhao, Shu Ding, Wenbo Zhong, Jiachen Zheng, Shibao Institute of Image Communication and Network Engineering Shanghai Jiao Tong University China Institute for Ai Tsinghua University BNRist Center Thbi Lab Dept. of Comp. Sci. and Tech. China School of Computer Science and Technology Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Information Materials and Intelligent Sensing Laboratory of Anhui Province China Saic Motor Ai Lab Zhongguancun Laboratory China

ISBN: (纸本)9798350301298

3D object detection is an essential perception task in autonomous driving to understand the environments. The Bird's-Eye-View (BEV) representations have significantly improved the performance of 3D detectors with camera inputs on popular benchmarks. However, there still lacks a systematic understanding of the robustness of these vision-dependent BEV models, which is closely related to the safety of autonomous driving systems. In this paper, we evaluate the natural and adversarial robustness of various representative models under extensive settings, to fully understand their behaviors influenced by explicit BEV features compared with those without BEV. In addition to the classic settings, we propose a 3D consistent patch attack by applying adversarial patches in the 3D space to guarantee the spatiotemporal consistency, which is more realistic for the scenario of autonomous driving. With substantial experiments, we draw several findings: 1) BEV models tend to be more stable than previous methods under different natural conditions and common corruptions due to the expressive spatial representations;2) BEV models are more vulnerable to adversarial noises, mainly caused by the redundant BEV features;3) Camera-LiDARfusion models have superior performance under different settings with multi-modal inputs, but BEV fusion model is still vulnerable to adversarial noises of both point cloud and image. These findings alert the safety issue in the applications of BEV detectors and could facilitate the development of more robust models. © 2023 IEEE.

关键词： Autonomous driving

来源：评论

学校读者我要写书评

暂无评论

A Novel Multi-band EBG Structure Using Nested Square Grooves 5

A Novel Multi-band EBG Structure Using Nested Square Grooves

引用

5th IEEE International Conference on Electronic Information and Communication Technology, ICEICT 2022

作者： Sun, Guoxing Ren, Xingang Ju, Huping Xueyuan, Cai He, Shuping Xianliang, Wu Huang, Zhixiang Anhui University Key Laboratory of Target Recognition and Feature Extraction of Anhui Province Lu'an China Key Laboratory of Electromagnetic Environmental Sensing of Anhui Province Anqing Normal Unverisity Anqing China Ministry of Education Anhui University Key Laboratory of Intelligent Computing & Signal Processing Hefei China Anhui University Key Laboratory of Electromagnetic Environmental Sensing of Anhui Province Hefei China

ISBN: (数字)9781665472111

ISBN: (纸本)9781665472111

A nested rectangle electromagnetic bandgap structure with dual broadband band is designed to enhance the performance of telecom/mobile 5G antennas operating at 3.3GHz and 4.9GHz, which has a short frequency spacing of about 1.6GHz. through loading EBG structure under dipole antenna, directional radiation, low profile and high gain performance have been achieved. The distance between electromagnetic bandgap (EBG) structure and antenna is only 0.067 wavelength, the first band and the second band of EBG are greatly expanded by etching nested square grooves around the EBG (NSGEBG) as compared with traditional etched ring groove EBG (ERGEBG). The bandwidth of the first band of 0.39GHz is twice wider than that of the ring groove of 0.2GHz, the second band has a bandwidth of 0.46GHz, which perfectly solves the problem that the spacing of the two operating frequency is greater than 2GHz. © 2022 IEEE.

关键词： Energy gap

来源：评论

学校读者我要写书评

暂无评论

An Efficient Saddle Search Method for Ordered Phase Transitions Involving Translational Invariance

SSRN

引用

SSRN 2024年

作者： Cui, Gang Jiang, Kai Zhou, Tiejun Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China

In this work, we propose an efficient nullspace-preserving saddle search (NPSS) method for a class of phase transitions involving translational invariance, where the critical states are often degenerate. The NPSS method includes two stages, escaping from the basin and searching for the index-1 generalized saddle point. The NPSS method climbs upward from the generalized local minimum in segments to overcome the challenges of degeneracy. In each segment, an effective ascent direction is ensured by keeping this direction orthogonal to the nullspace of the initial state in this segment. This method can escape the basin quickly and converge to the transition states efficiently. We apply the NPSS method to the phase transitions between crystals, and between crystal and quasicrystal, based on the Landau-Brazovskii and Lifshitz-Petrich free energy functionals. Numerical results show a good performance of the NPSS method. © 2024, The Authors. All rights reserved.

关键词： Free energy

来源：评论

学校读者我要写书评

暂无评论

Characterization of Plotkin-optimal two-weight codes over finite chain rings and related applications

arXiv

引用

arXiv 2023年

作者： Li, Shitao Shi, Minjia Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China State Key Laboratory of Integrated Services Networks Xidian University Xi’an710071 China

Few-weight codes over finite chain rings are associated with combinatorial objects such as strongly regular graphs (SRGs), strongly walk-regular graphs (SWRGs) and finite geometries, and are also widely used in data storage systems and secret sharing schemes. The first objective of this paper is to characterize all possible parameters of Plotkin-optimal two-homogeneous weight regular projective codes over finite chain rings, as well as their weight distributions. We show the existence of codes with these parameters by constructing an infinite family of two-homogeneous weight codes. The parameters of their Gray images have the same weight distribution as that of the two-weight codes of type SU1 in the sense of Calderbank and Kantor (Bull Lond Math Soc 18: 97-122, 1986). Further, we also construct three-homogeneous weight regular projective codes over finite chain rings combined with some known results. Finally, we study applications of our constructed codes in secret sharing schemes and graph theory. In particular, infinite families of SRGs and SWRGs with non-trivial parameters are *** Codes 94B05, 05E30 Copyright © 2023, The Authors. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：