The paper focuses on location of seal imprints on Chinese bank-checks based on region growing.Region growing method can be applied to searching and locating connection region in an image.A seal imprint,however,is gene...The paper focuses on location of seal imprints on Chinese bank-checks based on region growing.Region growing method can be applied to searching and locating connection region in an image.A seal imprint,however,is generally composed of various connection regions which are unconnected to each other.In order to locate the seal imprint,these connection regions must be fused together.In the paper,an algorithm for locating seal imprints on Chinese bankchecks based on region growing is proposed, of which a fusion criterion for connection regions in a seal imprint is put forth based on the image feature of Chinese bankcheck,and a center-rays model is proposed to find the topological relationship between connection regions,for which externally-tangent rectangle of region is used as the mark of location of region.The location experiment is achieved with a false-acceptance rate of 7.1% and a false-rejection rate of 0% on Chinese bankcheck.展开更多
Jacquard image segmentation is one of the primary steps in image analysis for jacquard pattern identification. The main aim is to recognize homogeneous regions within a jacquard image as distinct, which belongs to dif...Jacquard image segmentation is one of the primary steps in image analysis for jacquard pattern identification. The main aim is to recognize homogeneous regions within a jacquard image as distinct, which belongs to different patterns. Active contour models have become popular for finding the contours of a pattern with a complex shape. However, the performance of active contour models is often inadequate under noisy environment. In this paper, a robust algorithm based on the Mumford-Shah model is proposed for the segmentation of noisy jacquard images. First, the Mumford-Shah model is discretized on piecewise linear finite element spaces to yield greater stability. Then, an iterative relaxation algorithm for numerically solving the discrete version of the model is presented. In this algorithm, an adaptive triangular mesh is refined to generate Delaunay type triangular mesh defined on structured triangulations, and then a quasi-Newton numerical method is applied to find the absolute minimum of the discrete model. Experimental results on noisy jacquard images demonstrated the efficacy of the proposed algorithm.展开更多
Pupil localization is a very important preprocessing step in many reel applications. Accurate and robust pupil localization in non-ideal eye images is a challenging task. A detailed method of pupil localization in non...Pupil localization is a very important preprocessing step in many reel applications. Accurate and robust pupil localization in non-ideal eye images is a challenging task. A detailed method of pupil localization in non-ideal eye images is proposed. This method is implemented in three main phases： first, segment the rough pupil region based on Gaussian Mixture Model： then modify the rough segmentation result using morphological method to minimize the influence of some disturbing factors; last estimate the pupil parameters based on minimizing the least square error. The proposed method is first tested on CASIA iris image dataset, and then on our self-captured iris dataset which contains a wider variety of iris images. Experiments show that the proposed method can perform well for nonideal eye images of various qualities.展开更多
Based on an efficient algorithm of Euclidean distance transform for binary images, a circuit of O(N2) size is proposed. With in-place calculation, both the intermediate data storing and the result output use the same ...Based on an efficient algorithm of Euclidean distance transform for binary images, a circuit of O(N2) size is proposed. With in-place calculation, both the intermediate data storing and the result output use the same memory with the input data. This reduces the amount of memory largely. By replacing multipliers with counters, comparators, and adders, the circuit size is further reduced and its calculation speed is improved also.展开更多
文摘The paper focuses on location of seal imprints on Chinese bank-checks based on region growing.Region growing method can be applied to searching and locating connection region in an image.A seal imprint,however,is generally composed of various connection regions which are unconnected to each other.In order to locate the seal imprint,these connection regions must be fused together.In the paper,an algorithm for locating seal imprints on Chinese bankchecks based on region growing is proposed, of which a fusion criterion for connection regions in a seal imprint is put forth based on the image feature of Chinese bankcheck,and a center-rays model is proposed to find the topological relationship between connection regions,for which externally-tangent rectangle of region is used as the mark of location of region.The location experiment is achieved with a false-acceptance rate of 7.1% and a false-rejection rate of 0% on Chinese bankcheck.
基金Project (No. 2003AA411021) supported by the Hi-Tech Research andDevelopment Program (863) of China
文摘Jacquard image segmentation is one of the primary steps in image analysis for jacquard pattern identification. The main aim is to recognize homogeneous regions within a jacquard image as distinct, which belongs to different patterns. Active contour models have become popular for finding the contours of a pattern with a complex shape. However, the performance of active contour models is often inadequate under noisy environment. In this paper, a robust algorithm based on the Mumford-Shah model is proposed for the segmentation of noisy jacquard images. First, the Mumford-Shah model is discretized on piecewise linear finite element spaces to yield greater stability. Then, an iterative relaxation algorithm for numerically solving the discrete version of the model is presented. In this algorithm, an adaptive triangular mesh is refined to generate Delaunay type triangular mesh defined on structured triangulations, and then a quasi-Newton numerical method is applied to find the absolute minimum of the discrete model. Experimental results on noisy jacquard images demonstrated the efficacy of the proposed algorithm.
基金National Natural Science Foundation (No60427002)863 Project (No2006AA01Z119) (Partly support)
文摘Pupil localization is a very important preprocessing step in many reel applications. Accurate and robust pupil localization in non-ideal eye images is a challenging task. A detailed method of pupil localization in non-ideal eye images is proposed. This method is implemented in three main phases： first, segment the rough pupil region based on Gaussian Mixture Model： then modify the rough segmentation result using morphological method to minimize the influence of some disturbing factors; last estimate the pupil parameters based on minimizing the least square error. The proposed method is first tested on CASIA iris image dataset, and then on our self-captured iris dataset which contains a wider variety of iris images. Experiments show that the proposed method can perform well for nonideal eye images of various qualities.
文摘Based on an efficient algorithm of Euclidean distance transform for binary images, a circuit of O(N2) size is proposed. With in-place calculation, both the intermediate data storing and the result output use the same memory with the input data. This reduces the amount of memory largely. By replacing multipliers with counters, comparators, and adders, the circuit size is further reduced and its calculation speed is improved also.
