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

4th International Conference on Optics and Image processing, ICOIP 2024

作者： Xu, Hongze Chen, Chen Tian, Xuecong He, Liang Zuo, Enguang Chen, Xiaomei Wu, Lijun Chen, Cheng Lv, Xiaoyi College of Software Xinjiang University Urumqi830046 China College of Information Science and Engineering Xinjiang University Urumqi830046 China Key Laboratory of signal detection and processing Xinjiang University Urumqi830046 China Xinjiang Cloud Computing Application Laboratory Karamay834099 China Department of Rheumatology and Immunology People's Hospital of Xinjiang Uygur Autonomous Region Urumqi830001 China Xinjiang Clinical Research Center for Rheumatoid Arthritis Urumqi830001 China Department of Electronic Engineering Tsinghua National Laboratory for Information Science and Technology Tsinghua University Beijing China School of Information Science and Engineering Xinjiang University Ürümqi China

ISBN: (纸本)9781510682481

Osteoarthritis (OA) is a common chronic degenerative disease worldwide. Currently, traditional diagnostic methods for OA have disadvantages such as high cost and long time consumption. For this reason, it is urgent to have a method that can diagnose osteoarthritis quickly and accurately. During this study, we suggest a multi-column convolutional neural networks (MCNN) model based on Mel-frequency cepstral coefficient (MFCC). We first compare the effectiveness of Partial Least Squares (PLS) and MFCC in preprocessing the data and comprehensively evaluate the performance of the model by five-fold cross-validation. To further improve the ability of recognizing spectral features, We utilize the Spectral Segmentation Method (SSM) to construct the MFCC feature sequences into 2D spectral feature maps and input them into the MCNN for classification. The final experimental results show that our proposed mfc - ssm - mcnn model has a high classification efficiency in diagnosing osteoarthritis with an accuracy of 95.0%. © 2024 SPIE.

关键词： Raman spectroscopy

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: vivid multi-colored hair editing via latent diffusion 24

HairDiffusion: vivid multi-colored hair editing via latent d...

引用

Proceedings of the 38th International Conference on Neural Information processing Systems

作者： Yu Zeng Yang Zhang Jiachen Liu Linlin Shen Kaijun Deng Weizhao He Jinbao Wang Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University and Shenzhen Institute of Artificial Intelligence and Robotics for Society and National Engineering Laboratory for Big Data System Computing Technology Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University and Guangdong Provincial Key Laboratory of Intelligent Information Processing

ISBN: (纸本)9798331314385

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SpreadFGL: Edge-Client Collaborative Federated Graph Learning with Adaptive Neighbor Generation

SpreadFGL: Edge-Client Collaborative Federated Graph Learnin...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Luying Zhong Yueyang Pi Zheyi Chen Zhengxin Yu Wang Miao Xing Chen Geyong Min College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China School of Computing and Communications University of Lancaster UK School of Engineering Computing and Mathematics University of Plymouth UK Department of Computer Science University of Exeter UK

ISBN: (数字)9798350383508

ISBN: (纸本)9798350383515

Federated Graph Learning (FGL) has garnered widespread attention by enabling collaborative training on multiple clients for semi-supervised classification tasks. However, most existing FGL studies do not well consider the missing inter-client topology information in real-world scenarios, causing insufficient feature aggregation of multi-hop neighbor clients during model training. Moreover, the classic FGL commonly adopts the FedAvg but neglects the high training costs when the number of clients expands, resulting in the overload of a single edge server. To address these important challenges, we propose a novel FGL framework, named SpreadFGL, to promote the information flow in edge-client collaboration and extract more generalized potential relationships between clients. In SpreadFGL, an adaptive graph imputation generator incorporated with a versatile assessor is first designed to exploit the potential links between subgraphs, without sharing raw data. Next, a new negative sampling mechanism is developed to make SpreadFGL concentrate on more refined information in downstream tasks. To facilitate load balancing at the edge layer, SpreadFGL follows a distributed training manner that enables fast model convergence. Using real-world testbed and benchmark graph datasets, extensive experiments demonstrate the effectiveness of the proposed SpreadFGL. The results show that SpreadFGL achieves higher accuracy and faster convergence against state-of-the-art algorithms.

关键词： Training Accuracy Collaboration Benchmark testing Imputation Generators Topology

来源：评论

学校读者我要写书评

暂无评论

Singular Value Decomposition Compressed Ghost Imaging Based on Non-negative Constraints 11

Singular Value Decomposition Compressed Ghost Imaging Based ...

引用

2019第十一届数字图像处理国际会议

作者： Cheng Zhang Jun Tang Yuanyuan Zhu Meiqin Wang Qianwen Chen Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University

ISBN: (数字)9781510630765

ISBN: (纸本)9781510630758

Compressed ghost imaging can effectively enhance the quality of original image from far fewer measurements,but due to the non-negativity of the measurement matrix,the recover quality is thus *** this paper,singular value decomposition compressed ghost imaging is proposed;First,the singular value decomposition be used to decompose the measurement matrix,and then the optimized measurement matrix and measurements are used to recover the original *** experiments verify the superiority of our proposed singular value decomposition compression ghost imaging method.

关键词： ghost imaging compressed ghost imaging singular value decomposition compressed ghost imaging

来源：评论

学校读者我要写书评

暂无评论

Multi-View Subgraph Neural Networks: Self-Supervised Learning with Scarce Labeled Data

arXiv

引用

arXiv 2024年

作者： Wang, Zhenzhong Zeng, Qingyuan Lin, Wanyu Jiang, Min Tan, Kay Chen Department of Computing The Hong Kong Polytechnic University Hong Kong Department of Artificial Intelligence Key Laboratory of Digital Protection and Intelligent Processing of Intangible Cultural Heritage of Fujian and Taiwan Ministry of Culture and Tourism School of Informatics Xiamen University Fujian Xiamen361005 China

While graph neural networks (GNNs) have become the de-facto standard for graph-based node classification, they impose a strong assumption on the availability of sufficient labeled samples. This assumption restricts the classification performance of prevailing GNNs on many real-world applications suffering from low-data regimes. Specifically, features extracted from scarce labeled nodes could not provide sufficient supervision for the unlabeled samples, leading to severe over-fitting. In this work, we point out that leveraging subgraphs to capture long-range dependencies can augment the representation of a node with homophily properties, thus alleviating the low-data regime. However, prior works leveraging subgraphs fail to capture the long-range dependencies among nodes. To this end, we present a novel self-supervised learning framework, called Multi-view subgraph neural networks (Muse), for handling the long-range dependencies. In particular, we propose an information theory-based identification mechanism to identify two types of subgraphs from the views of input space and latent space, respectively. The former is to capture the local structure of the graph, while the latter captures the long-range dependencies among nodes. By fusing these two views of subgraphs, the learned representations can preserve the topological properties of the graph at large, including the local structure and long-range dependencies, thus maximizing their expressiveness for downstream node classification tasks. Theoretically, we provide the generalization error bound based on Rademacher complexity to show the effectiveness of capturing complementary information from subgraphs of multiple views. Empirically, we show a proof-of-concept of Muse on canonical node classification problems on graph data. Experimental results show that Muse outperforms the alternative methods on node classification tasks with limited labeled data. Copyright © 2024, The Authors. All rights reserved.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Super-Sparse-Sampling High-Resolution Photoacoustic Microscopy Boosted by Generative Diffusion Priors

SSRN

引用

SSRN 2025年

作者： Chen, Yanhan Cao, Yubin Liu, Guolin Wang, Yiguang Cao, Siyi Yuan, Weiliang Lian, Teng Liu, Qiegen Song, Xianlin School of Information Engineering Nanchang University Nanchang330031 China Jiluan Academy Nanchang University Nanchang330031 China Jiangxi Provincial Key Laboratory of Advanced Signal Processing and Intelligent Communications Nanchang University Nanchang330031 China Jiangxi Provincial Engineering Research Center for Intelligent Medical Information Detection and Internet of Things Nanchang University Nanchang330031 China

Photoacoustic Microscopy (PAM) is a non-invasive hybrid biomedical imaging technology that combines the advantages of optics and acoustics to provide high-resolution biological tissue information at the submicron scale. Conventional PAM suffers from slow imaging speeds during high-resolution imaging due to the limitations of the laser pulse repetition rate. Although extending the sampling step size (i.e., sparse sampling) can enhance imaging speed and alleviate data collection demands, it might compromise image quality by causing distortions or the loss of fine details. This study presents an enhanced method based on the mean-reverting diffusion model for sparse-sampling high-resolution reconstruction in PAM to address the problem. The model captures prior knowledge of the data distribution by simulating the degradation process from a fully-sampled image to a sparsely-sampled image contaminated with Gaussian noise (mean state). The learned prior is then utilized to iteratively reconstruct a fully-sampled image from the sparsely-sampled one. The results indicate that the IR-SDE method achieves high-resolution sparse-sampling reconstruction for mouse in vivo blood vessel experimental data compared with the Richardson-Lucy deconvolution method (RL Deconv) and CycleGAN method. Under super-sparse sampling (sampling ratios of about 0.4%), the IR-SDE method reaches an SSIM of 0.742 and a PSNR of 24.22 dB using only about 0.4% of the fully-sampled pixels, improving 0.597 (~412%) in SSIM and 11.51 dB (~91%) in PSNR, compared to U-Net method. Even in the case of reconstructing sparsely-sampled PAM images obtained from real-world scenarios without prior training or extensive trainable data, the proposed method still demonstrates satisfactory reconstruction performance. The proposed method is anticipated to improve reconstruction speed and imaging speed, achieving highresolution reconstruction at super-sparse sampling. © 2025, The Authors. All rights reserved.

关键词： Photoacoustic microscopy

来源：评论

学校读者我要写书评

暂无评论

Lesion-Aware Open Set Medical Image Recognition with Domain Shift

Lesion-Aware Open Set Medical Image Recognition with Domain ...

引用

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

作者： Yiqian Xu Rui-Wei Zhao Rui Feng School of Computer Science Shanghai Key Laboratory of Intelligent Information Processing Fudan University Shanghai China Academy for Engineering and Technology Fudan University Shanghai China National Children’s Medical Center Children’s Hospital of Fudan University Shanghai China Shanghai Collaborative Innovation Center of Intelligent Visual Computing Shanghai China

Medical image diagnosis in real clinical scenario faces the challenging open set recognition problem with domain shift. Based on the observation that it is often merely the local lesion areas in the whole image decide or cause the true seen or potential unseen disease labels, we propose a unified deep learning framework to address it by establishing a lesion-aware mask generator to guide the model towards focusing on the lesion areas for both seen and unseen diseases, followed by a multi-task feature learning module to extract the lesion image features; and an open set recognizer with improved capability to reject unseen classes. Last but not least, we propose tailored training strategies with mixed up data and mask augmentation for improved OSR and multi-clue cross-domain feature alignment for domain generalization. Through comparative experiments and ablation studies on the representative skin lesion benchmarks, we successfully validate the effectiveness of our proposed framework.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adaptive-Propagating Heterophilous Graph Convolutional Network

SSRN

引用

SSRN 2024年

作者： Huang, Yang Pi, Yueyang Shi, Yiqing Wang, Shiping Guo, Wenzhong College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China College of Photonic and Electronic Engineering Fujian Normal University Fuzhou350007 China

Graph convolutional network have significant advantages in tasks dealing with graph-structured data, but most existing approaches based on graph convolutional network usually potentially assume that nodes belonging to the same class in a graph tend to form edges, yet inter-class edges exist in many real graph-structured data. Due to the propagation mechanism of graph convolutional network, it is usually difficult to avoid the aggregation of interference information of nodes from different classes, leading to the inclusion of noise and irrelevant information in the results, thus affecting the performance of the model. We propose a new framework to address this issue, which can extend graph convolutional network to heterophilous graph-structured data. The proposed method has two main parts: Firstly, from the perspective of feature space, the heterophily of the graph-structured data is modeled so that the model can adaptively change the information propagation process according to the homophily of the edges, and mitigate the influence of inter-class information on the model. Secondly, the implicit node interaction information is captured through the feature space, which is then fused with the original interaction information to aggregate sufficient intra-class information. Extensive experiments on real-world datasets demonstrate the competitiveness of our approach among current state-of-the-art methods. © 2024, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Fence Theorem: Towards Dual-Objective Semantic-Structure Isolation in Preprocessing Phase for 3D Anomaly Detection

arXiv

引用

arXiv 2025年

作者： Liang, Hanzhe Zhou, Jie Chen, Xuanxin Dai, Tao Wang, Jinbao Gao, Can College of Computer Science and Software Engineering Shenzhen University China Shenzhen Audencia Financial Technology Institute Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Faculty of Education Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

3D anomaly detection (AD) is prominent but difficult due to lacking a unified theoretical foundation for preprocessing design. We establish the Fence Theorem, formalizing preprocessing as a dual-objective semantic isolator: (1) mitigating cross-semantic interference to the greatest extent feasible and (2) confining anomaly judgements to aligned semantic spaces wherever viable, thereby establishing intra-semantic comparability. Any preprocessing approach achieves this goal through a two-stage process of Semantic-Division and Spatial-Constraints stage. Through systematic deconstruction, we theoretically and experimentally subsume existing preprocessing methods under this theorem via tripartite evidence: qualitative analyses, quantitative studies, and mathematical proofs. Guided by the Fence Theorem, we implement Patch3D, consisting of Patch-Cutting and Patch-Matching modules, to segment semantic spaces and consolidate similar ones while independently modeling normal features within each space. Experiments on Anomaly-ShapeNet and Real3D-AD with different settings demonstrate that progressively finer-grained semantic alignment in preprocessing directly enhances point-level AD accuracy, providing inverse validation of the theorem’s causal logic. Copyright © 2025, The Authors. All rights reserved.

关键词： Fences

来源：评论

学校读者我要写书评

暂无评论

A Multi-direction Prediction Multi-objective Hybrid Chemical Reaction Optimization Algorithm for Dynamic Multi-objective Optimization 16th

A Multi-direction Prediction Multi-objective Hybrid Chemical...

引用

16th International Conference on Bio-Inspired computing: Theories and Applications, BIC-TA 2021

作者： Li, Hongye Pan, Xiaoying Gan, Wei Wang, Lei School of Computer Science and Technology Xi’an University of Posts and Telecommunications Shaanxi Xi’an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi’an710121 China Xi’an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi’an710121 China Xi’an Shiyou University Shaanxi Xi’an710065 China School of Computer Science and Engineering Xi’an University of Technology Xi’an710048 China Shaanxi University of Technology Shaanxi Han Zhong723001 China

ISBN: (纸本)9789811912559

The challenge of solving dynamic multi-objective optimization problems is to trace the varying Pareto optimal front and/or Pareto optimal set quickly and efficiently. This paper proposes a multi-direction prediction strategy using a hybrid chemical reaction optimization, aimed at finding the dynamic Pareto optimal front and/or Pareto optimal set as quickly and accurately as possible before the next environmental change occurs. The proposed method, multi-direction prediction multi-objective hybrid chemical reaction optimization algorithm which mainly includes a hybrid chemical reaction optimization algorithm is proposed for solving dynamic multi-objective problems, which can guide population trace the optimum. When the environment has changed, the population is divided into several subpopulations. In subpopulation, a center point was found to construct multi-direction prediction model. As a result, this approach enhances the diversity of algorithm. While the environment has not changed, the hybrid chemical reaction algorithm with particle swarm optimization algorithm can efficiency find the optimal solution, it can achieve good diversity as well as guarantee the avoidance of local optimal solutions. The proposed algorithm is measured on several benchmark test suites with various dynamic characteristics and different difficulties. Experimental results show that this algorithm is very competitive in dealing with dynamic multi-objective optimization problems when compared with four state-of-the-art approaches. © 2022, Springer Nature Singapore Pte Ltd.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：