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

Karen Hollingsworth

dblp:10/5161 · DBLP profile ↗
← Back
8ranked-venue papers
6as first author
0since 2021 · last 2012
—ORCID · none

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

Artificial intelligence and machine learning · 5 · 4 first-authorSecurity and privacy · 2 · 2 first-authorSystems, architecture and hardware · 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.

Network and information security
3 papers
Biometric security · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 67% Distributed systems · 33%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Biometric security
iris recognition
0.332012
Improved Iris Recognition through Fusion of Hamming Distance and Fragile Bit Distance · IEEE Trans. Pattern Anal. Mach. Intell. 2011
Iris recognition using signal-level fusion of frames from video · IEEE Trans. Inf. Forensics Secur. 2009
Human and Machine Performance on Periocular Biometrics Under Near-Infrared Light and Visible Light · IEEE Trans. Inf. Forensics Secur. 2012
Biometric security › biometric fusion
score-level fusion
0.222011
Improved Iris Recognition through Fusion of Hamming Distance and Fragile Bit Distance · IEEE Trans. Pattern Anal. Mach. Intell. 2011
Iris recognition using signal-level fusion of frames from video · IEEE Trans. Inf. Forensics Secur. 2009
Biometric security › facial biometrics
periocular recognition
0.112012
Human and Machine Performance on Periocular Biometrics Under Near-Infrared Light and Visible Light · IEEE Trans. Inf. Forensics Secur. 2012
Biometric security
biometric fusion
0.112011
Improved Iris Recognition through Fusion of Hamming Distance and Fragile Bit Distance · IEEE Trans. Pattern Anal. Mach. Intell. 2011
High-performance computing › distributed computing infrastructure
campus grid
0.112010
All-Pairs: An Abstraction for Data-Intensive Computing on Campus Grids · IEEE Trans. Parallel Distributed Syst. 2010
High-performance computing
data-intensive computing
0.112010
All-Pairs: An Abstraction for Data-Intensive Computing on Campus Grids · IEEE Trans. Parallel Distributed Syst. 2010
Distributed systems
grid computing
0.112010
All-Pairs: An Abstraction for Data-Intensive Computing on Campus Grids · IEEE Trans. Parallel Distributed Syst. 2010
Biometric security
biometric recognition
0.122012
Human and Machine Performance on Periocular Biometrics Under Near-Infrared Light and Visible Light · IEEE Trans. Inf. Forensics Secur. 2012
Iris recognition using signal-level fusion of frames from video · IEEE Trans. Inf. Forensics Secur. 2009

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

hamming distance · 0.2performance evaluation · 0.2human performance study · 0.1computer algorithm comparison · 0.1fragile bit distance · 0.1signal-level fusion · 0.1score-level fusion · 0.1
YearPublicationVenuePosition
2012 Human and Machine Performance on Periocular Biometrics Under Near-Infrared Light and Visible Light
abstract
Periocular biometrics is the recognition of individuals based on the appearance of the region around the eye. Periocular recognition may be useful in applications where it is difficult to obtain a clear picture of an iris for iris biometrics, or a complete picture of a face for face biometrics. Previous periocular research has used either visible-light (VL) or near-infrared (NIR) light images, but no prior research has directly compared the two illuminations using images with similar resolution. We conducted an experiment in which volunteers were asked to compare pairs of periocular images. Some pairs showed images taken in VL, and some showed images taken in NIR light. Participants labeled each pair as belonging to the same person or to different people. Untrained participants with limited viewing times correctly classified VL image pairs with 88% accuracy, and NIR image pairs with 79% accuracy. For comparison, we presented pairs of iris images from the same subjects. In addition, we investigated differences between performance on light and dark eyes and relative helpfulness of various features in the periocular region under different illuminations. We calculated performance of three computer algorithms on the periocular images. Performance for humans and computers was similar.
Karen Hollingsworth, Shelby Solomon Darnell, Philip E. Miller, Damon L. Woodard, Kevin W. Bowyer, Patrick J. Flynn
IEEE Trans. Inf. Forensics Secur.1
2011 Genetically identical irises have texture similarity that is not detected by iris biometrics
Karen Hollingsworth, Kevin W. Bowyer, Stephen Lagree, Samuel P. Fenker, Patrick J. Flynn
Comput. Vis. Image Underst.1
2011 Useful features for human verification in near-infrared periocular images
Karen Hollingsworth, Kevin W. Bowyer, Patrick J. Flynn
Image Vis. Comput.1
2011 Improved Iris Recognition through Fusion of Hamming Distance and Fragile Bit Distance
abstract
The most common iris biometric algorithm represents the texture of an iris using a binary iris code. Not all bits in an iris code are equally consistent. A bit is deemed fragile if its value changes across iris codes created from different images of the same iris. Previous research has shown that iris recognition performance can be improved by masking these fragile bits. Rather than ignoring fragile bits completely, we consider what beneficial information can be obtained from the fragile bits. We find that the locations of fragile bits tend to be consistent across different iris codes of the same eye. We present a metric, called the fragile bit distance, which quantitatively measures the coincidence of the fragile bit patterns in two iris codes. We find that score fusion of fragile bit distance and Hamming distance works better for recognition than Hamming distance alone. To our knowledge, this is the first and only work to use the coincidence of fragile bit locations to improve the accuracy of matches.
Karen Hollingsworth, Kevin W. Bowyer, Patrick J. Flynn
IEEE Trans. Pattern Anal. Mach. Intell.1
2010 All-Pairs: An Abstraction for Data-Intensive Computing on Campus Grids
abstract
Today, campus grids provide users with easy access to thousands of CPUs. However, it is not always easy for nonexpert users to harness these systems effectively. A large workload composed in what seems to be the obvious way by a naive user may accidentally abuse shared resources and achieve very poor performance. To address this problem, we argue that campus grids should provide end users with high-level abstractions that allow for the easy expression and efficient execution of data-intensive workloads. We present one example of an abstraction—All-Pairs—that fits the needs of several applications in biometrics, bioinformatics, and data mining. We demonstrate that an optimized All-Pairs abstraction is both easier to use than the underlying system, achieve performance orders of magnitude better than the obvious but naive approach, and is both faster and more efficient than a tuned conventional approach. This abstraction has been in production use for one year on a 500 CPU campus grid at the University of Notre Dame and has been used to carry out a groundbreaking analysis of biometric data.
Christopher Moretti, Hoang Bui, Karen Hollingsworth, Brandon Rich, Patrick J. Flynn, Douglas Thain
IEEE Trans. Parallel Distributed Syst.3
2009 Pupil dilation degrades iris biometric performance
Karen Hollingsworth, Kevin W. Bowyer, Patrick J. Flynn
Comput. Vis. Image Underst.1
2009 Iris recognition using signal-level fusion of frames from video
abstract
We take advantage of the temporal continuity in an iris video to improve matching performance using signal-level fusion. From multiple frames of a frontal iris video, we create a single average image. For comparison, we reimplement three score-level fusion methods (Ma, Krichen, and Schmid). We find that our signal-level fusion ofNimages performs better than Ma's or Krichen's score-level fusion methods ofNHamming distance scores. Our signal-level fusion performs comparably to Schmid's log-likelihood method of score-level fusion, and our method achieves this performance using less computation time. We compare our signal fusion method with another new method: a multigallery, multiprobe method involving score-level fusion ofN2Hamming distances. The multigallery, multiprobe score fusion has slightly better recognition performance, while the signal fusion has significant advantages in memory and computation requirements. No published prior work has shown any advantage of the use of video over still images in iris biometrics.
Karen Hollingsworth, Tanya Peters, Kevin W. Bowyer, Patrick J. Flynn
IEEE Trans. Inf. Forensics Secur.1
2008 Image understanding for iris biometrics: A survey
Kevin W. Bowyer, Karen Hollingsworth, Patrick J. Flynn
Comput. Vis. Image Underst.2