10 July 1999 in Applied Optics
We present two different channel models (the magnitude model and the intensity model) for a pixel-matched volume holographic data storage system that employs the 4-focal-length architecture. First, a framework to describe the channel models is developed. We evaluate the linearity of the channel models by comparing data values obtained from diffraction-limited interference with data values predicted by the channel models. The models are evaluated for linearity and equalization gain under different storage and read-back conditions, such as fill factors, apertures, and contrast ratios. Bit error rate results obtained by use of linear equalization methods in conjunction with the channel models developed are also presented. Our results suggest that the magnitude model leads to better performance when the fill factors are small, whereas the intensity model appears to be more appropriate for the high-fill-factor cases. The magnitude model, when suitable, appears to provide a storage density improvement of as great as 65%, whereas the intensity model seems capable of providing as much as 15% density gain through deconvolution. The optimum aperture for storage seems to be close to the Nyquist aperture.
10 January 2004 in Applied Optics
Using biometrics for subject verification can significantly improve security over that of approaches based on passwords and personal identification numbers, both of which people tend to lose or forget. In biometric verification the system tries to match an input biometric (such as a fingerprint, face image, or iris image) to a stored biometric template. Thus correlation filter techniques are attractive candidates for the matching precision needed in biometric verification. In particular, advanced correlation filters, such as synthetic discriminant function filters, can offer very good matching performance in the presence of variability in these biometric images (e.g., facial expressions, illumination changes, etc.). We investigate the performance of advanced correlation filters for face, fingerprint, and iris biometric verification.
1 June 2000 in IEEE Transactions on Image Processing
Correlation methods are becoming increasingly attractive tools for image recognition and location. This renewed interest in correlation methods is spurred by the availability of high-speed image processors and the emergence of correlation filter designs that can optimize relevant figures of merit. In this paper, a new correlation filter design method is presented that allows one to optimally tradeoff among potentially conflicting correlation output performance criteria while achieving desired correlation peak value behavior in response to in-plane rotation of input images. Such controlled in-plane rotation response is useful in image analysis and pattern recognition applications where the sensor follows a pre-arranged trajectory while imaging an object. Since this new correlation filter design is based on circular harmonic function (CHF) theory, we refer to the resulting filters as optimal tradeoff circular harmonic function (OTCHF) filters. Underlying theory, OTCHF filter design method, and illustrative numerical results are presented.
29 August 2019 in IEEE Transactions on Information Forensics and Security
This paper considers the problem of image set-based face verification and identification. Unlike traditional single sample (an image or a video) setting, this situation assumes the availability of a set of heterogeneous collection of orderless images and videos. The samples can be taken at different check points, different identity documents $etc$ . The importance of each image is usually considered either equal or based on a quality assessment of that image independent of other images and/or videos in that image set. How to model the relationship of orderless images within a set remains a challenge. We address this problem by formulating it as a Markov Decision Process (MDP) in a latent space. Specifically, we first propose a dependency-aware attention control (DAC) network, which uses actor-critic reinforcement learning for attention decision of each image to exploit the correlations among the unordered images. An off-policy experience replay is introduced to speed up the learning process. Moreover, the DAC is combined with a temporal model for videos using divide and conquer strategies. We also introduce a pose-guided representation (PGR) scheme that can further boost the performance at extreme poses. We propose a parameter-free PGR without the need for training as well as a novel metric learning-based PGR for pose alignment without the need for pose detection in testing stage. Extensive evaluations on IJB-A/B/C, YTF, Celebrity-1000 datasets demonstrate that our method outperforms many state-of-art approaches on the set-based as well as video-based face recognition databases.
26 November 2014 in IEEE Transactions on Pattern Analysis and Machine Intelligence
Correlation filters (CFs) are a class of classifiers that are attractive for object localization and tracking applications. Traditionally, CFs have been designed in the frequency domain using the discrete Fourier transform (DFT), where correlation is efficiently implemented. However, existing CF designs do not account for the fact that the multiplication of two DFTs in the frequency domain corresponds to a circular correlation in the time/spatial domain. Because this was previously unaccounted for, prior CF designs are not truly optimal, as their optimization criteria do not accurately quantify their optimization intention. In this paper, we introduce new zero-aliasing constraints that completely eliminate this aliasing problem by ensuring that the optimization criterion for a given CF corresponds to a linear correlation rather than a circular correlation. This means that previous CF designs can be significantly improved by this reformulation. We demonstrate the benefits of this new CF design approach with several important CFs. We present experimental results on diverse data sets and present solutions to the computational challenges associated with computing these CFs. Code for the CFs described in this paper and their respective zero-aliasing versions is available at http://vishnu.boddeti.net/projects/correlation-filters.html