• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.392-395
• /
• 2003

This paper describes a new iris segmentation and recognition method, which is robust to noises. Combining statistical classification and elastic boundary fitting, the iris is first segmented. Then, the localized iris image is smoothed by a convolution with a Gaussian function, down-sampled by a factor of filtered with a Laplacian operator, and quantized using the Lloyd-Max method. Since the quantized output is sensitive to a small shift of the full-resolution iris image, the outputs of the Laplacian operator are computed for all space shifts. The quantized output with maximum entropy is selected as the final feature representation. An appropriate formulation of similarity measure is defined for the classification of the quantized output. Experimentally we showed that the proposed method produces superb performance in iris segmentation and recognition.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.1
• /
• pp.127-135
• /
• 1995

The diffusion neural network forms a Gaussian distribution by transferring an excitation to the surround. A DOG(difference of two Gaussians) is obtained by the diffusion neural network. This type of the DOG, which can detect the intensity changes of an image, has the same shape as a LOG(Laplacian of a Gaussian:${\Delta}^2$G) and narrow band pass characteristics. In this paper we show that another type of the DOG which has a very narrow Gaussian for the excitatory and a very wide Gaussian for the inhibitory, can be formed by the diffusion process of this network, This type of the DOG has a wide band width in spatial frequency domain and can be used efficiently in detecting special type of edges.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.4
• /
• pp.325-334
• /
• 2001

It is shown that the multiscale prewhitening matched filter for detecting Gaussian objects in Markov noise can be implemented by the undecimated wavelet transform with a biorthogonal spline wavelet. If the object to be detected is Gaussian shaped and its scale coincides with one of those computed by the wavelet transform, and if the background noise is truly Markov, then optimum detection is realized by thresholding the appropriate details image. Our detection algorithm is applied to the digitized mammograms for detecting microcalcifications. However, microcalcifications are not exactly Gaussian shaped and its background noise may not be Markov. In order to campensate for these discrepancy, Hotelling observer is employed, which is applied to feature vectors comprised of 3-octave wavelet coefficients.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6B
• /
• pp.993-1001
• /
• 2000

This research features a method that quantitatively evaluates the performance of edge detection algorithms. Contrary to conventional methods that evaluate the performance of edge detection as a function of the amount of noise added to he input image, the proposed method is capable of assessing the performance of edge detection algorithms based on chosen parameters that influence the performance of edge detection. We have proposed a quantitative measure, called average performance index, that compares the average performance of different edge detection algorithms. We have applied the method to the commonly used edge detectors, Sobel, LOG(Laplacian of Gaussian), and Canny edge detectors for noisy images that contain straight line edges and curved line edges. Two kinds of noises i.e, Gaussian and impulse noises, are used. Experimental results show that our method of quantitatively evaluating the performance of edge detection algorithms can facilitate the selection of the optimal dge detection algorithm for a given task.

• Proceedings of the KIEE Conference
• /
• 2001.11c
• /
• pp.26-29
• /
• 2001

In a target tracking problem the radar glint noise has non-Gaussian heavy-tailed distribution and will seriously affect the target tracking performance. In most nonlinear situations an Extended Robust Kalman Filter(ERKF) can yield acceptable performance as long as the noises are white Gaussian. However, an Extended Robust $H_{\infty}$ Filter (ERHF) can yield acceptable performance when the noises are Laplacian. In this paper, we use the Interacting Multiple Model(IMM) estimator for the problem of target tracking with glint noise. In the IMM method, two filters(ERKF and ERHF) are used in parallel to estimate the state. Computer simulations of a real target tracking shows that hybrid filter used the IMM algorithm has superior performance than a single type filter.

• Communications for Statistical Applications and Methods
• /
• v.23 no.1
• /
• pp.71-83
• /
• 2016

In this paper we discuss a deconvolution density estimator obtained using the support vector machines (SVM) and Tikhonov's regularization method solving ill-posed problems in reproducing kernel Hilbert space (RKHS). A remarkable property of SVM is that the SVM leads to sparse solutions, but the support vector deconvolution density estimator does not preserve sparsity as well as we expected. Thus, in section 3, we propose another support vector deconvolution estimator (method II) which leads to a very sparse solution. The performance of the deconvolution density estimators based on the support vector method is compared with the classical kernel deconvolution density estimator for important cases of Gaussian and Laplacian measurement error by means of a simulation study. In the case of Gaussian error, the proposed support vector deconvolution estimator shows the same performance as the classical kernel deconvolution density estimator.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.1
• /
• pp.90-98
• /
• 1993

A Gaussian is formed by diffusing a spot excitation. In this paper, a diffusion neural network model is derived from the diffusion equation. And it is shown that a difference of two Gaussians(DOG) may have the same shape as a Laplacian of Gaussian(LOG), A neural network model executing a DOG convolution by diffusing an external excitation is proposed. By this model intensity changes of image may be detected. This model may be implemented economically because each neuron has only four fixed-valued synapes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7A
• /
• pp.522-527
• /
• 2012

In this paper, union upper bound on convolutional coded bit error rates (BER) is derived for downlink orthogonal frequency division multiple access (OFDMA) networks. According to the numerical results, for the small network loads, the BER performance with Laplacian decoding metric outperforms the BER performance with Gaussian decoding metric under downlink OFDMA networks with Viterbi decoder.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.17 no.4
• /
• pp.321-330
• /
• 1999

Automation of observation and positioning of fiducial marks is made possible with the application of image matching technique, developed through the cooperative research effort of computer vision and digital photogrammetry. The major problem in such automation effort is to minimize the computing time and to increase the positional accuracy. Except for scanning and ground control surveying, the interior orientation process was automated in this study, through the development of an algorithm which applies the image matching and image processing techniques. The developed system was applied to close-range photogrammetry and the analysis of the results showed 54% improvement in processing time. For fiducial mark observation during interior orientation, the Laplacian of Gaussian transformation and the Hough transformation were applied to determine the accurate position of the center point, and the correlation matching and the least squares matching method were then applied to improve the accuracy of automated observation of fiducial marks. Image pyramid concept was applied to reduce the computing time of automated positioning of fiducial mark.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.3
• /
• pp.294-299
• /
• 2005

This paper presents the separation performance of the linearly mixed image signals with additive noises by using an independent component analyses(ICAs) of the fixed-point(FP) algorithm based on Newton and secant method, respectively. The Newton's FP-ICA uses the slope of objective function, and the secant's FP-ICA also uses the tangent line of objective function. The 2 kinds of ICA have been applied to the 2 dimensional 2-image with $512\times512$ pixels. Then Gaussian noise and Laplacian noise are added to the mixed images, respectively. The experimental results show that the Newton's FP-ICA has better the separation speed than secant FP-ICA and the secant's FP-ICA has also the better separation rate than Newton's FP-ICA. Especially, the Newton and secant method gives relatively larger improvement degree in separation speed and rate as the noise increases.