Svetlana N. Yanushkevich

Image Pattern Recognition: Synthesis and Analysis in Biometrics

Analysis in Biometrics: A Statistical Model for Biometric Verification (S N Srihari & H Srinivasan) Force Field Feature Extraction for Ear Biometrics (D J Hurley) Behavior Biometrics for Online Computer User Monitoring (A A E Ahmed & I Traore) Synthesis in Biometrics: Introduction to Synthesis in Biometrics (S N Yanushkevich et al.) Local B-Spline Multiresolution with Example in Iris Synthesis and Volumetric Rendering (F F Samavati et al.) Computational Geometry and Biometrics: On the Path to Convergence (M L Gavrilova) Biometric Systems and Applications: Large-Scale Biometric Identification: Challenges and Solutions (N K Ratha et al.) Issues Involving the Human Biometric Sensor Interface (S J Elliott et al.) Signature Analysis, Verification and Synthesis in Pervasive Environments (D V Popel) and other papers.

FACIAL BIOMETRICS USING NONTENSOR PRODUCT WAVELET AND 2D DISCRIMINANT TECHNIQUES

A new facial biometric scheme is proposed in this paper. Three steps are included. First, a new nontensor product bivariate wavelet is utilized to get different facial frequency components. Then a ...

NONITERATIVE 3D FACE RECONSTRUCTION BASED ON PHOTOMETRIC STEREO

3D face reconstruction is a popular area within the computer vision domain. 3D face reconstruction should ideally be achieved easily and cost-effectively, without requiring specialized equipment to estimate 3D shapes. As a result of this, many techniques for retrieving 3D shapes from 2D images have been proposed. In this paper, a novel method for 3D face reconstruction based on photometric stereo, which estimates the surface normal from shading information in multiple images, hence recovering the 3D shape of a face, is proposed. In order to overcome the problems of previous approaches related to prior-knowledge regarding lighting conditions and iterative algorithms, the exemplar is synthesized with known lighting conditions from at least three images, under arbitrary lighting conditions and using an illumination reference. Experiments in 3D face reconstruction were made by verifying the proposed approach using the illumination subset of the Max-Planck Institute face database and Yale face database B. Experimental results demonstrate that the proposed method is effective for 3D shape reconstruction of faces from 2D images.

Gauss–Laguerre wavelet textural feature fusion with geometrical information for facial expression identification

Facial expressions are a valuable source of information that accompanies facial biometrics. Early detection of physiological and psycho-emotional data from facial expressions is linked to the situational awareness module of any advanced biometric system for personal state re/identification. In this article, a new method that utilizes both texture and geometric information of facial fiducial points is presented. We investigate Gauss–Laguerre wavelets, which have rich frequency extraction capabilities, to extract texture information of various facial expressions. Rotation invariance and the multiscale approach of these wavelets make the feature extraction robust. Moreover, geometric positions of fiducial points provide valuable information for upper/lower face action units. The combination of these two types of features is used for facial expression classification. The performance of this system has been validated on three public databases: the JAFFE, the Cohn-Kanade, and the MMI image.

Evolutionary multi-level network synthesis in given design style

This paper extends the technique of evolutionary network design. We study an evolutionary network design strategy from the position of design style. A hypothesis under investigation is that the uncertainty of a total search space (the space of all possible network solutions) through evolutionary network design is removed faster if this space is partitioned into subspaces. This idea has been realized through a parallel window-based scanning of these subspaces. Such a window is determined by the parameters of a multi-level network architecture in a given design style. Our approach allows to synthesize networks with more than two hundred quaternary gates. Moreover we show that information theoretical interpretation of the evolutionary process is useful, in particular in partitioning of network space and measuring of fitness function. The experimental data with 6-input quaternary and 11-inputs binary benchmarks demonstrate the efficiency of our program, EvoDesign, and an improvement against the recently obtained results.

Functional entropy and decision trees

We introduce a technique to compute several information estimations for Boolean and multivalued functions. Special features of these estimations for completely and incompletely specified logic functions, including symmetric logic functions are investigated. Finally, we give an algorithm for determining various information measures for logical functions based on decision trees.

Logic Design of NanoICS

PREFACE ACKNOWLEDGEMENTS INTRODUCTION Progress From Micro- to Nanoelectronics Logic Design in Spatial Dimensions Towards Computer-Aided Design of NanoICs Methodology Example: Hypercube Structure of Hierarchical FPGA Summary Problems Further Reading References NANOTECHNOLOGIES Nanotechnologies Nanoelectronic Devices Digital Nanoscale Circuits: Gates vs. Arrays Molecular Electronics Scaling and Fabrication Summary Problems Further Reading References BASICS OF LOGIC DESIGN IN NANOSPACE Graphs Data Structures for Switching Functions Sum-of-Products Expressions Shannon Decision Trees and Diagrams Reed-Muller Expressions Decision Trees and Diagrams Arithmetic Expressions Decision Trees and Diagrams Summary Problems Further Reading References WORD-LEVEL DATA STRUCTURES Word-level Data Structures Word-level Arithmetic Expressions Word-level Sum-of-Products Expressions Word-level Reed-Muller Expressions Summary Problems Further Reading References NANOSPACE AND HYPERCUBE-LIKE DATA STRUCTURES Spatial Structures Hypercube Data Structure Assembling of Hypercubes N-Hypercube Definition Degree of Freedom and Rotation Coordinate Description N-Hypercube Design for n > 3 Dimensions Embedding a Binary Decision Tree in N-Hypercube Assembling Spatial Topological Measurements Summary Problems Further Reading References NANODIMENSIONAL MULTILEVEL CIRCUITS Graph-Based Models in Logic Design of Multilevel Networks Library of N-Hypercubes for Elementary Logic Functions Hybrid Design Paradigm: N-Hypercube and DAG Manipulation of N-Hypercubes Numerical Evaluation of 3-D Structures Summary Further Reading References LINEAR WORD-LEVEL MODELS OF MULTILEVEL CIRCUITS Linear Expressions Linear Arithmetic Expressions Linear Arithmetic Expressions of Elementary Functions Linear Decision Diagrams Representation of a Circuit Level by Linear Expression Linear Decision Diagrams for Circuit Representation Technique for Manipulating the Coefficients Linear Word-level Sum-of-Products Expressions Linear Word-level Reed-Muller Expressions Summary Problems Further Reading References EVENT-DRIVEN ANALYSIS OF HYPERCUBE-LIKE TOPOLOGY Formal Definition of Change in a Binary System Computing Boolean Differences Models of Logic Networks in Terms of Change Matrix Models of Change Models of Directed Changes in Algebraic Form Local Computation Via Partial Boolean Difference Generating Reed-Muller Expressions by Logic Taylor Series Arithmetic Analogs of Boolean Differences and Logic Taylor Expansion Summary Problems Further Reading References NANODIMENSIONAL MULTIVALUED CIRCUITS Introduction to Multivalued Logic Spectral Technique Multivalued Decision Trees and Decision Diagrams Concept of Change in Multivalued Circuits Generation of Reed-Muller Expressions Linear Word-level Expressions of Multivalued Functions Linear Nonarithmetic Word-level Representation of Multivalued Functions Summary Problems Further Reading References PARALLEL COMPUTATION IN NANOSPACE Data Structures and Massive Parallel Computing Arrays Linear Systolic Arrays for Computing Logic Functions Computing Reed-Muller Expressions Computing Boolean Differences Computing Arithmetic Expressions Computing Walsh Expressions Tree-Based Network for Manipulating a Switching Function Hypercube Arrays Summary Problems Further Reading References FAULT-TOLERANT COMPUTATION Definitions Probabilistic Behavior of Nanodevices Neural Networks Stochastic Computing Von Neumanns Model on Reliable Computation with Unreliable Components Faulty Hypercube-Like Computing Structures Summary Further Reading References INFORMATION MEASURES IN NANODIMENSIONS Information-Theoretical Measures at Various Levels of Design in Nanodimensions Information-Theoretical Measures in Logic Design Information Measures of Elementary Switching Functions Information-Theoretical Measures in Decision Trees Information Measures in the N-Hypercube Information-Theoretical Measures in Multivalued Functions Summary Problems Further Reading References INDEX

Technique of computing logic derivatives for MVL-functions

A technique to compute logic derivatives of MVL-functions is considered based on four algorithms, two of them are new. At first these are symbolic and matrix algorithms to find logic derivatives with respect to variables, and, secondly, partial direct and inverse derivatives. The algorithms are compared by using an example of testing a MVL switching circuit. The matrix approach allows to extract the appropriatenesses of computing process and to come to some simple operators of logic processing truth vectors of MVL functions.

Facial biometrics for situational awareness systems

This study contributes to developing the concept of decision-making support in biometric-based situational awareness systems. Such systems assist users in gathering and analysing biometric data, and support the decision-making on the human behavioural pattern and/or authentication. As an example, the authors consider a facial biometric assistant that functions based on multi-spectral biometrics in visible and infrared bands; it involves facial expression recognition, face recognition in both spectra, as well as estimation of physiological parameters. The authors also investigate usage of facial biometrics for the semantic representation for advanced decision-making.

Synthetic Biometrics: A Survey

This brief survey addresses the state-of-the-art techniques of inverse biometrics, which deals with synthesis of biometric data. It reports on genesis of synthetic biometric, advanced methods, and open application-specific problems. Currently deployed biometric systems use comprehensive methods and algorithms (such as pattern recognition, decision making, database searching, etc.) to analyze biometric data collected from individuals. We consider the inverse task, synthesis of artificial biometric data. These biologically meaningful data are useful, for example, for testing the biometric tools, and for enhancing the security of biometric systems. The synthetic data replicate all possible instances of otherwise unavailable data, thus, creating a variety of samples for testing. Properly created artificial biometric data provides a basis for enhancing security through the detailed and controlled modeling of a wide range of training skills, strategies and tactics of a hypothetical robber or forger. Databases of synthetic biometric data also serve for simulation in forensic systems.