PCA Based Gait Segmentation

Similar documents
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

A Binarization Algorithm specialized on Document Images and Photos

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

Research and Application of Fingerprint Recognition Based on MATLAB

Parallelism for Nested Loops with Non-uniform and Flow Dependences

An Improved Image Segmentation Algorithm Based on the Otsu Method

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Face Recognition Based on SVM and 2DPCA

Using Fuzzy Logic to Enhance the Large Size Remote Sensing Images

Shape-adaptive DCT and Its Application in Region-based Image Coding

Palmprint Feature Extraction Using 2-D Gabor Filters

Recognizing Faces. Outline

Cluster Analysis of Electrical Behavior

A Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Edge Detection in Noisy Images Using the Support Vector Machines

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

High-Boost Mesh Filtering for 3-D Shape Enhancement

A high precision collaborative vision measurement of gear chamfering profile

Lecture 4: Principal components

Application of adaptive MRF based on region in segmentation of microscopic image

On Modeling Variations For Face Authentication

Fast Feature Value Searching for Face Detection

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

Fingerprint matching based on weighting method and SVM

TN348: Openlab Module - Colocalization

Palmprint Recognition Using Directional Representation and Compresses Sensing

Modular PCA Face Recognition Based on Weighted Average

EYE CENTER LOCALIZATION ON A FACIAL IMAGE BASED ON MULTI-BLOCK LOCAL BINARY PATTERNS

IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. *, NO. *, Dictionary Pair Learning on Grassmann Manifolds for Image Denoising

Learning Ensemble of Local PDM-based Regressions. Yen Le Computational Biomedicine Lab Advisor: Prof. Ioannis A. Kakadiaris

Histogram-Enhanced Principal Component Analysis for Face Recognition

Detection of an Object by using Principal Component Analysis

Robust Face Alignment for Illumination and Pose Invariant Face Recognition

Multi-View Face Alignment Using 3D Shape Model for View Estimation

An Optimal Algorithm for Prufer Codes *

Integrated Expression-Invariant Face Recognition with Constrained Optical Flow

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:

Video Object Tracking Based On Extended Active Shape Models With Color Information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

Human Face Recognition Using Generalized. Kernel Fisher Discriminant

Two-Dimensional Supervised Discriminant Projection Method For Feature Extraction

Brushlet Features for Texture Image Retrieval

On Incremental and Robust Subspace Learning

Novel Pattern-based Fingerprint Recognition Technique Using 2D Wavelet Decomposition

A Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures

Wavefront Reconstructor

Collaboratively Regularized Nearest Points for Set Based Recognition

Machine Learning: Algorithms and Applications

An inverse problem solution for post-processing of PIV data

Solving two-person zero-sum game by Matlab

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Dynamic wetting property investigation of AFM tips in micro/nanoscale

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Discriminative Dictionary Learning with Pairwise Constraints

A New Image Binarization Method Using Histogram and Spectral Clustering

3D Rigid Facial Motion Estimation from Disparity Maps

Structure from Motion

Lecture 5: Multilayer Perceptrons

Feature Reduction and Selection

Vol. 5, No. 3 March 2014 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved.

Reducing Frame Rate for Object Tracking

Gender Classification using Interlaced Derivative Patterns

Face Tracking Using Motion-Guided Dynamic Template Matching

Face Recognition Methods Based on Feedforward Neural Networks, Principal Component Analysis and Self-Organizing Map

The Shortest Path of Touring Lines given in the Plane

A MINUTIAE-BASED MATCHING ALGORITHMS IN FINGERPRINT RECOGNITION SYSTEMS 1. INTRODUCTION

Classifier Selection Based on Data Complexity Measures *

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches

PRÉSENTATIONS DE PROJETS

Robust Mean Shift Tracking with Corrected Background-Weighted Histogram

A Study on Clustering for Clustering Based Image De-Noising

A Lossless Watermarking Scheme for Halftone Image Authentication

A Computer Vision System for Automated Container Code Recognition

Changyuan Xing College of Computer Engineering, Yangtze Normal University, Chongqing , China

A New Feature of Uniformity of Image Texture Directions Coinciding with the Human Eyes Perception 1

Learning a Class-Specific Dictionary for Facial Expression Recognition

Face recognition based on eigenfeatures

Local Quaternary Patterns and Feature Local Quaternary Patterns

Face Detection with Deep Learning

A Probabilistic Approach to Detect Urban Regions from Remotely Sensed Images Based on Combination of Local Features

An Approach for Crowd Density and Crowd Size Estimation

Novel Fuzzy logic Based Edge Detection Technique

Facial Expression Recognition Based on Local Binary Patterns and Local Fisher Discriminant Analysis

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method

Non-Negative Matrix Factorization and Support Vector Data Description Based One Class Classification

3D Face Reconstruction With Local Feature Refinement

3D Face Reconstruction With Local Feature Refinement. Abstract

Robust Shot Boundary Detection from Video Using Dynamic Texture

Research in Algorithm of Image Processing Used in Collision Avoidance Systems

An Image Fusion Approach Based on Segmentation Region

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

An AAM-based Face Shape Classification Method Used for Facial Expression Recognition

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Lecture #15 Lecture Notes

Skew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach

An Automatic Eye Detection Method for Gray Intensity Facial Images

Transcription:

Honggu L, Cupng Sh & Xngguo L PCA Based Gat Segmentaton PCA Based Gat Segmentaton Honggu L, Cupng Sh, and Xngguo L 2 Electronc Department, Physcs College, Yangzhou Unversty, 225002 Yangzhou, Chna 2 Department of Electronc Engneerng, Nanng Unversty of Scence & echnology, 20094 Nanng, Chna hgl@yzu.edu.cn Abstract A PCA based gat segmentaton method s proposed. Background mages are used for PCA tranng. PCA reconstructon, recursve error compensaton and sngle threshold based method s put forward for gat segmentaton. Sngle threshold based method has the same gat segmentaton ablty as classcal adaptve threshold based method, and the former s faster n mplementaton than the later. Proposed method s better than classcal background subtracton based method, and can be compared wth Gaussan dervatve flter based method. Proposed method converges rapdly and has the excellent capablty of gat segmentaton for varant background. Keyword: PCA, Gat segmentaton, Gat recognton.. ntroducton Gat recognton s one of the man technologes for authentcatng a person at a long dstance. ther bometrcs technologes, such as fngerprnt recognton, rs recognton, face recognton, hand recognton and palmprnt recognton, can't work effectvely when person s far away. Gat segmentaton s the frst step for gat analyss and recognton. Gat segmentaton can be defned as extractng human body from background n gat mage. Usually the result of gat segmentaton s a slhouette mage. Classcal gat segmentaton method s background subtracton []. hs method can't work well when pxel of foreground mage has smlar gray level value as that of pxel of background mage n the same poston. Because there are new edges at human body contour n foreground mage, human body counter can be found through comparng the edge nformaton between foreground mage and background mage. We have provded a new gat segmentaton method, whch s based on comparng flterng results between foreground mage and background mage usng mult-scale and mult-drecton Gaussan dervatve flters [2]. Better gat segmentaton method s stll expected. Face recognton technology has been developed deeply, and a lot of algorthms have been proposed. Successful face recognton method can be used for other bometrcs. Some approaches have been * hs paper s sponsored by the proect (No. 04KJB5067) from educaton department of Jangsu, Chna. 36

nternatonal Journal of nformaton echnology Vol. 2 No. 5 2006 proposed to extract and remove eyeglasses from facal mages. f we take person n gat mage as glasses n facal mage, glasses removal algorthm can be used for gat segmentaton. Sato reconstructed eyeglassless facal mages usng PCA [3]. Facal mages wth eyeglasses are proected nto the egenspace traned by eyeglassless facal mages, from whch correspondng eyeglassless facal mages are reconstructed. he representatonal capablty of PCA depends on the tranng mages. Because the tranng mages have no eyeglasses, the reconstructed mages don t have eyeglasses no matter the nput facal mages have eyeglasses or not. herefore, reconstructon errors caused by eyeglasses are spread out over the entre reconstructed mage. hs results n some degradaton of qualty and some traces of the eyeglasses frame remaned. Smple PCA method has some lmtatons n obtanng natural lookng glassless facal mages. Cheng Du and Guangda Su removed eyeglasses from facal mage usng PCA reconstructon, recursve error compensaton and adaptve threshold based method [4]. egons, whch are occluded by eyeglasses, are frstly detected by adaptve bnarzaton approach. hen natural lookng eyeglassless facal mage s obtaned by recursve error compensaton of PCA reconstructon. he reconstructed mages have nether trace of eyeglasses, nor the reflecton and shade caused by the eyeglasses. A PCA reconstructon, recursve error compensaton and sngle threshold based method s proposed n ths paper. he rest part of ths paper s arranged as follows. PCA and SVD algorthm are ntroduced n secton 2. Smple PCA reconstructon based gat segmentaton method and PCA reconstructon, recursve error compensaton and sngle threshold based gat segmentaton method wll be dscussed n secton 3. Experments and results are n secton 4. Secton 5 s conclusons.. PCA Algorthm and SVD Algorthm Proposed method s derved from PCA algorthm and SVD algorthm. PCA algorthm and SVD algorthm are descrbed as follows. A. SVD Algorthm SVD algorthm s gven frstly. Let A be a M N real matrx of a face mage, M > N, and rank A =, the sngular value decomposton ( SVD ) of A s, ( ) K where, Σ = dag( λ0, λ,..., λk,0,...,0), U = [ u0, u,..., uk, uk, uk +,..., um ], V = [ v0, v,..., v K, v K, v K +,..., v N ], Σ s a M N matrx, U s a M M matrx, V s a N N matrx, λ, = 0,,..., K are egenvalues of AA as well as λ, = 0,,..., K are sngular values of A, u, = 0,,..., M are column egenvectors of AA, v, = 0,,..., N are column egenvectors of A A. 2 A = UΣ V. () A A, and λ 0 > λ >... > λk, 37

Honggu L, Cupng Sh & Xngguo L PCA Based Gat Segmentaton he relatonshp of U and V s 2 U = AVΣ. (2) B. PCA Algorthm PCA ( prncpal component analyss ) algorthm s dscussed as follows. Let, = 0,,..., M be N N face mages for tranng, and t can be represented as N 2 vectors Γ, = 0,,..., M. he dfference vector Φ s defned as Φ = Γ Ψ, where M Ψ = Γ. M Ψ s the average vector of where A [ Φ Φ Φ ] = 0,,..., M dffcult, so egenvectors v of SVD, AA and A A u = Av. λ mage Γ. he 2 2 N N covarance matrx C s defned as, M C = ΦΦ M = 0 = AA M. Drectly computng egenvectors u of M M matrx A A s computed ( = 0. (3) 2 2 N N matrx AA s 2 M << N ). Accordng to have same egenvalue λ, and the relatonshp of u and N N can be represented as vector N 2 v s Γ, and related dfference vector s Φ = Γ Ψ. he feature of N N s F = U Φ. he reconstructed Φˆ s Φ ˆ = UF. he reconstructed mage vector Γˆ s Γ ˆ = Φ ˆ + Ψ. (4). Gat Segmentaton Method Smple PCA reconstructon based method, and recursve error compensaton and sngle threshold based method, are depcted as follows. A. Smple PCA econstructon Based Method Frstly background mages are used to tran PCA algorthm [3]. Secondly foreground mage s proected to the egenspace traned by background mages. hen reconstructed mage of foreground mage can be computed from egenspace usng PCA reconstructon algorthm. Because tranng mages have no person, the reconstructed mage has no person yet. Fnally, reconstructed mage s subtracted from orgnal foreground mage, and segmented bnary mage can be ganed by threshold, where H s threshold operator. ( ) = H. (5) 38

nternatonal Journal of nformaton echnology Vol. 2 No. 5 2006 B. ecursve Error Compensaton and Sngle hreshold Based Method PCA reconstructon, recursve error compensaton and sngle threshold based gat segmentaton method s gven as follows. t s followed by a postprocessng, n order to obtan good gat segmentaton results. he qualty of from smple PCA reconstructon based method s not very good. ecursve error compensaton and sngle threshold based method should be used [4]. he man dfference between proposed method and method n [4] s, usng sngle threshold to take the place of adaptve threshold. he proposed method s depcted as follows. where, s the number of teraton, s orgnal foreground mage, C s error compensaton mage, s PCA reconstructed mage, ( W ), =,2 J. (6) C = W +,..., ( ) PCA _ EC, = =. (7) C PCA _ EC( ), = 2,3,..., J ( m, n) ( m, n), = W ( m, n) =. (8) 0, = 0 ( ) = H. (9) s the segmented bnary mage, PCA _ EC s PCA reconstructon algorthm, W s weght matrx, H s sngle threshold operator, whch s take the place of adaptve threshold. C C f < ε, where ε s a small threshold, the algorthm s termnated. J s the ultmate segmented slhouette mage. Dstance between PCA reconstructed mage and orgnal mage s defned as ( ) = SUM ( ), =,2 J D,...,. (0) Because there are small regons and holes n J, a postprocessng s needed. Frstly a morphologcal close operator s used to merge small and near regons n J. hen bnary mage are labeled and small regons are removed. Fnally a hole-fllng operator s used to fll the hole n bnary mage. V. Experments and esults Gat mages come from CMU MB database [5]. hs database has 25 persons, sx dfferent vew angles, and four types of walk: slow walk, fast walk, slow nclne walk and slow walk holdng a ball. 39

Honggu L, Cupng Sh & Xngguo L PCA Based Gat Segmentaton A. PCA ranng wth Smlar Background mages 8 smlar background mages of vew angle are used for PCA tranng. Fg. s the result of proposed method. Fg. (a) s the background mage. Fg. (b) s the foreground mage. Fg. (c) s J. Fg. (d) s the result mage of morphologcal close operator. Fg. (e) s the result mage of removng small regons. Fg. (f) s the result mage of hole fllng. Fg. (f) shows that proposed method has perfect ablty of gat segmentaton. Fg. (g) s the result mage of background subtracton based method. Comparng Fg. (g) and Fg. (f), t shows proposed method s better than background subtracton based method. Fg. (h) s the result mage of Gaussan dervatve flter based method. Comparng Fg. (h) and Fg. (f), t shows proposed method s as good as Gaussan dervatve flter based method. Fg. () s the result mage of PCA reconstructon, recursve error compensaton and adaptve threshold based method. Comparng Fg. () and Fg. (f), t shows proposed method has the same ablty as PCA reconstructon, recursve error compensaton and adaptve threshold based method. Because proposed method uses sngle threshold and need not compute adaptve threshold, whose computaton load s large, t s faster n mplementaton than adaptve threshold based method. Fg. 2 and Fg. 3 further study the ablty of sngle threshold based method and adaptve threshold base method. Fg. 2(a)~2(d) are ~ 4 of sngle threshold based method. Fg. 2(e)~2(h) are ~ 4 of adaptve threshold based method. t shows the bggest dfference s n the frst teraton. hs s because, sngle threshold based method uses a unquely small threshold and adaptve threshold based method uses varant threshold, whch s n drect proporton to the mean of. Fg. 3 s the relatonshp curve of dstance D ( ) and the number of teraton. he sold lne s the curve of sngle threshold based method, and the dashed s the curve of adaptve threshold based method. t shows the bggest dfference s n second teraton. hs because s same n both methods of the frst teraton. Fg. 2 and Fg. 3 show sngle threshold based method has the same ablty for gat segmentaton as adaptve threshold based method. Fg. 3 also shows proposed method wll termnate at the ffth teraton. So proposed method converges rapdly. hs s very mportant for realtme gat recognton system. Fg. 4 has more examples of proposed method. B. PCA ranng wth Four Knds of Background mages 25 background mages of vew angle are used for PCA tranng. hese back-ground mages can be dvded nto four knds. Fg. 5 shows four knds of background and ts gat segmentaton examples. Fg. 5 shows that proposed method can be used for varant background. hs s very mportant for practcal gat recognton system. V. Concluson A PCA based gat segmentaton method s proposed. Frstly background mages are used for PCA tranng. hen PCA reconstructon, recursve error compensaton and sngle threshold based method s brought forward for gat segmentaton. Fnally a postprocessng s adopted for obtanng well segmented mage. Sngle threshold based method has the same ablty as classcal adaptve threshold 40

nternatonal Journal of nformaton echnology Vol. 2 No. 5 2006 based method, and the former s faster n mplementaton than the later, because sngle threshold based method uses a unquely small threshold and adaptve threshold based method uses varant threshold. Proposed method s better than classcal background subtracton based method, and can be compared wth Gaussan dervatve flter based method. Proposed method converges rapdly and can be used for varant background. he man drawback of proposed method s that shade removng s not ncluded. n future work shade removng wll be studed. (a) (b) (c) (d) (e) (f) (g) (h) () Fg.. (a) Background mage, (b) foreground mage, (c) J, (d) result mage of morphologcal close operator, (e) result mage of removng small regons, (f) result mage of hole fllng operator, (g) result mage of background subtracton based method, (h) result mage of Gaussan dervatve flter based method, () result mage of PCA reconstructon, recursve error compensaton and adaptve threshold based method. 4

Honggu L, Cupng Sh & Xngguo L PCA Based Gat Segmentaton (a) (b) (c) (d) Fg. 2. (a) sngle threshold, (e) (e) (f) (g) (h) of sngle threshold, (b) 2 of sngle threshold, (c) of adaptve threshold, (f) threshold, (h) 3 of sngle threshold, (d) 2 of adaptve threshold, (g) 4 of adaptve threshold.. 4 of 3 of adaptve Fg. 3. he relatonshp curve of dstance and the number of teraton. Sold lne s the curve of sngle threshold, and dashed s the curve of adaptve threshold. 42

nternatonal Journal of nformaton echnology Vol. 2 No. 5 2006 Fg. 4. More examples for foreground mages and related segmented mages. 43

Honggu L, Cupng Sh & Xngguo L PCA Based Gat Segmentaton (a) (b) (c) (d) Fg. 5. Four knds of background and ts gat segmentaton examples. (a) background and ts gat segmentaton example, (b) background 2 and ts gat segmentaton example, (c) background 3 and ts gat segmentaton example, (d) background 4 and ts gat segmentaton example. 44

nternatonal Journal of nformaton echnology Vol. 2 No. 5 2006 eferences [] obert. Collns, alph Gross and Janbo Sh, Slhouette-based human dentfcaton from body shape and gat, Proc. of nt. Conf. n Automatc Face and Gesture ecognton, 2002, pp.366-37. [2] Honggu L, Xngguo L, LLE based gat analyss and recognton, Stan Z. L (eds.), Advances n Bometrc Person Authentcaton, Lecture Notes n Computer Scence, Vol. 3338. Sprnger-Verlag, Berln Hedelberg New York, 2004, pp.67-679. [3] Sato, Y. Kenmoch, Y. and Kotan, K., Estmaton of eyeglassless facal mages usng prncpal component analyss, Proc. of nt. Conf. on mage Processng, Vol.4, 999, pp.97-20. [4] Cheng Du, Guangda Su, Eyeglasses removal from facal mages, Manuscrpt Draft (PAEC-D-04-0020.pdf), Pattern ecognton Letters. [5].Gross, J. Sh, he CMU Moton of Body (MoBo) Database, echncal eport CMU- --0-8, obotcs nsttute, Carnege Mellon Unversty, 200. Honggu L born n 97, receved B.S. degree of appled electroncs from physcs department of Yangzhou Unversty, Chna, n 994, and Ph.D. degree of mechancal-electronc engneerng from electronc engneerng department of Nanng Unversty of Scence & echnology, Chna, n 999. He was a tutor of Yangzhou Unversty n 994. He read for PhD degree n Nanng Unversty of scence and technology from 995 to 999. He s an assocate professor n Yangzhou Unversty snce 2000. Hs research area ncludes computer vson, pattern recognton and machne learnng. Cupng Sh born n 98, receved B.S. degree from Daqng Petroleum Unversty, Chna, n 2004, and M.S. degree from Yangzhou Unversty, Chna, n 2007. She s a tutor n Qqhaer Unversty n Chna. Her research area ncludes computer vson and pattern recognton. Xngguo L born n 940, receved B.S. degree from Chengdu Unversty of Electronc Scence & echnology n Chna. He s a professor and a doctoral supervsor n Nanng Unversty of Scence & echnology. Hs research area s MMW sgnal processng. 45