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

European Journal of Radiology Artificial intelligence 2025年 2卷 100019-100019页

作者： Matthaios Triantafyllou Evangelia E. Vassalou Alexia Maria Goulianou Theodoros H. Tosounidis Kostas Marias Apostolos H. Karantanas Michail E. Klontzas Artificial Intelligence and Translational Imaging (ATI) Lab Department of Radiology School of Medicine University of Crete Voutes Campus Heraklion Greece Department of Medical Imaging University Hospital of Heraklion Heraklion Crete Greece Department of Orthopaedic Surgery University Hospital Heraklion Heraklion Crete 71500 Greece Computational BioMedicine Laboratory Institute of Computer Science Foundation for Research and Technology (FORTH) Heraklion Crete Greece Department of Electrical and Computer Engineering Hellenic Mediterranean University Heraklion Crete Greece Division of Radiology Department for Clinical Science Intervention and Technology (CLINTEC) Karolinska Institutet Stockholm Sweden

Objective Calcific tendinopathy of the rotator cuff presents challenges in symptom management and functional recovery with image-guided treatment. This study aimed to develop a regression model integrating radiomic and clinical features to predict 1-year Constant-Murley Score (CMS) improvement following ultrasound-guided percutaneous irrigation of calcific tendinopathy (US-PICT). Materials and Methods This retrospective study included 84 patients undergoing US-PICT between 2017 and 2019. Advanced Contrast Limited Adaptive Histogram Equilization (CLAHE) preprocessing was applied to US images for radiomic feature extraction. Manual segmentation of calcifications yielded 849 features, later refined to 6 predictive features through inter-rater ICC analysis, correlation filtering, and Recursive Feature Elimination (RFE). Clinical variables, including age, calcification type, and maximum diameter, were integrated. Model performance was evaluated using R 2 , MAE, RMSE, calibration curves, and SHAP analysis, while decision curve analysis assessed clinical utility. Results The regression model achieved an R 2 of 0.66 (95 % CI: 0.52–0.76) with an RMSE of 8.26. Younger age, larger calcifications, and fluid-like consistency correlated with greater CMS improvement (p < 0.001). SHAP analysis identified calcification type, age, and radiomic features as key predictors. Calibration curves demonstrated reasonable alignment between predictions and observed outcomes, while decision curve analysis highlighted the model’s clinical utility. Conclusion Radiomics combined with clinical features provides robust predictions of 1-year functional improvement after US-PICT. Further validation in larger cohorts is warranted to refine and generalize these findings.

关键词： Radiomics Calcific Tendinopathy/(US-PICT) Machine Learning Artificial intelligence Shoulder

来源：评论

学校读者我要写书评

暂无评论

Minority Oversampling Using Sensitivity

Minority Oversampling Using Sensitivity

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Jianjun Zhang Ting Wang Wing W. Y. Ng Witold Pedrycz Shuai Zhang Chris D. Nugent Guangdong Provincial Key Lab of Computational Intelligence and Cyberspace Information School of Computer Science and Engineering South China University of Technology Guangzhou China Department of Electrical and Computer Engineering University of Alberta Edmonton Canada School of Computing Ulster University Jordanstown United Kingdom

ISBN: (数字)9781728169262

ISBN: (纸本)9781728169279

The Synthetic Minority Oversampling Technique (SMOTE) is effective to handle imbalance classification problems. However, the random candidate selection of SMOTE may lead to severe overlap between classes and introduce new noise factors. Many variants of SMOTE have been proposed to relieve these problems by generating new examples in safe regions. Most of these methods generate new examples with existing minority examples without considering the negative impact that class imbalance have brought on these examples. In this paper, we handle the imbalance classification using Bayes' decision rule and propose a novel oversampling method, the Minority Oversampling using Sensitivity (MOSS). Candidates for new example generations are selected considering their sensitivity with respect to class imbalance. New examples are then generated by interpolating the candidate and one of its adjacent examples. Experiments on 30 datasets confirm the superiority of the MOSS against one baseline method and seven oversampling methods.

关键词： Sensitivity Noise measurement Computational intelligence Cyberspace computer science Gaussian distribution Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

A distributed Multifactorial Particle Swarm Optimization Approach

TechRxiv

引用

TechRxiv 2021年

作者： Aboud, Ahlem Rokbani, Nizar Mirjalili, Seyedali Qahtani, Abdulrahman M. Almutiry, Omar Dhahri, Habib Alimi, Adel M. University of Sousse ISITCom Sousse4011 Tunisia BP 1173 Sfax3038 Tunisia High Institute of Applied Science and technolgy of Sousse University of Sousse Tunisia Department of Electrical and Electronic Engineering Science Faculty of Engineering and the Built Environment University of Johannesburg South Africa Centre for Artificial Intelligence Research and Optimisation Torrens University Australia Brisbane Australia Yonsei Frontier Lab Yonsei University Korea Republic of Department of Computer Science College of Computers and Information Technology Taif University P.O.Box. 11099 Taif21944 Saudi Arabia College of Applied Computer Science King Saud University Riyadh Saudi Arabia

Multifactorial Optimization (MFO) and Evolutionary Transfer Optimization (ETO) are new optimization challenging paradigms for which the multi-Objective Particle Swarm Optimization system (MOPSO) may be interesting despite limitations. MOPSO has been widely used in static/dynamic multi-objective optimization problems, while its potentials for multi-task optimization are not completely unveiled. This paper proposes a new distributed Multifactorial Particle Swarm Optimization algorithm (DMFPSO) for multi-task optimization. This new system has a distributed architecture on a set of sub-swarms that are dynamically constructed based on the number of optimization tasks affected by each particle skill factor. DMFPSO is designed to deal with the issues of handling convergence and diversity concepts separately. DMFPSO uses Beta function to provide two optimized profiles with a dynamic switching behaviour. The first profile, Beta-1, is used for the exploration which aims to explore the search space toward potential solutions, while the second Beta-2 function is used for convergence enhancement. This new system is tested on 36 benchmarks provided by the CEC’2021 Evolutionary Transfer Multi-Objective Optimization Competition. Comparatives with the state-of-the-art methods are done using the Inverted General Distance (IGD) and Mean Inverted General Distance (MIGD) metrics. Based on the MSS metric, this proposal has the best results on most tested problems. © 2021, CC BY.

关键词： Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Perturbations and Phase Transitions in Swarm Optimization Algorithms

arXiv

引用

arXiv 2025年

作者： Vantuch, Tomáš Zelinka, Ivan Adamatzky, Andrew Marwan, Norbert Center ENET Technical University of Ostrava Czech Republic Modeling Evolutionary Algorithms Simulation and Artificial Intelligence Faculty of Electrical & Electronics Engineering Ton Duc Thang University Ho Chi Minh City Viet Nam Department of Computer Science Technical University of Ostrava Czech Republic Unconventional Computing Lab UWE Bristol United Kingdom Leibniz Association Potsdam Germany

Natural systems often exhibit chaotic behavior in their space-time evolution. Systems transiting between chaos and order manifest a potential to compute, as shown with cellular automata and artificial neural networks. We demonstrate that swarm optimization algorithms also exhibit transitions from chaos, analogous to a motion of gas molecules, when particles explore solution space disorderly, to order, when particles follow a leader, similar to molecules propagating along diffusion gradients in liquid solutions of reagents. We analyze these ‘phase-like’ transitions in swarm optimization algorithms using recurrence quantification analysis and Lempel-Ziv complexity estimation. We demonstrate that converging iterations of the optimization algorithms are statistically different from non-converging ones in a view of applied chaos, complexity and predictability estimating indicators. An identification of a key factor responsible for the intensity of their phase transition is the main contribution of this paper. We examined an optimization as a process with three variable factors – an algorithm, number generator and optimization function. More than 9.000 executions of the optimization algorithm revealed that the nature of an applied algorithm itself is the main source of the phase transitions. Some of the algorithms exhibit larger transition-shifting behavior while others perform rather transition-steady computing. These findings might be important for future extensions of these algorithms. © 2025, CC BY-NC-ND.

关键词： Cellular automata

来源：评论

学校读者我要写书评

暂无评论

Nearest neighborhood-based deep clustering for source data-absent unsupervised domain adaptation

arXiv

引用

arXiv 2021年

作者： Tang, Song Yang, Yan Ma, Zhiyuan Hendrich, Norman Zeng, Fanyu Ge, Shuzhi Sam Zhang, Changshui Zhang, Jianwei The Institute of Machine Intelligence University of Shanghai for Science and Technology Shanghai China The State Key Laboratory of Electronic Thin Films and Integrated Devices University of Electronic Science and Technology of China Chengdu China Group Department of Informatics Universität Hamburg Hamburg Germany The Institute of Machine Intelligence University of Shanghai for Science and Technology Shanghai China The State Key Lab. for Novel Software Technology Nanjing University Nanjing China The Engineering Research Center of Wideband Wireless Communication Technology Ministry of Education Nanjing University of Posts and Telecommunications Nanjing China The Department of Electrical and Computer Engineering National University of Singapore Singapore Singapore The Department of Automation Tsinghua University Beijing China

In the classic setting of unsupervised domain adaptation (UDA), the labeled source data are available in the training phase. However, in many real-world scenarios, owing to some reasons such as privacy protection and information security, the source data is inaccessible, and only a model trained on the source domain is available. This paper proposes a novel deep clustering method for this challenging task. Aiming at the dynamical clustering at feature-level, we introduce extra constraints hidden in the geometric structure between data to assist the process. Concretely, we propose a geometry-based constraint, named semantic consistency on the nearest neighborhood (SCNNH), and use it to encourage robust clustering. To reach this goal, we construct the nearest neighborhood for every target data and take it as the fundamental clustering unit by building our objective on the geometry. Also, we develop a more SCNNH-compliant structure with an additional semantic credibility constraint, named semantic hyper-nearest neighborhood (SHNNH). After that, we extend our method to this new geometry. Extensive experiments on three challenging UDA datasets indicate that our method achieves state-of-the-art results. The proposed method has significant improvement on all datasets (as we adopt SHNNH, the average accuracy increases by over 3.0% on the large-scaled dataset). Code is available at https://***/tntek/N2DCX. Copyright © 2021, The Authors. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Erratum to: Large circuit models: opportunities and challenges

引用

science CHINA Information sciences 2024年第11期67卷 1-1页

作者： Lei CHEN Yiqi CHEN Zhufei CHU Wenji FANG Tsung-Yi HO Ru HUANG Yu HUANG Sadaf KHAN Min LI Xingquan LI Yu LI Yun LIANG Jinwei LIU Yi LIU Yibo LIN Guojie LUO Hongyang PAN Zhengyuan SHI Guangyu SUN Dimitrios TSARAS Runsheng WANG Ziyi WANG Xinming WEI Zhiyao XIE Qiang XU Chenhao XUE Junchi YAN Jun YANG Bei YU Mingxuan YUAN Evangeline F.Y. YOUNG Xuan ZENG Haoyi ZHANG Zuodong ZHANG Yuxiang ZHAO Hui-Ling ZHEN Ziyang ZHENG Binwu ZHU Keren ZHU Sunan ZOU Huawei Noah's Ark Lab Hong Kong 999077 China School of Integrated Circuits Peking University Beijing 100871 China Faculty of Electrical Engineering and Computer Science Ningbo University Ningbo 315211 China Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong 999077 China Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong 999077 China School of Integrated Circuits Southeast University Nanjing 210096 China Huawei HiSilicon Shenzhen 518129 China Peng Cheng Laboratory Shenzhen 518052 China School of Computer Science Peking University Beijing 100871 China School of Microelectronics State Key Laboratory of Integrated Chips and System Fudan University Shanghai 200433 China School of Artificial Intelligence Shanghai Jiao Tong University Shanghai 200240 China

来源：评论

学校读者我要写书评

暂无评论

NTIRE 2022 Challenge on Stereo Image Super-Resolution: Methods and Results

arXiv

引用

arXiv 2022年

作者： Guo, Yulan Wang, Longguang Wang, Yingqian Li, Juncheng Gu, Shuhang Timofte, Radu Chen, Liangyu Chu, Xiaojie Yu, Wenqing Jin, Kai Wei, Zeqiang Guo, Sha Yang, Angulia Zhou, Xiuzhuang Guo, Guodong Xiao, Huaxin Yan, Shen Liu, Yuxiang Cai, Hanxiao Dai, Bin Peng, Feiyue Cao, Pu Nie, Yang Yang, Lu Song, Qing Hu, Xiaotao Xu, Jun Xu, Mai Jing, Junpeng Deng, Xin Xing, Qunliang Qiao, Minglang Guan, Zhenyu Guo, Wenlong Peng, Chenxu Chen, Zan Chen, Junyang Li, Hao Chen, Junbin Li, Weijie Yang, Zhijing Li, Gen Li, Aijin Sun, Lei Zhang, Dafeng Liu, Shizhuo Zhang, Jiangtao Qu, Yanyun Yang, Hao-Hsiang Huang, Zhi-Kai Chen, Wei-Ting Chang, Hua-En Kuo, Sy-Yen Liang, Qiaohui Lin, Jianxin Wang, Yijun Yin, Lianying Zhang, Rongju Zhao, Wei Xiao, Peng Xu, Rongjian Zhang, Zhilu Zuo, Wangmeng Guo, Hansheng Gao, Guangwei Zeng, Tieyong Kim, Joohyeok Kim, HyeonA Park, Eunpil Sim, Jae-Young Pi, Huicheng Zhang, Shunli Zhai, Jucai Zeng, Pengcheng Liu, Yang Ma, Chihao Huang, Yulin Chen, Junying National University of Defense Technology China The Chinese University of Hong Kong Hong Kong The University of Sydney Australia University of Würzburg ETH Zürich Switzerland MEGVII Technology China Peking University China Bigo Technology Pte. Ltd Singapore Smart Healthcare Innovation Lab Beijing University of Posts and Telecommunications China School of Artificial Intelligence Beijing University of Posts and Telecommunications China Head of Institute of Deep Learning Baidu Research College of Systems Engineering National University of Defense Technology China College of Liberal Arts and Sciences National University of Defense Technology China Pattern Recognition and Intelligent Vision Lab Beijing University of Posts and Telecommunications China College of Computer Science Nankai University Tianjin China School of Statistics and Data Science Nankai University Tianjin Singapore Beihang University China Zhejiang University of Technology China Guangdong University of Technology China Tencent OVBU SRC-B Xiamen University China Department of Electrical Engineering National Taiwan University Taiwan Graduate Institute of Electronics Engineering National Taiwan University Taiwan College of Computer Science and Electronic Engineering Hunan University China Harbin Institude of Technology China The Chinese University of Hong Kong Hong Kong Nanjing University of Posts and Telecommunications China Department of Electrical Engineering Ulsan National Institute of Science and Technology Korea Republic of Graduate School of Artificial Intelligence Ulsan National Institute of Science and Technology Korea Republic of Beijing Jiaotong University China City University of Hong Kong Hong Kong South China University of Technology China

In this paper, we summarize the 1st NTIRE challenge on stereo image super-resolution (restoration of rich details in a pair of low-resolution stereo images) with a focus on new solutions and results. This challenge has 1 track aiming at the stereo image super-resolution problem under a standard bicubic degradation. In total, 238 participants were successfully registered, and 21 teams competed in the final testing phase. Among those participants, 20 teams successfully submitted results with PSNR (RGB) scores better than the baseline. This challenge establishes a new benchmark for stereo image SR. Copyright © 2022, The Authors. All rights reserved.

关键词： Stereo image processing

来源：评论

学校读者我要写书评

暂无评论

The state-of-the-art in Cardiac MRI Reconstruction: Results of the CMRxRecon Challenge in MICCAI 2023

arXiv

引用

arXiv 2024年

作者： Lyu, Jun Qin, Chen Wang, Shuo Wang, Fanwen Li, Yan Wang, Zi Guo, Kunyuan Ouyang, Cheng Tänzer, Michael Liu, Meng Sun, Longyu Sun, Mengting Li, Qin Shi, Zhang Hua, Sha Li, Hao Chen, Zhensen Zhang, Zhenlin Xin, Bingyu Metaxas, Dimitris N. Yiasemis, George Teuwen, Jonas Zhang, Liping Chen, Weitian Pang, Yanwei Liu, Xiaohan Razumov, Artem Dylov, Dmitry V. Dou, Quan Yan, Kang Xue, Yuyang Du, Yuning Dietlmeier, Julia Garcia-Cabrera, Carles Hemidi, Ziad Al-Haj Vogt, Nora Xu, Ziqiang Zhang, Yajing Chu, Ying-Hua Chen, Weibo Bai, Wenjia Zhuang, Xiahai Qin, Jing Wu, Lianmin Yang, Guang Qu, Xiaobo Wang, He Wang, Chengyan Psychiatry Neuroimaging Laboratory Brigham and Women’s Hospital Harvard Medical School 399 Revolution Drive BostonMA02215 United States Department of Electrical and Electronic Engineering & I-X Imperial College London United Kingdom Digital Medical Research Center School of Basic Medical Sciences Fudan University Shanghai China Department of Bioengineering & I-X Imperial College London LondonW12 7SL United Kingdom Cardiovascular Magnetic Resonance Unit Royal Brompton Hospital Guy’s and St Thomas’ NHS Foundation Trust LondonSW3 6NP United Kingdom Department of Radiology Ruijin Hospital Shanghai Jiao Tong University School of Medicine Shanghai China Department of Electronic Science Fujian Provincial Key Laboratory of Plasma and Magnetic Resonance National Institute for Data Science in Health and Medicine Institute of Artificial Intelligence Xiamen University Xiamen361102 China Department of Computing Department of Brain Sciences Imperial College London LondonSW7 2AZ United Kingdom Human Phenome Institute Fudan University 825 Zhangheng Road Pudong New District Shanghai201203 China Department of Radiology Zhongshan Hospital Fudan University Shanghai China Department of Cardiovascular Medicine Ruijin Hospital Lu Wan Branch Shanghai Jiao Tong University School of Medicine Shanghai China Institute of Science and Technology for Brain-Inspired Intelligence Fudan University Shanghai200433 China Department of Computer Science Rutgers University PiscatawayNJ08854 United States AI for Oncology Netherlands Cancer Institute Plesmanlaan 121 Amsterdam1066 CX Netherlands Department of Imaging and Interventional Radiology The Chinese University of Hong Kong Hong Kong TJK-BIIT Lab School of Electrical and Information Engineering Tianjin University Tianjin300072 China Skolkovo Institute Of Science And Technology Center for Artificial Intelligence Technology 30/1 Bolshoy blvd. Moscow121205 Russia Department of Biomedical Engineering University of Virginia

Cardiac magnetic resonance imaging (MRI) provides detailed and quantitative evaluation of the heart’s structure, function, and tissue characteristics with high-resolution spatial-temporal imaging. However, its slow imaging speed and motion artifacts are notable limitations. Undersampling reconstruction, especially data-driven algorithms, has emerged as a promising solution to accelerate scans and enhance imaging performance using highly under-sampled data. Nevertheless, the scarcity of publicly available cardiac k-space datasets and evaluation platform hinder the development of data-driven reconstruction algorithms. To address this issue, we organized the Cardiac MRI Reconstruction Challenge (CMRxRecon) in 2023, in collaboration with the 26th International Conference on Medical Image Computing and computer-Assisted Intervention (MICCAI). CMRxRecon presented an extensive k-space dataset comprising cine and mapping raw data, accompanied by detailed annotations of cardiac anatomical structures. With overwhelming participation, the challenge attracted more than 285 teams and over 600 participants. Among them, 22 teams successfully submitted Docker containers for the testing phase, with 7 teams submitted for both cine and mapping tasks. All teams use deep learning based approaches, indicating that deep learning has predominately become a promising solution for the problem. The first-place winner of both tasks utilizes the E2E-VarNet architecture as backbones. In contrast, U-Net is still the most popular backbone for both multi-coil and single-coil reconstructions. This paper provides a comprehensive overview of the challenge design, presents a summary of the submitted results, reviews the employed methods, and offers an in-depth discussion that aims to inspire future advancements in cardiac MRI reconstruction models. The summary emphasizes the effective strategies observed in Cardiac MRI reconstruction, including backbone architecture, loss function, pre-processing techn

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

When counterpoint meets chinese folk melodies 20

When counterpoint meets chinese folk melodies

引用

Proceedings of the 34th International Conference on Neural Information Processing Systems

作者： Nan Jiang Sheng Jin Zhiyao Duan Changshui Zhang Institute for Artificial Intelligence Tsinghua University (THUAI) and State Key Lab of Intelligent Technologies and Systems and Beijing National Research Center for Information Science and Technology (BNRist) and Department of Automation Tsinghua University Beijing China Department of Electrical and Computer Engineering University of Rochester

ISBN: (纸本)9781713829546

Counterpoint is an important concept in Western music theory. In the past century, there have been significant interests in incorporating counterpoint into Chinese folk music composition. In this paper, we propose a reinforcement learning-based system, named FolkDuet, towards the online countermelody generation for Chinese folk melodies. With no existing data of Chinese folk duets, FolkDuet employs two reward models based on out-of-domain data i.e., Bach chorales, and monophonic Chinese folk melodies. An interaction reward model is trained on the duets formed from outer parts of Bach chorales to model counterpoint interaction, while a style reward model is trained on monophonic melodies of Chinese folk songs to model melodic patterns. With both rewards, the generator of FolkDuet is trained to generate countermelodies while maintaining the Chinese folk style. The entire generation process is performed in an online fashion, allowing real-time interactive human-machine duet improvisation. Experiments show that the proposed algorithm achieves better subjective and objective results than the baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-stage Speaker Extraction with Utterance and Frame-Level Reference Signals

arXiv

引用

arXiv 2020年

作者： Ge, Meng Xu, Chenglin Wang, Longbiao Chng, Eng Siong Dang, Jianwu Li, Haizhou Tianjin Key Laboratory of Cognitive Computing and Application College of Intelligence and Computing Tianjin University Tianjin China School of Computer Science and Engineering Nanyang Technological University Singapore Japan Advanced Institute of Science and Technology Ishikawa Japan Department of Electrical and Computer Engineering National University of Singapore Singapore Machine Listening Lab University of Bremen Germany

Speaker extraction requires a sample speech from the target speaker as the reference. However, enrolling a speaker with a long speech is not practical. We propose a speaker extraction technique, that performs in multiple stages to take full advantage of short reference speech sample. The extracted speech in early stages is used as the reference speech for late stages. For the first time, we use frame-level sequential speech embedding as the reference for target speaker. This is a departure from the traditional utterance-based speaker embedding reference. In addition, a signal fusion scheme is proposed to combine the decoded signals in multiple scales with automatically learned weights. Experiments on WSJ0-2mix and its noisy versions (WHAM! and WHAMR!) show that SpEx++ consistently outperforms other state-of-the-art baselines. Copyright © 2020, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：