Results 1 - 10 of 4,738

A Statistical Method for 2-D Facial Landmarking

by Student Member, Albert Ali Salah, Theo Gevers
"... Abstract—Many facial-analysis approaches rely on robust and accurate automatic facial landmarking to correctly function. In this paper, we describe a statistical method for automatic facial-landmark localization. Our landmarking relies on a parsimonious mixture model of Gabor wavelet features, compu ..."
Abstract - Cited by 7 (3 self) - Add to MetaCart
Abstract—Many facial-analysis approaches rely on robust and accurate automatic facial landmarking to correctly function. In this paper, we describe a statistical method for automatic facial-landmark localization. Our landmarking relies on a parsimonious mixture model of Gabor wavelet features

High confidence visual recognition of persons by a test of statistical independence

by John G. Daugman - IEEE TRANS. ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE , 1993
"... A method for rapid visual recognition of personal identity is described, based on the failure of a statistical test of independence. The most unique phenotypic feature visible in a person’s face is the detailed texture of each eye’s iris: An estimate of its statistical complexity in a sample of the ..."
Abstract - Cited by 621 (8 self) - Add to MetaCart
A method for rapid visual recognition of personal identity is described, based on the failure of a statistical test of independence. The most unique phenotypic feature visible in a person’s face is the detailed texture of each eye’s iris: An estimate of its statistical complexity in a sample

De-Noising By Soft-Thresholding

by David L. Donoho , 1992
"... Donoho and Johnstone (1992a) proposed a method for reconstructing an unknown function f on [0; 1] from noisy data di = f(ti)+ zi, iid i =0;:::;n 1, ti = i=n, zi N(0; 1). The reconstruction fn ^ is de ned in the wavelet domain by translating all the empirical wavelet coe cients of d towards 0 by an a ..."
Abstract - Cited by 1279 (14 self) - Add to MetaCart
Donoho and Johnstone (1992a) proposed a method for reconstructing an unknown function f on [0; 1] from noisy data di = f(ti)+ zi, iid i =0;:::;n 1, ti = i=n, zi N(0; 1). The reconstruction fn ^ is de ned in the wavelet domain by translating all the empirical wavelet coe cients of d towards 0

Statistical shape influence in geodesic active contours

by Michael E. Leventon, W. Eric, L. Grimson, Olivier Faugeras - In Proc. 2000 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR), Hilton Head, SC , 2000
"... A novel method of incorporating shape information into the image segmentation process is presented. We introduce a representation for deformable shapes and define a probability distribution over the variances of a set of training shapes. The segmentation process embeds an initial curve as the zero l ..."
Abstract - Cited by 396 (4 self) - Add to MetaCart
A novel method of incorporating shape information into the image segmentation process is presented. We introduce a representation for deformable shapes and define a probability distribution over the variances of a set of training shapes. The segmentation process embeds an initial curve as the zero

Statistical Methods for Detecting Molecular Adaptation

by Z. Yang, J. P. Bielawski, Ziheng Yang, Ziheng Yang - RR n\Sigma2848 34 Renzo G. AVESANI , 2000
"... nally, synonymous and nonsynonymous substitution rates (Box 1) are defined in the context of comparing two DNA sequences, with d S and d N as the numbers of synonymous and nonsynonymous substitutions per site, respectively . Thus, the ratio v 5 d N /d S measures the difference between the two rat ..."
Abstract - Cited by 299 (11 self) - Add to MetaCart
rates and is most easily understood from a mathematical description of a codon substitution model (Box 2). If an amino acid change is neutral, it will be fixed at the same rate as a synonymous mutation, with v 5 1. If the amino acid change is deleterious, purifying selection (Box 1) will reduce its

Scalable statistical bug isolation

by Ben Liblit, Alex Aiken, Mayur Naik, Alice X. Zheng - In Proceedings of the ACM SIGPLAN 2005 Conference on Programming Language Design and Implementation , 2005
"... We present a statistical debugging algorithm that isolates bugs in programs containing multiple undiagnosed bugs. Earlier statistical algorithms that focus solely on identifying predictors that correlate with program failure perform poorly when there are multiple bugs. Our new technique separates th ..."
Abstract - Cited by 304 (14 self) - Add to MetaCart
studies, including examples in which the algorithm identified previously unknown, significant crashing bugs in widely used systems. Categories and Subject Descriptors D.2.4 [Software Engineering]: Software/Program Verification—statistical methods; D.2.5

Robust Facial Landmarking for Registration

by Albert Ali Salah, Hatice Çinar, Lale Akarun, Bülent Sankur - Annals of Telecommunications
"... Finding landmark positions on facial images is an important step in face registration and normalization, for both 2D and 3D face recognition. In this paper, we inspect shortcomings of existing approaches in the literature and compare several methods for performing automatic landmarking on near-front ..."
Abstract - Cited by 13 (7 self) - Add to MetaCart
Finding landmark positions on facial images is an important step in face registration and normalization, for both 2D and 3D face recognition. In this paper, we inspect shortcomings of existing approaches in the literature and compare several methods for performing automatic landmarking on near

A Minimum Description Length Approach to Statistical Shape Modelling

by Rhodri H. Davies, Carole J. Twining, Tim. F. Cootes, John C. Waterton, Chris. J. Taylor - IEEE Transactions on Medical Imaging , 2001
"... We describe a method for automatically building statistical shape models from a training set of exam- ple boundaries / surfaces. These models show considerable promise as a basis for segmenting and interpreting images. One of the drawbacks of the approach is, however, the need to establish a set of ..."
Abstract - Cited by 202 (12 self) - Add to MetaCart
, specificity and generalization ability. We show how a set of shape parameterizations can be represented and manipulated in order to build a minimum description length model. Results are given for several different training sets of 2D boundaries, showing that the proposed method constructs better models than

3D Facial Landmarking under Expression, Pose, and Occlusion Variations

by Albert Ali Salah, Lale Akarun
"... Abstract — Automatic localization of 3D facial features is important for face recognition, tracking, modeling and expression analysis. Methods developed for 2D images were shown to have problems working across databases acquired with different illumination conditions. Expression variations, pose var ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
variations and occlusions also hamper accurate detection of landmarks. In this paper we assess a fully automatic 3D facial landmarking algorithm that relies on accurate statistical modeling of facial features. This algorithm can be employed to model any facial landmark, provided that the facial poses present

Facial Landmark Localization and Feature Extraction for Therapeutic Face Exercise Classification

by Cornelia Lanz, Birant Sibel Olgay, Joachim Denzler
"... Abstract. In this work, we examine landmark localization and feature extraction approaches for the unexplored topic of therapeutic facial exer-cise recognition. Our goal is to automatically discriminate nine thera-peutic exercises that have been determined in cooperation with speech therapists. We u ..."
Abstract - Add to MetaCart
use colour, 2.5D and 3D image data that was recorded using Microsoft’s Kinect. Our features comprise statistical descriptors of the face surface curvature as well as characteristic profiles that are derived from face landmarks. For the nine facial exercises, we yield an average recognition accuracy
Results 1 - 10 of 4,738