• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.05a
• /
• pp.813-816
• /
• 2005

최근 휴대폰의 활용 범위는 단순히 사용자간의 통신이라는 기본적인 목적을 넘어서 다양한 기능을 제공하고 있다. 그중 휴대폰에 카메라를 탑재하여 디지털 카메라의 기능을 혼합한 휴대폰은 최근 각광을 받고 있으며 휴대폰에 탑재된 카메라의 기능은 디지털 카메라의 메가 픽셀 급 화질을 제공하는 정도의 수준으로 발전하였으며 이미 그 수요는 대중화되어 가고 있다. 이런 카메라 폰을 응용한 연구 분야로 생체 인식 기술을 적용할 수 있으며, 본 논문에서는 휴대폰 환경에서의 홍채 인식을 위한 홍채 영역에서의 홍채 코드 추출에 관한 방법을 제안한다. 휴대폰에서의 홍채 인식에 사용되는 홍채 코드 추출 과정은 다음과 같다. 먼저 휴대폰 카메라를 통해 얻은 메가 픽셀 급 영상($2048{\times}1536$ pixel 8bit gray Image)에서 동공위치 추적 & 홍채 영역 추출 알고리즘[1]을 이용하여 눈 영상($640{\times}480$ pixel 8bit gray Image))을 추출한다. 이렇게 추출된 눈 영상 중에 홍채 코드 인식 에러율을 좀더 낮추기 위해 눈썹영역, 안경에 의해 반사되는 반사광(Specular Reflection), 눈꺼풀 영역을 눈 영역에서 제거 하는 과정을 거친다. 이 논문에서는 위와 같은 과정을 거쳐 얻어진 홍채 영상에 그대로 극좌표 가버 필터[2]를 씌워 홍채 코드를 추출해내기 때문에 기존 보간법을 이용한 스트레칭 된 홍채 영상에서의 홍채 코드 추출보다 잘못된 홍채 코드 정보를 줄일 수 있으며 휴대폰이라는 특수한 환경에서의 홍채 코드 추출이란 점을 고려하여 가버 필터를 고주파와 저주파로 나누어 미리 설계해두어 좀더 빠르고 정확한 홍채 코드를 추출해 내는 방법을 제안한다. 실험 결과, 기존 방식보다 극좌표 가버 필터를 사용한 홍채 코드 추출 실험에서 보다 높은 인식률을 보였다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3290-3299
• /
• 2000

Digital watermarking has similar concepts with channel coding thechnique for transferring data with minimizing error in noise environment, since it should be robust to various kinds of data manipulation for protecting copyrights of multimedia data. This paper proposes a digital watermarking technique which is robust to various kinds of data manipulation. Intellectual property rights information is encoded using a convolutional code, and block-interleaving technique is applied to prevent successive loss of encoded data. Encoded intelloctual property rithts informationis embedded using spread spectrum technique which is robust to cata manipulation. In order to reconstruct intellectual property rights information, watermark signalis detected by covariance between watermarked image and pseudo rando noise sequence which is used to einbed watermark. Embedded intellectual property rights information is obtaned by de-interleaving and cecoding previously detected wtermark signal. Experimental results show that block interleaving watermarking technique can detect embedded intellectial property right informationmore correctly against to attacks like Gaussian noise additon, filtering, and JPEG compression than general spread spectrum technique in the same PSNR.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.169-178
• /
• 2001

The demand for high-resolution images is gradually increasing, whereas many imaging systems have been designed to allow a certain level of aliasing during image acquisition. Thus, digital image processing approaches have recently been investigated to reconstruct a high-resolution image from aliased low-resolution images. However, since the sub-pixel motion information is assumed to be accurate in most conventional approaches, the satisfactory high-resolution image cannot be obtained when the sub-pixel motion information is inaccurate. Therefore, in this paper we propose a new algorithm to reduce the distortion in the reconstructed high-resolution image due to the inaccuracy of sub-pixel motion information. For this purpose, we analyze the effect of inaccurate sub-pixel motion information on a high-resolution image reconstruction, and model it as zero-mean additive Gaussian errors added respectively to each low-resolution image. To reduce the distortion we apply the modified multi-channel image deconvolution approach to the problem. The validity of the proposed algorithm is both theoretically and experimentally demonstrated in this paper.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.12
• /
• pp.3275-3284
• /
• 1998

In this paper, we deseribe a Medical Image Information System. Our system stores and manages 5 dimensional medical image data and provides the 3 dimensional medical data via the Internet. The Internet standard VR format. VRML(Virtual Reality Modeling Language) is used to represent the 3I) medical image data. The 3D images are reconstructed from medical image data which are enerated by medical imaging systems such ans CT(Computerized Tomography). MRI(Magnetic Resonance Imaging). PET(Positron Emission Tomograph), SPECT(Single Photon Emission Compated Tomography). We implemented the medical image information system shich rses a surface-based rendering method for the econstruction of 3D images from 2D medical image data. In order to reduce the size of image files to be transfered via the Internet. The system can reduce more than 50% for the triangles which represent the surfaces of the generated 3D medical images. When we compress the 3D image file, the size of the file can be redued more than 80%. The users can promptly retrieve 3D medical image data through the Internet and view the 3D medical images without a graphical acceleration card, because the images are represented in VRML. The image data are generated by various types of medical imaging systems such as CT, MRI, PET, and SPECT. Our system can display those different types of medical images in the 2D and the 3D formats. The patient information and the diagnostic information are also provided by the system. The system can be used to implement the "Tele medicaine" systems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.10
• /
• pp.1234-1239
• /
• 2019

This paper proposes a method for measuring fine dust concentration through digital processing of images captured by only existing CCTVs without additional equipment. This image processing algorithm consists of noise reduction, edge sharpening, ROI setting, edge strength calculation, and correction through HSV conversion. This algorithm is implemented using the C ++ OpenCV library. The algorithm was applied to CCTV images captured over a month. The edge strength values calculated for the ROI region are found to be closely related to the fine dust concentration data. To infer the correlation between the two types fo data, a trend line in the form of a power equation is established using MATLAB. The number of data points deviating from the trend line accounts for around 12.5%. Therefore, the overall accuracy is about 87.5%.

• The Journal of Korean Association of Computer Education
• /
• v.9 no.2
• /
• pp.101-109
• /
• 2006

We propose an adaptive digital watermarking algorithm using HVS(human visual system) and SOM(Self-Organizing Map) among neural networks. This method adjusts adaptively the strength of the watermark which is embedded in different blocks according to block classification in DCT(Discrete Cosine Transform) domain. All blocks in 3 classes out of 4 are selected to embed a watermark. Watermark sequences are embedded in 6 lowest frequency coefficients of each block except the DC component. The experimental results are excellent.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.7
• /
• pp.871-880
• /
• 2002

In this paper, I proposed the adaptive watermarking based on the discrete wavelet transform for the very robust watermarking against intentional distortion which attacks on image. A watermark is an binary image such as document(sign), and such watermark image is embedded in the LH and HL band of wavelet transformed domain for copyright protection of image data. To evaluate robustness of the proposed method, we applied some basic algorithm of image processing such as brightening, darkening, sharpening, blurring, cropping, histogram equalizing and lossy compression(JPEG, gif). As a result of experiment, the proposed method has the good image quality and the high perceptibility of watermark. It was demonstrated by experiments that the proposed algorithm can provide an excellent protection under various attacks.

• Journal of Korea Multimedia Society
• /
• v.14 no.11
• /
• pp.1392-1400
• /
• 2011

In most digital imaging applications, high-resolution images or videos are usually desired for later image processing and analysis. The image signal obtained from general imaging system occurs image degradation during the process of image acquirement caused by the optics, physical constraints and the atmosphere effects. Super-resolution reconstruction, one of the solution to address this problem, is image reconstruction technique that produces a high-resolution image from several low-resolution frames in video sequences. In this paper, we propose an improved super-resolution method using Projection onto Convex Sets (POCS) method based on Shift & Add (S&A). The image using conventional algorithms is sensitive to noise. To solve this problem, we propose a fusion algorithm of S&A and POCS. Also we solve the problem using BLPF (Butterworth Low-pass Filter) in frequency domain as optical blur. Our method is robust to noise and has sharpness enhancement ability. Experimental results show that the proposed super-resolution method has better resolution enhancement performance than other super-resolution methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.11
• /
• pp.1637-1643
• /
• 2022

In recent years, the demand for image-processing technology in digital marketing has increased due to the expansion and diversification of the digital market, such as video, security, and machine intelligence. Noise-processing is essential for image-correction and reconstruction, especially in the case of sensitive noises, such as in CT, MRI, X-ray, and scanners. The two main salt and pepper noises have been actively studied, but the details and edges are still unsatisfactory and tend to blur when there is a lot of noise. Therefore, this paper proposes an algorithm that applies a weight-based Euclidean distance equation to the partial mask and uses only the non-noisy pixels that are the most similar to the original as effective pixels. The proposed algorithm determines the type of filter based on the state of the internal pixels of the designed partial mask and the degree of mask deterioration, which results in superior noise cancellation even in highly damaged environments.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.4
• /
• pp.9-16
• /
• 2014

This paper proposes a linear scratch detection and restoration algorithm using pixel data comparison in a single frame or consecutive frames. There exists a high parallelism in that a scratch detection and restoration algorithm needs a large amount of comparison operations. The proposed scratch detection and restoration algorithm is designed with a GPU for fast computation. We test the proposed algorithm in sequential and parallel processing with the set of digital videos in National Archive of Korea. In the experiments, the scratch detection rate of consecutive frames is as fast as about 20% for that of a single frame. The detection and restoration rates of a GPU-based algorithm are similar to those of a CPU-based algorithm, but the parallel implementation speeds up to about 50 times.