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

Multiple-Object Tracking Using Histogram Stamp Extraction in CCTV Environments

computers, Materials & Continua 2023年第12期77卷 3619-3635页

作者： Ye-Yeon Kang Geon Park Hyun Yoo Kyungyong Chung Division of AI Computer Science and Engineering Kyonggi UniversitySuwon16227Korea Contents Convergence Software Research Institute Kyonggi UniversitySuwon16227Korea

Object tracking,an important technology in the field of image processing and computer vision,is used to continuously track a specific object or person in an *** technology may be effective in identifying the same person within one image,but it has limitations in handling multiple images owing to the difficulty in identifying whether the object appearing in other images is the *** tracking the same object using two or more images,there must be a way to determine that objects existing in different images are the same ***,this paper attempts to determine the same object present in different images using color information among the unique information of the ***,this study proposes a multiple-object-tracking method using histogram stamp extraction in closed-circuit television *** proposed method determines the presence or absence of a target object in an image by comparing the similarity between the image containing the target object and other *** this end,a unique color value of the target object is extracted based on its color distribution in the image using three methods:mean,mode,and interquartile *** Top-N accuracy method is used to analyze the accuracy of each method,and the results show that the mean method had an accuracy of 93.5%(Top-2).Furthermore,the positive prediction value experimental results show that the accuracy of the mean method was 65.7%.As a result of the analysis,it is possible to detect and track the same object present in different images using the unique color of the *** the results,it is possible to track the same object that can minimize manpower without using personal information when detecting objects in different *** the last response speed experiment,it was shown that when the mean was used,the color extraction of the object was possible in real time with 0.016954 *** this,it is possible to detect and track the same object in real time when using the proposed

关键词： Data mining deep learning object detection object tracking real-time object detection multiple object image processing

来源：评论

学校读者我要写书评

暂无评论

A Multimodal Method for Semi-Biometric Information Based User Identification in AR and VR Applications

A Multimodal Method for Semi-Biometric Information Based Use...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Han Li Ke Lyu Owen Dossett Xianglong Feng Department of Computer Science and Software Engineering Miami University Oxford

ISBN: (数字)9798350367942

ISBN: (纸本)9798350367959

Virtual Reality (VR) and Augmented Reality (AR) have witnessed a surge in popularity, revolutionizing various industries and enhancing user experiences. As these technologies continue to evolve, ensuring secure user identification becomes increasingly important. However, existing identification methods often come with vulnerabilities or require costly hardware implementations. To address these challenges, we propose a novel semi-biometric information-based user identification approach leveraging multimodal techniques. By analyzing the user’s viewing patterns and gaze behavior in the runtime, we can accurately identify individuals. This approach offers a promising solution for seamless user identification in VR and AR applications, without compromising on user experience or requiring expensive hardware modifications. To verify the efficiency of our proposed algorithm, we test our algorithm using a public dataset, the result of which shows a high classification accuracy. Additionally, beyond traditional evaluation metrics, we perform a transferability test, demonstrating the adaptability of our solution to new scenarios with robust generality.

关键词： Accuracy Runtime Neural networks Streaming media Hardware User experience Real-time systems Classification algorithms Security Surges

来源：评论

学校读者我要写书评

暂无评论

A Method Based on Genetic Programming to Automatically Construct Factors for Annual Report Scenarios 20

A Method Based on Genetic Programming to Automatically Const...

引用

20th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2024

作者： Ma, Yan Zhang, Changsheng Gao, Yan Guo, Ying School of Computer Science and Engineering Northeastern University Shenyang China Software College Northeastern University Shenyang China College of Computer Science and Engineering Ningxia Institute of Science and Technology Shizuishan China

ISBN: (纸本)9798350356328

Factors have always played an important role in stock analysis, but they are only effective for specific problems in specific scenarios. Therefore, constructing factors timely and quickly for different scenarios is an urgent problem to be solved. Although some experts have constructed factors, they need to manually construct factors for each scenario, and the construction process consumes time and effort. The annual report is an important and common scenario. It is an important form of information disclosure and financial reporting. Therefore, this paper proposes a method for automatically constructing factors based on genetic programming that combines expert experience for this scenario. It incorporates the knowledge and insights of experts in the field of stock analysis into the process of automati-cally constructing factors, and continuously adjusts and improves the combination of factors through genetic programming to adapt to the needs of the scenario. The effectiveness of this method is verified through empirical analysis and its advantages in specific scenarios are demonstrated. © 2024 IEEE.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

Optimisation of sparse deep autoencoders for dynamic network embedding

引用

CAAI Transactions on Intelligence Technology 2024年第6期9卷 1361-1376页

作者： Huimei Tang Yutao Zhang Lijia Ma Qiuzhen Lin Liping Huang Jianqiang Li Maoguo Gong College of Computer Science and Software Engineering Shenzhen UniversityShenzhenChina Institute for Infocomm Research Agency for Science Technology and ResearchSingaporeSingapore Key Laboratory of Collaborative Intelligence Systems Ministry of EducationXidian UniversityXi'anChina

Network embedding(NE)tries to learn the potential properties of complex networks represented in a low-dimensional feature ***,the existing deep learningbased NE methods are time-consuming as they need to train a dense architecture for deep neural networks with extensive unknown weight parameters.A sparse deep autoencoder(called SPDNE)for dynamic NE is proposed,aiming to learn the network structures while preserving the node evolution with a low computational *** tries to use an optimal sparse architecture to replace the fully connected architecture in the deep autoencoder while maintaining the performance of these models in the dynamic ***,an adaptive simulated algorithm to find the optimal sparse architecture for the deep autoencoder is *** performance of SPDNE over three dynamical NE models(*** architecture-based deep autoencoder method,DynGEM,and ElvDNE)is evaluated on three well-known benchmark networks and five real-world *** experimental results demonstrate that SPDNE can reduce about 70%of weight parameters of the architecture for the deep autoencoder during the training process while preserving the performance of these dynamical NE *** results also show that SPDNE achieves the highest accuracy on 72 out of 96 edge prediction and network reconstruction tasks compared with the state-of-the-art dynamical NE algorithms.

关键词： deep autoencoder dynamic networks low-dimensional feature space network embedding sparse structure

来源：评论

学校读者我要写书评

暂无评论

Profit Maximization of Delay-Sensitive, Differential Accuracy Inference Services in Mobile Edge Computing

引用

IEEE Transactions on Mobile Computing 2025年第07期24卷 6209-6224页

作者： Zhang, Yuncan Liang, Weifa Xu, Zichuan Jia, Xiaohua Yang, Yuanyuan City University of Hong Kong Department of Computer Science Hong Kong Hong Kong Dalian University of Technology School of Software Dalian China Stony Brook University Department of Electrical and Computer Engineering Stony BrookNY United States

The integration of Artificial Itelligence (AI) and edge computing has sparked significant interest in edge inference services. In this paper, we consider delay-sensitive, differential accuracy inference services in a Mobile Edge Computing (MEC) network while meeting user stringent delay and accuracy requirements. We formulate two novel profit maximization problems under static and dynamic settings of service request arrivals, with the aim of maximizing the accumulative profit of admitted requests. We assign differential accuracy service requests to the corresponding resolution instances of their requested service models, assuming that each resolution instance can serve up to L≥ 1 the same type of service requests. Since the profit maximization problem is NP-hard, we first formulate an Integer Linear Program (ILP) solution if the problem size is small or medium;otherwise, we devise a constant randomized algorithm with high probability. Then, we consider dynamic service request admissions without the knowledge of future request arrivals for a given finite time horizon, for which we develop a simple yet effective prediction mechanism to accurately predict the number of different resolution instances of each model needed, and pre-deploy the predicted number of resolution instances into cloudlets to reduce instantiating delays. We then devise an online algorithm with a provable competitive ratio for the dynamic profit maximization problem by leveraging the primal-dual dynamic updating technique. Finally, we evaluate the performance of the proposed algorithms by simulations. The simulation results demonstrate that the proposed algorithms are promising. © 2002-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Motif-oriented influence maximization for viral marketing in large-scale social networks 38

Motif-oriented influence maximization for viral marketing in...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zhou, Mingyang Cao, Weiji Liao, Hao Mao, Rui Guangdong Province Key Laboratory of Popular High Performance Computers College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China

The influence maximization (IM) problem aims to identify a budgeted set of nodes with the highest potential to influence the largest number of users in a cascade model, a key challenge in viral marketing. Traditional IM approaches consider each user/node independently as a potential target customer. However, in many scenarios, the target customers comprise motifs, where activating only one or a few users within a motif is insufficient for effective viral marketing, which, nevertheless, receives little attention. For instance, if a motif of three friends planning to dine together, targeting all three simultaneously is crucial for a restaurant advertisement to succeed. In this paper, we address the motif-oriented influence maximization problem under the linear threshold model. We prove that the motif-oriented IM problem is NP-hard and that the influence function is neither supermodular nor submodular, in contrast to the classical IM setting. To simplify the problem, we establish the submodular upper and lower bounds for the influence function. By leveraging the submodular property, we propose a natural greedy strategy that simultaneously maximizes both bounds. Our algorithm has an approximation ratio of τ·(1−1/e−Ε) and a near-linear time complexity of O((k+l)(m+η) log η/Ε2). Experimental results on diverse datasets confirm the effectiveness of our approach in motif maximization. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DeepOCL:A deep neural network for Object Constraint Language generation from unrestricted nature language

引用

CAAI Transactions on Intelligence Technology 2024年第1期9卷 250-263页

作者： Yilong Yang Yibo Liu Tianshu Bao Weiru Wang Nan Niu Yongfeng Yin School of Software Beihang UniversityBeijingChina College of Computer Science and Technology Guizhou UniversityGuiyangGuizhouChina Faculty of Information Technology Beijing University of TechnologyBeijingChina Department of Electrical Engineering and Computer Sciences University of CincinnatiCincinnatiOhioUSA

Object Constraint Language(OCL)is one kind of lightweight formal specification,which is widely used for software verification and validation in NASA and Object Management Group *** OCL provides a simple expressive syntax,it is hard for the developers to write correctly due to lacking knowledge of the mathematical foundations of the first-order logic,which is approximately half accurate at the first stage of devel-opment.A deep neural network named DeepOCL is proposed,which takes the unre-stricted natural language as inputs and automatically outputs the best-scored OCL candidates without requiring a domain conceptual model that is compulsively required in existing rule-based generation *** demonstrate the validity of our proposed approach,ablation experiments were conducted on a new sentence-aligned dataset named *** experiments show that the proposed DeepOCL can achieve state of the art for OCL statement generation,scored 74.30 on BLEU,and greatly outperformed experienced developers by 35.19%.The proposed approach is the first deep learning approach to generate the OCL expression from the natural *** can be further developed as a CASE tool for the software industry.

关键词： deep learning OCL software engineering

来源：评论

学校读者我要写书评

暂无评论

CPL-SLAM: Centralized Collaborative Multi-Robot Visual-Inertial SLAM Using Point-and-Line Features

引用

IEEE Internet of Things Journal 2025年第12期12卷 21866-21875页

作者： Liu, Xin Wen, Shuhuan Liu, Huaping Richard Yu, F. Yanshan University Engineering Research Center The Ministry of Education for Intelligent Control System and Intelligent Equipment Key Lab of Intelligent Rehabilitation and Neuroregulation in Hebei Province Department of Key Lab of Industrial Computer Control Engineering of Hebei Province Qinhuangdao066004 China Tsinghua University Department of Computer Science and Technology Beijing100084 China Shenzhen University College of Computer Science and Software Engineering China Carleton University Canada

Traditional visual-inertial SLAM (Simultaneous Localization and Mapping) systems predominantly rely on feature point matching from a single robot to realize the robot pose estimation and environment map construction. However, in complex scenarios, these traditional systems struggle with issues such as tracking failures due to illumination changes, rapid movements, and low-texture environments, and they perform poorly in terms of mapping efficiency and global consistency. To address these challenges, we propose a centralized collaborative SLAM system that employs both point and line features for tracking in the robot and map fusion in the cloud. The proposed system leverages the fusion of point and line features across all instances in the process, which allows our method to achieve higher localization accuracy in structured, low-texture scenes. With the aid of classifying gravity-aligned vertical lines and spatial parallel lines, the proposed system can deliver faster and more accurate odometry in complex scenes. Furthermore, we developed intra-robot and inter-robot loop closure detection methods based on point and line features, generating a globally consistent sparse point cloud and structured scene map in the cloud. Our method is able to build richer maps while improving accuracy compared to existing methods. Experimental results on public datasets and in real-world environments show that, compared to existing advanced methods, our approach demonstrates better performance. © 2014 IEEE.

关键词： SLAM robotics

来源：评论

学校读者我要写书评

暂无评论

UKF‐MOT:An unscented Kalman filter‐based 3D multi‐object tracker

引用

CAAI Transactions on Intelligence Technology 2024年第4期9卷 1031-1041页

作者： Meng Liu Jianwei Niu Yu Liu Collective Intelligence&Collaboration Laboratory China North Artificial Intelligence and Innovation Research InstituteBeijingChina China North Vehicle Research Institute BeijingChina State Key Laboratory of Software Development Environment School of Computer Science and EngineeringBeihang UniversityBeijingChina State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and EngineeringBeihang UniversityBeijingChina School of Computer Science and Engineering Beihang UniversityBeijingChina

Multi‐object tracking in autonomous driving is a non‐linear *** better address the tracking problem,this paper leveraged an unscented Kalman filter to predict the object's *** the association stage,the Mahalanobis distance was employed as an affinity metric,and a Non‐minimum Suppression method was designed for *** the detections fed into the tracker and continuous‘predicting‐matching’steps,the states of each object at different time steps were described as their own continuous *** conducted extensive experiments to evaluate tracking accuracy on three challenging datasets(KITTI,nuScenes and Waymo).The experimental results demon-strated that our method effectively achieved multi‐object tracking with satisfactory ac-curacy and real‐time efficiency.

关键词： autonomous vehicle transportation

来源：评论

学校读者我要写书评

暂无评论

An Efficient Dialogue Policy Agent with Model-Based Causal Reinforcement Learning 31

An Efficient Dialogue Policy Agent with Model-Based Causal R...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Xu, Kai Wang, Zhenyu Zhao, Yangyang Fang, Bopeng School of Software Engineering South China University of Technology Guangdong China Department of Computer and Communication Engineering Changsha University of Science and Technology Changsha China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (纸本)9798891761964

Dialogue policy trains an agent to select dialogue actions frequently implemented via deep reinforcement learning (DRL). The model-based reinforcement methods built a world model to generate simulated data to alleviate the sample inefficiency. However, traditional world model methods merely consider one-step dialogues, leading to an inaccurate environmental simulation. Furthermore, different users may have different intention preferences, while most existing studies lack consideration of the intention-preferences causal relationship. This paper proposes a novel framework for dialogue policy learning named MCA, implemented through model-based reinforcement learning with automatically constructed causal chains. The MCA model utilizes an autoregressive Transformer to model dialogue trajectories, enabling a more accurate simulation of the environment. Additionally, it constructs a causal chains module that outputs latent preference distributions for intention-action pairs, thereby elucidating the relationship between user intentions and agent actions. The experimental results show that MCA can achieve state-of-the-art performances on three dialogue datasets over the compared dialogue agents, highlighting its effectiveness and robustness. © 2025 Association for Computational Linguistics.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：