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

Fayin Li

dblp:22/2759 · DBLP profile ↗
← Back
8ranked-venue papers
4as first author
0since 2021 · last 2009
—ORCID · none

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

Artificial intelligence and machine learning · 7 · 4 first-authorSystems, architecture and hardware · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
5 papers
Robot navigation and mapping · 58% Face, body and person analysis · 15% 3D vision · 14%
Computer graphics and multimedia
2 papers
Image and video processing · 100%
Network and information security
1 paper
Biometric security · 100%
Human-computer interaction and pervasive computing
1 paper
User interface design and tools · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping
localization
0.112006
Probabilistic Location Recognition using Reduced Feature Set · ICRA 2006
Computer vision › 3D vision
visual localization
0.112006
Probabilistic Location Recognition using Reduced Feature Set · ICRA 2006
Computer vision › Face, body and person analysis
face recognition
0.112005
Open Set Face Recognition Using Transduction · IEEE Trans. Pattern Anal. Mach. Intell. 2005
Biometric security
open-set recognition
0.112005
Open Set Face Recognition Using Transduction · IEEE Trans. Pattern Anal. Mach. Intell. 2005
Robotics › Robot navigation and mapping › localization › probabilistic localization
markov localization
0.012004
Vision based Topological Markov Localization · ICRA 2004
Robotics › Robot navigation and mapping › localization › map-based localization
topological localization
0.012004
Vision based Topological Markov Localization · ICRA 2004
Robotics › Robot navigation and mapping › robot mapping
topological mapping
0.012004
Vision based Topological Markov Localization · ICRA 2004
Robotics › Robot navigation and mapping › place recognition
visual place recognition
0.012004
Vision based Topological Markov Localization · ICRA 2004
Image and video processing
motion estimation
0.012004
Motion Estimation Using Statistical Learning Theory · IEEE Trans. Pattern Anal. Mach. Intell. 2004
Machine learning › Learning theory › statistical learning theory
complexity control
0.012003
Controlling Model Complexity in Flow Estimation · ICCV 2003
Image and video processing › motion estimation
flow estimation
0.012003
Controlling Model Complexity in Flow Estimation · ICCV 2003
Image and video processing › motion estimation
optical flow
0.012003
Controlling Model Complexity in Flow Estimation · ICCV 2003
User interface design and tools
adaptive user interfaces
0.012002
Integrating perceptual and cognitive modeling for adaptive and intelligent human-computer interaction · Proc. IEEE 2002
Machine learning › Trustworthy machine learning › uncertainty estimation
confidence estimation
0.012005
Open Set Face Recognition Using Transduction · IEEE Trans. Pattern Anal. Mach. Intell. 2005
Image and video processing › motion analysis
motion tracking
0.012004
Motion Estimation Using Statistical Learning Theory · IEEE Trans. Pattern Anal. Mach. Intell. 2004

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

hidden markov model · 0.1transductive inference · 0.1kolmogorov complexity · 0.1k-nearest neighbors · 0.1perceptual modeling · 0.1nonverbal behavior parsing · 0.1cognitive modeling · 0.1scale-invariant keypoints · 0.1statistical learning theory · 0.0scale-invariant feature · 0.0ridge regression · 0.0image histogram · 0.0VC theory · 0.0
YearPublicationVenuePosition
2009 Face Authentication Using Recognition-by-Parts, Boosting and Transduction
abstract
The paper describes an integrated recognition-by-parts architecture for reliable and robust face recognition. Reliability and robustness are characteristic of the ability to deploy full-fledged and operational biometric engines, and handling adverse image conditions that include among others uncooperative subjects, occlusion, and temporal variability, respectively. The architecture proposed is model-free and non-parametric. The conceptual framework draws support from discriminative methods using likelihood ratios. At the conceptual level it links forensics and biometrics, while at the implementation level it links the Bayesian framework and statistical learning theory (SLT). Layered categorization starts with face detection using implicit rather than explicit segmentation. It proceeds with face authentication that involves feature selection of local patch instances including dimensionality reduction, exemplar-based clustering of patches into parts, and data fusion for matching using boosting driven by parts that play the role of weak-learners. Face authentication shares the same implementation with face detection. The implementation, driven by transduction, employs proximity and typicality (ranking) realized using strangeness and p-values, respectively. The feasibility and reliability of the proposed architecture are illustrated using FRGC data. The paper concludes with suggestions for augmenting and enhancing the scope and utility of the proposed architecture.
Fayin Li, Harry Wechsler
Int. J. Pattern Recognit. Artif. Intell.1
2008 Robust fusion using boosting and transduction for component-based face recognition
abstract
Face recognition performance depends upon the input variability as encountered during biometric data capture including occlusion and disguise. The challenge met in this paper is to expand the scope and utility of biometrics by discarding unwarranted assumptions regarding the completeness and quality of the data captured. Towards that end we propose a model-free and non-parametric component-based face recognition strategy with robust decisions for data fusion that are driven by transduction and boosting. The conceptual framework draws support throughout from discriminative methods using likelihood ratios. It links at the conceptual level forensics and biometrics, while at the implementation level it links the Bayesian framework and statistical learning theory (SLT). Feature selection of local patch instances and their corresponding high-order combinations, exemplar-based clustering (of patches) as components including the sharing (of exemplars) among components, and finally decision-making regarding authentication using boosting driven by components that play the role of weak-learners, are implemented in a similar fashion using transduction driven by a strangeness measure akin to typicality. The feasibility, reliability, and utility of the proposed open set face recognition architecture vis-à-vis adverse image capture conditions are illustrated using FRGC data. The potential for future developments concludes the paper.
Fayin Li, Harry Wechsler, Massimo Tistarelli
ICARCV1
2006 Probabilistic Location Recognition using Reduced Feature Set
abstract
The localization capability is central to basic navigation tasks and motivates development of various visual navigation systems. In this paper we describe a two stage approach for localization in indoor environments. In the first stage, the environment is partitioned into several locations, each characterized by a set of scale-invariant keypoints and their associated descriptors. In the second stage the keypoints of the query view are integrated probabilistically yielding an estimate of most likely location. The novelty of our approach is in the selection of discriminative features, best suited for characterizing individual locations. We demonstrate that high location recognition rate is maintained with only 10% of the originally detected features, yielding a substantial speedup in recognition and capability of handling larger environments. The ambiguities due to the self-similarity and dynamic changes in the environment are resolved by exploiting spatial relationships between locations captured by hidden Markov model
Fayin Li, Jana Kosecka
ICRA1
2005 Open Set Face Recognition Using Transduction
abstract
This paper motivates and describes a novel realization of transductive inference that can address the Open Set face recognition task. Open Set operates under the assumption that not all the test probes have mates in the gallery. It either detects the presence of some biometric signature within the gallery and finds its identity or rejects it, i.e., it provides for the "none of the above" answer. The main contribution of the paper is Open Set TCM-kNN (Transduction Confidence Machine-k Nearest Neighbors), which is suitable for multiclass authentication operational scenarios that have to include a rejection option for classes never enrolled in the gallery. Open Set TCM-kNN, driven by the relation between transduction and Kolmogorov complexity, provides a local estimation of the likelihood ratio needed for detection tasks. We provide extensive experimental data to show the feasibility, robustness, and comparative advantages of Open Set TCM-kNN on Open Set identification and watch list (surveillance) tasks using challenging FERET data. Last, we analyze the error structure driven by the fact that most of the errors in identification are due to a relatively small number of face patterns. Open Set TCM-kNN is shown to be suitable for PSEI (pattern specific error inhomogeneities) error analysis in order to identify difficult to recognize faces. PSEI analysis improves biometric performance by removing a small number of those difficult to recognize faces responsible for much of the original error in performance and/or by using data fusion.
Fayin Li, Harry Wechsler
IEEE Trans. Pattern Anal. Mach. Intell.1
2004 Vision based Topological Markov Localization
abstract
In this paper we study the problem of acquiring a topological model of indoors environment by means of visual sensing and subsequent localization given the model. The resulting model consists of a set of locations and neighborhood relationships between them. Each location in the model is represented by a collection of representative views and their associated descriptors selected from a temporally sub-sampled video stream captured by a mobile robot during exploration. We compare the recognition performance using global image histograms as well as local scale-invariant features as image descriptors, demonstrate their strengths and weaknesses and show how to model the spatial relationships between individual locations by a Hidden Markov Model. The quality of the acquired model is tested in the localization stage by means of location recognition: given a new view or a sequence of views, the most likely location where that view came from is determined.
Jana Kosecka, Fayin Li
ICRA2
2004 Motion Estimation Using Statistical Learning Theory
abstract
This paper describes a novel application of Statistical Learning Theory (SLT) to single motion estimation and tracking. The problem of motion estimation can be related to statistical model selection, where the goal is to select one (correct) motion model from several possible motion models, given finite noisy samples. SLT, also known as Vapnik-Chervonenkis (VC), theory provides analytic generalization bounds for model selection, which have been used successfully for practical model selection. This paper describes a successful application of an SLT-based model selection approach to the challenging problem of estimating optimal motion models from small data sets of image measurements (flow). We present results of experiments on both synthetic and real image sequences for motion interpolation and extrapolation; these results demonstrate the feasibility and strength of our approach. Our experimental results show that for motion estimation applications, SLT-based model selection compares favorably against alternative model selection methods, such as the Akaike's fpe, Schwartz' criterion (sc), Generalized Cross-Validation (gcv), and Shibata's Model Selector (sms). The paper also shows how to address the aperture problem using SLT-based model selection for penalized linear (ridge regression) formulation.
Harry Wechsler, Zoran Duric, Fayin Li, Vladimir Cherkassky
IEEE Trans. Pattern Anal. Mach. Intell.3
2003 Controlling Model Complexity in Flow Estimation
Zoran Duric, Fayin Li, Harry Wechsler, Vladimir Cherkassky
ICCV2
2002 Integrating perceptual and cognitive modeling for adaptive and intelligent human-computer interaction
abstract
This paper describes technology and tools for intelligent human-computer interaction (IHCI) in which human cognitive, perceptual, motor and affective factors are modeled and used to adapt the H-C interface. IHCI emphasizes that human behavior encompasses both apparent human behavior and the hidden mental state behind behavioral performance. IHCI expands on the interpretation of human activities, known as W4 (what, where, when, who). While W4 only addresses the apparent perceptual aspect of human behavior the W5+ technology for IHCI described in this paper addresses also the why and how questions, whose solution requires recognizing specific cognitive states. IHCI integrates parsing and interpretation of nonverbal information with a computational cognitive model of the user which, in turn, feeds into processes that adapt the interface to enhance operator performance and provide for rational decision-making. The technology proposed is based on a general four-stage interactive framework, which moves from parsing the raw sensory-motor input, to interpreting the user's motions and emotions, to building an understanding of the user's current cognitive state. It then diagnoses various problems in the situation and adapts the interface appropriately. The interactive component of the system improves processing at each stage. Examples of perceptual, behavioral, and cognitive tools are described throughout the paper Adaptive and intelligent HCI are important for novel applications of computing, including ubiquitous and human-centered computing.
Zoran Duric, Wayne D. Gray, Ric Heishman, Fayin Li, Azriel Rosenfeld, Michael J. Schoelles, Christian D. Schunn, Harry Wechsler
Proc. IEEE4