scispace - formally typeset
Search or ask a question
Author

Nalini K. Ratha

Bio: Nalini K. Ratha is an academic researcher from IBM. The author has contributed to research in topics: Biometrics & Fingerprint recognition. The author has an hindex of 50, co-authored 216 publications receiving 12290 citations. Previous affiliations of Nalini K. Ratha include Michigan State University & University at Buffalo.


Papers
More filters
Patent
06 Nov 2015
TL;DR: In this article, a method for monitoring a user includes the steps of: collecting real-time data from the user, wherein the data is collected via a mobile feedback controller worn by the user; determining whether the data collected from a user indicates impairment; determining appropriate corrective actions to be taken if the collected data from an individual indicates impairment, otherwise continuing to collect data from that individual in real time.
Abstract: Techniques for modifying user behavior and screening for impairment using a mobile feedback controller, such as a smartwatch, are provided. In one aspect, a method for monitoring a user includes the steps of: collecting real-time data from the user, wherein the data is collected via a mobile feedback controller worn by the user; determining whether the data collected from the user indicates impairment; determining appropriate corrective actions to be taken if the data collected from the user indicates impairment, otherwise continuing to collect data from the user in real-time; determining whether any action is needed; and undertaking the appropriate corrective actions if action is needed, otherwise continuing to collect data from the user in real-time.

5 citations

Proceedings ArticleDOI
08 Dec 2008
TL;DR: This paper proposes a novel encoding technique which is based on 2D median filters, which are commonly used as de-noising tools in image processing domain, and uses their nonlinear characteristics to generate binary codes from gray scale iris images.
Abstract: Iris-based human recognition is very attractive because of the high accuracy achievable. However, existing encoding methods are unable to handle iris images acquired when the ambient lighting is non-uniform. In this paper we propose a novel encoding technique which can handle images acquired under such conditions. The method is based on 2D median filters, which are commonly used as de-noising tools in image processing domain, and uses their nonlinear characteristics to generate binary codes from gray scale iris images. The application of this method for robust iris recognition is discussed and compared with two more traditional iris encoding techniques: the 2D Gabor filter based method and the 1D log-Gabor method. Our algorithm is usable for the whole range of conditions encountered in the MMU1 iris database, performs well in a synthetic uneven illumination study, and gets comparable results on other tests.

5 citations

Proceedings ArticleDOI
21 Sep 1994
TL;DR: A feature-based segmentation approach to the object detection problem is pursued, where the features used are computed over multiple spatial orientations, and frequencies.
Abstract: In this paper the problem of detecting objects in the presence of clutter is studied. The images considered are obtained from both visual and infrared sensors. A feature-based segmentation approach to the object detection problem is pursued, where the features used are computed over multiple spatial orientations, and frequencies. The method proceeds as follows: A given image is passed through a bank of even-symmetric Gabor filters. A selection of these filtered images is made and each (selected) filtered image is subjected to a nonlinear (sigmoidal like) transformation. Then, a measure of texture `energy' is computed in a window around each transformed image pixel. The texture `energy' features, and their spatial locations, are inputted to a least squared error based clustering algorithm. This clustering algorithm yields a segmentation of the original image -- it assigns to each pixel in the image a cluster label that identifies the amount of mean local energy the pixel possesses across the different spatial orientations, and frequencies. This method is applied on a number of visual and infrared images, every one of which contains one or more objects. The region corresponding to the object is usually segmented correctly, and a unique set of texture `energy' features is typically associated with the segment containing the object(s) of interest.

4 citations

Journal ArticleDOI
01 Jun 2022
TL;DR: The possible robustness connection between natural and artificial adversarial examples is studied and can pave a way for the development of unified resiliency because defense against one attack is not sufficient for real-world use cases.
Abstract: Although recent deep neural network algorithm has shown tremendous success in several computer vision tasks, their vulnerability against minute adversarial perturbations has raised a serious concern. In the early days of crafting these adversarial examples, artificial noises are optimized through the network and added in the images to decrease the confidence of the classifiers against the true class. However, recent efforts are showcasing the presence of natural adversarial examples which can also be effectively used to fool the deep neural networks with high confidence. In this paper, for the first time, we have raised the question that whether there is any robustness connection between artificial and natural adversarial examples. The possible robustness connection between natural and artificial adversarial examples is studied in the form that whether an adversarial example detector trained on artificial examples can detect the natural adversarial examples. We have analyzed several deep neural networks for the possible detection of artificial and natural adversarial examples in seen and unseen settings to set up a robust connection. The extensive experimental results reveal several interesting insights to defend the deep classifiers whether vulnerable against natural or artificially perturbed examples. We believe these findings can pave a way for the development of unified resiliency because defense against one attack is not sufficient for real-world use cases.

4 citations

Proceedings ArticleDOI
22 Mar 1996
TL;DR: A page layout segmentation algorithm for locating text, background and halftone areas is presented and a significant speedup of two orders of magnitude compared to a SparcStation 20 has been achieved.
Abstract: A page layout segmentation algorithm for locating text, background and halftone areas is presented. The algorithm has been implemented on Splash 2-an FPGA-based array processor. The speed as determined by the Xilinx synthesis tools projects an application speed of 5 MHz. For documents of size 1,024/spl times/1,024 pixels, a significant speedup of two orders of magnitude compared to a SparcStation 20 has been achieved.

4 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: An overview of pattern clustering methods from a statistical pattern recognition perspective is presented, with a goal of providing useful advice and references to fundamental concepts accessible to the broad community of clustering practitioners.
Abstract: Clustering is the unsupervised classification of patterns (observations, data items, or feature vectors) into groups (clusters). The clustering problem has been addressed in many contexts and by researchers in many disciplines; this reflects its broad appeal and usefulness as one of the steps in exploratory data analysis. However, clustering is a difficult problem combinatorially, and differences in assumptions and contexts in different communities has made the transfer of useful generic concepts and methodologies slow to occur. This paper presents an overview of pattern clustering methods from a statistical pattern recognition perspective, with a goal of providing useful advice and references to fundamental concepts accessible to the broad community of clustering practitioners. We present a taxonomy of clustering techniques, and identify cross-cutting themes and recent advances. We also describe some important applications of clustering algorithms such as image segmentation, object recognition, and information retrieval.

14,054 citations

Book
10 Mar 2005
TL;DR: This unique reference work is an absolutely essential resource for all biometric security professionals, researchers, and systems administrators.
Abstract: A major new professional reference work on fingerprint security systems and technology from leading international researchers in the field Handbook provides authoritative and comprehensive coverage of all major topics, concepts, and methods for fingerprint security systems This unique reference work is an absolutely essential resource for all biometric security professionals, researchers, and systems administrators

3,821 citations

Journal ArticleDOI
TL;DR: A fast fingerprint enhancement algorithm is presented, which can adaptively improve the clarity of ridge and valley structures of input fingerprint images based on the estimated local ridge orientation and frequency.
Abstract: In order to ensure that the performance of an automatic fingerprint identification/verification system will be robust with respect to the quality of input fingerprint images, it is essential to incorporate a fingerprint enhancement algorithm in the minutiae extraction module. We present a fast fingerprint enhancement algorithm, which can adaptively improve the clarity of ridge and valley structures of input fingerprint images based on the estimated local ridge orientation and frequency. We have evaluated the performance of the image enhancement algorithm using the goodness index of the extracted minutiae and the accuracy of an online fingerprint verification system. Experimental results show that incorporating the enhancement algorithm improves both the goodness index and the verification accuracy.

2,212 citations

01 Apr 1997
TL;DR: The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity.
Abstract: The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind. The emphasis is on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity. Topics covered includes an introduction to the concepts in cryptography, attacks against cryptographic systems, key use and handling, random bit generation, encryption modes, and message authentication codes. Recommendations on algorithms and further reading is given in the end of the paper. This paper should make the reader able to build, understand and evaluate system descriptions and designs based on the cryptographic components described in the paper.

2,188 citations

Reference EntryDOI
15 Oct 2004

2,118 citations