loading
Papers

Research.Publish.Connect.

Paper

Authors: Jieun Lee ; Miran Heo and Yoonsik Choe

Affiliation: School of Electrical and Electronic Engineering, Yonsei University, Seoul and Korea

ISBN: 978-989-758-354-4

Keyword(s): Face Recognition, Greedy Algorithm, Random Projection, Sparse-based Representation Classification.

Related Ontology Subjects/Areas/Topics: Applications ; Applications and Services ; Computer Vision, Visualization and Computer Graphics ; Enterprise Information Systems ; Features Extraction ; Human and Computer Interaction ; Human-Computer Interaction ; Image and Video Analysis ; Image Formation and Preprocessing ; Image Formation, Acquisition Devices and Sensors ; Pattern Recognition ; Robotics ; Software Engineering

Abstract: Face and expression recognition problem can be converted into superposition of low-rank matrix and sparse error matrix, which have the merits of robustness to occlusion and disguise. Low-rank matrix manifests neutral facial image and sparse matrix captures emotional expression with respect to whole image. To separate these matrices, the problem is formulated to minimize the nuclear norm and L1 norm, then can be solved by using a closed-form proximal operator which is called Singular Value Thresholding (SVD). However, this conventional approach has high computational complexity since it requires computation of singular value decomposition of large sized matrix at each iteration. In this paper, to reduce this computational burden, a fast approximation method for SVT is proposed, utilizing a suitable low-rank matrix approximation involving random projection. Basically, being associated with sampling, a low-rank matrix is modeled as bilateral factorized matrices, then update these matrice s with greedy manner. Experiments are conducted on publicly available different dataset for face and expression recognition. Consequently, proposed algorithm results in the improved recognition accuracy and also further speeding up the process of approximating low-rank matrix, compared to the conventional SVT based approximation methods. The best recognition accuracy score of 98.1% in the JAFFE database is acquired with our method about 55 times faster than SVD based method. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 35.172.217.40

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Lee, J.; Heo, M. and Choe, Y. (2019). Bilateral Random Projection based High-speed Face and Expression Recognition Method.In Proceedings of the 14th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 4 VISAPP: VISAPP, ISBN 978-989-758-354-4, pages 99-106. DOI: 10.5220/0007346000990106

@conference{visapp19,
author={Jieun Lee. and Miran Heo. and Yoonsik Choe.},
title={Bilateral Random Projection based High-speed Face and Expression Recognition Method},
booktitle={Proceedings of the 14th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 4 VISAPP: VISAPP,},
year={2019},
pages={99-106},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007346000990106},
isbn={978-989-758-354-4},
}

TY - CONF

JO - Proceedings of the 14th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications - Volume 4 VISAPP: VISAPP,
TI - Bilateral Random Projection based High-speed Face and Expression Recognition Method
SN - 978-989-758-354-4
AU - Lee, J.
AU - Heo, M.
AU - Choe, Y.
PY - 2019
SP - 99
EP - 106
DO - 10.5220/0007346000990106

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.