Вы находитесь на странице: 1из 15

Gagandeep Jaswal, Harjinder Singh

Score calibration in face acknowledgement


1

Gagandeep Jaswal, 2Harjinder Singh


1

1,2

PG student, 2Assistant Professor

Electronics and Communication Engineering Department, Punjabi University, Patiala


1

gjaswal46@gmail.com, 2 hrjindr@gmail.com

Abstract:
An appraisal of the confirmation and adjustment execution of a face acknowledgment
frameworks are needy upon inter session variability (ISV) demonstrating is displayed. As an
option to adjustment through direct change of scores, downright alignment is acquainted as an
approach to contain extra data about pictures for adjustment. The expense of probability
proportion, which is a surely understood border in the speaker acknowledgment field, is utilized
as an adjustment execution parameter. The outcomes accomplished from the testing web camera
face databases indicate that directly aligned face acknowledgment scores are less vague in their
probability proportion understanding than unadjusted scores. Furthermore, the clear cut
alignment tests exhibit that adjustment can be used not just to improve the probability proportion
understanding of scores, additionally to build the confirmation execution of the face
acknowledgment frameworks.

1 Introduction
Biometric acknowledgment can be characterized as mechanized techniques to precisely perceive
people dependant on particular physiological and/or behavioral attributes. As advanced society
progressively relies on upon frameworks to give secure situations and administrations to
individuals, it gets to be central to guarantee the security of a framework through intends to
recognize the legitimacy of an individual asking for access to it. This is typically settled by
separating some type of data from the person to check against data held by the framework about
substantial users[1].
Face is a complex multidimensional structure and requires great figuring procedures for
acknowledgment. The face is our essential region of consideration in social life assuming a key
part in character of person. We can perceive an enormous number of confronts scholarly all
through our lifespan and order that appearances initially even after years. There can be varieties
in countenances because of maturing of indiviual and diversions like whiskers, glasses or variety
of hairdos. Face acknowledgment is a key a portion of biometrics. In biometrics essential
attributes of person is coordinated to the current information and subject to aftereffect of
coordinating recognizable proof of an individual is portrayed. Facial components are determined
and actualized through calculations which are compelling and some progressions are done to
enhance the present calculation models[2].

Research Cell : An International Journal of Engineering Sciences, Issue June 2016


ISSN: 2229-6913 (Print), ISSN: 2320-0332 (Online) -, Web Presence: http://ijoes.vidyapublications.com

2016 Vidya Publications. Authors are responsible for any plagiarism issues.

Gagandeep Jaswal, Harjinder Singh


Programmed face acknowledgment in biometrics has applications that can be apportioned into
three fundamental gatherings: business, legislative and scientific applications. A case of business
face acknowledgment is the client validation process which is performed by cell phones and PCs.
In legislative applications, programmed face acknowledgment frameworks may be utilized as a
part of biometric international ID check or fringe control exercises. For both business and
government-related applications, the subjects by and large coordinate with the framework. In
criminological applications, advanced picture evidence can be recuperated from observation
operations that regularly include closed circuit TV (CCTV)cameras. In spite of business
applications, subjects in measurable face acknowledgment normally don't collaborate with the
framework while such evidence is caught. Or maybe, they are either unacquainted of the
framework or are purposely uncooperative, for instance by stowing away or disguising
themselves with caps, shades or veils. Now and again, wrongdoing scenes are seen by onlookers,
who may later be called upon to perceive suspects. PCs that identify and perceive appearances
could be connected to a wide assortment of commonsense applications including criminal
recognizable proof, security frameworks, character confirmation and so on. Face location and
acknowledgment is utilized as a part of numerous spots these days, in sites facilitating pictures
and person to person communication locales. Face acknowledgment and location can be
accomplished utilizing advancements identified with software engineering.
At the point when a wrongdoing scene is observed by a CCTV camera, the caught pictures are
ordinarily contrasted with facial pictures from potential suspects of the wrongdoing by legal
specialists. On one hand, individuals have a tendency to perform superior to a programmed based
framework while perceiving well known countenances, however in actuality, it has been
demonstrated that programmed face acknowledgment frameworks surpass human execution
when looking at new faces in troublesome light conditions. Subsequently, programmed
frameworks for legal face acknowledgment ought to be utilized to help scientific specialists.
A few difficulties show up when pictures caught from cell phones or CCTV cameras are utilized
for face acknowledgment. The worries that impact acknowledgment execution incorporate low
determination in the caught pictures, the postures of subject, incomplete impediments of the
subject's face and variable enlightenment [10]. To address these worries, different systems have
been produced, including picture preprocessing to lessen enlightenment impacts [11], highlight
standardization [12] and inter session variability (ISV) displaying. Score standardization
systems, for example, zero and test score standardization (ZT-standard), have additionally been
appeared to enhance confirmation execution [15]. By and large, programmed face
acknowledgment frameworks compute a similitude score between a given test and a model from
a known character. For confirmation or check uses of programmed face acknowledgment, the
score is contrasted with an edge to sort the trial as either a customer or an impostor. For legal
applications, translating the scores are more entangled in light of the fact that legitimate choices
can't be made specifically by the programmed face correlation framework yet rather ought to be
made by a judge or jury in court, in the wake of coordinating data including a few bits of
confirmation. On the off chance that the result of the face examination ought to be displayed in
court, a good approach to express it as a likelihood ratio (LR), i.e. a relative likelihood of the
Research Cell : An International Journal of Engineering Sciences, Issue June 2016
ISSN: 2229-6913 (Print), ISSN: 2320-0332 (Online) -, Web Presence: http://ijoes.vidyapublications.com

2016 Vidya Publications. Authors are responsible for any plagiarism issues.

Gagandeep Jaswal, Harjinder Singh


accompanying two contending speculations [16]: (a) test picture (e.g. from CCTV) originated
from the suspect (prosecution hypothesis H p ) or (b) picture taken from another person (defense
hypothesis H D ). It is accounted for that uncalibrated LRs can be ambiguous in their translation
for legal sciences application [17, 18]. The methodology that can be taken to handle this worry is
adjustment [17, 19], a procedure to change over crude scores processed via programmed face
acknowledgment frameworks into aligned LR scores. In the stadium of speaker
acknowledgment, alignment is utilized as a part of the speaker recognition evaluation (SRE) i.e.
consistently held by the American National Institute for Standards and Technology (NIST) to
affirm advances of the innovation for speaker recognition frameworks and figuring its execution
[20]. In other criminological biometric fields like fingerprint recognition and signature
acknowledgment, alignment is utilized to change over raw scores from biometric frameworks to
LRs [2123].There is just constrained writing accessible that talks about the adjustment for
scores delivered via programmed face acknowledgment frameworks [21, 24]. In the past takes a
shot at face acknowledgment, a session variability decrease strategy through ISV demonstrating
[14] was proposed, and a score standardization procedure by means of ZT-standard usage [15] to
the face acknowledgment framework. These works concentrate on enhancing the framework
check execution. Not at all like the past works, in this study, we concentrate on the alignment
execution and presenting adjustment methods for face acknowledgment frameworks.
Trials are completed by utilizing a face acknowledgment framework in light of ISV
demonstrating, with and without ZT-standard, and web camera facial picture database. We
survey both the confirmation and alignment exhibitions, previously, then after the fact the direct
adjustment is being connected to the scores. At that point we present clear cut adjustment as an
approach to use extra data about facial pictures for alignment. In absolute adjustment, we have
demonstrated that alignment, as well as check execution can be made strides. In this discourse,
we inspect the impacts of adjustment on score circulations made by the face acknowledgment
framework. All tests solely depend on open source programming and are, therewith, altogether
reproducible.
The remaining paper is sorted out as takes after: the face acknowledgment framework is clarified
in more detail in Segment 2, trailed by presentation of LR adjustment in Segment 3 and
measurements used to survey the framework execution in Segment 4.Finally, the outcomes are
being talked about in Segment 5.

2 Face Acknowledgment
Programmed face acknowledgment is the assignment of perceiving individuals from their facial
pictures. There are different difficulties that impact programmed face acknowledgment
frameworks, similar to outward appearances, dissimilar to brightening conditions, halfway
impediments of the face, non-frontal stance and low picture determination.
Prior to the individual appeared in a picture could be recognized, the face must be distinguished.
Since we need to analyze face acknowledgment, as opposed to face identification, we utilize the
Research Cell : An International Journal of Engineering Sciences, Issue June 2016
ISSN: 2229-6913 (Print), ISSN: 2320-0332 (Online) -, Web Presence: http://ijoes.vidyapublications.com

2016 Vidya Publications. Authors are responsible for any plagiarism issues.

Gagandeep Jaswal, Harjinder Singh


hand-marked eye positions that are conveyed with the databases (cf. Area 5) to geometrically
standardize the pictures. Pictures are then photograph metrically upgraded to diminish the impact
of brightening, for instance, utilizing the technique presented as a part of [11].
From these preprocessed pictures, includes that are useful for face acknowledgment are removed.
In the course of recent decades, various calculations have been created to separate different sorts
of components like eigenfaces [25] and Gabor features [28]. Likewise, the technique to
concentrate features from raw pixel values has additionally been examined [29]. By utilizing
these elements, an acknowledgment calculation is then executed, for eg.,linear discriminant
analysis[30] or support vector machines [32]. In this paper, we concentrate on a face
acknowledgment framework that is one of the best performing frameworks in [35], which relies
on upon an ISV displaying in a Gaussian mixture model (GMM) system utilizing discrete cosine
transform (DCT) square components.
To guarantee the reproducibility and equivalence of our face acknowledgment framework, we
entirely take after the assessment conventions characterized by the web camera database and
solely utilize open source programming [36, 35] to run our trials. The database conventions
characterize the setup of the face check test by apportioning the pictures into three gatherings:
preparing set, improvement set and assessment set. Firstly, facial elements are removed from all
pictures of the database. Also, the pictures from the preparation set are utilized to modify the
face acknowledgment framework to the states of the database. At that point, for every customer
in the advancement set, the elements of one or a greater amount of the customer's pictures are
utilized to select a customer model. The elements of the remaining pictures from the
improvement set are utilized to explore the framework by figuring closeness scores between the
customer models and test features. At long last, the scores from the assessment set are processed
similarly. These scores can be straightforwardly used to ascertain the acknowledgment execution
of the framework, yet they can likewise be further handled by score standardization, for instance,
ZT-standard or score alignment.
2.1 DCT square components modelling using UBM-GMM
As in [14], the components extricated from the preprocessed pictures are called DCT square
elements. After picture is deteriorated into various covering pieces, DCT elements xb are
separated from each of the squares. This extraction procedure is pictured in Fig. 1.

Research Cell : An International Journal of Engineering Sciences, Issue June 2016


ISSN: 2229-6913 (Print), ISSN: 2320-0332 (Online) -, Web Presence: http://ijoes.vidyapublications.com

2016 Vidya Publications. Authors are responsible for any plagiarism issues.

Gagandeep Jaswal, Harjinder Singh

Fig. 1 Procedure of separating DCT square components from a geometrically standardized


picture
In spite of most ways to deal with face acknowledgment, these components are not linked into a
solitary long element vector, but rather every element is taken to be an autonomous perception of
the same individual. To enlist a model of a customer, the dispersion of DCT square components
from one or more pictures from the customer is displayed by a GMM. The enrolment process
makes the customer particular GMM is two-fold. Firstly, a customer unspecific GMM the
purported universal background model (UBM) UBM models the dispersion of elements from an
autonomous arrangement of preparing pictures that do exclude pictures from customers. Also,
the customer particular GMM c is made by adjusting the method for the UBM to the
components of the customer's enrolment features[14] while keeping the same covariance
frameworks as the UBM.
2.2 ISV demonstrating
The ISV demonstrating method was initially roused by speaker acknowledgment field [37]. This
procedure includes assessing a straight subspace in GMM super vector space to seizure the
impacts of picture varieties (e.g. enlightenment, posture, outward appearance and impediment)
and records for these varieties amid customer model enrolment.
The selected customer particular GMMs in this manner isolate a customer particular segment
from picture subordinate segments in GMM super vector space. This displaying strategy has
been appeared to expand strength against these picture subordinate varieties. For points of
interest, perusers are coordinated to [14]. Amid the organization (test) stage, the DCT features
x p = {x p ,b }bB=1 for all pieces b of a test picture are separated, and an assessment is made of how
well the test elements can be clarified by a specific customer model c . In particular, this is
accomplished by figuring the normal log-likelihood ratio (LLR) score

Research Cell : An International Journal of Engineering Sciences, Issue June 2016


ISSN: 2229-6913 (Print), ISSN: 2320-0332 (Online) -, Web Presence: http://ijoes.vidyapublications.com

2016 Vidya Publications. Authors are responsible for any plagiarism issues.

Gagandeep Jaswal, Harjinder Singh

h( x p , c ) =

1
B

log
b =1

p ( x p ,b / c )
p ( x p ,b / UBM )

(1)

This score, hence, thinks about the probability that the customer model c produced the
perceptions ( H p ) against the probability that they were created by the UBM, UBM ( H D )
2.3 ZT-score standardization
After score calculation, we utilize ZT-standardization, which was additionally received from the
speaker confirmation field [38]. ZT-standardization consolidates both customer driven Zstandardization and test driven T-standardization [39]. The objective of ZT-standardization is to
make the score free of the present customer or test. Both Z-and T-standardization change over a
crude score h to a standardized score h by subtracting a normal impostor score and isolating it
by its standard deviation :
h' =

(2)

The contrast amongst Z-and T-standardization is the manner by which impostor scores are
figured. For Z-standardization, these scores are registered between the as of now tried customer
model c and all test pictures from the companion, while for T-standardization, scores are
figured between the present test x p and all associate customer models. At last, ZTstandardization is a mix of first applying Z-standardization and after that applying Tstandardization a short time later, which was appeared to perform well for face acknowledgment
[15]. It ought to be noticed that the ZT-standardization score change evacuates any LLR
properties that the scores may have had before change.

3 Probability proportion (Likelihood ratio)alignment


Utilizing a programmed face acknowledgment framework for the measurable applications,
guarantee that scores are yield as LRs. Regardless of the fact that face acknowledgment
calculations are intended to deliver LR scores, in light of different reasons like score
standardization or imbalanced preparing information, this objective may not be specifically
accomplished. One approach to give LR properties to face acknowledgment scores is through
adjustment, that is portrayed as demonstration of characterizing the mapping from score to LLR'
[19].
3.1 Probability proportions for legal face acknowledgment
Specialists contend that reporting a LR is a decent method for exhibiting experimental proof to
court. A LR communicates the proportion of two probabilities. For criminology, this is the

Research Cell : An International Journal of Engineering Sciences, Issue June 2016


ISSN: 2229-6913 (Print), ISSN: 2320-0332 (Online) -, Web Presence: http://ijoes.vidyapublications.com

2016 Vidya Publications. Authors are responsible for any plagiarism issues.

Gagandeep Jaswal, Harjinder Singh


proportion of the probabilities of watching the proof E in two contendinghypothesis: the
prosecution hypothesis H p and the defense hypothesis H D
h' =

P( E / H P )
(3)
P( E / H D )

For scientific face acknowledgment, these two contending speculations can be characterized as
H p : test begins from the customer c, and

H D : test begins from another person.

For numerical soundness reasons, the LR is taken in the logarithmic area, framing the LLR.
3.2 Linear score transformation
One way to deal with perform alignment in a double arrangement process like face check is by
straight adjustment [40]. This alignment handle straightly changes over crude scores delivered by
a face acknowledgment framework to adjusted LR scores. The direct change used to align crude
scores h (or h after ZT-standardization) to adjusted LLRs is
=
w0 + w1h (4)
where is the counterbalanced parameter and is the scaling parameter.
These two parameters are accomplished from the scores of the improvement set of the database
by means of logistic relapse. At long last, the prepared adjustment parameters are then connected
to scores of the assessment set. In this way, alignment exchanges information about the whole
score appropriation from the advancement set to the assessment set, with a specific end goal to
build the interpretability of the subsequent adjusted scores.
3.3 Straight out(Categorical) alignment
In this paper, we present a procedure known as all out adjustment to the face acknowledgment
field. This alignment technique is an expansion of straight adjustment portrayed over that
substitutes the single counterbalance parameter with an arrangement of N classification
dependent on balance parameters. Expecting that there are N particular test picture classifications
and that, along these lines, test highlights that created score h have a place with a specific class q,
scores change utilizing unmitigated alignment can be planned as
N

i =1

q , qi

w0,i + w1h (5)

where is the Kronecker delta

q ,q = 1, if q = qi
i

Research Cell : An International Journal of Engineering Sciences, Issue June 2016


ISSN: 2229-6913 (Print), ISSN: 2320-0332 (Online) -, Web Presence: http://ijoes.vidyapublications.com

2016 Vidya Publications. Authors are responsible for any plagiarism issues.

Gagandeep Jaswal, Harjinder Singh


0, if q qi (6)
Absolute alignment is propelled by an adjustment method in speaker acknowledgment that
utilizations side data [41]. In all out adjustment, the classifications can be in type of value
measures [42, 43] of the picture like subject posture, enlightenment condition, determination,
outward appearance, et cetera. In this paper, we utilize separation amongst camera and subject to
know the classification of test pictures.
Not at all like customary straight alignment, an advancement in confirmation execution is
conceivable through all out adjustment. This is on account of the rank request of the scores is
invariant under (4) however not under (5).

4 Execution (Performance) measures


Two sorts of measurements are utilized for measuring the confirmation execution of our face
acknowledgment framework. These measurements are check taken a toll (Cver ) and likelihood of
false dismissal ( Pfr ) , both of which measures execution at various areas in the ROC bends, and
additionally the expense of LLR (Cllr ) , which assesses the entire ROC bend. In this area, we are
presenting these measures in more detail. For all measurements, lower values demonstrates better
framework execution.
4.1 Check cost
The check expense is parallel order framework execution measure, which is characterized as

Cver ( ) = Pcli CFR FRR( ) + (1 Pcli ) CFA FAR ( ) (7)


where Pcli is the earlier likelihood that test picture is of the customer, CFR and CFA are the
weighted expense of false reject and false caution errors, separately, and is the choice limit of
framework. This metric is like detection cost (Cdet ) in the speaker acknowledgment field [44]. It
quantifies the confirmation cost at an unmistakable working purpose of the DET-bend [45] or at
certain false rejection rate (FRR) or false acknowledgment rate (FAR) point.
On the off chance that earlier likelihood CFR = 0.5 and same weighting cost for and are utilized
( CFR = CFA = 1), (7) gets to be

Cv e r ( ) =

FRR ( ) + FAR ( )
(8)
2

This capacity is like the half total error rate (HTER), that is a surely understood assessment
measure typically utilized as a part of face acknowledgment [15, 46]. In our analyses, we utilize
two distinctive approaches to characterize a limit . Initially, the ideal edge * is ascertained in
view of the improvement and assessment set autonomously, by minimizing
Research Cell : An International Journal of Engineering Sciences, Issue June 2016
ISSN: 2229-6913 (Print), ISSN: 2320-0332 (Online) -, Web Presence: http://ijoes.vidyapublications.com

2016 Vidya Publications. Authors are responsible for any plagiarism issues.

Gagandeep Jaswal, Harjinder Singh

* = arg min Cv e r ( ) (9)


In this paper, we express the base confirmation cost as Cver = Cv e r ( )
To give a more sensible and fair-minded assessment of the confirmation cost on the assessment
set, we additionally ascertain the ideal edge in light of the advancement set and compute the of
the assessment set at that edge. In short, we basically call this worth . Besides to the measure, we
report the FRR at the edge, where the FAR = 1% as the likelihood of false dismissal ( Pfr ) for
min

min
both improvement and assessment set. Both Cver
and Pfr are only segregation execution

measures that are coldhearted to linear adjustment.


4.2 Expense (Cost) of LLR
The last execution parameter utilized as a part of this paper is the expense of LLR (Cllr ) .
Dissimilar to Cver and Pfr , Expense of LLR (Cllr ) is an application-autonomous check measure
[47]. Ordinarily, in face and speaker confirmation frameworks, hard choices are made by setting
the limit estimations of score. The includes the idea of expected expense and delicate Bayes
choice. This parameter can be seen as a basic over all cost capacities in (7) that is parameterized
by Pcli , CFR and CFA , subsequently assessing adjustment at all limits .
The metric is an execution measure normally utilized as a part of speaker acknowledgment, for
instance, in the NIST SRE plan[20]. It can be concluded as a scalar measure that compresses the
nature of the LR scores [48]. The is planned as

=
Cllr

1
2 N cli

hi {himp }

log 2 (1 + exp(hi )) + 2 N1imp

hi {himp }

log 2 (1 + exp(h j )) (10)

Where N cli and N imp are the quantity of customer and impostor trials, separately. The Cllr worth
can be communicated as an aggregate Cllr of a base quality signified as segregation misfortune
Cllrmin , in addition to adjustment misfortune, Cmc

C=
Cllr Cllrmin (11)
mc
Segregation misfortune Cllrmin and adjustment misfortune Cmc demonstrate the check and
alignment exhibitions of a framework, separately [47]. To figure a significant estimation of Cllr ,
it is vital that the scores are interpretable as LRs and, along these lines, adjustment is required
before figuring this measure.
Table 1 Translations of qualities for framework execution and LR scores [47]
Research Cell : An International Journal of Engineering Sciences, Issue June 2016
ISSN: 2229-6913 (Print), ISSN: 2320-0332 (Online) -, Web Presence: http://ijoes.vidyapublications.com

2016 Vidya Publications. Authors are responsible for any plagiarism issues.

Gagandeep Jaswal, Harjinder Singh


\cllr\ value

System
performance Special LLR properties
interpretation
Perfect verification system
LLR = for impostors and
LLR = for clients
Well-calibrated system
< LLR < and LLRs are
well-calibrated
Reference verification system LLR = 0 for impostors and
clients
Badly calibrated system
No
LLR
interpretation
possible

0
0 < \cllr\ < 1
1
\cllr\ > 1

This Cllr can be seen as a legitimacy measure of a biometric framework, in that it demonstrates
the quality and legitimacy of the LRs delivered by the framework [49]. The translation of Cllr
qualities are displayed in Table 1. A flawless check framework has Cllr = 0, while a reference
framework has Cllr = 1. The ideal check framework each time produces LLR = for impostor
scores and LLR = for customer scores. On the other hand, the reference framework each time
produces LLR = 0, i.e., it doesn't improve any data in the legal choice procedure. At the point
when a confirmation framework has Cllr > 1, it is thought to be seriously adjusted. The scores
delivered by this framework are vague if translated as LRs. On the off chance that the adjustment
loss is expelled from the quality, we discover the segregation loss is 0 Cllrmin < 1.
A very much aligned framework has 0 Cllr < 1 and delivers all around adjusted LRs. A very
much aligned LR has an intriguing property that 'the probability proportion of the probability
proportion is the probability proportion', which is alluded to as ineptitude [49]
P(/ H )

= log P ( / H Dp ) (12)
This depicts the log probability proportion of log probability proportion is the log probability
proportion itself. One induction of (12) is that for = 0, the probabilities of both H p and H D
are equivalent.

5 Results
This fragment portrays the consequences of our face acknowledgment and score alignment tests.
The check execution of the face acknowledgment framework is seen with and without ZTstandard. A short time later, alignment is connected to both crude and ZT standardized scores.
Clear cut alignment is uncovered to be gainful for both the segregation and adjustment execution
of scores. Toward the end of this fragment, we exhibit examination of the score conveyances.
Here, as cleared from above preview, the diverse score being ascertained.
Picture

Calculated scores(cllr value)

Research Cell : An International Journal of Engineering Sciences, Issue June 2016


ISSN: 2229-6913 (Print), ISSN: 2320-0332 (Online) -, Web Presence: http://ijoes.vidyapublications.com

2016 Vidya Publications. Authors are responsible for any plagiarism issues.

10

Gagandeep Jaswal, Harjinder Singh


Picture 1
Picture 2
Picture 3
Picture 4
Picture 5

Reference Picture
0.0058158
0.0069207
0.0008016
0

References
[1] Anil K.Jain, Stan Z.Lee "Handbook Of Face Recognition " Springer Science+Business
Media, Inc, first Edition,2005, pp-3-12
[2] Peacock, C., Goode, A., Brett, A.: Automatic forensic face recognition from digital images,
Sci. Justice: J. Forensic Sci. Soc., 2004, 44, (1), pp. 29
[3] Jain, A.K., Ross, A., Prabhakar, S.: An introduction to biometric recognition, IEEE Trans.
Circuits System. Video Technol., 2004, 14, (1), pp. 420
[4] Wright, D.B., Memon, A., Skagerberg, E.M., Gabbert, F.: When eyewitnesses talk, Curr.
Dir. Psychology. Sci., 2009, 18, (3), pp. 174178
[5] Loftus, E.F., Hoffman, H.G.: Misinformation and memory: the creation of new memories,
J. Exp. Psychology. Gen., 1989, 118, (1), pp. 100
[6] Loftus, E.F., Miller, D.G., Burns, H.J.: Semantic integration of verbal information into a
visual memory, J. Exp. Psychology. Hum. Learn. Mem., 1978, 4, (1), p. 19
[7] Ellis, H.D., Shepherd, J.W., Davies, G.M.: Identifications of familiar and unfamiliar faces
from internal and external features: some implications for theories of face recognition,
Perception, 1979, 8, (4), pp. 431439
[8] Burton, A.M., Wilson, S., Cowan, M., Bruce, V.: Face recognition in poor-quality video:
evidence from security surveillance, Psychology. Sci., 1999, 10, (3), pp. 243248
[9] OToole, A.J., Phillips, P.J., Jiang, F., Ayyad, J., Penard, N., Abdi, H.: Face recognition
algorithms surpass humans matching faces over changes in illumination, IEEE Trans. Pattern
Anal. Machine Intell., 2007, 29, (9), pp. 16421646
[10] Jafri, R., Arabnia, H.R.: A survey of face recognition techniques, JIPS, 2009, 5, (2), pp.
4268
[11] Tan, X., Triggs, B.: Enhanced local texture feature sets for face recognition under difficult
lighting conditions, Analytic. Model. Faces Gestures, 2007, pp. 168182
[12] Viikki, O., Laurila, K.: Cepstral domain segmental feature vector normalization for noise
robust speech recognition, Speech Comm., 1998, 25, (1), pp. 133147
Research Cell : An International Journal of Engineering Sciences, Issue June 2016
ISSN: 2229-6913 (Print), ISSN: 2320-0332 (Online) -, Web Presence: http://ijoes.vidyapublications.com

2016 Vidya Publications. Authors are responsible for any plagiarism issues.

11

Gagandeep Jaswal, Harjinder Singh

[13] Gurjeet Singh and Er. Harjinder Singh Design A New Algorithm For Image Edge
Detection To Find Surface Defects Published in International Journal of Innovative Research
and Studies, ISSN 2319-9725, Vol. 3, No. 5, May 2014
[14] PriyaSharda, Harjinder Singh Image Segmentation Techniques: A Review International
Journal of Research in Electronics and Computer Engineering, PP 15-21, VOL. 2 No. 4, ISSN:
2348-2281, December 2014.
[15] Wallace, R., McLaren, M., McCool, C., Marcel, S.: Cross-pollination of normalization
techniques from speaker to face authentication using Gaussian mixture model, IEEE Trans. Inf.
Forensics Sec., 2012, 7, (2), pp. 553562
[16] Champod, C., Meuwly, D.: The inference of identity in forensic speaker recognition,
Speech Comm., 2000, 31, (2), pp. 193203
[17] Ramos-Castro, D., Gonzalez-Rodriguez, J., Ortega-Garcia, J.: Likelihood ratio calibration
in a transparent and testable forensic speaker recognition framework. Odyssey: The Speaker and
Language Recognition Workshop, IEEE, Int.Speech Communication Association (ISCA), 2006,
pp. 18
[18] Castro, D.R.: Forensic evaluation of evidence using automatic speaker recognition
systems. PhD Thesis, Universidad autnoma de Madrid, 2007
[19] Brmmer, N., du Preez, J.: Application-independent evaluation of speaker detection,
Computational Speech Lang., 2006, 20, (2), pp. 230275
[20] National Institute of Standards and Technology: The NIST Year 2010 Speaker Recognition
Evaluation Plan. Available at: http://www.nist.gov/itl/iad/mig/sre12.cfm
[21] Gonzalez-Rodriguez, J., Fierrez-Aguilar, J., Ramos-Castro, D., Ortega-Garcia, J.: Bayesian
analysis of fingerprint, face and signature evidences with automatic biometric systems, Forensic
Science Int., 2005, 155, (2), pp. 126140
[22] Champod, I.C., Evett, I.W., Kuchler, B.: Earmarks as evidence: a critical review, J.
Forensic Science, 2001, 46, (6), pp. 1275
[23] Champod, C., Evett, I.W.: A probabilistic approach to fingerprint evidence, J. Forensic
Identification, 2001, 51, (2), pp. 101122
[24] Poh, N., Tistarelli, M.: Customizing biometric authentication systems via discriminative
score calibration. IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), 2012, pp.
26812686

Research Cell : An International Journal of Engineering Sciences, Issue June 2016


ISSN: 2229-6913 (Print), ISSN: 2320-0332 (Online) -, Web Presence: http://ijoes.vidyapublications.com

2016 Vidya Publications. Authors are responsible for any plagiarism issues.

12

Gagandeep Jaswal, Harjinder Singh


[25] Turk, M., Pentland, A.: Eigenfaces for recognition, J. Cognition Neuroscience., 1991, 3,
(1), pp. 7186
[26] Ahonen, T., Hadid, A., Pietikainen, M.: Face recognition with local binary pattern.
European Conf. on Computer Vision, Proc. of Workshop on Dynamical Vision, 2004, pp. 469
481
[27] Krizaj, J, Struc, V, Pavesic, N: Adaptation of SIFT features for robust face recognition.
ICIAR10, 2010, pp. 394404
[28] Daugman, J.G: Uncertainty relation for resolution in space, spatial frequency and
orientation optimized by two-dimensional visual cortical filters, J. Opt. Soc. Am. A, 1985, 2,
(7), pp. 11601169
[29] Cox, D.D, Pinto, N: Beyond simple features: a large-scale feature search approach to
unconstrained face recognition, 2011
[30] Zhao, W, Krishnaswamy, A, Chellappa, R, Swets, D.L, Weng, J:Discriminant analysis of
principal components for face recognition (Springer, Berlin, 1998), pp. 7385
[31] Moghaddam, B, Wahid, W, Pentland, A: Beyond eigenfaces: probabilistic matching for
face recognition. IEEE Int. Conf. on Automatic Face and Gesture Recognition, 1998, pp. 3035
[32] Phillips, P.J.: Support vector machines applied to face recognition. Advances in Neural
Inf. Processing Systems (MIT Press, 1999), vol. 11, pp. 803809
[33] Wiskott, L, Fellous, J-M, Kruger, N., Malsburg, C.v.d: Face recognition by elastic bunch
graph matching, IEEE Trans. On Pattern Anal. Mach. Intell., 1997, 19, pp. 775779
[34] Zhang,W, Shan, S, Gao,W, Chen, X, Zhang, H: Local Gabor binary pattern histogram
sequence (LGBPHS): a novel non-statistical model for face representation and recognition.
IEEE Int. Conf. on Computer Vision, 2005, vol. 1, pp. 786791
[35] Gunther, M, Wallace, R, Marcel, S: An open source framework for standardized
comparison of face recognition algorithms, in: Fusiello, A, Murino, V, Cucchiara, R (eds.):
Computer Vision ECCV 2012 on Workshops and Demonstrations, Volume 7585 of Lecture
Notes in Computer Science, Berlin, October 2012, pp. 547556
[36] Anjos, A, El Shafey, L.,Wallace, R, Gnther, M, McCool, C, Marcel, S: Bob: a free signal
processing and machine learning toolbox for researchers. 20th ACM Conf. on Multimedia
Systems (ACMMM), Nara, Japan, October 2012
[37] Vogt, R, Sridharan, S: Explicit modelling of session variability for speaker verification,
Computional. Speech Lang., 2008, 22, (1), pp. 1738

Research Cell : An International Journal of Engineering Sciences, Issue June 2016


ISSN: 2229-6913 (Print), ISSN: 2320-0332 (Online) -, Web Presence: http://ijoes.vidyapublications.com

2016 Vidya Publications. Authors are responsible for any plagiarism issues.

13

Gagandeep Jaswal, Harjinder Singh


[38] Zheng, R., Zhang, S, Xu, B: A comparative study of feature and score normalization for
speaker verification ,Proc. 2006 Int. Conf. on Advances in Biometrics, ICB06, Berlin,
Heidelberg, 2006, pp. 531538
[39] Auckenthaler, R, Carey, M, Lloyd-Thomas, H: Score normalization for text-independent
speaker verification systems, Digital Signal Processing, 2000, 10, (1), pp. 4254
[40] Brmmer, N, Burget, L, Cernocky, J.H, et al.: Fusion of heterogeneous speaker recognition
systems in stub submission for the NIST speaker recognition evaluation 2006, IEEE Trans. On
Audio Speech Lang. Process., 2007, 15, (7), pp. 20722084
[41] Van Leeuwen, D.A: The TNO SRE-2008 speaker recognition system. Proceedings of
NIST Speaker Recognition Evaluation Workshop at Montreal, 2009
[42] Garcia-Romero, D, Fierrez-Aguilar, J, Gonzalez-Rodriguez, J, Ortega-Garcia, J: On the use
of quality measures for the text-independent speaker recognition. Odyssey: The Speaker and
Language Recognition Workshop at International Speech Communication Association (ISCA),
2004
[43] Garcia-Romero, D, Fierrez-Aguilar, J, Gonzalez-Rodriguez, J, Ortega-Garcia, J: Using
quality measures for the multilevel speaker recognition, Computational Speech Lang., 2006, 20,
(2), pp. 192209
[44] Doddington, G.R, Przybocki, M.A, Martin, A.F, Reynolds, D.A: The NIST speaker
recognition evaluation overview, methodology, systems, results, perspective, Speech Comm.,
2000, 31, (2), pp. 225254
[45] Martin, A, Doddington, G, Kamm, T, Ordowski, M, Przybocki, M: The DET curve in
assessment of detection task performance, Technical Report, DTIC Document, 1997
[46] Gnther, M, Costa-Pazo, A, Ding, C, et al.: The 2013 face recognition evaluation in mobile
environment. The Sixth IAPR Int. Conf. on Biometrics, 2013
[47] Van Leeuwen, D.A., Brmmer, N.: An introduction to application-independent evaluation
of the speaker recognition systems. Speaker classification I (Springer, 2007), pp. 330353
[48] Brmmer, N, de Villiers, E: The Bosaris toolkit: theory, algorithms and code for surviving
the new DCF, arXiv preprint arXiv:1304.2865, 2013
[49] Morrison, G.S: Measuring the validity and reliability of forensic likelihood - ratio systems,
Sci. Justice, 2011, 51, (3), pp. 9198

Research Cell : An International Journal of Engineering Sciences, Issue June 2016


ISSN: 2229-6913 (Print), ISSN: 2320-0332 (Online) -, Web Presence: http://ijoes.vidyapublications.com

2016 Vidya Publications. Authors are responsible for any plagiarism issues.

14

Gagandeep Jaswal, Harjinder Singh

Research Cell : An International Journal of Engineering Sciences, Issue June 2016


ISSN: 2229-6913 (Print), ISSN: 2320-0332 (Online) -, Web Presence: http://ijoes.vidyapublications.com

2016 Vidya Publications. Authors are responsible for any plagiarism issues.

15

Вам также может понравиться