Iris localization based on the Hough transform,a radial-gradient operator,and the gray-level intensity

The iris biometric recognizes a human based on his/her iris texture, which is a stable and unique feature for every individual. A typical iris biometric system performs better for the ideal data, which is acquired under controlled conditions. However, its performance degrades when localizing iris in non-ideal data containing the noisy issues, e.g., the non-uniform illumination, defocus, and non-circular iris boundaries. This study proposes a reliable algorithm to localize iris in such images robustly. First, a small region containing the coarse location of iris is localized. Next, the pupillary boundary is extracted within this small region using an iterative-scheme comprising an adaptive binarization and a pupil location verification test. Following that, the limbic boundary is localized by reusing the Hough accumulator. The iris location is also verified through a gray-level test. After that, the pupillary and limbic boundaries are regularized by applying an enhanced method comprising a Radial-gradient operator (RGO), an error-transform (ET), and the Fourier series. Experimental results, obtained on the CASIA-IrisV3, CASIA-IrisV4, MMU V1.0, and MMU(new) V2.0 iris databases, show superiority of the proposed technique over some of the contemporary techniques.     

A non-circular iris localization algorithm using image projection function and gray level statistics

Iris recognition technology identifies an individual from its iris texture with great precision. A typical iris recognition system comprises eye image acquisition, iris segmentation, feature extraction, and matching. However, the system precision greatly depends on accurate iris localization in the segmentation module. In this paper, we propose a reliable iris localization algorithm. First, we locate a coarse eye location in an eye image using integral projection function (IPF). Next, we localize the pupillary boundary in a sub image using a reliable technique based on the histogram-bisection, image statistics, eccentricity, and object geometry. After that, we localize the limbic boundary using a robust scheme based on the radial gradients and an error distance transform. Finally, we regularize the actual iris boundaries using active contours. The proposed algorithm is tested on public iris databases: MMU V1.0, CASIA-IrisV1, and the CASIA-IrisV3-Lamp. Experimental results demonstrate superiority of the proposed algorithm over some of the contemporary techniques.     

Localization of iris in gray scale images using intensity gradient

A new method of iris localization based on intensity value analysis is proposed in this paper. Iris recognition systems are mainly dependent on the performance of iris localization processing. Steps after localization involve normalization, feature extraction and matching. These steps are based on the accuracy and efficiency of localization of iris in human eye images. In the proposed scheme, the inner boundary of iris is calculated by finding the pupil center and radius using two methods. In the first method, selected region is adaptively binarized and centroid of the region utilized for obtaining pupil parameters. Edges are processed to detect radius and center of pupil during the second method. For outer iris boundary, a band is calculated within which iris outer boundary lies. Signals in one dimension are picked up along radial direction within determined band at different angles. Three points with maximum gradient are selected from each signal. Redundant points are deleted using Mahalanobis distance and remaining points are used to obtain the outer circle of the iris. Points for upper and lower eyelids are found in the same way as the iris outer boundary. Selected points are then statistically fitted to make parabolas and lastly eyelashes are removed from the image to completely localize the iris. Experimental results show that proposed method is very efficient and accurate.     

Automatic localization of pupil using eccentricity and iris using gradient based method

This paper presents a novel approach for the automatic localization of pupil and iris. Pupil and iris are nearly circular regions, which are surrounded by sclera, eyelids and eyelashes. The localization of both pupil and iris is extremely important in any iris recognition system. In the proposed algorithm pupil is localized using Eccentricity based Bisection method which looks for the region that has the highest probability of having pupil. While iris localization is carried out in two steps. In the first step, iris image is directionally segmented and a noise free region (region of interest) is extracted. In the second step, angular lines in the region of interest are extracted and the edge points of iris outer boundary are found through the gradient of these lines. The proposed method is tested on CASIA ver 1.0 and MMU Iris databases. Experimental results show that this method is comparatively accurate.     

Iris segmentation using variational level set method

Continuous efforts have been made to process degraded iris images for enhancement of the iris recognition performance in unconstrained situations. Recently, many researchers have focused on developing the iris segmentation techniques, which can deal with iris images in a non-cooperative environment where the probability of acquiring unideal iris images is very high due to gaze deviation, noise, blurring, and occlusion by eyelashes, eyelids, glasses, and hair. Although there have been many iris segmentation methods, most focus primarily on the accurate detection of iris images captured in a closely controlled environment. The novelty of this research effort is that we propose to apply a variational level set-based curve evolution scheme that uses a significantly larger time step to numerically solve the evolution partial differential equation (PDE) for segmentation of an unideal iris image accurately, and thereby, speeding up the curve evolution process drastically. The iris boundary represented by the variational level set may break and merge naturally during evolution, and thus, the topological changes are handled automatically. The proposed variational model is also robust against poor localization and weak iris/sclera boundaries. In order to solve the size irregularities occurring due to arbitrary shapes of the extracted iris/pupil regions, a simple method is applied based on connection of adjacent contour points. Furthermore, to reduce the noise effect, we apply a pixel-wise adaptive 2D Wiener filter. The verification and identification performance of the proposed scheme is validated on three challenging iris image datasets, namely, the ICE 2005, the WVU Unideal, and the UBIRIS Version 1.     

基于特定感兴趣区采样的虹膜定位改进算法

从虹膜图像特点出发,以瞳孔形心为辅助点实现对虹膜图像特定感兴趣区采样.并且根据虹膜内外圆半径的生理特点设定Hough变换半径参量,依据虹膜内外圆近似同心圆来筛选与虹膜外圆最匹配的Hough变换结果.该算法在主动避开眼皮,睫毛干扰的同时又显著降低了Hough变换的计算量.通过对中科院自动化所CASIA虹膜数据库108组图像的虹膜定位测试结果表明,该方法平均定位时间0.83 s,定位准确率98.9%.     

复杂背景下钢索图像的纹理分割与边界识别

 针对复杂背景下钢索图像难以准确分割的问题,提出一种基于纹理分析的钢索图像分割与边界识别方法.采用基于模糊Hough变换的纹理方向检测方法确定钢索走向,利用边缘方向密度直方图作为纹理特征,对与钢索纹理方向相应的边缘方向赋予不同权重,抑制纹理分割中背景的干扰,对钢丝绳图像进行聚类分割,采用检测平行直线的方法确定其边界,并根据算法参量对边界进行修正.在实验中,对比了边缘方向密度直方图特征与灰度共生矩阵、局部二值模式在钢索图像纹理分割中的结果与计算时间,结果表明边缘方向密度直方图特征计算速度快、受背景干扰小,分割准确率高.本文方法无须预先训练,受背景干扰小,可以准确地识别出钢索并确定其边界,能满足钢丝绳视觉检测的要求.     

光学小波包变换及其滤波器的研究

基于对光学小波变换必要条件的分析,提出光学小波包变换的概念.选出虹膜图库的联合最优小波包基,利用最优基的线性组合生成相应的复合光学小波包滤波器.将滤波器用于光电混合虹膜识别系统中对待识别输入进行小波包特征提取预处理,模拟结果不仅证明引入该滤波器可明显提升系统的识别效果,也证明了光学小波包变换提出的意义.     

Blind and Secured Adaptive Digital Image Watermarking Approach for High Imperceptibility and Robustness

In the past decade, rapid development in digital communication has led to prevalent use of digital images. More importantly, confidentiality issues have also come up recently due to the increase in digital image transmission across the Internet. Therefore, it is necessary to provide high imperceptibility and security to digitally transmitted images. In this paper, a novel blind digital image watermarking scheme is introduced tackling secured transmission of digital images, which provides a higher quality regarding both imperceptibility and robustness parameters. A block based hybrid IWT- SVD transform is implemented for robust transmission of digital images. To ensure high watermark security, the watermark is encrypted using a Pseudo random key which is generated adaptively from cover and watermark images. An encrypted watermark is embedded in randomly selected low entropy blocks to increase the security as well as imperceptibility. Embedding positions within the block are identified adaptively using a Blum–Blum–Shub Pseudo random generator. To ensure higher visual quality, Initial Scaling Factor (ISF) is chosen adaptively from a cover image using image range characteristics. ISF can be optimized using Nature Inspired Optimization (NIO) techniques for higher imperceptibility and robustness. Specifically, the ISF parameter is optimized by using three well-known and novel NIO-based algorithms such as Genetic Algorithms (GA), Artificial Bee Colony (ABC), and Firefly Optimization algorithm. Experiments were conducted for the proposed scheme in terms of imperceptibility, robustness, security, embedding rate, and computational time. Experimental results support higher effectiveness of the proposed scheme. Furthermore, performance comparison has been done with some of the existing state-of-the-art schemes which substantiates the improved performance of the proposed scheme.     

Region-based SIFT approach to iris recognition

Traditional iris recognition systems transfer iris images to polar (or log-polar) coordinates and have performed very well on data that tends to have a centered gaze. The patterns of an iris are part of a 3-D structure that is captured as a two-dimensional (2-D) image and cooperative iris recognition systems are capable of correctly matching these 2-D representations of iris features. However, when the gaze of an eye changes with respect to the camera lens, many times the size, shape, and detail of iris patterns will change as well and cannot be matched to enrolled images using traditional methods. Additionally, the transformation of off-angle eyes to polar coordinates becomes much more challenging and noncooperative iris algorithms will require a different approach. The direct application of the scale-invariant feature transform (SIFT) method would not work well for iris recognition because it does not take advantage of the characteristics of iris patterns. We propose the region-based SIFT approach to iris recognition. This new method does not require polar transformation, affine transformation or highly accurate segmentation to perform iris recognition and is scale invariant. This method was tested on the iris challenge evaluation (ICE), WVU and IUPUI noncooperative databases and results show that the method is capable of cooperative and noncooperative iris recognition.     

Automatic white blood cell segmentation using stepwise merging rules and gradient vector flow snake

This study aims at proposing a new stained WBC (white blood cell) image segmentation method using stepwise merging rules based on mean-shift clustering and boundary removal rules with a GVF (gradient vector flow) snake. This paper proposes two different schemes for segmenting the nuclei and cytoplasm of WBCs, respectively. For nuclei segmentation, a probability map is created using a probability density function estimated from samples of WBC's nuclei and sub-images cropped to include a nucleus based on the fact that nuclei have a salient color against the background and red blood cells. Mean-shift clustering is then performed for region segmentation, and a stepwise merging scheme applied to merge particle clusters with a nucleus. Meanwhile, for cytoplasm segmentation, morphological opening is applied to a green image to boost the intensity of the granules and canny edges detected within the sub-image. The boundary edges and noise edges are then removed using removal rules, while a GVF snake is forced to deform to the cytoplasm boundary edges. When evaluated using five different types of stained WBC, the proposed algorithm produced accurate segmentation results for most WBC types.     

基于人眼灰度分布特征的虹膜定位算法

虹膜定位是虹膜识别过程中的重要环节,定位速度和精度决定了整个虹膜识别系统的性能。提出了一种基于人眼灰度分布特征的虹膜定位算法,该算法利用形态学运算实现瞳孔圆心粗定位,采用划分区域求灰度均值隔项差值最大值的方法实现外圆半径的粗定位,并通过分层聚类的方法实现内外边界的精确定位。实验结果表明．与经典的虹膜定位算法如Wildes算法、Daugman算法相比,该算法定位结果更加准确,定位速度大幅度提高。     

混沌加密的虹膜识别系统的安全性

提出了针对特征码的单向耦合映像格混沌加密系统,以及Arnold变换与单向耦合映像格混沌系统相结合对虹膜信息进行加密的复合混沌加密系统.利用Arnold变换置乱并混淆虹膜图像,通过镜像解决零点不变性问题,最后通过单向耦合映像格混沌系统实现加密.实验表明本算法密钥空间大,统计特性好,密钥敏感性强,加密速度快,平均加密时间70 ms.     

Bilinear modal representations for reduced-order modeling of localized piecewise-linear oscillators

A novel reduced-order modeling method for vibration problems of elastic structures with localized piecewise-linearity is proposed. The focus is placed upon solving nonlinear forced response problems of elastic media with contact nonlinearity, such as cracked structures and delaminated plates. The modeling framework is based on observations of the proper orthogonal modes computed from nonlinear forced responses and their approximation by a truncated set of linear normal modes with special boundary conditions. First, it is shown that a set of proper orthogonal modes can form a good basis for constructing a reduced-order model that can well capture the nonlinear normal modes. Next, it is shown that the subspace spanned by the set of dominant proper orthogonal modes can be well approximated by a slightly larger set of linear normal modes with special boundary conditions. These linear modes are referred to as bi-linear modes, and are selected by an elaborate methodology which utilizes certain similarities between the bi-linear modes and approximations for the dominant proper orthogonal modes. These approximations are obtained using interpolated proper orthogonal modes of smaller dimensional models. The proposed method is compared with traditional reduced-order modeling methods such as component mode synthesis, and its advantages are discussed. Forced response analyses of cracked structures and delaminated plates are provided for demonstrating the accuracy and efficiency of the proposed methodology.     

架构于双树轮廓波方向及相位特征的纹理图像分割

考虑到纹理的方向及相位特性,提出一种基于双树轮廓波变换的纹理图像分割新方法.双树轮廓波由塔型双树方向滤波器组构建,它不仅保持了轮廓波灵活的方向选择性,克服了传统轮廓波不具有移不变性的缺点,而且提供了复子带系数.本文以各方向子带的能量作为方向特征,复系数的平均相角作为相位特征,生成特征向量,利用模糊C均值聚类算法进行纹理图像分割.实验结果表明,相位特征是方向特征的有效补充,与传统方法相比,该方法在分割错误率、边缘准确性以及区域一致性等方面均有明显的改善.     

A high-order accurate hybrid scheme using a central flux scheme and a WENO scheme for compressible flowfield analysis

A high-order accurate hybrid central-WENO scheme is proposed. The fifth order WENO scheme [G.S. Jiang, C.W. Shu, Efficient implementation of weighted ENO schemes, J. Comput. Phys. 126 (1996) 202–228] is divided into two parts, a central flux part and a numerical dissipation part, and is coupled with a central flux scheme. Two sub-schemes, the WENO scheme and the central flux scheme, are hybridized by means of a weighting function that indicates the local smoothness of the flowfields. The derived hybrid central-WENO scheme is written as a combination of the central flux scheme and the numerical dissipation of the fifth order WENO scheme, which is controlled adaptively by a weighting function. The structure of the proposed hybrid central-WENO scheme is similar to that of the YSD-type filter scheme [H.C. Yee, N.D. Sandham, M.J. Djomehri, Low-dissipative high-order shock-capturing methods using characteristic-based filters, J. Comput. Phys. 150 (1999) 199–238]. Therefore, the proposed hybrid scheme has also certain merits that the YSD-type filter scheme has. The accuracy and efficiency of the developed hybrid central-WENO scheme are investigated through numerical experiments on inviscid and viscous problems. Numerical results show that the proposed hybrid central-WENO scheme can resolve flow features extremely well.     

Context dependent graph-based method for laser cladding image thresholding

For segmentation method to be useful it must be fast, easy to use, and produce high quality segmentations, but few algorithms can offer this in various conditions and applications. In this paper, we propose a context dependent graph-based method for transition region extraction and thresholding. The graph-based approach is introduced into image thresholding, and context dependent graph is constructed from a given image, which can adaptively extract the pixel context and shape information because of the scalable neighborhood. Then an edge weight function is defined as the measure of possible transition pixels, and a robust fully automatic scheme for the optimal threshold is also presented. The proposed approach is validated both quantitatively and qualitatively. Compared with the traditional state-of-art algorithms on synthetic and real images, as well as laser cladding images, the experimental results suggest that the new proposal is efficient and effective.     

基于K-L变换的虹膜识别方法

提出了一种基于K-L变换和最近邻分类器的虹膜识别方法。该方法采用K-L变换得到一组虹膜图像基,并利用这组基图像构造一子空间,将待识别图像在这个空间上的投影系数作为待识别图像的特征向量。采用最近邻分类器进行了分类。基于CASIA虹膜数据库的试验表明,将K-L变换应用在虹膜特征提取上可以取得较高的识别率。     

一种新型摆杆式可变光栏

本文介绍了一种新型的摆杆式可变光栏。根据推导出的动环转角与光栏片转角的关系式,用计算机辅助设计选取光栏机构的一组最优化参数,使动环等角转动变换每档光圈时,实际光通量与理论值误差≤8.4%。