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

EFFICIENT ONLINE lab.L 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 lab.l 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

Online non-feedback image re-ranking via dominant data selection

学校读者我要写书评

暂无评论

Online non-feedback image re-ranking via dominant data selec...

20th ACM International Conference on Multimedia, MM 2012

作者： Cao, Chen Chen, Shifeng Li, Yuhong Liu, Jianzhuang Shenzhen Key Laboratory for Computer Vision and Pattern Recognition Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen China Department of Information Engineering Chinese University of Hong Kong Hong Kong Media Lab. Huawei Technologies Co. Ltd. China

ISBN: (纸本)9781450310895

Image re-ranking aims at improving the precision of keyword-based image retrieval, mainly by introducing visual features to re-rank. Many existing approaches require offline training for every keyword, which are unsuitable for online image search. Other real-time approaches demand user interaction, which are inappropriate for large-scale image collection. To improve the accuracy of web image retrieval in a practicable manner, we propose a novel re-ranking algorithm to explore the cluster information of the image set. First, we build spectral graph on images that retrieved bysearch engine, and remove isolated nodes as noisy images. Then, we select positive samples from the most dominant cluster in initial top-ranked images, and the samples are used for semi-supervised learning and ranking. Our algorithm is online and non-feedback. Experiments on two public databases demonstrate that our algorithm outperforms the state-of-the-art approaches. © 2012 ACM.

关键词： Supervised learning

Inconsistency Distillation For Consistency:Enhancing Multi-View Clustering via Mutual Contrastive Teacher-Student Leaning

学校读者我要写书评

暂无评论

Inconsistency Distillation For Consistency:Enhancing Multi-V...

IEEE International Conference on Data Mining (ICDM)

作者： Dunqiang Liu Shu-Juan Peng Xin Liu Lei Zhu Zhen Cui Taihao Li Dept. of Comput. Sci. & Fujian Key Lab. of Big Data Intelligence and Security Huaqiao University Xiamen China Zhejiang Lab Hangzhou China Xiamen Key Lab. of Computer Vision and Pattern Recognition Huaqiao University Xiamen China Key Lab. of Computer Vision and Machine Learning (Huaqiao University) Fujian Province University Xiamen China School of Information Sci. and Eng. Shandong Normal University Jinan China School of Computer Sci. and Eng. Nanjing University of Science and Technology Nanjing China

Multi-view clustering has attracted more attention recently since many real-world data are comprised of different representations or views. Recent multi-view clustering works mainly exploit the instance consistency to obtain the shared representations across different views, and apply a single-view clustering method to perform data partitions. However, these existing methods often ignore the inconsistency of instance associations within the views, which may enlarge the intra-class diversity among the views and therefore degrade the clustering performance. To address this issue, this paper proposes an efficient mutual contrastive teacher-student leaning (MC-TSL) model to enhance the multi-view clustering, which is the first attempt to study the inconsistency distillation for consistency learning. First, the proposed MC-TSL approach exploits a view-specific encoder with two heads, an instance encoding head and a semantic distillation head, respectively, for capturing the consistent and discriminative feature representations. To be specific, the former head exploits a cross-view contrastive learning method to obtain a redundancy-free consistent representation at the instance level, while the latter head designs a mutual teacher-student learning module to capture the intra-view information at semantic level. By training these two heads in an end-to-end manner, the discriminative multi-view embeddings are efficiently obtained and refined by minimizing the weighted sum of the reconstruction loss, contrastive loss and contrast distillation loss. Extensive experiments verify the superiorities of the proposed MC-TSL framework and show its competitive clustering performances.

关键词： Training Learning systems Clustering methods Semantics Encoding Data mining

RankSRGAN: Generative adversarial networks with ranker for image super-resolution

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Zhang, Wenlong Liu, Yihao Dong, Chao Qiao, Yu ShenZhen Key Lab of Computer Vision and Pattern Recognition SIAT-SenseTime Joint Lab. Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences

Generative Adversarial Networks (GAN) have demonstrated the potential to recover realistic details for single image super-resolution (SISR). To further improve the visual quality of super-resolved results, PIRM2018-SR Challenge employed perceptual metrics to assess the perceptual quality, such as PI, NIQE, and Ma. However, existing methods cannot directly optimize these indifferentiable perceptual metrics, which are shown to be highly correlated with human ratings. To address the problem, we propose Super-Resolution Generative Adversarial Networks with Ranker (RankSRGAN) to optimize generator in the direction of perceptual metrics. Specifically, we first train a Ranker which can learn the behavior of perceptual metrics and then introduce a novel rank-content loss to optimize the perceptual quality. The most appealing part is that the proposed method can combine the strengths of different SR methods to generate better results. Extensive experiments show that RankSRGAN achieves visually pleasing results and reaches state-of-the-art performance in perceptual metrics. Project page: https://***/Projects/RankSRGAN. Copyright © 2019, The Authors. All rights reserved.

关键词： Generative adversarial networks

Context-transformer: Tackling object confusion for few-shot detection

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Yang, Ze Wang, Yali Chen, Xianyu Liu, Jianzhuang Qiao, Yu ShenZhen Key Lab of Computer Vision and Pattern Recognition SIAT-SenseTime Joint Lab. Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Huawei Noah’s Ark Lab. SIAT Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society

Few-shot object detection is a challenging but realistic scenario, where only a few annotated training images are availab.e for training detectors. A popular approach to handle this problem is transfer learning, i.e., fine-tuning a detector pretrained on a source-domain benchmark. However, such transferred detector often fails to recognize new objects in the target domain, due to low data diversity of training samples. To tackle this problem, we propose a novel Context-Transformer within a concise deep transfer framework. Specifically, Context-Transformer can effectively leverage source-domain object knowledge as guidance, and automatically exploit contexts from only a few training images in the target domain. Subsequently, it can adaptively integrate these relational clues to enhance the discriminative power of detector, in order to reduce object confusion in few-shot scenarios. Moreover, Context-Transformer is flexibly embedded in the popular SSD-style detectors, which makes it a plug-and-play module for end-to-end few-shot learning. Finally, we evaluate Context-Transformer on the challenging settings of few-shot detection and incremental few-shot detection. The experimental results show that, our framework outperforms the recent state-of-the-art approaches. The codes are availab.e at https://***/Ze-Yang/ContextTransformer. Copyright © 2020, The Authors. All rights reserved.

关键词： Object detection

Reflash Dropout in Image Super-Resolution

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Kong, Xiangtao Liu, Xina Gu, Jinjin Qiao, Yu Dong, Chao ShenZhen Key Lab of Computer Vision and Pattern Recognition SIAT-SenseTime Joint Lab. Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences China University of Chinese Academy of Sciences China The University of Sydney Australia Shanghai AI Laboratory Shanghai China

Dropout is designed to relieve the overfitting problem in high-level vision tasks but is rarely applied in low-level vision tasks, like image super-resolution (SR). As a classic regression problem, SR exhibits a different behaviour as high-level tasks and is sensitive to the dropout operation. However, in this paper, we show that appropriate usage of dropout benefits SR networks and improves the generalization ability. Specifically, dropout is better embedded at the end of the network and is significantly helpful for the multi-degradation settings. This discovery breaks our common sense and inspires us to explore its working mechanism. We further use two analysis tools – one is from a recent network interpretation work, and the other is specially designed for this task. The analysis results provide side proofs to our experimental findings and show us a new perspective to understand SR networks. Copyright © 2021, The Authors. All rights reserved.

关键词： Optical resolving power

Detach and Enhance: Learning Disentangled Cross-modal Latent Representation for Efficient Face-Voice Association and Matching

学校读者我要写书评

暂无评论

Detach and Enhance: Learning Disentangled Cross-modal Latent...

IEEE International Conference on Data Mining (ICDM)

作者： Zhenning Yu Xin Liu Yiu-Ming Cheung Minghang Zhu Xing Xu Nannan Wang Taihao Li Dept. of Comput. Sci. & Fujian Key Lab. of Big Data Intelligence and Security Huaqiao University Xiamen China Zhejiang Lab Hangzhou China Dept. of Comput. Sci. and Institute of Research and Continuing Education HK Baptist University Hong Kong SAR China Xiamen Key Lab. of Computer Vision and Pattern Recognition Huaqiao University Xiamen China Dept. of Computer Sci. and Eng. University of Electronic Science and Technology of China Chengdu China State Key Lab. of Integrated Services Networks & School of Telecommun. Eng. Xidian University Xi’an China

Many researches in cognitive science have shown that humans often perform face-voice association for various perception tasks, and some recent data mining works have been designed in emulating such ability intelligently. Nevertheless, most methods often suffer from the degraded performance when there exist semantically irrelevant interference factors across different modalities. To alleviate this concern, this paper presents an efficient Disentangled Cross-modal Latent Representation (DCLR) method to adaptively detach the discriminative feature attributes and enhance the face-voice association. To be specific, the proposed DCLR framework consists of two-stage cross-modal disentangling process. First, the former stage employs the supervised contrastive learning to push the representations of face-voice data from the same person closer while pulling those representations of different person away. Then, the latter stage freezes all the parameters of the former stage, and further innovates a multi-layer orthogonal decoupling scheme to learn the disentangled latent representations, while filtering out the modality-dependent irrelevant factors. Besides, the cross-modal reconstruction loss is further utilized to narrow down the semantic gap between heterogeneous feature expressions. Through the joint exploitation of the above, the proposed framework can well associate the face-voice data to benefit various kinds of cross-modal perception tasks. Extensive experiments verify the superiorities of the proposed face-voice association framework and show its competitive performances.

关键词： Representation learning Filtering Semantics Interference Data models Cognitive science Data mining

TTPP: Temporal transformer with progressive prediction for efficient action anticipation

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Wang, Wen Peng, Xiaojiang Su, Yanzhou Qiao, Yu Cheng, Jian School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu Sichuan611731 China ShenZhen Key Lab of Computer Vision and Pattern Recognition SIAT-SenseTime Joint Lab. Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences SIAT Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society

Video action anticipation aims to predict future action categories from observed frames. Current state-of-the-art approaches mainly resort to recurrent neural networks to encode history information into hidden states, and predict future actions from the hidden representations. It is well known that the recurrent pipeline is inefficient in capturing long-term information which may limit its performance in predication task. To address this problem, this paper proposes a simple yet efficient Temporal Transformer with Progressive Prediction (TTPP) framework, which repurposes a Transformer-style architecture to aggregate observed features, and then leverages a light-weight network to progressively predict future features and actions. Specifically, predicted features along with predicted probabilities are accumulated into the inputs of subsequent prediction. We evaluate our approach on three action datasets, namely TVSeries, THUMOS-14, and TV-Human-Interaction. Additionally we also conduct a comprehensive study for several popular aggregation and prediction strategies. Extensive results show that TTPP not only outperforms the state-of-the-art methods but also more efficient. Copyright © 2020, The Authors. All rights reserved.

关键词： Forecasting

Learning Flexible Binary Code for Linear Projection Based Hashing with Random Forest

学校读者我要写书评

暂无评论

Learning Flexible Binary Code for Linear Projection Based Ha...

International Conference on pattern recognition

作者： Shuze Du Wei Zhang Shifeng Chen Yafei Wen Chengdu Institute of Computer Applications Chinese Academy of Sciences Sichuan China Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Media Lab. Huawei Technologies Co. Ltd. China Shenzhen Key Lab of Computer Vision and Pattern Recognition Chinese Academy of Sciences Guangdong China The Chinese University of Hong Kong Hong Kong University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781479952106

Existing linear projection based hashing methods have witnessed many progresses in finding the approximate nearest neighbor(s) of a given query. They perform well when using a short code. But their code length depends on the original data dimension, thus their performance can not be further improved with higher number of bits for low dimensional data. In addition, in the case of high dimensional data, it is not a good choice to produce each bit by a sign function. In this paper, we propose a novel random forest based approach to cope with the above shortcomings. The bits are obtained by recording the paths when a point traversing each tree in the forest. Then we propose a new metric to calculate the similarity between any two codes. Experimental results on two large benchmark datasets show that our approach outperforms its counterparts and demonstrate its superiority over the existing state-of-the-art hashing methods for descriptor retrieval.

关键词： Vegetation Vectors Binary codes Encoding Computational modeling Radio frequency Principal component analysis