Mun-Chol Kim

Chol-Kyu Pak, Mun-Chol Kim, Chang-Ho Rim

In this paper we propose an efficient third-order numerical scheme for backward stochastic differential equations(BSDEs). We use 3-point Gauss-Hermite quadrature rule for approximation of the conditional expectation and avoid spatial interpolation by setting up a fully nested spatial grid and using the approximation of derivatives based on non-equidistant sample points. As a result, the overall computational complexity is reduced significantly. Several examples show that the proposed scheme is of third-order and very efficient.

Chol-Kyu Pak, Mun-Chol Kim, Chang-Ho Rim

In this paper we propose a new kind of high order numerical scheme for backward stochastic differential equations(BSDEs). Unlike the traditional $θ$-scheme, we reduce truncation errors by taking $θ$ carefully for every subinterval according to the characteristics of integrands. We give error estimates of this nonlinear scheme and verify the order of scheme through a typical numerical experiment.

Chol-Kyu Pak, Mun-Chol Kim, O Hun

In this paper we propose a generalized numerical scheme for backward stochastic differential equations(BSDEs). The scheme is based on approximation of derivatives via Lagrange interpolation. By changing the distribution of sample points used for interpolation, one can get various numerical schemes with different stability and convergence order. We present a condition for the distribution of sample points to guarantee the convergence of the scheme.

Chol-Kyu Pak, Mun-Chol Kim, Hun O

In this paper, we propose a new kind of numerical scheme for high-dimensional backward stochastic differential equations based on modified multi-level Picard iteration. The proposed scheme is very similar to the original multi-level Picard iteration but it differs on underlying Monte-Carlo sample generation and enables an improvement in the sense of complexity. We prove the explicit error estimates for the case where the generator does not depend on control variate.

Gwang-Il Ri, Mun-Chol Kim, Su-Rim Ji

The minutia descriptor which describes characteristics of minutia, plays a major role in fingerprint recognition. Typically, fingerprint recognition systems employ minutia descriptors to find potential correspondence between minutiae, and they use similarity between two minutia descriptors to calculate overall similarity between two fingerprint images. A good minutia descriptor can improve recognition accuracy of fingerprint recognition system and largely reduce comparing time. A good minutia descriptor should have high ability to distinguish between different minutiae and at the same time should be robust in difficult conditions including poor quality image and small size image. It also should be effective in computational cost of similarity among descriptors. In this paper, a robust minutia descriptor is constructed using Gabor wavelet and linear discriminant analysis. This minutia descriptor has high distinguishing ability, stability and simple comparing method. Experimental results on FVC2004 and FVC2006 databases show that the proposed minutia descriptor is very effective in fingerprint recognition.