Guanqun Cao

Guanqun Cao

Auto-generated profile, based on publicly available information

Guanqun Cao

Signal Processing, Tampereen Teknillinen yliopisto, 7839 Tampere, Tampere Finland 33101

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 September 2017 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
GCGuanqun Cao
Guanqun Cao
AIAlexandros Iosifidis
Alexandros Iosifidis
Ke ChenKe Chen
Ke Chen
MGMoncef Gabbouj
Moncef Gabbouj
In this paper, the problem of multi-view embedding from different visual cues and modalities is considered. We propose a unified solution for subspace learning methods using the Rayleigh quotient, which is extensible for multiple views, supervised learning, and nonlinear embeddings. Numerous methods including canonical correlation analysis, partial least square regression, and linear discriminant analysis are studied using specific intrinsic and penalty graphs within the same framework. Nonlinear extensions based on kernels and (deep) neural networks are derived, achieving better performance than the linear ones. Moreover, a novel multi-view modular discriminant analysis is proposed by taking the view difference into consideration. We demonstrate the effectiveness of the proposed multi-view embedding methods on visual object recognition and cross-modal image retrieval, and obtain superior results in both applications compared to related methods.

20 September 2019 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
GCGuanqun Cao
Guanqun Cao
AIAlexandros Iosifidis
Alexandros Iosifidis
MGMoncef Gabbouj
Moncef Gabbouj
VRVijay Raghavan
Vijay Raghavan
RGRaju Gottumukkala
Raju Gottumukkala
We study the problem of learning to rank from multiple information sources. Though multi-view learning and learning to rank have been studied extensively leading to a wide range of applications, multi-view learning to rank as a synergy of both topics has received little attention. The aim of the paper is to propose a composite ranking method while keeping a close correlation with the individual rankings simultaneously. We present a generic framework for multi-view subspace learning to rank (MvSL2R), and two novel solutions are introduced under the framework. The first solution captures information of feature mappings from within each view as well as across views using autoencoder-like networks. Novel feature embedding methods are formulated in the optimization of multi-view unsupervised and discriminant autoencoders. Moreover, we introduce an end-to-end solution to learning towards both the joint ranking objective and the individual rankings. The proposed solution enhances the joint ranking with minimum view-specific ranking loss, so that it can achieve the maximum global view agreements in a single optimization process. The proposed method is evaluated on three different ranking problems, i.e. university ranking, multi-view lingual text ranking and image data ranking, providing superior results compared to related methods.

1 July 2014
Verified
Conference Paper
Closed access
JRJ. Raitoharju
J. Raitoharju
HZH. Zhang
H. Zhang
EOE.C. Ozan
E.C. Ozan
MWM.A. Waris
M.A. Waris
MFM. Faisal
M. Faisal
MGMoncef Gabbouj
Moncef Gabbouj
This paper presents our system designed for MSR-Bing Image Retrieval Challenge @ ICME 2014. The core of our system is formed by a text processing module combined with a module performing PCA-assisted perceptron regression with random sub-space selection (P2R2S2). P2R2S2 uses Over-Feat features as a starting point and transforms them into more descriptive features via unsupervised training. The relevance score for each query-image pair is obtained by comparing the transformed features of the query image and the relevant training images. We also use a face bank, duplicate image detection, and optical character recognition to boost our evaluation accuracy. Our system achieves 0.5099 in terms of DCG25 on the development set and 0.5116 on the test set.

1 December 2016
Verified
Conference Paper
Closed access
GCGuanqun Cao
Guanqun Cao
MWMuhammad Adeel Waris
Muhammad Adeel Waris
AIAlexandros Iosifidis
Alexandros Iosifidis
MGMoncef Gabbouj
Moncef Gabbouj
There has been a surge of efforts in cross-modal recognition and retrieval in recent multimedia research. Towards this goal, we investigate a multi-modal subspace learning algorithm together with the Dropout regularizer. Inspired by the regularization for neural networks, we propose to aritificially remove the effect of certain amount of feature bins using the probabilistic approach to prevent the linear subspace learning from over-fitting. The novel regularizer is well integrated into the multi-modal learning algorithm which maximizes the between-class scatter while minimizing the within-class scatter in the projected latent space. The new objective function can be solved efficiently as the generalized eigenvalue problem. Experimental results have shown that superior performance can be obtained in both face-sketch recognition and cross-modal retrieval applications.