http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : BenZhai Hai (검색결과 4 건)
- 무료
- 기관 내 무료
- 유료
-
An Applied Research on Improved Watershed Algorithm in Medical Image Segmentation
BenZhai Hai,RuiYun Xie,PeiYan Yuan 보안공학연구지원센터 2016 International Journal of Signal Processing, Image Vol.9 No.11
The image segmentation technology is of great significance to the target identification. The watershed segmentation algorithm has wide application in image segmentation. The traditional watershed segmentation often causes the problems of over segmentation and noise sensitivity. Therefore, a medical image segmentation algorithm is proposed based on K-means clustering algorithm and improved watershed algorithm. First, K - means clustering algorithm is used for initial segmentation, and then the concept of similarity is put forward to improve the original watershed algorithm. Finally, the adjacent tiles of the initial segmentation is merged. The magnetic resonance image is regarded as the segmentation object. The experimental result shows that the proposed algorithm effectively solves the problem of the over-segmentation of traditional watershed algorithm, and achieves a satisfactory effect for the image segmentation.
-
Image Encryption Research based on Key Extracted from Iris Feature
RuiYun Xie,MingFei Wang,BenZhai Hai 보안공학연구지원센터 2015 International Journal of Security and Its Applicat Vol.9 No.6
The encryption algorithm has disadvantages like the long key making memory difficult and uneasy safekeeping, which causes a potential threat to the information security. Therefore, a new direction of the encryption method research is to combine the biometric information with the traditional encryption algorithm. The key extracted from the iris and AES encryption algorithm are used in the image encryption algorithm. The db2 wavelet decomposition to the iris region is performed, and the third level high frequency coefficient is extracted as the iris feature codes, from which a 192 bit key is generated by using the stochastic mapping function. The randomness of the key extraction is analyzed. The proposed algorithm is employed to do the encryption test to the image. The encryption effect is compared with the scrambling encryption effect of the classic Arnold method. The experiment results show that security of the encryption image gained by using the proposed algorithm is higher, achieving the purpose of protecting image information.
-
Optimization Algorithm Based on Laplacian Location and Extension Grid
Shaohui Ma,Xinling Sun,Benzhai Hai,Xie Rui-yun 보안공학연구지원센터 2016 International Journal of Grid and Distributed Comp Vol.9 No.9
This article put forward an optimization algorithm of triangle grid model based on Laplacian coordinate constraint and a fast reconstruction algorithm of model topology structure based on STL file, such methods may enhance the quality of triangular patch as well as splendidly remain local geometric features of original grid model. The character of it is there’s unnecessary to distinguish constraint vertex and free vertex no longer and to carry on a double restraints to location and Laplacian coordinate for all vertex, then solve a linear system, which contains double restraint, with least-squares sense to carry on an relocation for all vertex. The experimental results showed that proposed algorithm is provided with a certain advantage in terms of detail features of grid compared with precedent Laplacian optimization algorithm.
-
An Iris Localization Algorithm based on Geometric Features of the Circle
Ming Fei Wang,RuiYun Xie,BenZhai Hai 보안공학연구지원센터 2015 International Journal of Signal Processing, Image Vol.8 No.7
An iris localization algorithm with the fast speed is proposed based on geometric features of the circle combing coarse localization with fine localization to avoid the problem of the slow speed of the classical iris localization algorithm. First, the row and column scanning method is employed to find four strings in the pupil. Four couples of tangency points are located by using the perpendicular bisector of strings and the threshold of the pupil boundary. The mean value of the coordinate parameters of the tangency points is regarded as the parameters for inner edge rough localization parameters. Then the calculus method is used for precise localization of the inner edge. The priori knowledge of the close distance between inner and outer edge centers of the circle is used to narrow the search range of the calculus method localizing outside edge, to significantly improving the speed of iris localization. The experimental results show that the proposed algorithm can improve the speed of iris localization with the high localizing accuracy.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
