Search NASA⌕ Search

SEARCH · Search NASA

Results for “FACE RECOGNITION”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2014

Face recognition system and method using face pattern words and face pattern bytes

The present invention provides a novel system and method for identifying individuals and for face recognition utilizing facial features for face identification. The system and method of the invention comprise creating facial features or face patterns called face pattern words and face pattern bytes for face identification. The invention also provides for pattern recognitions for identification other than face recognition. The invention further provides a means for identifying individuals based on visible and/or thermal images of those individuals by utilizing computer software implemented by instructions on a computer or computer system and a computer readable medium containing instructions on a computer system for face recognition and identification.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Face Recognition Algorithm Bias: Performance Differences on Images of Children and Adults

In this work, we examine if current state-of-the-art deep- learning enhanced face recognition systems exhibit a negative bias for children as compared to adults. The systems selected for this work are five top performing1 commercial off-the-shelf (COTS) face recognition systems, two government off-the-shelf (GOTS) face recognition systems and one open-source face recognition solution. The datasets used to evaluate the performance of the systems are both unconstrained in age, pose, illumination, and expression and are publicly available. These datasets are indicative of photo journalistic face datasets published and evaluated on over the last few years. Our findings show a negative bias (i.e., a considerable degradation in performance) for each algorithm on children when compared to the performance obtained on adults. Genuine and imposter distributions high- light the performance bias between the datasets further sup- porting the need for a deeper investigation into algorithm bias as a function of age cohorts. To combat the performance decline on the child demographic, several score- level fusion strategies were evaluated. This work identifies the best score-level fusion technique for child demographic.

Srinivas, Nisha↗
DOE OSTI2019

Face Recognition from Oak Ridge (FaRO)

Many universities have published highly accurate open source face recognition algorithms, but configuring and using those algorithms can be very difficult due to poor documentation and challenges with installing the right software and libraries. Comparing research results is also a problem due to uncontrolled research methods. Provide baseline face recognition implementations that can be used for evaluating algorithm accuracy. The software provides a consistent web service interface to face recognition algorithms that can be used to support research in biometrics. The software uses protobuf and grpc services to publish standardized interfaces to the algorithms. The software also provides Docker container support which allows services to be easily started and configured on new machines. Reproducible baseline configurations are provided to serve as bench marks for publications in this area.

Bolme, DavidS↗
DOE OSTI2020

Face Recognition Oak Ridge (FaRO): A Framework for Distributed and Scalable Biometrics Applications

The facial biometrics community has seen a recent abundance of high-accuracy facial analytic models become freely available. Although these models' capabilities in facial detection, landmark detection, attribute analysis, and recognition are ever-increasing, they aren't always straightforward to deploy in a real-world environment. In reality, the use of the field's ever growing collection of models is becoming exceedingly difficult as library dependencies update and deprecate. Researchers often encounter headaches when attempting to utilize multiple models requiring different or conflicting software packages. Face Recognition Oak Ridge (FaRO) is an open-source project designed to provide a highly modular, flexible framework for unifying facial analytic models through a compartmentalized plug-and-play paradigm built on top of the gRPC (Google Remote Procedure Call) protocol. FaRO's server-client architecture and flexible portability allows easy construction of modularized and heterogeneous face analysis pipelines, distributed over many machines with differing hardware and software resources. This paper outlines FaRO's architecture and current capabilities, along with some experiments in model testing and distributed scaling through FaRO.

Bolme, David↗
DOE OSTI2019

Effects of Postmortem Decomposition on Face Recognition

Although viable tools are available for the identification of unknown deceased individuals, recognition rates with these methods are greatly impacted by the degree to which decomposition has occurred. Therefore, identifying highly decomposed remains poses a major challenge. This paper analyzes the effect of facial decomposition on the recognition rates of several facial recognition commercial-off-theshelf systems and research-grade systems, as well as algorithms contained in a custom recognition library. The custom dataset of facial images used in the experiment is composed of 42 subjects at stages of decomposition rangingfrom recently deceased to later stages where the soft tissues are severely decomposed and facial features are deformed. It is shown that an algorithm’s ability to correctly detect a decomposing face is a crucial first step that not all face models can accurately handle. However, some of the evaluated Convolution Neural Network (CNN)–inspired methods provide promising results even in cases of severely decomposed faces.

Cornett, David↗
DOE OSTI2023

Rifle-like camera for long distance face recognition

An improved long-range facial recognition system is provided. The facial recognition system includes an integrated, rifle-like mounting platform with modular and interchangeable components, including a machine-vision camera, a facial recognition module, and an aiming scope. The mounting platform includes an elongated frame, a hand grip, a shoulder stock, and an underbody support attachment for an optional bipod. The mounting platform provides an intuitive, shoulder-operated support structure for stabilizing the machine-vision camera and reducing vibrations that otherwise inhibit long distance imaging.

Bolme, David S.↗
DOE OSTI2020

The Mertens Unrolled Network (MU-Net): A High Dynamic Range Fusion Neural Network for Through the Windshield Driver Recognition

Face recognition of vehicle occupants through windshields in unconstrained environments poses a number of unique challenges ranging from glare, poor illumination, driver pose and motion blur. In this paper, we further develop the hardware and software components of a custom vehicle imaging system to better overcome these challenges. After the build out of a physical prototype system that performs High Dynamic Range (HDR) imaging, we collect a small dataset of through-windshield image captures of known drivers. We then reformulate the classical Mertens-Kautz-Van Reeth HDR fusion algorithm as a pre-initialized neural network, which we name the Mertens Unrolled Network (MU-Net), for the purpose of fine-tuning the HDR output of through-windshield images. Reconstructed faces from this novel HDR method are then evaluated and compared against other traditional and experimental HDR methods in a pre-trained state-of-the-art (SOTA) facial recognition pipeline, verifying the efficacy of our approach.

Ruby, Max↗
DOE OSTI2015

Machine Learning Approaches for Predicting Radiation Therapy Outcomes: A Clinician's Perspective

Radiation oncology has always been deeply rooted in modeling, from the early days of isoeffect curves to the contemporary Quantitative Analysis of Normal Tissue Effects in the Clinic (QUANTEC) initiative. In recent years, medical modeling for both prognostic and therapeutic purposes has exploded thanks to increasing availability of electronic data and genomics. One promising direction that medical modeling is moving toward is adopting the same machine learning methods used by companies such as Google and Facebook to combat disease. Broadly defined, machine learning is a branch of computer science that deals with making predictions from complex data through statistical models. These methods serve to uncover patterns in data and are actively used in areas such as speech recognition, handwriting recognition, face recognition, “spam” filtering (junk email), and targeted advertising. Although multiple radiation oncology research groups have shown the value of applied machine learning (ML), clinical adoption has been slow due to the high barrier to understanding these complex models by clinicians. Here, we present a review of the use of ML to predict radiation therapy outcomes from the clinician's point of view with the hope that it lowers the “barrier to entry” for those without formal training in ML. We begin by describing 7 principles that one should consider when evaluating (or creating) an ML model in radiation oncology. We next introduce 3 popular ML methods—logistic regression (LR), support vector machine (SVM), and artificial neural network (ANN)—and critique 3 seminal papers in the context of these principles. Although current studies are in exploratory stages, the overall methodology has progressively matured, and the field is ready for larger-scale further investigation.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2023

Expanding Accurate Person Recognition to New Altitudes and Ranges: The BRIAR Dataset

Face recognition technology has advanced significantly in recent years due largely to the availability of large and increasingly complex training datasets for use in deep learning models. These datasets, however, typically comprise images scraped from news sites or social media plat-forms and, therefore, have limited utility in more advanced security, forensics, and military applications. These applications require lower resolution, longer ranges, and ele-vated viewpoints. To meet these critical needs, we collected and curated the first and second subsets of a large multi-modal biometric dataset designed for use in the research and development (R&D) of biometric recognition technolo-gies under extremely challenging conditions. Thus far, the dataset includes more than 350,000 still images and over 1,300 hours of video footage of approximately 1,000 sub-jects. To collect this data, we used Nikon DSLR cameras, a variety of commercial surveillance cameras, specialized long-rage R&D cameras, and Group 1 and Group 2 UAV platforms. The goal is to support the development of algorithms capable of accurately recognizing people at ranges up to 1,000 m and from high angles of elevation. These ad-vances will include improvements to the state of the art in face recognition and will support new research in the area of whole-body recognition using methods based on gait and anthropometry. This paper describes methods used to col-lect and curate the dataset, and the dataset's characteristics at the current stage.

Brogan, Joel↗
DOE OSTI2020

A neural network for determination of latent dimensionality in Nonnegative Matrix Factorization

Non-negative Matrix Factorization (NMF) has proven to be a powerful unsupervised learning method for uncovering hidden features in complex and noisy datasets with applications in data mining, text recognition, dimension reduction, face recognition, anomaly detection, blind source separation, and many other fields. An important input for NMF is the latent dimensionality of the data, that is, the number of hidden features, K, present in the explored dataset. Unfortunately, and this quantity is rarely known a priori. The existing methods for determining latent dimensionality, such as Automatic Relevance Determination (ARD), are mostly heuristic and utilize different characteristics to estimate the number of hidden features. However, all of them require human presence to make a final determination of K. Here we utilize a supervised machine learning approach in combination with a recent method for model determination, called NMFk, to determine the number of hidden features automatically. NMFk performs a set of NMF simulations on an ensemble of matrices, obtained by bootstrapping the initial dataset, and estimates which K produces stable groups of latent features that reconstruct the initial dataset well. We then train a Multi-Layter Perceptron (MLP) classifier network to determine the correct number of latent features utilizing the statistics and characteristics of the NMF solution, obtained from NMFk. In order to train the MLP classifier, a training set of 58,660 matrices with predetermined latent features were factorized with NMFk. The MLP classifier in conjunction with NMFk maintains a greater than 95% success rate when applied to a held out test set. Additionally, when applied to two well-known benchmark datasets, the swimmer and MIT face data, NMFk/MLP correctly recovers the established number of hidden features. Finally, we compare the accuracy of our method to the ARD, AIC and Stability-based methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Grassmannian Diffusion Maps--Based Dimension Reduction and Classification for High-Dimensional Data

This work introduces the Grassmannian diffusion maps (GDMaps), a novel nonlinear dimensionality reduction technique that defines the affinity between points through their representation as low-dimensional subspaces corresponding to points on the Grassmann manifold. Here, the method is designed for applications, such as image recognition and data-based classification of constrained high-dimensional data where each data point itself is a high-dimensional object (i.e., a large matrix) that can be compactly represented in a lower-dimensional subspace. The GDMaps is composed of two stages. The first is a pointwise linear dimensionality reduction wherein each high-dimensional object is mapped onto the Grassmann manifold representing the low-dimensional subspace on which it resides. The second stage is a multipoint nonlinear kernel-based dimension reduction using diffusion maps to identify the subspace structure of the points on the Grassmann manifold. To this end, an appropriate Grassmannian kernel is used to construct the transition matrix of a random walk on a graph connecting points on the Grassmann manifold. Spectral analysis of the transition matrix yields low-dimensional Grassmannian diffusion coordinates embedding the data into a low-dimensional reproducing kernel Hilbert space. Further, a novel data classification/recognition technique is developed based on the construction of an overcomplete dictionary of reduced dimension whose atoms are given by the Grassmannian diffusion coordinates. Three examples are considered. First, a "toy" example shows that the GDMaps can identify an appropriate parametrization of structured points on the unit sphere. The second example demonstrates the ability of the GDMaps to revealing the intrinsic subspace structure of high-dimensional random field data. In the last ex- ample, a face recognition problem is solved considering face images subject to varying illumination conditions, changes in face expressions, and occurrence of occlusions. The technique presented high recognition rates (i.e., 95% in the best case) using a fraction of the data required by conventional methods.

42 ENGINEERING↗
DOE OSTI2024

Long-Range Biometric Identification in Real World Scenarios: A Comprehensive Evaluation Framework Based on Missions

The considerable body of data available for evaluating biometric recognition systems in Research and Development (R&D) environments has contributed to the increasingly common problem of target performance mismatch. Biometric algorithms are frequently tested against data that may not reflect the real world applications they target. From a Testing and Evaluation (T&E) standpoint, this domain mismatch causes difficulty assessing when improvements in State-of-the-Art (SOTA) research actually translate to improved applied outcomes. This problem can be addressed with thoughtful preparation of data and experimental methods to reflect specific use-cases and scenarios.To that end, this paper evaluates research solutions for identifying individuals at ranges and altitudes, which could support various application areas such as counterterrorism, protection of critical infrastructure facilities, military force protection, and border security. We address challenges including image quality issues and reliance on face recognition as the sole biometric modality. By fusing face and body features, we propose developing robust biometric systems for effective long-range identification from both the ground and steep pitch angles. Preliminary results show promising progress in whole-body recognition. This paper presents these early findings and discusses potential future directions for advancing long-range biometric identification systems based on mission-driven metrics.

Aykac, Deniz↗
DOE OSTI2019

Through the Windshield Driver Recognition

Biometric recognition of vehicle occupants in unconstrained environments is rife with a host of challenges. In particular, the complications arising from imaging through vehicle windshields provide a significant hurdle. Distance to target, glare, poor lighting, head pose of occupants, and speed of vehicle are some of the challenges. We explore the construction of a multi-unit computational camera system to mitigate these challenges in order to obtain accurate and consistent face recognition results. This paper documents the hardware components and software design of the computational imaging system. Also, we document the use of RCNN for face detection and GAN for machine learning-inspired High Dynamic Range Imaging, artifact removal, and image fusion.

Cornett, David↗
DOE OSTI2018

Incremental nonnegative matrix factorization based on correlation and graph regularization for matrix completion

Matrix factorization is widely used in recommendation systems, text mining, face recognition and computer vision. As one of the most popular methods, nonnegative matrix factorization and its incremental variants have attracted much attention. The existing incremental algorithms are established based on the assumption of samples are independent and only update the new latent variable of weighting coefficient matrix when the new sample comes, which may lead to inferior solutions. To address this issue, we investigate a novel incremental nonnegative matrix factorization algorithm based on correlation and graph regularizer (ICGNMF). The correlation is mainly used for finding out those correlated rows to be updated, that is, we assume that samples are dependent on each other. We derive the updating rules for ICGNMF by considering the correlation. We also present tests on widely used image datasets, and show ICGNMF reduces the error by comparing other methods.

Zhang, Xiaoxia↗
DOE OSTI2020

Low-threshold, single-transverse-mode, 940-nm vertical-cavity surface-emitting laser with a mode filter and half-wavelength cavity

We demonstrate a structure for a vertical-cavity surface-emitting laser (VCSEL) with a mode filter and half-wavelength (λ/2) cavity. The effects of λ/2- and λ-cavities on the threshold current are studied. The thickness and etched diameter of the mode filter are optimised to achieve single-transverse-mode output. The results show that when changing from λ-cavity to λ/2-cavity, the threshold current of the VCSEL decreases by 30.7% (from 0.85 mA to 0.65 mA). In addition, for the mode-filter thickness of 80 nm, and the etched diameter of 2.5 μm, the side mode suppression ratio reaches 90 dB, which meets the requirement of single-transverse-mode output. The VCSELs with the optimised design can overcome many difficulties and have great potential in 3D face recognition. (paper)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2014

MorphoHawk

An overview of Idaho National Laboratory's MorphoHawk software.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

The BRIAR Dataset: A Comprehensive Whole-Body Biometric Recognition Benchmark at Extreme Distances and Altitudes (Collections 1-6)

The Biometric Recognition and Identification at Altitude and Range (BRIAR) program aims to extend biometric capabilities into severe operational environments characterized by long ranges, atmospheric turbulence, and elevated viewpoints. This paper introduces the program’s two final government collections expanding activities, environments, viewpoints, distances, and modalities, and adding appearance and environmental stressors. We refine curation/evaluation and include sequestered subsets to support controlled assessments. These updates strengthen BRIAR as a comprehensive resource for whole-body, face, and gait recognition at altitude and range, while maintaining privacy-first practices.

Yoon, Rocky [ORNL] (ORCID:0009000491499165)↗
DOE OSTI2015

A paradigm shift - the key to optimal, defensible and transparent waste management, disposal and remediation decisions - 15236

Current methods for structuring nuclear waste management, disposal, and remediation decisions are subject to three major limitations. First, they are based on a series of extraordinarily conservative assumptions. The dominant way of thinking is that, for example, conservative models yield better, safer decisions. Second, they lack methods to meaningfully address and incorporate the 'human dimension'. The dominant way of thinking is that the current approach is sufficient to bring together the values and interests of both internal and external stakeholders in making a decision. And third, they lack a formal method through which both internal and external stakeholders are encouraged collectively to 'think through' complex problems that contain multiple competing objectives so that wise, socially acceptable, and scientifically-defensible decisions are made. To overcome these limitations, a paradigm shift is needed towards a holistic, integrated approach to structure nuclear waste management, disposal and remediation decisions. The first requirement of this paradigm shift is the realization and recognition that the problems faced are decision problems, and that there is a formal theory of decision analysis that can, and should, be used to support finding the best solutions. Decision analysis, very simply, is formalized common sense. The reason it is needed for complex problems is that there are too many moving parts (variables) for humans to manage with out the formalism. Decision analysis leads to addressing problem solving using a combination of a science-based model and a costs/values model. Expectation ('realism') and uncertainty are addressed in the science-based models, whereas stakeholder values, preferences, and desires are addressed when modeling costs and value judgments. Science-based modeling tools have been developed, improved, and used since the current regulatory setting was introduced about 30 years ago. However, modeling of costs and value judgments has not often been addressed using any formal approach, despite the openings that exist in regulations (e.g., CERCLA's modifying criteria and the concept of 'as low as reasonably achievable' referenced in DOE Orders). A discussion of the need and rationale for this paradigm shift is presented, followed by a description of the technical basics of this approach to decision modeling, and ending with an explanation of the steps that are taken in this approach to structured decision-making. A software framework program called Guided Interactive Statistical Decision Tools (GiSdT - pronounced 'gist') is introduced that supports this paradigm shift. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗