안녕하세요. 생체인식연구센터에서 제6회, 제7회 초청세미나를 아래와 같이 실시합니다. 많은 참여 바랍니다.

------------------------------------------------------------
1. 제목 : Vulnerability Analysis of fingerprint and Iris Recognition Systems
2. 일시 : 2004년 3월 18일(목) 오후 4:30 ~
3. 장소 : 연세대학교 산학협동연구관 425호
4. 강사 : Tsutomu Matsumoto(Graduate School of Environment and Information Sciences Yokohama National University)
5. Abstract
   Biometric authentication techniques are convenient, but as opposed to passwords or tokens,
even if biometrics of a particular person were once compromised, they are hard to replace
because they are intrinsic to the person. Therefore, biometric systems must possess the function to
effectively reject fake biometric objects or patterns as well as to protect  the template data against abuse.
We have made "artificial irises" i.e., pieces of papers with printed monotone color patterns similar to irises,
based on the eye pictures captured by an iris image capture device used in an iris recognition system or
by an infrared camera on the market. Such artificial irises are accepted at a certain rate with a certain
matching time by some three models of commercially available iris recognition systems supplied by
plural venders. Two of them are designed typically for PC-login and contain  portable iris image capture devices,
and the rest is a gate control system equipped with a relatively large stationary iris image capture device.
These results may imply the necessity of enhancing the liveness detection function at least for a certain class of iris recognition systems.

-----------------------------------------------------------

1. 제목 : Iterative Methods for Toeplitz Systems and Applicatons to Image Processing
2. 일시 : 2004년 3월 19일(금) 오전 11:00 ~
3. 장소 : 연세대학교 산학협동연구관 425호
4. 강사 : Michael K. Ng(Department of Mathematics, The University of Hong Kong)
5. Abstract
     In this expository talk, we survey some of the latest developments on using
    preconditioned conjugate gradient methods for solving Toeplitz systems.
    One of the main results is that the complexity of solving a large class of $n$-by-$n$ Toeplitz
    systems is reduced to $O(n \log n)$ operations as compared to $O(n \log ^2 n)$
    operations required by fast direct Toeplitz solvers. Applications to Toeplitz-related systems
    arising from image processing are given.
    
------------------------------------------------------------

많은 참석바랍니다.
좋은 하루 되세요,,^^