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

Robust Motion-Guided Frame Sampler with Interpretive Evaluation for Video Action Recognition

IEEE Transactions on Mobile Computing 2025年第07期24卷 6197-6208页

作者： Bai, Jing Zhang, Yuxiang Wang, Yiran Xiao, Zhu Xiong, Yong Jiao, Licheng Xidian University School of Artificial Intelligence Key Laboratory of Intelligent Perception and Image Understanding Ministry of Education Xi'an710071 China Hunan University College of Computer Science and Electronic Engineering Changsha410082 China Hunan Lianzhi Technology Co. Ltd Changsha410200 China

Due to the presence of redundancy and interference, frame sampling is a promising but challenging solution to mitigate the expensive computation of video action recognition. Although the motion prior has shown great potential for frame selection, existing motion-based strategies suffer from limitations in terms of robustness and interpretive evaluation. In this paper, we devise a robust frame sampling strategy called positive motion guided sampler (PMGSampler). It consists of two procedures, local motion capture and global motion statistics. At the local level, we propose two concepts about inter-frame motion amplitude and motion continuity, which helps to perceive the movement of subjects and identify abnormal events that may generate negative pseudo-motion information. Then, through a global analysis of the obtained local motions, the sampler becomes more sensitive to informative frames and robust to outliers. The proposed sampler can be applied to most existing models for improving recognition accuracy. We conduct extensive experiments on four widely-used benchmarks to demonstrate the superiority of our PMGSampler over other methods of the same type. In addition, to analyse how sampled frames influence action recognition, we present a visual interpretation method for video models, termed as spatio-temporal class activation map (STCAM). By introducing spatial and temporal branches, our STCAM is able to visualise the salience of spatio-temporal features. With the help of STCAM, we can further intuitively evaluate the performance of different sampling strategies. Code is available at https://***/zyx-cv/PMGSampler. © 2002-2012 IEEE.

关键词： Motion capture

来源：评论

学校读者我要写书评

暂无评论

A Shape Retentive Filtering Algorithm for Post-processing of Instance Contour of Cervical Cell Based on Level Set Method 6

A Shape Retentive Filtering Algorithm for Post-processing of...

引用

6th IEEE International Conference on computer and Communications, ICCC 2020

作者： Liu, Guangqi Ding, Qinghai Ju, Moran Luo, Haibo Jin, Tianming He, Miao The Key Laboratory of Image Understanding and Computer Vision Shenyang110016 China Space Star Technology Company Ltd. Beijing100086 China

ISBN: (纸本)9781728186351

A novel filtering algorithm is proposed based on level set method (LSM) and linear time Euclidean distance transform (LET) algorithm in this paper, which has the property of shape retention and thus is suitable for post-processing of the initial contours for contacting instances in digital Pap image. As one of our contributions, we propose two new metrics based on the pixel-level average false positive rate and false negative rate that used by baseline method. A significant decrease in pixel-level average false positive rate (FP) by 62% can obtain by our proposed method. The result of quantitative and qualitative evaluation shows that our proposed shape retentive filtering algorithm (SRFA) can effectively filter out the false positive fragments of the initial instance contour of cervical cells from the ISBI-2014 dataset. © 2020 IEEE.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

A Multi-Armed Bandits Learning-Based Approach to Service Caching in Edge Computing Environment 30th

A Multi-Armed Bandits Learning-Based Approach to Service Ca...

引用

30th International Conference on Web Services, ICWS 2023

作者： Li, Jinpeng Zhao, Jiale Chen, Peng Xia, Yunni Li, Fan Li, Yin Zeng, Feng Liu, Hui School of Computer Chongqing University Chongqing400030 China School of Computer and Software Engineering Xihua University Chengdu610039 China Key Laboratory of Fundamental Synthetic Vision Graphics and Image Science for National Defense Sichuan University Chengdu610065 China Guangzhou Institute of Software Application Technology Guangzhou510990 China Limited Shenzhen518129 China School of Computer Science and Technology Beijing Institute of Technology Beijing100083 China

ISBN: (纸本)9783031448355

Mobile edge computing (MEC) is a newly emerging concept that provides significant local computing power and reduces end-to-end latency. In MEC environments, caching frequently accessed services on edge servers effectively reduces latency and improves system responsiveness. An ongoing research topic in such a cachable MEC context is to design novel algorithms for yielding high-quality caching decision that guarantee high user-perceived quality-of-service (QoS) and high system responsiveness of delivery of cached content with the difference of caching capacities of edge servers and diversified content popularity appropriately addressed. In this article, we propose a multi-armed bandits learning-based method busing a Thompson sampling for generating caching decisions. We introduce a genetic multi-armed bandits algorithm (GMAB), which synthesizes the genetic algorithm (GA) and multi-armed bandits (MAB), for optimizing caching effectiveness with timing and space constraints. The experiment results show that GMAB outperforms traditional methods in terms of multiple aspects. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Asymptotics-Aware Multi-View Subspace Clustering

引用

IEEE Transactions on Multimedia 2025年

作者： Xu, Yesong Chen, Shuo Li, Jun Yang, Jian Anhui Polytechnic University School of Computer and Information Wuhu241000 China RIKEN Center for Advanced Intelligence Project Tokyo103-0027 Japan Nanjing University of Science and Technology PCA Laboratory Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Nanjing210094 China Nanjing University of Science and Technology Jiangsu Key Laboratory of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing210094 China

Recently, multi-view subspace clustering has attracted extensive attention due to the rapid increase of multi-view data in many real-world applications. The main goal of this task is to learn a common representation of multiple subspaces from the given multi-view data, and most existing methods usually directly merge multiple groups of features by the single-step integration. However, there may exist large disparities among different views of the data, and thus the conventional single-step practice can hardly obtain a generally consistent feature representation for the multi-view data. To overcome this challenge, we present a novel approach dubbed "Asymptotics-Aware Multi-view Subspace Clustering (A2 MSC)"to pursue a consistent feature representation in a multi-step way, which iteratively conducts the data recovery to gradually reduce the differences between pairwise views. Specifically, we construct an asymptotic learning rule to update the feature representation, and the iteration result converges to a consistent feature vector for characterizing each instance of the original multi-view data. After that, we utilize such a new feature representation to learn a clustering-oriented similarity matrix via minimizing a self-expressive objective, and we also design the corresponding optimization algorithm to solve it with convergence guarantees. Theoretically, we prove that the learned asymptotic representation effectively integrates multiple views, thereby ensuring the effective handling of multi-view data. Empirically, extensive experimental results demonstrate the superiority of our proposed A2 MSC over the state-of-the-art multi-view subspace clustering approaches. © 2025 IEEE.

关键词： Data assimilation

来源：评论

学校读者我要写书评

暂无评论

Prototype-based classifier learning for long-tailed visual recognition

引用

Science China(Information Sciences) 2022年第6期65卷 62-76页

作者： Xiu-Shen WEI Shu-Lin XU Hao CHEN Liang XIAO Yuxin PENG School of Computer Science and Engineering Nanjing University of Science and Technology State Key Laboratory of Integrated Services Networks Xidian University Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education and Jiangsu Key Lab of Image and Video Understanding for Social Security Wangxuan Institute of Computer Technology Peking University

In this paper, we tackle the long-tailed visual recognition problem from the categorical prototype perspective by proposing a prototype-based classifier learning(PCL) method. Specifically, thanks to the generalization ability and robustness, categorical prototypes reveal their advantages of representing the category semantics. Coupled with their class-balance characteristic, categorical prototypes also show potential for handling data imbalance. In our PCL, we propose to generate the categorical classifiers based on the prototypes by performing a learnable mapping function. To further alleviate the impact of imbalance on classifier generation, two kinds of classifier calibration approaches are designed from both prototype-level and example-level aspects. Extensive experiments on five benchmark datasets, including the large-scale iNaturalist, Places-LT,and imageNet-LT, justify that the proposed PCL can outperform state-of-the-arts. Furthermore, validation experiments can demonstrate the effectiveness of tailored designs in PCL for long-tailed problems.

关键词： long-tailed distribution categorical prototype classifier generation classifier calibration class imbalance

来源：评论

学校读者我要写书评

暂无评论

Hybrid Data-Free Knowledge Distillation

arXiv

引用

arXiv 2024年

作者： Tang, Jialiang Chen, Shuo Gong, Chen School of Computer Science and Engineering Nanjing University of Science and Technology China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education China Jiangsu Key Laboratory of Image and Video Understanding for Social Security China Center for Advanced Intelligence Project RIKEN Japan Department of Automation Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University China

Data-free knowledge distillation aims to learn a compact student network from a pre-trained large teacher network without using the original training data of the teacher network. Existing collection-based and generation-based methods train student networks by collecting massive real examples and generating synthetic examples, respectively. However, they inevitably become weak in practical scenarios due to the difficulties in gathering or emulating sufficient real-world data. To solve this problem, we propose a novel method called Hybrid Data-Free Distillation (HiDFD), which leverages only a small amount of collected data as well as generates sufficient examples for training student networks. Our HiDFD comprises two primary modules, i.e., the teacher-guided generation and student distillation. The teacher-guided generation module guides a Generative Adversarial Network (GAN) by the teacher network to produce high-quality synthetic examples from very few real-world collected examples. Specifically, we design a feature integration mechanism to prevent the GAN from overfitting and facilitate the reliable representation learning from the teacher network. Meanwhile, we drive a category frequency smoothing technique via the teacher network to balance the generative training of each category. In the student distillation module, we explore a data inflation strategy to properly utilize a blend of real and synthetic data to train the student network via a classifier-sharing-based feature alignment technique. Intensive experiments across multiple benchmarks demonstrate that our HiDFD can achieve state-of-the-art performance using 120 times less collected data than existing methods. Code is available at https://***/tangjialiang97/HiDFD. Copyright © 2024, The Authors. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Graph Convolutional Neural Network with Inter-layer Cascade Based on Attention Mechanism 7

Graph Convolutional Neural Network with Inter-layer Cascade ...

引用

7th IEEE International Conference on Cloud Computing and Intelligence Systems, CCIS 2021

作者： Wei, Lu Liu, Yiting Feng, Kaiyuan Li, Jianzhao Sheng, Kai Wu, Yue Xidian University Key Laboratory of Big Data and Intelligent Vision School of Computer Science and Technology Xi'an710071 China Xidian University Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education School of Electronic Engineering Xi'an710071 China Academy of Advanced Interdisciplinary Research Xidian University Xi'an710071 China

ISBN: (纸本)9781665441490

In recent years, graph data in the non-Euclidean space has been widely used, and the methods and techniques for learning graph data in many deep learning fields have been continuously developed, such as the Graph neural network (GNN). The structural characteristics of graph data, the aggregation mode and representation mode of node information, and the node neighbor information are the core issues of GNN. However, most of the existing graph convolutional neural networks have an excessive smoothing problem, which limits the learning ability of the model. Aiming at the over-smoothing problem of the current algorithm, this paper enhances the learning of graph data by improving the expression ability of local information and global features. This paper constructs a cascade structure between graph convolutional layers. This kind of network structure realizes the dense connection of convolutional layers, makes the local feature information is effectively used, and further enhances the graph representation ability. Introduce self-attention and TopK into the Readout module, selectively aggregate and express feature information, and use graph-level information more efficiently. Graph classification is a downstream task to verify the performance of the proposed model. Experimental results prove that this densely structured graph convolutional network can effectively aggregate local node information and global graph-level information. © 2021 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Rethinking Object Saliency Ranking: A Novel Whole-flow Processing Paradigm

arXiv

引用

arXiv 2023年

作者： Song, Mengke Li, Linfeng Wu, Dunquan Song, Wenfeng Chen, Chenglizhao China University of Petroleum China Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology China Jiangsu Key Laboratory of Image and Video Understanding for Social Safety China Qingdao University China Beijing Information Science and Technology University China

Existing salient object detection methods are capable of predicting binary maps that highlight visually salient regions. However, these methods are limited in their ability to differentiate the relative importance of multiple objects and the relationships among them, which can lead to errors and reduced accuracy in downstream tasks that depend on the relative importance of multiple objects. To conquer, this paper proposes a new paradigm for saliency ranking, which aims to completely focus on ranking salient objects by their "importance order". While previous works have shown promising performance, they still face ill-posed problems. First, the saliency ranking ground truth (GT) orders generation methods are unreasonable since determining the correct ranking order is not well-defined, resulting in false alarms. Second, training a ranking model remains challenging because most saliency ranking methods follow the multi-task paradigm, leading to conflicts and trade-offs among different tasks. Third, existing regression-based saliency ranking methods are complex for saliency ranking models due to their reliance on instance mask-based saliency ranking orders. These methods require a significant amount of data to perform accurately and can be challenging to implement effectively. To solve these problems, this paper conducts an in-depth analysis of the causes and proposes a whole-flow processing paradigm of saliency ranking task from the perspective of "GT data generation", "network structure design" and "training protocol". The proposed approach outperforms existing state-of-the-art methods on the widely-used SALICON set, as demonstrated by extensive experiments with fair and reasonable comparisons. The saliency ranking task is still in its infancy, and our proposed unified framework can serve as a fundamental strategy to guide future work. The code and data will be available at https://***/MengkeSong/Saliency-Ranking-Paradigm. Copyright © 2023, The Authors. All rig

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Lens-to-Lens Bokeh Effect Transformation. NTIRE 2023 Challenge Report

Lens-to-Lens Bokeh Effect Transformation. NTIRE 2023 Challen...

引用

2023 IEEE/CVF Conference on computer vision and Pattern Recognition Workshops, CVPRW 2023

作者： Conde, Marcos V. Kolmet, Manuel Seizinger, Tim Bishop, Tom E. Timofte, Radu Kong, Xiangyu Zhang, Dafeng Wu, Jinlong Wang, Fan Peng, Juewen Pan, Zhiyu Liu, Chengxin Luo, Xianrui Sun, Huiqiang Shen, Liao Cao, Zhiguo Xian, Ke Liu, Chaowei Chen, Zigeng Yang, Xingyi Liu, Songhua Jing, Yongcheng Mi, Michael Bi Wang, Xinchao Yang, Zhihao Lian, Wenyi Lai, Siyuan Zhang, Haichuan Hoang, Trung Yazdani, Amirsaeed Monga, Vishal Luo, Ziwei Gustafsson, Fredrik K. Zhao, Zheng Sjölund, Jens Schön, Thomas B. Zhao, Yuxuan Chen, Baoliang Xu, Yiqing Niu, Jixiang Computer Vision Lab CAIDAS IFI University of Würzburg Germany Glass Imaging Inc. China Huazhong University of Science and Technology China Nanyang Technological University Singapore National University of Singapore Singapore University of Sydney Australia Huawei Uppsala University Sweden Department of Electrical Engineering Pennsylvania State University United States Department of Information Technology Uppsala University Sweden Key Laboratory of Intelligent Perception and Image Understanding of the Ministry of Education Xidian University Xi'an China North China University of Technology China

ISBN: (纸本)9798350302493

We present the new Bokeh Effect Transformation Dataset (BETD), and review the proposed solutions for this novel task at the NTIRE 2023 Bokeh Effect Transformation Challenge. Recent advancements of mobile photography aim to reach the visual quality of full-frame cameras. Now, a goal in computational photography is to optimize the Bokeh effect itself, which is the aesthetic quality of the blur in out-of-focus areas of an image. Photographers create this aesthetic effect by benefiting from the lens optical *** aim of this work is to design a neural network capable of converting the the Bokeh effect of one lens to the effect of another lens without harming the sharp foreground regions in the image. For a given input image, knowing the target lens type, we render or transform the Bokeh effect accordingly to the lens properties. We build the BETD using two full-frame Sony cameras, and diverse lens *** the best of our knowledge, we are the first attempt to solve this novel task, and we provide the first BETD dataset and benchmark for it. The challenge had 99 registered participants. The submitted methods gauge the state-of-the-art in Bokeh effect rendering and transformation. © 2023 IEEE.

关键词： Color photography

来源：评论

学校读者我要写书评

暂无评论

SpliceMix: A Cross-scale and Semantic Blending Augmentation Strategy for Multi-label image Classification

引用

IEEE Transactions on Multimedia 2025年

作者： Wang, Lei Zhan, Yibing Ma, Leilei Tao, Dapeng Ding, Liang Gong, Chen Nanjing University of Science and Technology Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Laboratory of Image and Video Understanding for Social Security School of Computer Science and Engineering Jiangsu Nanjing210094 China JD Explore Academy Beijing100000 China Anhui University School of Computer Science and Technology Anhui Heifei230601 China Yunnan University FIST LAB School of Information Science and Engineering Yunnan Kunming650091 China

Recently, Mix-style data augmentation methods (e.g., Mixup and CutMix) have shown promising performance in various visual tasks. However, these methods are primarily designed for single-label images, ignoring the considerable discrepancies between single- and multi-label images, i.e., a multi-label image involves multiple co-occurred categories and fickle object scales. On the other hand, previous multi-label image classification (MLIC) methods tend to design elaborate models, bringing expensive computation. In this article, we introduce a simple but effective augmentation strategy for multi-label image classification, namely SpliceMix. The "splice"in our method is two-fold: 1) Each mixed image is a splice of several downsampled images in the form of a grid, where the semantics of images attending to mixing are blended without object deficiencies for alleviating co-occurred bias;2) We splice mixed images and the original mini-batch to form a new SpliceMixed mini-batch, which allows an image with different scales to contribute to training together. Furthermore, such splice in our SpliceMixed mini-batch enables interactions between mixed images and original regular images. We also provide a simple and non-parametric extension based on consistency learning (SpliceMix-CL) to show the potential of extending our SpliceMix. Extensive experiments on various tasks demonstrate that only using SpliceMix with a baseline model (e.g., ResNet) achieves better performance than state-of-the-art methods. Moreover, the generalizability of our SpliceMix is further validated by the improvements in current MLIC methods when married with our SpliceMix. The code is available at https://***/zuiran/SpliceMix. © 1999-2012 IEEE.

关键词： image classification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：