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

Perpendicular-Cutdepth:Perpendicular Direction Depth Cutting data Augmentation Method

Computers, Materials & Continua 2024年第4期79卷 927-941页

作者： Le Zou Linsong Hu Yifan Wang Zhize Wu Xiaofeng Wang Anhui Provincial Engineering Laboratory of Big Data Technology Application forUrban Infrastructure School ofArtificial Intelligence and Big DataHefei UniversityHefei230601China Institute of Applied Optimization School of Artificial Intelligence and Big DataHefei UniversityHefei230601China

Depth estimation is an important task in computer *** data at scale for monocular depth estimation is challenging,as this task requires simultaneously capturing RGB images and depth ***,data augmentation is crucial for this *** data augmentationmethods often employ pixel-wise transformations,whichmay inadvertently disrupt edge *** this paper,we propose a data augmentationmethod formonocular depth estimation,which we refer to as the Perpendicular-Cutdepth *** method involves cutting realworld depth maps along perpendicular directions and pasting them onto input images,thereby diversifying the data without compromising edge *** validate the effectiveness of the algorithm,we compared it with existing convolutional neural network(CNN)against the current mainstream data augmentation ***,to verify the algorithm’s applicability to Transformer networks,we designed an encoder-decoder network structure based on Transformer to assess the generalization of our proposed *** results demonstrate that,in the field of monocular depth estimation,our proposed method,Perpendicular-Cutdepth,outperforms traditional data *** the indoor dataset NYU,our method increases accuracy from0.900 to 0.907 and reduces the error rate from0.357 to *** the outdoor dataset KITTI,our method improves accuracy from 0.9638 to 0.9642 and decreases the error rate from 0.060 to 0.0598.

关键词： Perpendicular depth estimation data augmentation

来源：评论

学校读者我要写书评

暂无评论

引用

High-Speed Railway 2024年第2期2卷 101-109页

作者： Jiaxu Guo Ding Ding Peihan Yang Qi Zou Yaping Huang School of Computer Science and Technology Beijing Jiaotong UniversityBeijing 100044China Key Laboratory of Big Data&Artificial Intelligence in Transportation Ministry of EducationBeijing 100044China

It is of great significance to improve the efficiency of railway production and operation by realizing the fault knowledge association through the efficient data mining ***,high utility quantitative frequent pattern mining algorithms in the field of data mining still suffer from the problems of low time-memory performance and are not easy to scale *** the context of such needs,we propose a related degree-based frequent pattern mining algorithm,named Related High Utility Quantitative Item set Mining(RHUQI-Miner),to enable the effective mining of railway fault *** algorithm constructs the item-related degree structure of fault data and gives a pruning optimization strategy to find frequent patterns with higher related degrees,reducing redundancy and invalid frequent ***,it uses the fixed pattern length strategy to modify the utility information of the item in the mining process so that the algorithm can control the length of the output frequent pattern according to the actual data situation and further improve the performance and practicability of the *** experimental results on the real fault dataset show that RHUQI-Miner can effectively reduce the time and memory consumption in the mining process,thus providing data support for differentiated and precise maintenance strategies.

关键词： High utility Quantitative Frequent pattern mining Related degree pruning Fixed pattern length

来源：评论

学校读者我要写书评

暂无评论

A Method for Fast Feature Selection Utilizing Cross-Similarity within the Context of Fuzzy Relations

引用

Computers, Materials & Continua 2025年第4期83卷 1195-1218页

作者： Wenchang Yu Xiaoqin Ma Zheqing Zhang Qinli Zhang School of Big Data and Artificial Intelligence Chizhou UniversityChizhou247000China Anhui Education Big Data Intelligent Perception and Application Engineering Research Center Anhui Provincial Joint Construction Key Laboratory of Intelligent Education Equipment and TechnologyChizhou247000China

Feature selection methods rooted in rough sets confront two notable limitations:their high computa-tional complexity and sensitivity to noise,rendering them impractical for managing large-scale and noisy *** primary issue stems from these methods’undue reliance on all *** overcome these challenges,we introduce the concept of cross-similarity grounded in a robust fuzzy relation and design a rapid and robust feature selection ***,we construct a robust fuzzy relation by introducing a truncation ***,based on this fuzzy relation,we propose the concept of cross-similarity,which emphasizes the sample-to-sample similarity relations that uniquely determine feature importance,rather than considering all such relations *** studying the manifestations and properties of cross-similarity across different fuzzy granularities,we propose a forward greedy feature selection algorithm that leverages cross-similarity as the foundation for information *** algorithm significantly reduces the time complexity from O(m2n2)to O(mn2).Experimental findings reveal that the average runtime of five state-of-the-art comparison algorithms is roughly 3.7 times longer than our algorithm,while our algorithm achieves an average accuracy that surpasses those of the five comparison algorithms by approximately 3.52%.This underscores the effectiveness of our *** paper paves the way for applying feature selection algorithms grounded in fuzzy rough sets to large-scale gene datasets.

关键词： Fuzzy rough sets feature selection cross-similarity fuzzy relations

来源：评论

学校读者我要写书评

暂无评论

ControlVideo: conditional control for one-shot text-driven video editing and beyond

引用

Science China(Information Sciences) 2025年第3期68卷 150-162页

作者： Min ZHAO Rongzhen WANG Fan BAO Chongxuan LI Jun ZHU Department of Computer Science and Technology Institute for AI Tsinghua-Bosch Joint ML CenterTsinghua Laboratory of Brain and Intelligence Lab Tsinghua University ShengShu Technology Gaoling School of Artificial Intelligence Renmin University of China Beijing Key Laboratory of Big Data Management and Analysis Methods Pazhou Laboratory (Huangpu)

This paper presents ControlVideo for text-driven video editing — generating a video that aligns with a given text while preserving the structure of the source video. Building on a pre-trained text-to-image diffusion model, ControlVideo enhances the fidelity and temporal consistency by incorporating additional conditions(such as edge maps), and fine-tuning the key-frame and temporal attention on the source video-text pair via an in-depth exploration of the design space. Extensive experimental results demonstrate that ControlVideo outperforms various competitive baselines by delivering videos that exhibit high fidelity w.r.t. the source content, and temporal consistency, all while aligning with the text. By incorporating low-rank adaptation layers into the model before training, ControlVideo is further empowered to generate videos that align seamlessly with reference images. More importantly, ControlVideo can be readily extended to the more challenging task of long video editing(e.g., with hundreds of frames), where maintaining long-range temporal consistency is crucial. To achieve this, we propose to construct a fused ControlVideo by applying basic ControlVideo to overlapping short video segments and key frame videos and then merging them by pre-defined weight functions. Empirical results validate its capability to create videos across 140 frames, which is approximately 5.83 to 17.5 times more than what previous studies achieved. The code is available at https://***/thu-ml/controlvideo.

关键词： diffusion models controllable generation text-driven editing video editing long video editing

来源：评论

学校读者我要写书评

暂无评论

Graph distillation with network symmetry

引用

Chinese Physics B 2025年第4期34卷 262-271页

作者： Feng Lin Jia-Lin He China West Normal University Nanchong 637000China The Internet of Things Perception and Big Data Analysis Key Laboratory of Nanchong City Nanchong 637000China Institute of Artificial Intelligence China West Normal UniversityNanchong 637000China

Graph neural networks(GNNs)have demonstrated excellent performance in graph representation ***,as the volume of graph data grows,issues related to cost and efficiency become increasingly *** distillation methods address this challenge by extracting a smaller,reduced graph,ensuring that GNNs trained on both the original and reduced graphs show similar *** methods,however,primarily optimize the feature matrix of the reduced graph and rely on correlation information from GNNs,while neglecting the original graph’s structure and redundant *** often results in a loss of critical information within the reduced *** overcome this limitation,we propose a graph distillation method guided by network ***,we identify symmetric nodes with equivalent neighborhood structures and merge them into“super nodes”,thereby simplifying the network structure,reducing redundant parameter optimization and enhancing training *** the same time,instead of relying on the original node features,we employ gradient descent to match optimal features that align with the original features,thus improving downstream task ***,our method guarantees that the reduced graph retains the key information present in the original *** experiments demonstrate that our approach achieves significant improvements in graph distillation,exhibiting strong generalization capability and outperforming existing graph reduction methods.

关键词： graph neural networks graph distillation network symmetry super nodes feature optimization

来源：评论

学校读者我要写书评

暂无评论

Enhancing Adversarial Example Transferability via Regularized Constrained Feature Layer

引用

Computers, Materials & Continua 2025年第4期83卷 157-175页

作者： Xiaoyin Yi Long Chen Jiacheng Huang Ning Yu Qian Huang School of Computer Science and Technology Chongqing University of Posts and TelecommunicationsChongqing400065China Chongqing Key Laboratory of Public Big Data Security Technology Chongqing401420China School of Cyber Security and Information Law Chongqing University of Posts and TelecommunicationsChongqing400065China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of EducationChongqing400065China Artificial Intelligence and Big Data College Chongqing Polytechnic University of Electronic TechnologyChongqing401331China

Transfer-based Adversarial Attacks(TAAs)can deceive a victim model even without prior *** is achieved by leveraging the property of adversarial *** is,when generated from a surrogate model,they retain their features if applied to other models due to their good ***,adversarial examples often exhibit overfitting,as they are tailored to exploit the particular architecture and feature representation of source ***,when attempting black-box transfer attacks on different target models,their effectiveness is *** solve this problem,this study proposes an approach based on a Regularized Constrained Feature Layer(RCFL).The proposed method first uses regularization constraints to attenuate the initial examples of low-frequency *** are then added to a pre-specified layer of the source model using the back-propagation technique,in order to modify the original adversarial ***,a regularized loss function is used to enhance the black-box transferability between different target *** proposed method is finally tested on the ImageNet,CIFAR-100,and Stanford Car datasets with various target models,The obtained results demonstrate that it achieves a significantly higher transfer-based adversarial attack success rate compared with baseline techniques.

关键词： Adversarial examples black-box transferability regularized constrained transfer-based adversarial attacks

来源：评论

学校读者我要写书评

暂无评论

Layer-Wise Learning Rate Optimization for Task-Dependent Fine-Tuning of Pre-Trained Models: An Evolutionary Approach

引用

ACM Transactions on Evolutionary Learning and Optimization 2024年第4期4卷 1-23页

作者： Bu, Chenyang Liu, Yuxin Huang, Manzong Shao, Jianxuan Ji, Shengwei Luo, Wenjian Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data Ministry of Education and School of Computer Science and Information Engineering Hefei University of Technology Hefei China School of Artificial Intelligence and Big Data Hefei University Hefei China Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies School of Computer Science and Technology Harbin Institute of Technology Shenzhen China

The superior performance of large-scale pre-Trained models, such as Bidirectional Encoder Representations from Transformers (BERT) and Generative Pre-Trained Transformer (GPT), has received increasing attention in both academic and industrial research and has become one of the current research hotspots. A pre-Trained model refers to a model trained on large-scale unlabeled data, whose purpose is to learn general language representation or features for fine-Tuning or transfer learning in subsequent tasks. After pre-Training is complete, a small amount of labeled data can be used to fine-Tune the model for a specific task or domain. This two-stage method of "pre-Training+fine-Tuning"has achieved advanced results in natural language processing (NLP) tasks. Despite widespread adoption, existing fixed fine-Tuning schemes that adapt well to one NLP task may perform inconsistently on other NLP tasks given that different tasks have different latent semantic structures. In this article, we explore the effectiveness of automatic fine-Tuning pattern search for layer-wise learning rates from an evolutionary optimization perspective. Our goal is to use evolutionary algorithms to search for better task-dependent fine-Tuning patterns for specific NLP tasks than typical fixed fine-Tuning patterns. Experimental results on two real-world language benchmarks and three advanced pre-Training language models show the effectiveness and generality of the proposed framework. © 2024 held by the owner/author(s).

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Combining permissioned blockchain and Bayesian best-worst method for transparent supplier selection in supply chain management

引用

Science China(Technological Sciences) 2024年第8期67卷 2579-2593页

作者： LIU JiaJun ZHANG Jie LENG JieWu Shanghai Engineering Research Center of Industrial Big Data and Intelligent System Institute of Artificial IntelligenceDonghua UniversityShanghai 201620China State Key Laboratory of Precision Electronic Manufacturing Technology and Equipment Guangdong University of TechnologyGuangzhou 510006China

Supplier selection is an important business activity in order to realize the purchasing function in supply chain *** supplier selection process includes four stages,i.e.,bidding inviting,bidding,group decision-making,and results disclosure,involving the participation of manufacturing service demanders(MSDs),manufacturing service suppliers(MSSs),and ***,all the participants have raised concerns about the increased transparency in supplier ***,this study proposes a transparent supplier selection method by considering the engagement of *** this method,the Bayesian best-worst method(Bayesian BWM)is used to aggregate decision-makers'preferences into the overall optimal weights of the alternative MSSs,and the MSS with the largest weight is considered the suitable MSS for ***,blockchain is introduced to record the decision-making process information about supplier selection through a customized smart contract,where MSSs act as supervisors to supervise the decision-making process through the distributed consensus mechanism rather than directly participate in the decision-making ***,a case study of supplier selection in purchasing vibration acceleration sensors is *** result shows that the proposed method can support MSDs in selecting suitable MSS from alternative MSSs by aggregating decision-makers'preferences,and blockchain can provide credible information about the supplier selection process for MSSs,MSDs,and *** this way,the transparency of supplier selection is enhanced.

关键词： blockchain supplier selection supply chain transparency Bayesian BWM group decision-making

来源：评论

学校读者我要写书评

暂无评论

A Keypoint-Based Object Detection Algorithm 7

A Keypoint-Based Object Detection Algorithm

引用

7th IEEE Information Technology, Networking, Electronic and Automation Control Conference, ITNEC 2024

作者： Hou, Xiangdan Chen, Quansong Liu, Hongpu School of Artificial Intelligence and Data Science Hebei University of Technology Tianjin China Hebei Province Key Laboratory of Big Data Computing Tianjin China

ISBN: (纸本)9798350370782

An improved algorithm is proposed for the omission and re-detection problems in the point cloud object detection method CenterPoint. The algorithm firstly adds Focal sparse convolution module to the feature extraction network to increase the proportion of important information in the features;then redefines the generation function of the detection head heatmap, and the supervisory signal generated by the elliptical Gaussian kernel is more closely matched to the real shape of the object to inhibit the generation of negative samples;finally, the overall regression of the bounding box information is applied to the training, so that the back propagation loss gain of the single dimensional information is regulated by the associated information. The improved algorithm is trained and evaluated on the KITTI 3D object detection dataset, and the overall mean Average Precision (mAP) is improved by 3.29% compared with the base model CenterPoint. The experimental results show that the improved algorithm effectively suppresses the redetection and omission problems of CenterPoint. © 2024 IEEE.

关键词： CenterPoint Focal sparse convolution Gaussian kernel object detection overall regression

来源：评论

学校读者我要写书评

暂无评论

Transverse Velocity Field Measurement of Solar High-resolution Images Based on Unsupervised Deep Learning

引用

Research in Astronomy and Astrophysics 2025年第3期25卷 236-248页

作者： Zhen-Hong Shang Long Chen Zhen-Ping Qiang Yi Bi Run-Xin Li Faculty of Information Engineering and Automation Kunming University of Science and Technology Yunnan Key Laboratory of Artificial Intelligence Kunming University of Science and Technology College of Big Data and Intelligent Engineering Southwest Forestry University Yunnan Observatories Chinese Academy of Sciences

Measuring the transverse velocity field in high-resolution solar images is essential for understanding solar *** paper introduces an innovative unsupervised deep learning optical flow model designed to calculate the transverse velocity field,addressing the challenges of missing optical flow labels and the limited accuracy of velocity field measurements in high-resolution solar *** proposed method converts the transverse velocity field computation problem into an optical flow computation problem,using two forward propagations of features to get rid of the reliance on optical flow ***,it reduces the impact of the“Brightness Consistency”constraint on optical flow accuracy by identifying and handling optical flow *** apply this method to compute the transverse velocity fields of high-resolution solar image sequences from the Hαand TiO bands,observed by the New Vacuum Solar *** experiments with several wellestablished optical flow methods,including those based on supervised deep learning models,show that our approach outperforms the comparison methods according to key evaluation metrics such as Residual Map Mean,Residual Map Variance,Cross Correlation,and Structural Similarity Index ***,since optical flow captures the fundamental motion information in image sequences,the proposed method can be applied to a variety of research areas,including solar image registration,sequence alignment,image super-resolution,magnetic field calibration,and solar activity *** code is available at https://***/jackie-willianm/Transverse-Velocity-Field-Measurement-of-Solar-High-Resolution-Images.

关键词： methods: data analysis Sun: fundamental parameters techniques: image processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：