• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.151-156
• /
• 2012

In this paper robust nonlinear image denoising algorithms are introduced for the distribution which is Gaussian in the center and Laplacian in the tails. The distribution is known as the least favorable ${\epsilon}$-contaminated normal distribution that maximizes the asymptotic variance. The proposed filter proves to be the maximum likelihood estimator under the heavy-tailed Gaussian noise environments. It is optimal in the respect of maximizing the efficacy under the above noise environment. Another filter for reducing impulsive noise is proposed by mixing with the myriad filter to propose an amplitude-limited myriad filter. Extensive experiment is conducted with images corrupted with ${\alpha}$-stable noise to analyze the behavior and performance of the proposed filters.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.5
• /
• pp.1050-1056
• /
• 2009

Heart Rate Variability(HRV) is a parameter that represents monitoring variability of time intervals between R-peak in electrocardiography. HRV serves to various applications, such as indices of autonomic functions, prediction of cardiac sudden death, assessment of stress and emotional, etc. However, as measuring R-peak in ECG needs at least 3-electrodes, and it is inconvenient for end users. In this paper, we suggested the modified laplacian electrodes for measuring HRV at one-point, which are producted by MEMS fabrication and have the two circular electrodes on the pad. For optimal position and direction, we performed an experiment that compared with pearson correlation coefficient and the amplitude of signals, between standard lead II and proposed electrodes. We analyzed the HRV parameters, such as standard deviation of the NN interval(SDNN), high frequency(HF), low frequency(LF), LF/HF ratio. The result showed that the average correlation coefficient and amplitude are 0.967 and 0.685 mVpp at the position 2. The coeffiecient correlation between the standard HRV and proposed electrode-HRV is 0.999

• Journal of the Korea Computer Graphics Society
• /
• v.27 no.3
• /
• pp.25-29
• /
• 2021

초박형 라이트필드 카메라 시스템은 이미지 센서 위에 렌즈 어레이를 부착하는 방식으로 만들어진다. 이러한 초박형 라이트필드 카메라는 하나의 이미지 센서를 여러 개의 sub-aperture가 나눠쓰는 방식으로 되어있어 개별 이미지의 분해능이 낮으며, sub-aperture 이미지들을 융합해 추가적인 분해능 향상이 수행되어야 한다. 본 연구에서는 초박형 라이트필드 카메라 시스템을 개발했으며, 개발된 카메라 시스템을 위한 실시간 분해능 향상 알고리즘을 개발, 실험을 통해 검증했다. 개발된 초박형 라이트필드 카메라는 두께 2mm, 24개(6×4)의 551×551 해상도의 sub-aperture로 구성되어 있으며, 임베디드 컴퓨팅 보드를 사용해 휴대가 가능하도록 제작되었다. 실시간 분해능 향상 알고리즘은 임베디드 컴퓨팅 보드의 GPU에서 병렬처리를 통해 라플라시안 피라미드 기반의 이미지 융합 알고리즘을 수행한다. 실험을 통해 검증한 결과로, 개발 시스템은 MTF50값이 평균 35% 정도 개선되었으며, 10.65fps의 처리속도로 실시간 처리가 가능함을 확인했다.

• Journal of IKEEE
• /
• v.26 no.2
• /
• pp.292-298
• /
• 2022

There is a limit to improving the image quality through global processing of images taken under backlighting because too bright and dark parts are mixed in one scene. This paper introduces a method to improve the quality of a photo by making two virtual images that improve the dark and bright areas of a backlit photo, and fusing them with the original image into a Laplacian pyramid. The proposed method reduces the computational burden by using histogram stretching and gamma transformation that can be simplified with LUT when creating the two virtual images. In addition, in order to obtain a color-enhanced image, contrast conversion was performed only on the luminance using the HSV coordinate system. The proposed technique showed its effectiveness by calculating several NIQA indicators using standard image data sets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.7
• /
• pp.935-943
• /
• 1993

In this paper, robust recognition system for tilted facial image was developed. At first, standard facial image and lilted facial image are captured by CCTV camera and then transformed into binary image. The binary image is processed in order to obtain contour image by Laplacian edge operator. We trace and delete outermost edge line and use inner contour lines. We label four inner contour lines in order among the inner lines, and then we extract left and right eye with known distance relationship and with two eyes coordinates, and calculate slope information. At last, we rotate the tilted image in accordance with slope information and then calculate the ten distance features between element and element. In order to make the system invariant to image scale, we normalize these features with distance between left and righ eye. Experimental results show 88% recognition rate for twenty five face images when tilted degree is considered and 60% recognition rate when tilted degree is not considered.

• Journal of Korea Multimedia Society
• /
• v.12 no.7
• /
• pp.929-940
• /
• 2009

This paper presents multipurpose watermarking scheme in coutourlet transform domain for copyright protection, authentication and transform detection. Since contourlet transform can detect more multi direction edge and smooth contour than wavelet transform, the proposed scheme embeds multi watermarks in contourlet domain based on 4-level Laplacian pyramid and 2-level directional filter bank. In the first stage of the robust watermarking scheme for copyright protection, we generates the sequence of circle patterns according to watermark bits and projects these patterns into the average of magnitude coefficients of high frequency directional subbands. Then the watermark bit is embedded into variance distribution of the projected magnitude coefficients. In the second stage that is the semi-fragile watermarking scheme for authentication and transform detection, we embed the binary watermark image in the low frequency subband of higher level by using adaptive quantization modulation scheme. From the evaluation experiment using Checkmark 2.1, we verified that the proposed scheme is superior to the conventional scheme in a view of the robustness and the invisibility.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.42 no.5 s.305
• /
• pp.19-26
• /
• 2005

In this paper, a new method for obtaining three-dimensional shape of an object by measuring relative blur between images using wavelet analysis has been described. Most of the previous methods use inverse filtering to determine the measure of defocus. These methods suffer from some fundamental problems like inaccuracies in finding the frequency domain representation, windowing effects, and border effects. Besides these deficiencies, a filter, such as Laplacian of Gaussian, that produces an aggregate estimate of defocus for an unknown texture, can not lead to accurate depth estimates because of the non-stationary nature of images. We propose a new depth from defocus (DFD) method using wavelet analysis that is capable of performing both the local analysis and the windowing technique with variable-sized regions for non-stationary images with complex textural properties. We show that normalized image ratio of wavelet power by Parseval's theorem is closely related to blur parameter and depth. Experimental results have been presented demonstrating that our DFD method is faster in speed and gives more precise shape estimates than previous DFD techniques for both synthetic and real scenes.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.9
• /
• pp.901-908
• /
• 2016

Edge is the basic characteristic of image, edge detection is very important in image processing applications and computer vision area. Many studies are being performed to detect these edges by domestic and foreign researchers. The conventional edge detection methods such as Roberts, Sobel, Prewitt, and Laplacian etc, which are using a fixed value of mask are widely used and morphological gradient which uses dilation and erosion among morphology process techniques is also widely used. But these methods does not detect edges well in the diagonal direction or gradually changing image parts. Accordingly, in this paper, the modified top-hat and bottom-hat transform algorithms which are detecting edges well in the parts of diagonal direction or gradually changing image are proposed. The proposed algorithms present the detected edge images compared with the conventional methods and are evaluated performance by using cosine similarity.

• Journal of Korea Multimedia Society
• /
• v.12 no.4
• /
• pp.473-482
• /
• 2009

Reconstructed 3D data from computer vision includes necessarily a noise or an error. When these data goes through a mesh process, the different 3D mesh data from original shape comes to make by a noise or an error. This paper proposed the method that smooths a noise effectively by noise analysis in reconstructed 3D data. Because the proposed method is smooths a noise using the area ratio of the mesh, the pre-processing of unusable mesh is necessary in 3D mesh data. This study detects a peak noise and Gaussian noise using the ratio of 3D volume and 2D area of mesh and smooths the noise with respect of its characteristics. The experimental results using synthetic and real data demonstrated the efficacy and performance of proposed algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1371-1378
• /
• 2017

In this paper, we present an upsampling technique for depth map image using selective bilateral weights and a color weight using laplacian function. These techniques prevent color texture copy problem, which problem appears in existing upsamplers uses bilateral weight. First, we construct a high-resolution image using the bicubic interpolation technique. Next, we detect a color texture region using pixel value differences of depth and color image. If an interpolated pixel belongs to the color texture edge region, we calculate weighting values of spatial and depth in $3{\times}3$ neighboring pixels and compute the cost value to determine the boundary pixel value. Otherwise we use color weight instead of depth weight. Finally, the pixel value having minimum cost is determined as the pixel value of the high-resolution depth image. Simulation results show that the proposed algorithm achieves good performance in terns of PSNR comparison and subjective visual quality.