Automated facial recognition and candidate list rank change of computer generated facial approximations generated with multiple eye orb positions

Parks, Connie L.; Monson, Keith L.

doi:10.1016/j.forsciint.2016.06.023

Title: Automated facial recognition and candidate list rank change of computer generated facial approximations generated with multiple eye orb positions

Full Record
Other Related Research

Authors:: Parks, Connie L.; Monson, Keith L.

Publication Date:: 2016-09-01

Sponsoring Org.:: USDOE

OSTI Identifier:: 1397033

Resource Type:: Publisher's Accepted Manuscript

Journal Name:: Forensic Science International

Additional Journal Information:: Journal Name: Forensic Science International Journal Volume: 266 Journal Issue: C; Journal ID: ISSN 0379-0738

Publisher:: Elsevier

Country of Publication:: Switzerland

Language:: English

Citation Formats


                    Parks, Connie L., and Monson, Keith L. Automated facial recognition and candidate list rank change of computer generated facial approximations generated with multiple eye orb positions.  Switzerland: N. p., 2016. 
Web.  doi:10.1016/j.forsciint.2016.06.023.

Copy to clipboard


                    Parks, Connie L., & Monson, Keith L. Automated facial recognition and candidate list rank change of computer generated facial approximations generated with multiple eye orb positions.  Switzerland.  https://doi.org/10.1016/j.forsciint.2016.06.023

Copy to clipboard


                    Parks, Connie L., and Monson, Keith L. Thu .  
"Automated facial recognition and candidate list rank change of computer generated facial approximations generated with multiple eye orb positions".  Switzerland.  https://doi.org/10.1016/j.forsciint.2016.06.023.

Copy to clipboard


                    
@article{osti_1397033,

  title        = {Automated facial recognition and candidate list rank change of computer generated facial approximations generated with multiple eye orb positions},

  author       = {Parks, Connie L. and Monson, Keith L.},

  abstractNote = {},

  doi          = {10.1016/j.forsciint.2016.06.023},

  journal      = {Forensic Science International},

  number       = C,

  volume       = 266,

  place        = {Switzerland},

  year         = {2016},

  month        = {9}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (Publisher)

Publisher's Version of Record
https://doi.org/10.1016/j.forsciint.2016.06.023

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 2 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

Automated facial recognition of manually generated clay facial approximations: Potential application in unidentified persons data repositories

Journal Article Parks, Connie L. ; Monson, Keith L. - Forensic Science International
https://doi.org/10.1016/j.forsciint.2017.11.013
Recognition of computerized facial approximations by familiar assessors

Journal Article Richard, Adam H. ; Monson, Keith L. - Science & Justice
https://doi.org/10.1016/j.scijus.2017.06.004
Laptop Computer - Based Facial Recognition System Assessment

Technical Report Cain, R A ; Singleton, G B

The objective of this project was to assess the performance of the leading commercial-off-the-shelf (COTS) facial recognition software package when used as a laptop application. We performed the assessment to determine the system's usefulness for enrolling facial images in a database from remote locations and conducting real-time searches against a database of previously enrolled images. The assessment involved creating a database of 40 images and conducting 2 series of tests to determine the product's ability to recognize and match subject faces under varying conditions. This report describes the test results and includes a description of the factors affecting the results.more »« less
https://doi.org/10.2172/780800

Full Text Available
Approximate parallel scheduling: Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time

Journal Article Cole, R ; Vishkin, U - SIAM J. Comput.; (United States)

The authors define a novel scheduling problem; it is solved in parallel by repeated, rapid, approximate reschedulings. This leads to the first optimal logarithmic time PRAM algorithm for list ranking. Companion papers show how to apply these results to obtain improved PRAM upper bounds for a variety of problems on graphs, including the following: connectivity, biconnectivity, Euler tour and st-numbering, and a number of problems on trees.
https://doi.org/10.1137/0217009
COMPUTER PROGRAMS FOR DETERMINING PAYOUT-EYE POSITIONS FOR LAYING FILAMENTS ALONG GEODESIC PATHS ON SURFACES OF REVOLUTION.

Technical Report Bookhart, T. W. ; Fowler, A. H.
https://doi.org/10.2172/4828429

Full Text Available

Similar Records