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

Face recognition via locality constrained low rank representation and dictionary learning

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Yin, He-Feng Wu, Xiao-Jun Kittler, Josef School of IoT Engineering Jiangnan University Wuxi214122 China Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Wuxi China Centre for Vision Speech and Signal Processing University of Surrey GuildfordGU2 7XH United Kingdom

Face recognition has been widely studied due to its importance in smart cities applications. However, the case when both training and test images are corrupted is not well solved. To address such a problem, this paper proposes a locality constrained low rank representation and dictionary learning (LCLRRDL) algorithm for robust face recognition. In particular, we present three contributions in the proposed formulation. First, a low-rank representation is introduced to handle the possible contamination of the training as well as test data. Second, a locality constraint is incorporated to acknowledge the intrinsic manifold structure of training data. With the locality constraint term, our scheme induces similar samples to have similar representations. Third, a compact dictionary is learned to handle the problem of corrupted data. The experimental results on two public databases demonstrate the effectiveness of the proposed approach. Matlab code of our proposed LCLRRDL can be downloaded from https://***/yinhefeng/LCLRRDL. Copyright © 2019, The Authors. All rights reserved.

关键词： Face recognition

Learning a representation with the block-diagonal structure for pattern classification

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Yin, He-Feng Wu, Xiao-Jun Kittler, Josef Feng, Zhen-Hua School of Internet of Things Engineering Jiangnan University Wuxi214122 China Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Jiangnan University Wuxi214122 China Centre for Vision Speech and Signal Processing University of Surrey GuildfordGU2 7XH United Kingdom

Sparse-representation-based classification (SRC) has been widely studied and developed for various practical signal classification applications. However, the performance of a SRC-based method is degraded when both the training and test data are corrupted. To counteract this problem, we propose an approach that learns Representation with Block-Diagonal Structure (RBDS) for robust image recognition. To be more specific, we first introduce a regularization term that captures the block-diagonal structure of the target representation matrix of the training data. The resulting problem is then solved by an optimizer. Last, based on the learned representation, a simple yet effective linear classifier is used for the classification task. The experimental results obtained on several benchmarking datasets demonstrate the efficacy of the proposed RBDS method. The code will be released upon the acceptance of this paper. Copyright © 2019, The Authors. All rights reserved.

关键词： Image recognition

Multiple riemannian manifold-valued descriptors based image set classification with multi-kernel metric learning

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Wang, Rui Wu, Xiao-Jun Kittler, Josef School of Internet of Things Engineering Jiangnan University Wuxi214122 China Jiangsu Provincial Engineering Laboratory of Pattern Recognition and Computational Intelligence Jiangnan University Wuxi214122 China Centre for Vision Speech and Signal Processing University of Surrey GuildfordGU2 7XH United Kingdom

The importance of wild video based image set recognition is becoming monotonically increasing due to the large amount of video resources obtained by diversified video collection approaches, like surveillance, drive recorders, smart phones, and internet. However, the contents of these collected videos are often complicated, and how to efficiently perform set modeling and feature extraction is a big challenge for set-based classification algorithms. In recent years, some proposed image set classification methods have made a considerable advance by modeling the original image set with covariance matrix, linear subspace, or Gaussian distribution. Moreover, the distinctive geometry spanned by them are Symmetric Positive Definite (SPD) manifold, Grassmann manifold, and Gaussian embedded Riemannian manifold, respectively. As a matter of fact, most of them just adopt a single geometric model to describe each given image set, which may lose some other useful information for classification. To tackle this problem, we propose a novel algorithm to model each image set from a multi-geometric perspective. Specifically, the covariance matrix, linear subspace, and Gaussian distribution are applied for set representation simultaneously. In order to fuse these multiple heterogeneous Riemannian manifoldvalued features, the well-equipped Riemannian kernel functions are first utilized to map them into high dimensional Hilbert spaces. Then, a multi-kernel metric learning framework is devised to embed the learned hybrid kernels into a lower dimensional common subspace for classification. We conduct experiments on four widely used datasets corresponding to four different classification tasks: video-based face recognition, set-based object categorization, video-based emotion recognition, and dynamic scene classification, to evaluate the classification performance of the proposed algorithm. Extensive experimental results justify its superiority over the state-of-the-art. Copyright © 2019, Th

关键词： Vector spaces

Dual encoder-decoder based generative adversarial networks for disentangled facial representation learning

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Hu, Cong Feng, Zhen-Hua Wu, Xiao-Jun Kittler, Josef School of Internet of Things Engineering Jiangnan University Wuxi Jiangsu Province214122 China Jiangsu Provincial Laboratory of Pattern Recognition and Computational Intelligence Jiangnan University Wuxi Jiangsu Province214122 China Centre for Vision Speech and Signal Processing University of Surrey GuildfordGU2 7XH United Kingdom

To learn disentangled representations of facial images, we present a Dual Encoder-Decoder based Generative Adversarial Network (DED-GAN). In the proposed method, both the generator and discriminator are designed with deep encoder-decoder architectures as their backbones. To be more specific, the encoder-decoder structured generator is used to learn a pose disentangled face representation, and the encoder-decoder structured discriminator is tasked to perform real/fake classification, face reconstruction, determining identity and estimating face pose. We further improve the proposed network architecture by minimising the additional pixel-wise loss defined by the Wasserstein distance at the output of the discriminator so that the adversarial framework can be better trained. Additionally, we consider face pose variation to be continuous, rather than discrete in existing literature, to inject richer pose information into our model. The pose estimation task is formulated as a regression problem, which helps to disentangle identity information from pose variations. The proposed network is evaluated on the tasks of pose-invariant face recognition (PIFR) and face synthesis across poses. An extensive quantitative and qualitative evaluation carried out on several controlled and in-the-wild benchmarking datasets demonstrates the superiority of the proposed DED-GAN method over the state-of-the-art approaches. Copyright © 2019, The Authors. All rights reserved.

关键词： Generative adversarial networks

Benchmarking quality-dependent and cost-sensitive score-level multimodal biometric fusion algorithms

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Poh, Norman Bourlai, Thirimachos Kittler, Josef Allano, Lorene Alonso-Fernandez, Fernando Ambekar, Onkar Baker, John Dorizzi, Bernadette Fatukasi, Omolara Fierrez, Julian Ganster, Harald Ortega-Garcia, Javier Maurer, Donald Salah, Albert Ali Scheidat, Tobias Vielhauer, Claus Centre for Vision Speech and Signal Processing School of Electronics and Physical Sciences University of Surrey Guildford SurreyGU2 7XH United Kingdom Biometrics Center Lane Department of Computer Science and Electrical Engineering College of Engineering and Mineral Resources West Virginia University MorgantownWV26506-6109 United States Institut Telecom Telecom and Management SudParis Evry91011 France Biometric Recognition Group – ATVS Escuela Politecnica Superior Universidad Autonoma de Madrid Madrid28049 Spain Amsterdam1098 XG Netherlands Applied Physics Laboratory Johns Hopkins University LaurelMD20723 United States Electronics and Physics Department Institut Telecom Telecom and Management SudParis Evry91011 France Institute of Digital Image Processing Joanneum Research Graz8010 Austria ISLA-ISIS University of Amsterdam Amsterdam1098 XG Netherlands Department of Informatics and Media Brandenburg University of Applied Sciences Brandenburg an der HavelD-14770 Germany Research Group Multimedia and Security Department of Technical and Business Information Systems Faculty of Computer Science Otto-von-Guericke-University of Magdeburg MagdeburgD-39106 Germany

Automatically verifying the identity of a person by means of biometrics (e.g., face and fingerprint) is an important application in our day-to-day activities such as accessing banking services and security control in airports. To increase the system reliability, several biometric devices are often used. Such a combined system is known as a multimodal biometric system. This paper reports a benchmarking study carried out within the framework of the BioSecure DS2 (Access Control) evaluation campaign organized by the University of Surrey, involving face, fingerprint, and iris biometrics for person authentication, targeting the application of physical access control in a medium-size establishment with some 500 persons. While multimodal biometrics is a well-investigated subject in the literature, there exists no benchmark for a fusion algorithm comparison. Working towards this goal, we designed two sets of experiments: quality-dependent and cost-sensitive evaluation. The quality-dependent evaluation aims at assessing how well fusion algorithms can perform under changing quality of raw biometric images principally due to change of devices. The cost-sensitive evaluation, on the other hand, investigates how well a fusion algorithm can perform given restricted computation and in the presence of software and hardware failures, resulting in errors such as failure-to-acquire and failure-to-match. Since multiple capturing devices are available, a fusion algorithm should be able to handle this nonideal but nevertheless realistic scenario. In both evaluations, each fusion algorithm is provided with scores from each biometric comparison subsystem as well as the quality measures of both the template and the query data. The response to the call of the evaluation campaign proved very encouraging, with the submission of 22 fusion systems. To the best of our knowledge, this campaign is the first attempt to benchmark quality-based multimodal fusion algorithms. In the presence of changing

关键词： Benchmarking

Semi-heterogeneous three-way joint embedding network for sketch-based image retrieval

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Lei, Jianjun Song, Yuxin Peng, Bo Ma, Zhanyu Shao, Ling Song, Yi-Zhe School of Electrical and Information Engineering Tianjin University Tianjin300072 China Pattern Recognition and Intelligent System Laboratory Beijing University of Posts and Telecommunications Beijing100876 China Inception Institute of Artificial Intelligence Abu Dhabi United Arab Emirates SketchX Lab Centre for Vision Speech and Signal Processing University of Surrey Surrey GuildfordGU2 7XH United Kingdom

Sketch-based image retrieval (SBIR) is a challenging task due to the large cross-domain gap between sketches and natural images. How to align abstract sketches and natural images into a common high-level semantic space remains a key problem in SBIR. In this paper, we propose a novel semi-heterogeneous three-way joint embedding network (Semi3-Net), which integrates three branches (a sketch branch, a natural image branch, and an edgemap branch) to learn more discriminative cross-domain feature representations for the SBIR task. The key insight lies with how we cultivate the mutual and subtle relationships amongst the sketches, natural images, and edgemaps. A semi-heterogeneous feature mapping is designed to extract bottom features from each domain, where the sketch and edgemap branches are shared while the natural image branch is heterogeneous to the other branches. In addition, a joint semantic embedding is introduced to embed the features from different domains into a common high-level semantic space, where all of the three branches are shared. To further capture informative features common to both natural images and the corresponding edgemaps, a co-attention model is introduced to conduct common channel-wise feature recalibration between different domains. A hybrid-loss mechanism is designed to align the three branches, where an alignment loss and a sketch-edgemap contrastive loss are presented to encourage the network to learn invariant cross-domain representations. Experimental results on two widely used category-level datasets (Sketchy and TU-Berlin Extension) demonstrate that the proposed method outperforms state-of-the-art methods. Copyright © 2019, The Authors. All rights reserved.

关键词： Semantics

Correction to: Automatic identification of myopic maculopathy related imaging features in optic disc region via machine learning methods

学校读者我要写书评

暂无评论

Journal of translational medicine 2021年第1期19卷 203页

作者： Yuchen Du Qiuying Chen Ying Fan Jianfeng Zhu Jiangnan He Haidong Zou Dazhen Sun Bowen Xin David Feng Michael Fulham Xiuying Wang Lisheng Wang Xun Xu Department of Automation The Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University (SJTU) 800 Dongchuan RD. Minhang District Shanghai 200240 People's Republic of China. Department of Preventative Ophthalmology Shanghai Eye Diseases Prevention and Treatment Center Shanghai Eye Hospital No. 380 Kangding Road Shanghai 200040 China. Department of Ophthalmology Shanghai Key Laboratory of Ocular Fundus Diseases Shanghai Engineering Center for Visual Science and Photo Medicine Shanghai General Hospital SJTU School of Medicine Shanghai China. National Clinical Research Center for Eye Diseases Shanghai 20080 China. Biomedical and Multimedia Information Technology Research Group School of Computer Science The University of Sydney Sydney NSW 2006 Australia. Department of Molecular Imaging Royal Prince Alfred Hospital and the University of Sydney Sydney Australia. Department of Automation The Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University (SJTU) 800 Dongchuan RD. Minhang District Shanghai 200240 People's Republic of China. lswang@***. Department of Preventative Ophthalmology Shanghai Eye Diseases Prevention and Treatment Center Shanghai Eye Hospital No. 380 Kangding Road Shanghai 200040 China. drxuxun@***. Department of Ophthalmology Shanghai Key Laboratory of Ocular Fundus Diseases Shanghai Engineering Center for Visual Science and Photo Medicine Shanghai General Hospital SJTU School of Medicine Shanghai China. drxuxun@***. National Clinical Research Center for Eye Diseases Shanghai 20080 China. drxuxun@***.

An amendment to this paper has been published and can be accessed via the original article.

关键词：

Benchmarking super-resolution algorithms on real data

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Köhler, Thomas Bätz, Michel Naderi, Farzad Kaup, André Maier, Andreas K. Riess, Christian Pattern Recognition Lab Dept. of Computer Science Multimedia Communications and Signal Processing Dept. of Electrical Electronic and Communication Engineering Erlangen-Nürnberg Erlangen Germany

Over the past decades, various super-resolution (SR) techniques have been developed to enhance the spatial resolution of digital images. Despite the great number of methodical contributions, there is still a lack of comparative validations of SR under practical conditions, as capturing real ground truth data is a challenging task. Therefore, current studies are either evaluated 1) on simulated data or 2) on real data without a pixel-wise ground truth. To facilitate comprehensive studies, this paper introduces the publicly available Super-Resolution Erlangen (SupER) database that includes real low-resolution images along with high-resolution ground truth data. Our database comprises image sequences with more than 20k images captured from 14 scenes under various types of motions and photometric conditions. The datasets cover four spatial resolution levels using camera hardware binning. With this database, we benchmark 15 single-image and multi-frame SR algorithms. Our experiments quantitatively analyze SR accuracy and robustness under realistic conditions including independent object and camera motion or photometric variations. Copyright © 2017, The Authors. All rights reserved.

关键词： Database systems

Edgy salient local binary patterns in inter-plane relationship for image retrieval in Diabetic Retinopathy

学校读者我要写书评

暂无评论

Procedia Computer Science 2017年 115卷 440-447页

作者： Gajanan M. Galshetwar Laxman M. Waghmare Anil B. Gonde Subrahmanyam Murala Center of Excellence in Signal and Image Processing (COESIP) Department of ECE SGGSIET Nanded Maharashtra 431606 India Computer Vision and Pattern Recognition Laboratory Department of Electrical Engineering IIT Ropar Rupnagar 140001 India

In this paper, a novel approach for content based image retrieval (CBIR) in diabetic retinopathy (DR) is proposed. The concept of salient point selection and inter-plane relationship technique is used. Salient points are selected from edgy image and later using inter-planer relationship, Local Binary patterns (LBPs) are calculated using the salient point as a center pixel. Our approach enhanced the results as we used color features in combination with LBP features. Experimentation is carried out on MESSIDOR database of 1200 retinal images, proposed approach has average precision of 57.82% as compared to the earlier approach whose average precision is 53.70%.

关键词： Content-Based image retrieval (CBIR) Diabetic Retinopathy (DR) Edgy Salient points Local Binary patterns (LBPs)