• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.133-139
• /
• 2004

In this paper. we propose a medical image processing method for detection of periodontal disease by geometric analysis on dental digital radiography. This paper proposes the method of an automatic image alignment and detection of minute changes, to overcome defects in the conventional subtraction radiography by image processing technique, that is necessary for getting subtraction image and ROI(Region Of Interest) focused on a selection method using the geometric features in target images. Therefore, we use these methods because they give accuracy, consistency and objective information or data to results. In result, easily and visually we can identify minute differences in the affected parts whether they have problems or not, and using application system.

• Journal of Korea Multimedia Society
• /
• v.16 no.6
• /
• pp.756-763
• /
• 2013

Bilateral filter (BF), functioning by two Gaussian filters, domain and range filter is a nonlinear filter for sharpness enhancement and noise removal. In infrared (IR) small target detection field, the BF is designed by background predictor for predicting background not including small target. For this, the standard deviations of the two Gaussian filters need to be changed adaptively in background and target region of an infrared image. In this paper, the proposed bilateral filter make the standard deviations changed adaptively, using variance feature of mean values of surrounding block neighboring local filter window. And, in case the variance of mean values for surrounding blocks is low for any processed pixel, the pixel is classified to flat background and target region for enhancing background prediction. On the other hand, any pixel with high variance for surrounding blocks is classified to edge region. Small target can be detected by subtracting predicted background from original image. In experimental results, we confirmed that the proposed bilateral filter has superior target detection rate, compared with existing methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.6
• /
• pp.105-114
• /
• 2011

The snake algorithm is widely adopted to track objects by extracting the active contour of the object from background. However, it fails to track the target converging to the background if there exists background whose gradient is greater than that of the pixels on the contour. Also, the contour may shrink when the target moves fast and the snake algorithm misses the boundary of the object in its searching window. To alleviate these problems, we propose an improved algorithm that can track object contour more robustly. Firstly, we propose two external energy functions, the edge energy and the contrast energy. One is designed to give more weight to the gradient on the boundary and the other to reflect the contrast difference between the object and background. Secondly, by computing the motion vector of the contour from the difference of the two consecutive frames, we can move the snake pointers of the previous frame near the region where the object boundary is probable at the current frame. Computer experiments show that the proposed method is more robust to the complicated background than the previously known methods and can track the object with fast movement.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.11
• /
• pp.101-108
• /
• 2007

In this paper, we propose and verify an adaptive block watermarking algorithm based on JPEG2000 DWT, which determines watermarking for the original image by two scaling factors in order to overcome image degradation and blocking problem at the edge. Adaptive block watermarking algorithm uses 2 scaling factors, one is calculated by the ratio of present block average to the next block average, and the other is calculated by the ratio of total LL subband average to each block average. Signals of adaptive block watermark are obtained from an original image by itself and the strength of watermark is automatically controlled by image characters. Instead of conventional methods using identical intensity of a watermark, the proposed method uses adaptive watermark with different intensity controlled by each block. Thus, an adaptive block watermark improves the visuality of images by 4$\sim$14dB and it is robust against attacks such as filtering, JPEG2000 compression, resizing and cropping. Also we implemented the algorithm in ASIC using Hynix 0.25${\mu}m$ CMOS technology to integrate it in JPEG2000 codec chip.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.18 no.1
• /
• pp.696-701
• /
• 2017

This paper proposes an improved de-interlacing method that converts interlaced images into progressive images from one field. First, it calculates inter-pixel values applying third-order spline interpolation for the horizontal direction from four upper lower pixel values of missing pixels. From inter-pixel values obtained from spline interpolation and upper lower pixels with value, the proposed method makes an accurate estimate of the direction by applying the correlation between upper and lower pixels. The correlation between upper and lower pixels is calculated in nine directions of a missing pixel by using values obtained from spline interpolation and pixels with value. The direction of an edge is determined as the direction in which the correlation between upper and lower pixels is at its minimum. Thus, a missing pixel is calculated by taking the average of upper lower pixels obtained from the predicted direction of an edge. From the simulation results, there are problems in that it takes a bit more time for processing, but it is expected that the time problem will be improved by increasing CPU processing speed. As for image quality, it is shown that the proposed method improves both subjective and objective image quality and quantitatively improves picture signal-to-noise ratio (PSNR) in the range between 0.1 dB to 0.5 dB, as compared with previously presented de-interlacing methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2953-2960
• /
• 2014

In the field of image recognition, circle detection is one of the most widely used techniques. Conventional algorithms are mainly based on Hough transform, which is the most straightforward algorithm for detecting circles and for providing enough robust algorithm. However, it suffers from large memory requirements and high computational loads, and sometimes tends to detect incorrect circles. This paper proposes an optimal circle detection and approximation method which is applicable for inspecting fiber optic connector endface. The proposed method finds initial center coordinates and radius based on the initial edge lines. Then, by introducing the simplified K-means algorithm, the proposed method investigates a substitute-circle by minimizing the area of non-overlapped regions. Through extensive simulations, it is shown that the proposed method can improve the error rate by as much as 67% and also can reduce the computing time by as much as 80%, compared to the Hough transform provided by the OpenCV library.

• Progress in Medical Physics
• /
• v.24 no.2
• /
• pp.85-91
• /
• 2013

At present, megavoltage computed tomography (MVCT) is the only method used to correct the position of tomotherapy patients. MVCT produces extra radiation, in addition to the radiation used for treatment, and repositioning also takes up much of the total treatment time. To address these issues, we suggest the use of a video image-guided setup (VIGS) system for correcting the position of tomotherapy patients. We developed an in-house program to correct the exact position of patients using two orthogonal images obtained from two video cameras installed at $90^{\circ}$ and fastened inside the tomotherapy gantry. The system is programmed to make automatic registration possible with the use of edge detection of the user-defined region of interest (ROI). A head-and-neck patient is then simulated using a humanoid phantom. After taking the computed tomography (CT) image, tomotherapy planning is performed. To mimic a clinical treatment course, we used an immobilization device to position the phantom on the tomotherapy couch and, using MVCT, corrected its position to match the one captured when the treatment was planned. Video images of the corrected position were used as reference images for the VIGS system. First, the position was repeatedly corrected 10 times using MVCT, and based on the saved reference video image, the patient position was then corrected 10 times using the VIGS method. Thereafter, the results of the two correction methods were compared. The results demonstrated that patient positioning using a video-imaging method ($41.7{\pm}11.2$ seconds) significantly reduces the overall time of the MVCT method ($420{\pm}6$ seconds) (p<0.05). However, there was no meaningful difference in accuracy between the two methods (x=0.11 mm, y=0.27 mm, z=0.58 mm, p>0.05). Because VIGS provides a more accurate result and reduces the required time, compared with the MVCT method, it is expected to manage the overall tomotherapy treatment process more efficiently.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.3
• /
• pp.249-255
• /
• 2017

The finger vein recognition technology is a method to acquire a finger vein image by illuminating infrared light to the finger and to authenticate a person through processes such as feature extraction and matching. In order to recognize a finger vein, a 2D mask-based two-dimensional convolution method can be used to detect a finger edge but it takes too much computation time when it is applied to a low cost micro-processor or micro-controller. To solve this problem and improve the recognition rate, this study proposed an extraction method for the region of interest based on virtual core points and moving average filtering based on the threshold and absolute value of difference between pixels without using 2D convolution and 2D masks. To evaluate the performance of the proposed method, 600 finger vein images were used to compare the edge extraction speed and accuracy of ROI extraction between the proposed method and existing methods. The comparison result showed that a processing speed of the proposed method was at least twice faster than those of the existing methods and the accuracy of ROI extraction was 6% higher than those of the existing methods. From the results, the proposed method is expected to have high processing speed and high recognition rate when it is applied to inexpensive microprocessors.