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

Human motion correction and representation method from motion camera

Journal of Engineering 2017年第1期1卷 370-375页

作者： Zhang, Hong-Bo Guo, Feng Zhang, Miaohui Lin, Ying Hsiao, Tsung-Chih Department of Computer Science and Technology Huaqiao University Xiamen China Xiamen Key Laboratory of Computer Vision and Pattern Recognition Huaqiao University Xiamen China School of Information Science and Engineering Xiamen University Xiamen China Institute of Energy Jiangxi Academy of Sciences Jiangxi Province China

Motion estimation is a basic issue for many computer vision tasks, such as human-computer interaction, motion objection detection and intelligent robot. In many practical scenes, the object movement goes with camera motion. Generally, motion descriptors directly based on optical flow are inaccurate and have low discrimination power. To this end, a novel motion correction method is proposed and a novel motion feature descriptor called the motion difference histogram (MDH) for recognising human action is proposed in this study. Motion estimation results are corrected by background motion estimation and MDH encodes the motion difference between the background and the objects. Experimental results on video shot with camera motion show that the proposed motion correction method is effective and the recognition accuracy of MDH is better than that of the state-of-the-art motion descriptor.

关键词： Motion estimation

来源：评论

学校读者我要写书评

暂无评论

WDA-Net: Weakly-Supervised Domain Adaptive Segmentation of Electron Microscopy

WDA-Net: Weakly-Supervised Domain Adaptive Segmentation of E...

引用

2022 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2022

作者： Qiu, Dafei Yi, Jiajin Peng, Jialin Huaqiao University Xiamen Key Laboratory of Computer Vision and Pattern Recognition China Meitu Inc Xiamen China Huaqiao University College of Computer Science and Technology China

ISBN: (纸本)9781665468190

Accurate segmentation of organelle instances is essential for electron microscopy analysis. Despite the outstanding performance of fully supervised methods, they highly rely on sufficient per-pixel annotated data and are sensitive to domain shift. Aiming to develop a highly annotation-efficient approach with competitive performance, we focus on weakly-supervised domain adaptation (WDA) with a type of extremely sparse and weak annotation demanding minimal annotation efforts, i.e., sparse point annotations on only a small subset of object instances. To reduce performance degradation arising from domain shift, we explore multi-level transferable knowledge through conducting three complementary tasks, i.e., counting, detection, and segmentation, constituting a task pyramid with different levels of domain invariance. The intuition behind this is that after investigating a related source domain, it is much easier to spot similar objects in the target domain than to delineate their fine boundaries. Specifically, we enforce counting estimation as a global constraint to the detection with sparse supervision, which further guides the segmentation. A cross-position cut-and-paste augmentation is introduced to further compensate for the annotation sparsity. Extensive validations show that our model with only 15% point annotations can achieve comparable performance as supervised models and shows robustness to annotation selection. © 2022 IEEE.

关键词： Electron microscopy

来源：评论

学校读者我要写书评

暂无评论

UformPose: A U-Shaped Hierarchical Multi-Scale keypoint-Aware Framework for Human Pose Estimation

引用

IEEE Transactions on Circuits and Systems for Video Technology 2023年第4期33卷 1697-1709页

作者： Wang, You-Jie Luo, Yan-Min Bai, Gui-Hu Guo, Jing-Ming Huaqiao University Key Laboratory for Computer Vision and Pattern Recognition The College of Computer Science and Technology Xiamen361021 China National Taiwan University of Science and Technology Department of Electrical Engineering Taipei10607 Taiwan

Human pose estimation is a fundamental yet challenging task in computer vision. However, difficult scenarios such as invisible keypoints, occlusions and small-scale persons are still not well-handed. In this paper, we present a novel pose estimation framework named UformPose which targets to relieve these issues. UformPose has two core designs: Shared Feature Pyramid Stem (SFPS) and U-shaped hierarchical Multi-scale keypoint-aware Attention Module (U-MKAM). SFPS is a feature pyramid stem with shared mechanism to learn stronger low-level features at the initial stage, and the shared mechanism can facilitate cross-resolution commonality learning. Our U-MKAM attempts to generate high-quality high-resolution representations by integrating all levels of feature representation of the backbone layer by layer. More importantly, we utilize the flexibility of attention operations for keypoint-aware modeling, which explicitly captures and trades-offs the dependencies between keypoints. We empirically demonstrate the effectiveness of our framework through the competitive pose estimation results on the COCO dataset. Extensive experiments and visual analysis on CrowdPose demonstrate the robustness of our model in crowd scenes. © 1991-2012 IEEE.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

Generalized Multimodal Fusion via Poisson-Nernst-Planck Equation

arXiv

引用

arXiv 2024年

作者： Xiong, Jiayu Wang, Jing Xiang, Hengjing Xue, Jun Xu, Chen Jiang, Zhouqiang Xiamen Key Lab of Computer Vision and Pattern Recognition Huaqiao University Xiamen China

Previous studies have highlighted significant advancements in multimodal fusion. Nevertheless, such methods often encounter challenges regarding the efficacy of feature extraction, data integrity, consistency of feature dimensions, and adaptability across various downstream tasks. This paper proposes a generalized multimodal fusion method (GMF) via the Poisson-Nernst-Planck (PNP) equation, which adeptly addresses the aforementioned issues. Theoretically, the optimization objective for traditional multimodal tasks is formulated and redefined by integrating information entropy and the flow of gradient backward step. Leveraging these theoretical insights, the PNP equation is applied to feature fusion, rethinking multimodal features through the framework of charged particles in physics and controlling their movement through dissociation, concentration, and reconstruction. Building on these theoretical foundations, GMF disassociated features which extracted by the unimodal feature extractor into modality-specific and modality-invariant subspaces, thereby reducing mutual information and subsequently lowering the entropy of downstream tasks. The identifiability of the feature’s origin enables our approach to function independently as a frontend, seamlessly integrated with a simple concatenation backend, or serve as a prerequisite for other modules. Experimental results on multiple downstream tasks show that the proposed GMF achieves performance close to the state-of-the-art (SOTA) accuracy while utilizing fewer parameters and computational resources. Furthermore, by integrating GMF with advanced fusion methods, we surpass the SOTA results. © 2024, CC BY-NC-SA.

关键词： Poisson equation

来源：评论

学校读者我要写书评

暂无评论

PON: Proposal Optimization Network for Temporal Action Proposal Generation 16th

PON: Proposal Optimization Network for Temporal Action Propo...

引用

16th International Conference on Intelligent Computing, ICIC 2020

作者： Peng, Xiaoxiao Du, Jixiang Zhang, Hongbo Department of Computer Science and Technology Huaqiao University Quanzhou China Fujian Key Laboratory of Big Data Intelligence and Security Huaqiao University Quanzhou China Xiamen Key Laboratory of Computer Vision and Pattern Recognition Huaqiao University Quanzhou China

ISBN: (纸本)9783030607951

Temporal action localization is a challenging task in video understanding. Although great progress has been made in temporal action localization, the most advanced methods still have the problem of sharp performance degradation when an action proposal generated. Most methods use sliding windows method or simply group frames according to frame-level scores. These methods are not enough to provide accurate action boundary and maintain reasonable temporal structure. In order to solve these problems, we propose a novel proposal optimization network to generate start score, end score, action score and regression score, and then remove the redundancy by NMS algorithm. In the proposed method, we introduce a metric loss function to maintain the temporal structure of action proposal in the training process. To verify the effectiveness of the proposed method, we have made comparative experiments on ActivityNet-1.3 dataset respectively, and the proposed method has surpassed some of the state-of-the-art methods on the dataset. © 2020, Springer Nature Switzerland AG.

关键词： Passive optical networks

来源：评论

学校读者我要写书评

暂无评论

Dynamic Feature Queue for Surveillance Face Anti-spoofing via Progressive Training

Dynamic Feature Queue for Surveillance Face Anti-spoofing vi...

引用

2023 IEEE/CVF Conference on computer vision and pattern recognition Workshops, CVPRW 2023

作者： Wang, keyao Huang, Mouxiao Zhang, Guosheng Yue, Haixiao Zhang, Gang Qiao, Yu China Chinese Academy of Sciences ShenZhen Key Lab of Computer Vision and Pattern Recognition Shenzhen Institute of Advanced Technology China University of Chinese Academy of Sciences China

ISBN: (纸本)9798350302493

In recent years, face recognition systems have faced increasingly security threats, making it essential to employ Face Anti-spoofing (FAS) to protect against various types of attacks in traditional scenarios like phone unlocking, face payment and self-service security inspection. However, further exploration is required to fully secure FAS in long-distance settings. In this paper, we propose two contributions to enhance the security of face recognition systems: Dynamic Feature Queue (DFQ) and Progressive Training Strategy (PTS). DFQ converts the conventional binary classification task into a multi-classification task. It treats live samples as a closed set and attack samples as an open set by using a dynamic queue that stores the features of spoofing samples and updates them. On the other hand, PTS targets difficult samples and iteratively adds them in batches for training. The proposed PTS divides the entire training set into blocks, trains only a small portion of the data, and gradually increases the training data with each stage while also incorporating low-scoring positive samples and high-scoring spoof samples from the test set. These two contributions complement each other by enhancing the model's ability to generalize and defend against various types of attacks, making the face recognition system more secure and reliable. Our proposed methods have achieved top performance on ACER metric with 4.73% on the SuHiFiMask dataset [11] and won the first prize in Surveillance Face Anti-spoofing track of the Challenge@CVPR 2023. © 2023 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Online Discriminative Semantic-Preserving Hashing for Large-Scale Cross-Modal Retrieval 18th

Online Discriminative Semantic-Preserving Hashing for Large-...

引用

18th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2021

作者： Yi, Jinhan He, Yi Liu, Xin Department of Computer Science and Technology Huaqiao University Xiamen361021 China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Nanjing University of Science and Technology Nanjing210094 China Xiamen Key Laboratory of Computer Vision and Pattern Recognition Xiamen China Fujian Key Laboratory of Big Data Intelligence and Security Xiamen China

ISBN: (纸本)9783030891879

Cross-modal hashing has drawn increasing attentions for efficient retrieval across different modalities, and existing methods primarily learn the hash functions in a batch based mode, i.e., offline methods. Nevertheless, the multimedia data often comes in a streaming fashion, which makes the batch based learning methods uncompetitive for large-scale streaming data due to the large memory consumption and calculation. To address this problem, we present an Online Discriminative Semantic-Preserving Hashing (ODSPH) method for large-scale cross-modal retrieval, featuring on fast training speed, low memory consumption and high retrieval accuracy. Within the proposed ODSPH framework, we utilize the newly coming data points to learn the hash codes and update hash functions in a stream manner. When new data comes, the corresponding hash codes are obtained by regressing the class label of the training examples. For hash function, we update it with the accumulated information from each round. Besides, we design a novel momentum updating method to adaptively update the hash function and reduce quantization loss, which can produce discriminative hash codes for high retrieval precision. Extensive experiments on three benchmark datasets show that the proposed ODSPH method improves the retrieval performance over the state-of-the-arts. © 2021, Springer Nature Switzerland AG.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Bootstrap Diffusion Model Curve Estimation for High Resolution Low-Light Image Enhancement 20th

Bootstrap Diffusion Model Curve Estimation for High Resolut...

引用

20th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2023

作者： Huang, Jiancheng Liu, Yifan Chen, Shifeng ShenZhen Key Lab of Computer Vision and Pattern Recognition Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9789819970247

Learning-based methods have attracted a lot of research attention and led to significant improvements in low-light image enhancement. However, most of them still suffer from two main problems: expensive computational cost in high resolution images and unsatisfactory performance in simultaneous enhancement and denoising. To address these problems, we propose BDCE, a bootstrap diffusion model that exploits the learning of the distribution of the curve parameters instead of the normal-light image itself. Specifically, we adopt the curve estimation method to handle the high-resolution images, where the curve parameters are estimated by our bootstrap diffusion model. In addition, a denoise module is applied in each iteration of curve adjustment to denoise the intermediate enhanced result of each iteration. We evaluate BDCE on commonly used benchmark datasets, and extensive experiments show that it achieves state-of-the-art qualitative and quantitative performance. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT ONLINE labEL CONSISTENT HASHING FOR LARGE-SCALE CROSS-MODAL RETRIEVAL

EFFICIENT ONLINE LABEL CONSISTENT HASHING FOR LARGE-SCALE CR...

引用

2021 IEEE International Conference on Multimedia and Expo, ICME 2021

作者： Yi, Jinhan Liu, Xin Cheung, Yiu-Ming Xu, Xing Fan, Wentao He, Yi Department of Computer Science and Technology Huaqiao University Xiamen361021 China Xiamen Key Lab. of Computer Vision and Pattern Recognition Fujian Key Lab. of Big Data Intelligence and Security China Department of Computer Science Hong Kong Baptist University Kowloon Hong Kong School of Computer Science and Engineering University of Electronic Science and Technology of China China Provincial Key Laboratory for Computer Information Processing Technology Soochow University China

ISBN: (纸本)9781665438643

Existing cross-modal hashing still faces three challenges: (1) Most batch-based methods are unsuitable for processing large-scale and streaming data. (2) Current online methods often suffer from insufficient semantic association, while lacking flexibility to learn the hash functions for varying streaming data. (3) Existing supervised methods always require much computation time or accumulate large quantization loss to learn hash codes. To address above challenges, we present an efficient Online label Consistent Hashing (OLCH) for cross-modal retrieval, which aims to incrementally learn hash codes for the current arriving data, while updating the hash functions at a streaming manner. To be specific, an online semantic representation learning framework is designed to adaptively preserve the semantic similarity across different modalities, and a mini-batch online gradient descent approach associated with forward-backward splitting is developed to optimize the hash functions. Accordingly, the hash codes are adaptively learned online with the high discriminative capability, while avoiding high computation complexity to process the streaming data. Experimental results show its outstanding performance in comparison with the-state-of-arts. © 2021 IEEE computer Society. All rights reserved.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

New texture-spatial features for keyword spotting in video images 3

New texture-spatial features for keyword spotting in video i...

引用

3rd IAPR Asian Conference on pattern recognition, ACPR 2015

作者： Shivakumara, Palaiahnakote Liang, Guozhu Roy, Sangheeta Pal, Umapada Lu, Tong Faculty of Computer Science and Information Technology University of Malaya Kuala Lumpur Malaysia National Key Lab for Novel Software Technology Nanjing University Nanjing China Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata India

ISBN: (纸本)9781479961009

keyword spotting in video document images is challenging due to low resolution and complex background of video images. We propose the combination of Texture-Spatial-Features (TSF) for keyword spotting in video images without recognizing them. First, a segmentation method extracts words from text lines in each video image. Then we propose the set of texture features for identifying text candidates in the word image with the help of k-means clustering. The proposed method finds proximity between text candidates to study the spatial arrangement of pixels that result in feature vectors for spotting words in the input frame. The proposed method is evaluated on word images of different fonts, contrasts, backgrounds and font sizes, which are chosen from standard databases such as ICDAR 2013 video and our video data. Experimental results show that the proposed method outperforms the existing method in terms of recall, precision and f-measure. © 2015 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：