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

Context-dependent diffusion network for visual relationship detection

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Cui, Zhen Xu, Chunyan Zheng, Wenming Yang, Jian PCA Lab Key Lab of Intelligent Perception and Systems High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China Key Laboratory of Child Development and Learning Science Ministry of Education Research Center for Learning Science Southeast University Nanjing210096 China

Visual relationship detection can bridge the gap between computer vision and natural language for scene understanding of images. Different from pure object recognition tasks, the relation triplets of subject-predicate-object lie on an extreme diversity space, such as person-behind-person and car-behind-building, while suffering from the problem of combinatorial explosion. In this paper, we propose a context-dependent diffusion network (CDDN) framework to deal with visual relationship detection. To capture the interactions of different object instances, two types of graphs, word semantic graph and visual scene graph, are constructed to encode global context interdependency. The semantic graph is built through language priors to model semantic correlations across objects, whilst the visual scene graph defines the connections of scene objects so as to utilize the surrounding scene information. For the graph-structured data, we design a diffusion network to adaptively aggregate information from contexts, which can effectively learn latent representations of visual relationships and well cater to visual relationship detection in view of its isomorphic invariance to graphs. Experiments on two widely-used datasets demonstrate that our proposed method is more effective and achieves the state-of-the-art performance. Copyright © 2018, The Authors. All rights reserved.

关键词： Diffusion

Minimal Solutions to Relative Pose Estimation From Two Views Sharing a Common Direction With Unknown Focal Length

学校读者我要写书评

暂无评论

Minimal Solutions to Relative Pose Estimation From Two Views...

Conference on computer vision and Pattern Recognition (CVPR)

作者： Yaqing Ding Jian Yang Jean Ponce Hui Kong Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology INRIA Paris France Département d'informatique de l'ENS ENS CNRS PSL University Paris France

ISBN: (数字)9781728171685

ISBN: (纸本)9781728171692

We propose minimal solutions to relative pose estimation problem from two views sharing a common direction with unknown focal length. This is relevant for cameras equipped with an IMU (inertial measurement unit), e.g., smart phones, tablets. Similar to the 6-point algorithm for two cameras with unknown but equal focal lengths and 7-point algorithm for two cameras with different and unknown focal lengths, we derive new 4- and 5-point algorithms for these two cases, respectively. The proposed algorithms can cope with coplanar points, which is a degenerate configuration for these 6- and 7-point counterparts. We present a detailed analysis and comparisons with the state of the art. Experimental results on both synthetic data and real images from a smart phone demonstrate the usefulness of the proposed algorithms.

关键词： Cameras Gravity Eigenvalues and eigenfunctions Smart phones computer vision Pose estimation Charge coupled devices

Sparse Prior Is Not All You Need: When Differential Directionality Meets Saliency Coherence for Infrared Small Target Detection

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhou, Fei Fu, Maixia Qian, Yulei Yang, Jian Dai, Yimian Ministry of Education Henan Key Laboratory of Grain Photoelectric Detection and Control Henan University of Technology Zhengzhou China Nanjing Marine Radar Institute Nanjing China PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China

Infrared small target detection is crucial for the efficacy of infrared search and tracking systems. Current tensor decomposition methods emphasize representing small targets with sparsity but struggle to separate targets from complex backgrounds due to insufficient use of intrinsic directional information and reduced target visibility during decomposition. To address these challenges, this study introduces a Sparse Differential Directionality prior (SDD) framework. SDD leverages the distinct directional characteristics of targets to differentiate them from the background, applying mixed sparse constraints on the differential directional images and continuity difference matrix of the temporal component, both derived from Tucker decomposition. We further enhance target detectability with a saliency coherence strategy that intensifies target contrast against the background during hierarchical decomposition. A Proximal Alternating Minimization-based (PAM) algorithm efficiently solves our proposed model. Experimental results on several real-world datasets validate our method’s effectiveness, outperforming ten state-of-the-art methods in target detection and clutter suppression. Our code is available at https://***/GrokCV/SDD. Copyright © 2024, The Authors. All rights reserved.

关键词： Tensors

Advances in Computational Intelligence 1

学校读者我要写书评

暂无评论

丛书名： Lecture Notes in computer Science

1000年

作者： Jing Liu Cesare Alippi Bernadette Bouchon-Meunier Garrison W. Greenwood Hussein A. Abbass

ISBN: (数字)9783642306877

ISBN: (纸本)9783642306860

This state-of-the-art survey offers a renewed and refreshing focus on the progress in evolutionary computation, in neural networks, and in fuzzy systems. The book presents the expertise and experiences of leading researchers spanning a diverse spectrum of computational intelligence in these areas. The result is a balanced contribution to the research area of computational intelligence that should serve the community not only as a survey and a reference, but also as an inspiration for the future advancement of the state of the art of the field. The 13 selected chapters originate from lectures and presentations given at the IEEE World Congress on Computational Intelligence, WCCI 2012, held in Brisbane, Australia, in June 2012.

关键词： Data Mining and Knowledge Discovery Database Management Information Storage and Retrieval Artificial Intelligence Information Systems Applications (incl. Internet) Algorithm Analysis and Problem Complexity

SEMICON: A Learning-to-hash Solution for Large-scale Fine-grained image Retrieval

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Shen, Yang Sun, Xuhao Wei, Xiu-Shen Jiang, Qing-Yuan Yang, Jian School of Computer Science and Engineering Nanjing University of Science and Technology China State Key Laboratory of Integrated Services Networks Xidian University China State Key Laboratory for Novel Software Technology Nanjing University China Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security Nanjing University of Science and Technology China

In this paper, we propose Suppression-Enhancing Mask based attention and Interactive Channel transformatiON (SEMICON) to learn binary hash codes for dealing with large-scale fine-grained image retrieval tasks. In SEMICON, we first develop a suppression-enhancing mask (SEM) based attention to dynamically localize discriminative image regions. More importantly, different from existing attention mechanism simply erasing previous discriminative regions, our SEM is developed to restrain such regions and then discover other complementary regions by considering the relation between activated regions in a stage-by-stage fashion. In each stage, the interactive channel transformation (ICON) module is afterwards designed to exploit correlations across channels of attended activation tensors. Since channels could generally correspond to the parts of fine-grained objects, the part correlation can be also modeled accordingly, which further improves fine-grained retrieval accuracy. Moreover, to be computational economy, ICON is realized by an efficient two-step process. Finally, the hash learning of our SEMICON consists of both global- and local-level branches for better representing fine-grained objects and then generating binary hash codes explicitly corresponding to multiple levels. Experiments on five benchmark fine-grained datasets show our superiority over competing methods. Copyright © 2022, The Authors. All rights reserved.

关键词： image retrieval

Bridge the Gap between Supervised and Unsupervised Learning for Fine-Grained Classification

学校读者我要写书评

暂无评论

SSRN

SSRN 2023年

作者： Wang, Jiabao Li, Yang Wei, Xiu-Shen Li, Hang Miao, Zhuang Zhang, Rui Army Engineering University of PLA Jiangsu Nanjing210007 China PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology Jiangsu Nanjing210094 China State Key Lab. for Novel Software Technology Nanjing University Jiangsu Nanjing210023 China

Unsupervised learning technology has caught up with or even surpassed supervised learning technology in general object classification (GOC) and person re-identification (re-ID). However, it is found that the unsupervised learning of fine-grained visual classification (FGVC) is more challenging than GOC and person re-ID. In order to bridge the gap between unsupervised and supervised learning for FGVC, we investigate the essential factors for the performance gap. Furthermore, we propose a simple, effective, and practical method, termed as UFCL, to alleviate the gap. Three key issues are concerned and improved: First, we introduce a robust and powerful backbone, ResNet50-IBN, which has an ability of domain adaptation when we transfer imageNet pre-trained models to FGVC tasks. Next, we propose to introduce HDBSCAN instead of DBSCAN to do clustering, which can generate better clusters for adjacent categories with fewer hyper-parameters. Finally, we propose a weighted feature agent and its updating mechanism to do contrastive learning, which can improve the optimization process of learning the parameters of the network. The effectiveness of our UFCL is verified on four public FGVC datasets. Under the unsupervised FGVC setting, we achieve state-of-the-art results, and analyze the key factors and the important parameters to provide a practical guidance. © 2023, The Authors. All rights reserved.

关键词： image classification

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

学校读者我要写书评

暂无评论

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

IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS)

作者： Lu Wei Yiting Liu Kaiyuan Feng Jianzhao Li Kai Sheng Yue Wu Key Laboratory of Big Data and Intelligent Vision School of Computer Science and Technology Xidian University Xi’an China Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education School of Electronic Engineering Xidian University Xi’an China Academy of Advanced Interdisciplinary Research Xidian University Xi’an China Dongfeng USharing Technology Co. Ltd. Dongfeng Motor Corporation Wuhan China

ISBN: (纸本)9781665441506

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.

关键词： Training Deep learning Smoothing methods Aggregates Conferences Graph neural networks Data models

Pick of the Bunch: Detecting Infrared Small Targets Beyond Hit-Miss Trade-Offs via Selective Rank-Aware Attention

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Dai, Yimian Pan, Peiwen Qian, Yulei Li, Yuxuan Li, Xiang Yang, Jian Wang, Huan PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Jiangsu Key Lab of Image Video Understanding for Social Security China The department of intelligence science School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing China Nanjing Marine Radar Institute Nanjing China VCIP CS Nankai University China The NKIARI Futian Shenzhen China

Infrared small target detection faces the inherent challenge of precisely localizing dim targets amidst complex background clutter. Traditional approaches struggle to balance detection precision and false alarm rates. To break this dilemma, we propose SeRankDet, a deep network that achieves high accuracy beyond the conventional hit-miss trade-off, by following the "Pick of the Bunch" principle. At its core lies our Selective Rank-Aware Attention (SeRank) module, employing a non-linear Top-K selection process that preserves the most salient responses, preventing target signal dilution while maintaining constant complexity. Furthermore, we replace the static concatenation typical in U-Net structures with our Large Selective Feature Fusion (LSFF) module, a dynamic fusion strategy that empowers SeRankDet with adaptive feature integration, enhancing its ability to discriminate true targets from false alarms. The network’s discernment is further refined by our Dilated Difference Convolution (DDC) module, which merges differential convolution aimed at amplifying subtle target characteristics with dilated convolution to expand the receptive field, thereby substantially improving target-background separation. Despite its lightweight architecture, the proposed SeRankDet sets new benchmarks in state-of-the-art performance across multiple public datasets. The code is available at https://***/GrokCV/SeRankDet. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantic Segmentation

Loss Decomposition and Centroid Estimation for Positive and Unlabeled Learning

学校读者我要写书评

暂无评论

IEEE transactions on pattern analysis and machine intelligence 2021年第3期43卷 918-932页

作者： Chen Gong Hong Shi Tongliang Liu Chuang Zhang Jian Yang Dacheng Tao PCA Lab the Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Nanjing University of Science and Technology Nanjing P.R. China PCA Lab the 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 the School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing P.R. China UBTECH Sydney Artificial Intelligence Centre School of Computer Science Faculty of Engineering University of Sydney Darlington NSW Australia

This paper studies Positive and Unlabeled learning (PU learning), of which the target is to build a binary classifier where only positive data and unlabeled data are available for classifier training. To deal with the absence of negative training data, we first regard all unlabeled data as negative examples with false negative labels, and then convert PU learning into the risk minimization problem in the presence of such one-side label noise. Specifically, we propose a novel PU learning algorithm dubbed "Loss Decomposition and Centroid Estimation" (LDCE). By decomposing the loss function of corrupted negative examples into two parts, we show that only the second part is affected by the noisy labels. Thereby, we may estimate the centroid of corrupted negative set via an unbiased way to reduce the adverse impact of such label noise. Furthermore, we propose the "Kernelized LDCE" (KLDCE) by introducing the kernel trick, and show that KLDCE can be easily solved by combining Alternative Convex Search (ACS) and Sequential Minimal Optimization (SMO). Theoretically, we derive the generalization error bound which suggests that the generalization risk of our model converges to the empirical risk with the order of O(1/√k+1/√{n-k}+1/√n) ( n and k are the amounts of training data and positive data correspondingly). Experimentally, we conduct intensive experiments on synthetic dataset, UCI benchmark datasets and real-world datasets, and the results demonstrate that our approaches (LDCE and KLDCE) achieve the top-level performance when compared with both classic and state-of-the-art PU learning methods.

关键词： Learning Artificial Intelligence Minimisation Pattern Classification Positive Data KLDCE Loss Decomposition Centroid Estimation Positive Learning Unlabeled Learning Binary Classifier Unlabeled Data Classifier Training Negative Training Data False Negative labels Risk Minimization Problem PU Learning Algorithm Loss Function Corrupted Negative Examples Noisy labels Corrupted Negative Set Generalization Risk Empirical Risk Kernelized LDCE One Side label Noise Alternative Convex Search ACS Sequential Minimal Optimization SMO Generalization Error Bound Estimation Training Supervised Learning Noise Measurement Analytical Models Risk Management Kernel PU Learning Loss Decomposition Centroid Estimation Kernel Extension Generalization Bound