Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Vishal Kakkad

dblp:88/5517 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Face, body and person analysis · 100%
Network and information security
1 paper
Biometric security · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › Face, body and person analysis
face recognition
0.011998
Face Surveillance · ICCV 1998
Computer vision › Face, body and person analysis › face recognition › video-based face recognition
surveillance face recognition
0.011998
Face Surveillance · ICCV 1998
Biometric security › face recognition
face authentication
0.011998
Face Surveillance · ICCV 1998

Methods — techniques the papers use, named apart from their topics

radial basis functions · 0.0hybrid classifiers · 0.0decision tree · 0.0
YearPublicationVenuePosition
1998 Face Surveillance
abstract
Most of the research on face recognition addresses the MATCH problem and it assumes a closed universe where there is no need for a REJECT ('false positive') option. The SURVEILLANCE problem is addressed indirectly, if at all, through the MATCH problem, where the size of the gallery rather than that of the probe set is very large. This paper addresses the proper surveillance problem where the size of the probe ('unknown image') set vs. gallery ('known image') set is 450 vs. 50 frontal images. We developed robust face ID verification ('classification') and retrieval schemes based on hybrid classifiers and showed their feasibility using the FERET face data base. The hybrid classifier architecture consists of an ensemble of connectionist networks-Radial Basis Functions (RBF) and inductive decision trees (DT). Experimental results prove the feasibility of our approach and yield 97% accuracy using the probe and gallery sets specified above.
Srinivas Gutta, Jeffrey Huang, Vishal Kakkad, Harry Wechsler
ICCV3