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

Multiple-Instance Learning with Instance Selection via Constructive Covering Algorithm

Tsinghua science and technology 2014年第3期19卷 285-292页

作者： Yanping Zhang Heng Zhang Huazhen Wei Jie Tang Shu Zhao the Department of Computer Science and Technology and Key Lab of Intelligent Computing and Signal Processing Anhui University the Department of Computer Science and Technology and Key Lab of Intelligent Computing and Signal Processing Anhui University1Hefei 230601 China the Department of Computer Science and Technology Tsinghua University

Multiple-Instance Learning （MIL） is used to predict the unlabeled bags＇ label by learning the labeled positive training bags and negative training *** bag is made up of several unlabeled instances.A bag is labeled positive if at least one of its instances is positive,otherwise *** multiple-instance learning methods with instance selection ignore the representative degree of the selected *** example,if an instance has many similar instances with the same label around it,the instance should be more representative than *** on this idea,in this paper,a multiple-instance learning with instance selection via constructive covering algorithm （MilCa） is *** MilCa,we firstly use maximal Hausdorff to select some initial positive instances from positive bags,then use a Constructive Covering Algorithm （CCA） to restructure the structure of the original instances of negative *** an inverse testing process is employed to exclude the false positive instances from positive bags and to select the high representative degree instances ordered by the number of covered instances from training ***,a similarity measure function is used to convert the training bag into a single sample and CCA is again used to classification for the converted *** results on synthetic data and standard benchmark datasets demonstrate that MilCa can decrease the number of the selected instances and it is competitive with the state-of-the-art MIL algorithms.

关键词： multiple-instance learning instance selection constructive covering algorithm maximal Hausdorff

来源：评论

学校读者我要写书评

暂无评论

ZCS-CDiff: A Zero-Shot Code-Switching TTS System with Conformer-Based Diffusion Model

ZCS-CDiff: A Zero-Shot Code-Switching TTS System with Confor...

引用

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

作者： Ke Chen Zhihua Huang Liang He Yonghong Yan School of Computer Science and Technology Xinjiang University Urumqi China Xinjiang Key Laboratory of Signal Detection and Processing Urumqi China Department of Electronic Engineering Tsinghua University Beijing China University of Chinese Academy of Sciences Beijing China Key Laboratory of Speech Acoustics and Content Understanding Institute of Acoustics CAS Beijing China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Code-Switching (CS) Text-To-Speech (TTS) models have gained attention due to the increasing prevalence of multilingual communication. However, existing models struggle to meet the growing demand for personalized CS TTS, particularly in Zero-Shot (ZS) scenarios where the model should generate speech for an unseen speaker from reference speech. In this paper, we propose ZCS-CDiff, a zero-shot code-switching TTS system with the Conformer-based diffusion model. We disentangle speech features and use the diffusion model to precisely model these disentangled attributes, resulting in high-quality ZS CS speech. Additionally, we introduce a Conformer-based WaveNet as the denoising network within the diffusion model to further improve the accuracy of modeling different attributes. We also designed a speaker-assist module to help the model better handle speaker information extracted from the reference speech, resulting in CS speech with higher speaker similarity. Experimental results and ablation studies demonstrate that the ZS CS speech generated by ZCS-CDiff has good speech naturalness, intelligibility, and speaker similarity while confirming the effectiveness of our design choices. Audio samples are available 1 .

关键词： Training Adaptation models Accuracy Speech coding Noise reduction Speech enhancement Signal processing Diffusion models Probabilistic logic Text to speech

来源：评论

学校读者我要写书评

暂无评论

PFS3F: Probabilistic Fusion of Superpixel-wise and Semantic-aware Structural Features for Hyperspectral Image Classification

引用

IEEE Transactions on Circuits and Systems for Video technology 2025年

作者： Zhang, Ying Duan, Puhong Liang, Lianhui Kang, Xudong Li, Jun Plaza, Antonio Hunan University of Technology College of Railway Transportation Zhuzhou412007 China Hunan University School of Robotics Changsha410082 China Guangxi University School of Electrical Engineering Nanning530004 China China University of Geosciences Hubei Key Laboratory of Intelligent Geo-Information Processing the School of Computer Science Wuhan430078 China Hyperspectral Computing Laboratory Department of Technology of Computers and Communications Escuela Politecnica University of Extremadura CaceresE-10071 Spain

processing high-dimensional data cubes and developing high-performance classifiers are core objectives in the field of hyperspectral image classification (HSIC). Superpixel-based methods are widely used in HSIC due to their efficacy in reducing redundant information and enhancing local features. However, imprecise segmentation, especially in complex structures and textures of hyperspectral images (HSIs), may lead to inconsistencies in the regions extracted by superpixels and the boundaries between different ground objects. Such inconsistencies significantly degrade the classification performance of HSIs. Alternatively, when parameter settings are inaccurate, edge-aware feature extraction methods often introduce sharpening artifacts at the image boundaries, resulting in a decrease in classification accuracy. To effectively address these challenges, we propose a novel probabilistic fusion method for HSIC. This method consists of the following stages. First, spatial information is extracted by a multiscale superpixel segmentation method and then probabilistically optimized by the extended random walk (ERW) method. Next, semantic-aware structural features (S2Fs) are extracted along with edge information of different objects. Lastly, a probabilistic framework is proposed to fuse the class probabilities of superpixel-based spatial information and semantic-aware structural features. Experimental results on three real datasets show state-of-the-art classification performance, even with limited training sets. ©1991-2012 IEEE.

关键词： Superpixels

来源：评论

学校读者我要写书评

暂无评论

Automatic detection of burn-through in GMA welding using a parametric model

引用

MECHANICAL SYSTEMS AND SIGNAL processing 1996年第5期10卷 633-651页

作者： Adolfsson, S Ericson, K Grennberg, A Department of Signal Processing University of Karlskrona/Ronneby Division of Signal Processing Luleå University of Technology Department of Computer Science and Electrical Engineering Division of Signal Processing Luleå University of Technology

This paper addresses the problem of automatic detection of burn-through in weld joints. Gas metal are (GMA) welding with pulsed current is used, and welding voltage and current are recorded. As short-circuitings are common between the welding electrode and the work piece during burn-through, a short-circuit detector is developed to detect these events. To detect another specific characteristic of burn-through-a broadband long-lasting voltage component-this detector is combined with a square-law detector. This second detector is based on a non-linear modification of an autoregressive model with extra input (ARX-model) of the welding process. The results obtained from this compound detector indicate that it is possible to detect burn-through in the welds automatically. The work also indicates that it is possible to design an on-line monitoring system for robotic GMA welding. (C) 1996 Academic Press Limited

关键词： Carbon dioxide arc welding

来源：评论

学校读者我要写书评

暂无评论

MICkNN:Multi-Instance Covering kNN Algorithm

引用

Tsinghua science and technology 2013年第4期18卷 360-368页

作者： Shu Zhao Chen Rui Yanping Zhang Department of Computer Science and Technology and Key Lab of Intelligent Computing and Signal Processing Anhui University

Mining from ambiguous data is very important in data mining. This paper discusses one of the tasks for mining from ambiguous data known as multi-instance problem. In multi-instance problem, each pattern is a labeled bag that consists of a number of unlabeled instances. A bag is negative if all instances in it are negative. A bag is positive if it has at least one positive instance. Because the instances in the positive bag are not labeled, each positive bag is an ambiguous. The mining aim is to classify unseen bags. The main idea of existing multi-instance algorithms is to find true positive instances in positive bags and convert the multi-instance problem to the supervised problem, and get the labels of test bags according to predict the labels of unknown instances. In this paper, we aim at mining the multi-instance data from another point of view, i.e., excluding the false positive instances in positive bags and predicting the label of an entire unknown bag. We propose an algorithm called Multi-Instance Covering kNN （MICkNN） for mining from multi-instance data. Briefly, constructive covering algorithm is utilized to restructure the structure of the original multi-instance data at first. Then, the kNN algorithm is applied to discriminate the false positive instances. In the test stage, we label the tested bag directly according to the similarity between the unseen bag and sphere neighbors obtained from last two steps. Experimental results demonstrate the proposed algorithm is competitive with most of the state-of-the-art multi-instance methods both in classification accuracy and running time.

关键词： mining ambiguous data multi-instance classification constructive covering algorithm kNN algorithm

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Covering Algorithm

引用

Tsinghua science and technology 2014年第1期19卷 76-81页

作者： Jie Chen Shu Zhao Yanping Zhang Department of Computer Science and Technology and Key Lab of Intelligent Computing and Signal Processing Anhui University

The concept of deep learning has been applied to many domains, but the definition of a suitable problem depth has not been sufficiently explored. In this study, we propose a new Hierarchical Covering Algorithm （HCA） method to determine the levels of a hierarchical structure based on the Covering Algorithm （CA）. The CA constructs neural networks based on samples＇ own characteristics, and can effectively handle multi-category classification and large-scale data. Further, we abstract characters based on the CA to automatically embody the feature of a deep structure. We apply CA to construct hidden nodes at the lower level, and define a fuzzy equivalence relation R on upper spaces to form a hierarchical architecture based on fuzzy quotient space theory. The covering tree naturally becomes from R. HCA experiments performed on MNIST dataset show that the covering tree embodies the deep architecture of the problem, and the effects of a deep structure are shown to be better than having a single level.

关键词： deep architecture hierarchy fuzzy equivalence relation covering tree MNIST dataset

来源：评论

学校读者我要写书评

暂无评论

A Chinese multimodal depression dataset with personality labeling for older adults with underlying medical conditions

引用

IEEE Transactions on Affective Computing 2025年

作者： Zhao, Yuliang Zhang, Huawei Li, Jian Song, Siyang Lian, Chao Liu, Yinghao Wang, Yulin Fu, Changzeng School of Information Science and Engineering Northeastern University Shenyang110819 China Hebei Key Laboratory of Micro-Nano Precision Optical Sensing and Measurement Technology Qinhuangdao066004 China Northeastern University SSTC NEU Hebei Key Laboratory of Marine Perception Network and Data Processing Hebei Qinhuangdao066004 China Osaka University Japan University of Cambridge AFAR Lab Department of Computer Science and Technology CambridgeCB3 0FT United Kingdom First Hospital of Qinhuangdao Qinhuangdao066004 China

Elderly individuals often suffer from underlying medical conditions, resulting in a significant decline in quality of life and a heightened susceptibility to depression. Presently, AI screening tools based on behavioral indicators offer an objective and effective approach to diagnosing depression. However, current AI depression screening tools are primarily tailored to adolescents and adults, exhibiting shortcomings in their applicability and accuracy for elderly individuals with underlying medical conditions. To address the above issues, firstly, this paper constructs a depression dataset for elderly people with underlying diseases by using semi-structured interviews. Secondly, based on cognitive science insights, it is recognized that personality factors significantly influence behavioral expressions and also determine the attitudes of elderly individuals toward current life circumstances/health issues. Therefore, besides annotating depression severity, the Big Five-10 personality scale was utilized to annotate participant personalities. Finally, a late fusion-based multi-task learning framework was proposed, and the effects of introducing gait information and personality annotation on the performance of depression assessment were investigated. The experimental findings affirm the importance of integrating gait information and personality assessment in improving depression detection effectiveness. This study provides valuable foundational resources, as well as beneficial references and insights, for the research on depression in the elderly. © 2010-2012 IEEE.

关键词： Depression Multimodal dataset Older adults Personality Underlying diseases

来源：评论

学校读者我要写书评

暂无评论

Cross-Modal Causal Representation Learning for Radiology Report Generation

引用

IEEE transactions on image processing : a publication of the IEEE Signal processing Society 2025年 PP卷 PP页

作者： Weixing Chen Yang Liu Ce Wang Jiarui Zhu Guanbin Li Cheng-Lin Liu Liang Lin School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China School of Science Sun Yat-sen University Shenzhen China Department of Health Technology and Informatics The Hong Kong Polytechnic University Hung Hom Hong Kong State Key Laboratory of Multimodal Artificial Intelligence Systems Institute of Automation Chinese Academy of Sciences Beijing China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing China

Radiology Report Generation (RRG) is essential for computer-aided diagnosis and medication guidance, which can relieve the heavy burden of radiologists by automatically generating the corresponding radiology reports according to the given radiology image. However, generating accurate lesion descriptions remains challenging due to spurious correlations from visual-linguistic biases and inherent limitations of radiological imaging, such as low resolution and noise interference. To address these issues, we propose a two-stage framework named Cross-Modal Causal Representation Learning (CMCRL), consisting of the Radiological Cross-modal Alignment and Reconstruction Enhanced (RadCARE) pre-training and the Visual-Linguistic Causal Intervention (VLCI) fine-tuning. In the pre-training stage, RadCARE introduces a degradation-aware masked image restoration strategy tailored for radiological images, which reconstructs high-resolution patches from low-resolution inputs to mitigate noise and detail loss. Combined with a multiway architecture and four adaptive training strategies (e.g., text postfix generation with degraded images and text prefixes), RadCARE establishes robust cross-modal correlations even with incomplete data. In the VLCI phase, we deploy causal front-door intervention through two modules: the Visual Deconfounding Module (VDM) disentangles local-global features without fine-grained annotations, while the Linguistic Deconfounding Module (LDM) eliminates context bias without external terminology databases. Experiments on IU-Xray and MIMIC-CXR show that our CMCRL pipeline significantly outperforms state-of-the-art methods, with ablation studies confirming the necessity of both stages. Code and models are available at.

关键词： Visualization Linguistics Radiology Heart Training Correlation Feature extraction Lesions Accuracy Lungs

来源：评论

学校读者我要写书评

暂无评论

Underwater Perception and Autonomous Operation for Underwater Vehicle-Manipulator Systems: Methodology and Experiment

引用

IEEE/ASME Transactions on Mechatronics 2025年

作者： Jiang, Chaicheng Xiong, Xinyang Xiang, Xianbo Zeng, Zhigang Zhang, Fumin Huazhong University of Science and Technology School of Artificial Intelligence and Automation Wuhan 430074 China Huazhong University of Science and Technology School of Naval Architecture and Ocean Engineering Wuhan 430074 China Huazhong University of Science and Technology School of Naval Architecture and Ocean Engineering School of Artificial Intelligence and Automation State Key Lab of Intelligent Manufacturing Equipment and Technology Wuhan 430074 China Huazhong University of Science and Technology School of Artificial Intelligence and Automation Key Laboratory of Image Processing and Intelligent Control The Education Ministry of China Wuhan 430074 China Hong Kong University of Science and Technology Department of Electronic and Computer Engineering Clear Water Bay Hong Kong Hong Kong

Camera-equipped underwater vehicle-manipulator systems (UVMS) can achieve autonomous underwater operations through visual servoing. However, current methods excessively rely on auxiliary means for target's visual information and do not sufficiently consider the target's pose when designing visual servoing schemes. As a result, UVMS can only perform dynamic positioning or grasp simple-shaped targets like sea urchins. In this article, we are devoted to making the UVMS autonomously complete more complex underwater operations, such as valve switching and pipe handling. First, an underwater target perception system is proposed to address the issue of discontinuous target position estimation caused by various interferences. Second, a deep neural network-based grasping mechanism controller is proposed to enable the manipulator to grasp targets in various initial poses using the target image. Third, a decoupled visual servoing scheme is proposed for the motion control of the UVMS, and in collaboration with a designed task supervisor to ensure that the UVMS can complete the underwater operation autonomously. To validate the effectiveness of the proposed methods, underwater experiments are conducted based on a UVMS prototype. The UVMS succeeds to autonomously switch different types of valves and handle the pipe. Experiments conducted under dynamic currents validated the reliability and robustness of the proposed methods. © 1996-2012 IEEE.

关键词： Autonomous underwater operations deep neural network underwater vehicle-manipulator systems (UVMS) visual perception visual servoing

来源：评论

学校读者我要写书评

暂无评论

GPU acceleration of subgraph isomorphism search in large scale graph

引用

Journal of Central South University 2015年第6期22卷 2238-2249页

作者：杨博卢凯高颖慧王小平徐凯 Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology College of Computer National University of Defense Technology Department of Electronic Science and Engineering National University of Defense Technology

A novel framework for parallel subgraph isomorphism on GPUs is proposed, named GPUSI, which consists of GPU region exploration and GPU subgraph matching. The GPUSI iteratively enumerates subgraph instances and solves the subgraph isomorphism in a divide-and-conquer fashion. The framework completely relies on the graph traversal, and avoids the explicit join operation. Moreover, in order to improve its performance, a task-queue based method and the virtual-CSR graph structure are used to balance the workload among warps, and warp-centric programming model is used to balance the workload among threads in a warp. The prototype of GPUSI is implemented, and comprehensive experiments of various graph isomorphism operations are carried on diverse large graphs. The experiments clearly demonstrate that GPUSI has good scalability and can achieve speed-up of 1.4–2.6 compared to the state-of-the-art solutions.

关键词： parallel graph isomorphism GPU backtrack paradigm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：