Linear Regression for Face Recognition Imran Naseem, Roberto Togneri, Senior Member, IEEE, and Mohammed Bennamoun ‘AbsacIn his pe we precanta.nve arose fe Hein | Tomulng te ptm txognn rote nto nas ran. Us & undoes sonent tot ten om a gle ses ese ton a nr ‘Nbspao, we dro a rar ros repesoing 3 prob nage a ner fertrtn ef laespeci ares. The ines pr sad use ‘nr ecnston en Tre oped Urea PerecsonGsaeson (LAC) apts al me cap of neare nsupae castes The ‘ort eonavey erated on overland clcbasos ude arunber tf erorpary eruaton pc repr n he ae rcegon Waal fern ay uth since srt dey re he cy tne proposes eproach Forte presen of catgun ccs, We ropve@ oct LAC epprsch odor ano Dstanotase Evers Pscn (CeF) agen. re popes metason sere: th best rere ove Index Terma-Foonresapon, ner efeson, see! step + 1 IntRopuction ace rcogiton systems ae knoven to be ei dependent on mano arming methods A grayscale face mage ofan oder {Ts bean be represnte a an aditensional vector in hoi luge ace. However, any aterpt at rcogeton in auch a Sigh dlmensonl space vunerabe ta wore fess ten ered tors the ar of dimensionality. Tenor the fate exteacon Stage, tages ae transformed 4 lw-diensonal vectors he otapce The msi Spies Bnd such a ase fncion or hs transformation which cou distinguishably represent faces the {sot space. A numberof approaches have ban reported in he Herat, sac a8 Pringplt Component Anages FCA) IL. 2 Linear Discriminant Analysis (LDA) [and Independent Con ponent Analysis (CA) (4 [5] Primaniy, these approwches are Es im two eaeporie ie, reontmacite sad dimiaise rethods. Reconstractiveappreches (sich as PCA and ICA) are ‘ported to be runt forthe problem of contaminated piel (6, ‘wheres dseiminatve approaches (eich se LDA) are koe 10 isk etter resus In cian conditions [7] Apart from these traditional approaches tas been shen recently tha inothodox features sic 9 downsampled images and random projections, Com serve equal wel In fot the choie of he festa space may to Tonger beso cial i. What realy mates the dlnensiow- ality of feature space andthe design ofthe classifier inthe mscach, we propose aay spe but iin Uear regression-bosedclasieation (URC) forthe prablen of fe Nico and Rael ane wit he Shot of Elst, Eston nd Gonputrgineng. MOIS, The User of Westone Austra, SF Shing geny, Cray Nesters Aastra C09, Aatrlia ma: rani, ebro + Mi Bown sh the Schl of Computer Since ond Sfore Engoneoring, The Unzerity of Wester Australia, 35 Sling igh, Cnty, stor Aust 609, Atal. Emil ottoman .daa, Marusopt recived 10 Oct. 2008; reid 13 Jon, 2009; accpad 1 July DOOR puso July 200, Recto for acta by 8. Li arian on absining rin of thi artic, lame sed emai So: {povidsmputer or, and roe IEEECS Lag Nuler ‘Trani 2008 1.0086 Distal Obert esr no, 1011087 PARL.2000.28, IEE TRANSACTIONS ON PATTERN ANALYSIS ANO MACHINE RETELGENCE, VOL. 2. NO. 11, novensen 2010 ‘dentification. Samples from a specific object class are known to lie on a linear subspace [3], [9]. We use this concept to develop assspecfic models of the registered users simply using. the Sdowasampled galery images, thereby defining the task of face recognition asa problem of linear segresion. Least-squares fstimation is used to estimate the vectors of parameters fr 8 fiven probe agains al lass models Finally, the decision rules in favor ofthe class with the most precise estimation. The proposed asi can be categorized as a Nearest Subspace (NS) approach ‘An important relevant work is presented in [8], where down sampled tages from all classes ate wed to develop dictionary Satie orn the in sean ch probe ge ee resulting in an il-conditioned inverse problem, With the Tatest research in compressive sensing and sparse representation, parity ofthe vector of coefficients Is hamossed to slve th fonaitioned problem using the {norm ainimization, tn (10, the oneept of Locally Lier Regression (LLR) is introduced specially to tackle the problem of pose. The main trust of the research isto indiate an epproximatelineae mapping between a nonrontl face mage an its ronal counterpart the estimation of linear mapping fs further formulated a= a prediction problem with 9 repression: based solution. For the ease of severe pose variation, the ronfontsl image is sampled & obtain many overlapped aca Segments, Linear Tegression is applied to cach small path to predict the coerespoling vital Frontal pate; the LLR approach hha shown some good results inthe presence of coarse alignment. In [lt], a two-step approach has been adopted, fusing the concept ‘of wavelet decomposition and discriminant analysis to design & Sophisticated feature extraction stage. These discriminant features ft used to develop feature planes (Gor Nearest Festure Plane [NIP classifier) ana feature spaces (for Nearest eatie Space—NFS sien). The query nage prope ote Une sulpaves at Une ‘eckson cules in favor of the subspace with the einitum distance However, the proposed LRC approach, forthe fst tm simply uses the downsampled images in combiration with the linear ‘egression clasfication to sehieve superior results compared the benchmark techniques. Further, forthe problem of severe contiguous occlusion, odie representation of image is expected to solve the problem, [12] Based on this concept, ee propose an elicient Maar LRC ‘Apprch. The proposed approach segments 2 given cluded mage and reaches individual decisions for each block. These intermediate decisions are combined sing a novel Distances Eoifene: Fusion (DEF) algorithm to reach the final decision. The proposed DEF algorithm uses the distance metrics of the termestiate decisions to decide about the “goodness” of partion. There are two major advantages of Using the DEF preach. First, the nonface partitions are rejected dyamicaly: therefore, they do not take part in the final decision making Second, the overall recognition performances better than the best ‘nvidia result ofthe combining partitions due tothe efficient ‘Ssision fusion ofthe face segments Algorithm: Linear Regression Classification (LC) Inputs: Cass models X, © RF 1,2,.-..Wand a test image vector ye R™: Output: Class of y 1. ©" is evaluated against each class model, B= EXIT, f= 1B 2. 1s computed for each 3,9, ey {3 Distance calculation betwen original and predicted response variables s(y) = ly ~Sil @= 12-3 4, Decision is made in favor ofthe class withthe im distance (y) ‘The rest of the paper is organized as follows: In Section 2, the proposed LRC and Movtlar LRC algorithms are described This isIEEE TRANGACTIONG ON PATTERN ANALYSIS AND MACHINE INTELUGENCE, VOL 82, NO. 11, followed by extensive experiments using standard databases tunder a variety of evaluation protocols in Section 3. The paper coneles in Seton A. 2. LINEAR REGRESSION FOR FACE RECOGNITON 2.41 Linear Regression Classification Algorithm Let there be 1Y numberof distinguished classes with » number of leaning images from the ith cass, = 1,2... N. Each gray-scale training image $8 of an order axb and i represented as a 22 and m = 1.2...he Each gallery image dowmsampled to an onder «x4 and traneformed, 9 vector Aug column concatenation ssch that Se Re" — 6) RO, where q= cl bean unlabeled test image and our problem is to classify vas ome of the classes FSi itie N, We tnsformn and normalize the gray-scale image 5 to an image vector y CHU" as discussed forthe gallery. It belongs to the sth clas, it should be represented as a Tineat combination ofthe training, images from the same cles (ying the same subspace), Le, Boel e where J, € "is the vector of parameters, Given that g > ps the System of equations in 2) Is well condoned and 9 can be ‘stimated using least squares estimation [13] [8] 115} 8. = (IX) IXY, @ ‘The estimated vector of parameters, 3, along with the predictors X are used to predict the response vector for each Sass HAM, 11D Y= XIX) Ry “ here the predicted vector Ri the projection of y onto the 4h subspace. In other words, §, 1 the closest vector, inthe Sth subspace, tothe observation vector y in the euclidean sense iin fs catea har motte since Ie maps ¥ Into ve now Calculate the dstance measure between the prediied response Nestor fii 12.1 and the original response vector, AQ) = By -Filey EAB 6 ann rule in favor of the class wth mini im distance, ie, Bway), F129 co 22 Modular Approach for the LAC Algorithm “The problem of identifying parally occluded faces could be efficiently dealt with using the modular representation approach [12], Contiguous occasion con safely be asstme local innate 2 sense that it corrupts only a portion of conterminous pixels of the image, the amount of contamination being uaknowh. tn the odor approach, see tilize the neighborhood propesty of the NOVEMBER 2010 207 contaminated pisels by dividing the face image into a number of sbimages. Each subimage is nove processed individually and final decision is made by fusing information from all of the subimages. A commonly reported technique for decision fusion is ‘majority voting [12] However, a major pital with majority voting Js that teats noisy and clean partitions equally. For instance if thee out of four partitions of an image are conrupted, majority ‘Voting is kely to Be erroneous no matter how significant the cleat partition may be inthe context of facial feabues, The tsk Becomes {even more complicated by the fact thatthe distribution of ccusion ‘vera face image s never known a prio and therefore, alongwith face and nonface subimages we are ikely #0 have face portions ‘corrupted with occlusion. Some sophisticated approaches have been developed Co fiter out the potentally contaminated image patel (forexsmple, [17]. In this ection, we make seat the specie ature of distance classification to develop airy simple but ficient fusion strategy which implicitly deemphasies conrupted Subimages, significantly proving the overall assfeation aceu- acy. Wepropece using the distance metic as evidence of our bit the "goodness" of intermediate decisions taken on the su fmages the approach i called “Distance-based Evidence Fusion “To formulate the concep, lt us suppose that each taining Image is segmented in MF partitions and each pattoned image i designated ast. = 12.---.M. The nth partition of ap taining lmages from the sth clas is subsampled and transformed to vectors as discussed in Section 2, o develop a casespeciic and partition specific subspace U." oi = (8) Fende — ) Ech class is aow represented by M subspaces and aliogsther wwe have Af 4 subspace models Now a given probe image is partitioned into AY segments accordingly. Each partition is fransformed to an image vector y= 1.2... Given that Js the tre class forthe given probe image. is expected oe on the nth subspace of the ith class U1" and should satis 6 ‘The vector of parameters and the response vectors are estimated as discussed inthis sections ip = ((up)y'uS sh) occlusion, lamination, and severe gestures, a copped and aligned face Is senerally not avallsble, Therefore, a consistent reliable perfor. france with unprocessed. standard databases makes the LRC slgorthm appropriate for real scenarios. For the case of varying bestures, the URC approach has been show to cope wel with the mast severe screaming expression where the stateot-theatt techniques lag behind, Indicating consistency for mild and severe ‘hung. For the problem of Tage recognition in the presence of ‘isgsive the Modular LRC algorithm using an efficient evidential fusion strategy yckss the best reported rests in the iterate In the paradigm of view-based face recognition, the choce of features tara given case study has been a debatable top. eset recarch has, however, shown the competency of unorthodox features such as downcampled images and random projections, indicating a divergence from the conventional ideology [B). The propased LRC approach in fact conforms to this emerging belie. e has been shown that with an appropriate choice of classifier the dlownsampled images can produce good results compared to the teaditional approaches. The simple architecture ofthe proposed approach makes it computationally efficent, therefore suggesting a Strong candidacy for elise video-based face recognition applca- fons. Other fate directions include the robustness sss relate to lumination, random piel corruption, and pose variations. ACKNOWLEDGMENTS “This research is partly funded by the Australian Research Council (ARC) grant No, DPv61225, IEE TRANSACTIONS ON PATTERN ANALYSIS ANO MACHINE INTELLIGENCE, VOL. $2. NO. 1h, novensen 2010 REFERENCES a a » 0 by eu ey ey be bs be bn bw by bo, bn Tr inl opt nd Se RCM fete FE + cme FIN. Belhumeur, .P. Hespanha, and DJ. Kriegman, “Eigeniaces vs eae See ae me : PL nape es ini Nine” Sd SRE ata Sot tn a foie fe : Seer a et as acre ee ore ge en, ey FRB sme 1 ras 88S Ye “en Rae ee a ee 8 a te teeing ce meme Cee ee Et Bsns nt SES ar at tate eee es Re Sane Mea meres TeChien and’ C, Wu, “Discriminant Wavelethices and. Nearest Feoture npaces oe Fae Recognition” EEE Coy Compr Vo rar and). Fina, The ll Sai Ltr ‘at ing acre ce Spiga TRG. Ste an SY Sheath Rohal Etna ond Tig. Wy SEaCGE To Fat inn p/w anon Fg uo aE sel eee at oars hie ere ears eee RS EOE te ocr ee ee cmesaemas Boner GP eo aoe Briar aia ai dame BEE OME Eh tps rsp Feo ar tip em meas See ee Eee crm feta EEO ra od Yon “opr § RE OSS be ce ct es reat Te en tt tpt FOLSTSPT ee tment nigt ang Mandal and A. Kot, “Eger Ragalazton and rt i pn EE Te Pt A a ae JEN: Plies. AN. Venesinapouls: and SZ. U, “Ensemble est Em rig it tg he Rago he ted Go Cael ten Pes 6 Ne En cal Runes Save the Day,” Prec: th At, Cg Sar Sx Co oe [iter Mt Ha RP Dl, an Mas, “On Combining Css {eer Pon on ho tgs a 0p