A fast evolutionary pursuit algorithm based on linearly combining vectors

Qijun Zhao; Hongtao Lu; Dapeng Zhang

doi:10.1016/j.patcog.2005.09.001

A fast evolutionary pursuit algorithm based on linearly combining vectors

Qijun Zhao
, Hongtao Lu
, Dapeng Zhang

Research output: Journal article publication › Journal article › Academic research › peer-review

8 Citations (Scopus)

Abstract

In this paper, we propose a fast Evolutionary pursuit algorithm. It searches for optimal discriminant vectors through linearly combining standard bases. Experiments on the Yale and ORL databases verify its effectiveness and enhanced efficiency.

Original language	English
Pages (from-to)	310-312
Number of pages	3
Journal	Pattern Recognition
Volume	39
Issue number	2
DOIs	https://doi.org/10.1016/j.patcog.2005.09.001
Publication status	Published - 1 Feb 2006

Keywords

Evolutionary pursuit
Face recognition
Linear combination

ASJC Scopus subject areas

Software
Signal Processing
Computer Vision and Pattern Recognition
Artificial Intelligence

More information

10.1016/j.patcog.2005.09.001

Cite this

@article{3ae6d01056fd4313ad244f540494072e,

title = "A fast evolutionary pursuit algorithm based on linearly combining vectors",

abstract = "In this paper, we propose a fast Evolutionary pursuit algorithm. It searches for optimal discriminant vectors through linearly combining standard bases. Experiments on the Yale and ORL databases verify its effectiveness and enhanced efficiency.",

keywords = "Evolutionary pursuit, Face recognition, Linear combination",

author = "Qijun Zhao and Hongtao Lu and Dapeng Zhang",

year = "2006",

month = feb,

day = "1",

doi = "10.1016/j.patcog.2005.09.001",

language = "English",

volume = "39",

pages = "310--312",

journal = "Pattern Recognition",

issn = "0031-3203",

publisher = "Elsevier Ltd",

number = "2",

}

TY - JOUR

T1 - A fast evolutionary pursuit algorithm based on linearly combining vectors

AU - Zhao, Qijun

AU - Lu, Hongtao

AU - Zhang, Dapeng

PY - 2006/2/1

Y1 - 2006/2/1

N2 - In this paper, we propose a fast Evolutionary pursuit algorithm. It searches for optimal discriminant vectors through linearly combining standard bases. Experiments on the Yale and ORL databases verify its effectiveness and enhanced efficiency.

AB - In this paper, we propose a fast Evolutionary pursuit algorithm. It searches for optimal discriminant vectors through linearly combining standard bases. Experiments on the Yale and ORL databases verify its effectiveness and enhanced efficiency.

KW - Evolutionary pursuit

KW - Face recognition

KW - Linear combination

UR - https://www.scopus.com/pages/publications/27744492167

U2 - 10.1016/j.patcog.2005.09.001

DO - 10.1016/j.patcog.2005.09.001

M3 - Journal article

SN - 0031-3203

VL - 39

SP - 310

EP - 312

JO - Pattern Recognition

JF - Pattern Recognition

IS - 2

ER -

A fast evolutionary pursuit algorithm based on linearly combining vectors

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this