• Fashion & Textile Research Journal
• /
• v.18 no.4
• /
• pp.468-476
• /
• 2016

Recent advancements in optics technology enable us to realize fast scans of hands using two-dimensional (2D) image scanners. In this paper, we propose an automatic hand measurement system using 2D image scanners for customized glove production. To develop the automatic hand measurement system, firstly hand scanning devices has been constructed. The devices are designed to block external lights and have user interface to guide hand posture during scanning. After hands are scanned, hand contour is extracted using binary image processing, noise elimination and outline tracing. And then, 19 hand landmarks are automatically detected using an automatic hand landmark detection algorithm based on geometric feature analysis. Then, automatic hand measurement program is executed based on the automatically extracted landmarks and measurement algorithms. The automatic hand measurement algorithms have been developed for 18 hand measurements required for custom-made glove pattern making. The program has been coded using the C++ programming language. We have implemented experiments to demonstrate the validity of the system using 11 subjects (8 males, 3 females) by comparing automatic 2D scan measurements with manual measurements. The result shows that the automatic 2D scan measurements are acceptable in the customized glove making industry. Our evaluation results confirm its effectiveness and robustness.

• Journal of Korea Multimedia Society
• /
• v.10 no.10
• /
• pp.1271-1283
• /
• 2007

To detect defect of FPD(flat panel displays) is very difficult due to uneven illumination on FPD panel image. This paper presents a method to detect various types of defects using the approximated image of the uneven illumination by B-spline. To construct a approximated surface, corresponding to uneven illumination background intensity, while reducing random noises and small defect signal, only the lowest smooth subband is used by wavelet decomposition, resulting in reducing the computation time of taking B-spline approximation and enhancing detection accuracy. The approximated image in lowest LL subband is expanded as the same size as original one by wavelet reconstruction, and the difference between original image and reconstructed one becomes a flat image of compensating the uneven illumination background. A simple binary thresholding is then used to separate the defective regions from the subtracted image. Finally, blob analysis as post-processing is carried out to get rid of false defects. For applying in-line system, the wavelet transform by lifting based fast algorithm is implemented to deal with a huge size data such as film and the processing time is highly reduced.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.418-423
• /
• 2004

The motion estimation algorithm based block matching is a widely used in the international standards related to video compression, such as the MPEG series and H.26x series. Full search algorithm(FA) ones of this block matching algorithms is usually impractical because of the large number of computations required for large search region. Fast search algorithms and conventional binary block matching algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is less performance than full search algorithm. This paper presents new Boolean matching algorithm, called BCBM(Bit Converted Boolean Matching). Proposed algorithm has performance closed to the FA by Boolean only block matching that may be very efficiently implemented in hardware for real time video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.08㏈ loss than FA but is about 0.96∼2.02㏈ gain than fast search algorithm and conventional Boolean matching algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1671-1678
• /
• 2006

A real time system realization for binocular eyeball tracking mouse on the computer monitor being far from 30-40cm is presented in the paper. The processing for searching eyeball and tracking the cursor are that a facial image is acquired by the small CCD camera, convert it into binary image, search for the eye two using the five region mask method in the eye surroundings and the side four points diagonal positioning method is searched the each iris. The tracking cursor is matched by measuring the iris central moving position. The cursor controlling is achieved by comparing two related distances between the iris maximum moving and the cursor moving to calculate the moving distance from gazing position and screen. The experimental results show that the binocular eyeball mouse system is simple and fast to be real time.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.2
• /
• pp.126-131
• /
• 2004

Full search algorithm(FA) provides the best performance but this is usually impractical because of the large number of computations required for large search region. Fast search and conventional Boolean matching algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is difficult of implementation of hardware because of high control overhead and that is less performance than FA. This paper presents new Boolean matching algorithm, called BCBM(Bit Converted Boolean Matching). Proposed algorithm has performance closed to the FA by Boolean only block matching that may be very efficiently implemented in hardware for real time video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.08㏈ loss than FA but is about 0.96∼2.02㏈ gain than fast search algorithm and conventional Boolean matching algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.1C
• /
• pp.72-80
• /
• 2009

Look-up table based inverse halftoning from the digital color halftone image is proposed in this paper, which uses vector adaptive filter for the nonexisting patterns in the table. Halftone image is obtained from a continuous -tone image, which can be restored into continuous one from the digital binary image by way of inverse halftoning method. Look-up table based method usually processes fast and has even performances over the various halftoning. The numbers of pixels in the pattern of table and the method how to define the table elements for each R, G, B channels can effect largely for its performance. The proposed method uses 16 pixels in the table considering the diversity of the expressions from their patterns and with memory size as well. This also proposed how to combine R, G, B channels into one. Experimental results showed the better performance in the expression of colors, better color restoration and the short processing time compared with the conventional ones.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1487-1494
• /
• 2012

This paper proposes an algorithm detecting the skew of the degraded as well as the clear document images using edge and correcting it. The proposed algorithm detects edges in a character region selected by image complexity and generates projection histograms by projecting them to various directions. And then it detects the document skew by estimating the edge concentrations in the histograms and corrects the skewed document image. For the fast skew detection, the proposed algorithm uses downsampling and 3 step coarse-to-fine searching. In the skew detection of the clear and the degraded images, the maximum and the average detection errors in the proposed algorithm are about 50% of one in a conventional similar algorithm and the processing time is reduced to about 25%. In the non-uniform luminance images acquired by a mobile device, the conventional algorithm can't detect skews since it can't get valid binary images, while the proposed algorithm detect them with the average detection error of 0.1o or under.

• The KIPS Transactions:PartB
• /
• v.11B no.1
• /
• pp.13-20
• /
• 2004

In the real-time automatic face recognition technique, accurate face detection is essential and very important part because it has the effect to face recognition performance. In this paper, we use color information, edge information, and binary information to detect candidate regions of eyes from Input image, and then detect face candidate region using the center point of the detected eyes. We verify both eye candidate region and face candidate region using Support Vector Machines(SVM). It is possible to perform fast and reliable face detection because we can protect false detection through these verification process. From the experimental results, we confirmed the Proposed algorithm in this paper shows excellent face detection rate over 99%.

• The Journal of the Acoustical Society of Korea
• /
• v.37 no.1
• /
• pp.12-20
• /
• 2018

Efforts have been made to reconstruct low-resolution underwater images to high-resolution ones by using the image SR (Super-Resolution) method, all to improve efficiency when acquiring side-scan sonar images. As side-scan sonar images are similar with the optical images with respect to exploiting 2-dimensional signals, conventional image restoration methods for optical images can be considered as a solution. One of the most typical super-resolution methods for optical image is a sparse coding and there are studies for verifying applicability of sparse coding method for underwater images by analyzing sparsity of underwater images. Sparse coding is a method that obtains recovered signal from input signal by linear combination of dictionary and sparse coefficients. However, it requires huge computational load to accurately estimate sparse coefficients. In this study, a sparse coding based underwater image super-resolution method is applied while a selective reconstruction method for object region is suggested to reduce the processing time. For this method, this paper proposes an edge detection and object and non object region classification method for underwater images and combine it with sparse coding based image super-resolution method. Effectiveness of the proposed method is verified by reducing the processing time for image reconstruction over 32 % while preserving same level of PSNR (Peak Signal-to-Noise Ratio) compared with conventional method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.61-71
• /
• 2004

Recently, various techniques for face detection are studied, but most of them still have problems on processing in real-time. Therefore, in this paper, we propose novel techniques for real-time detection of human faces in sequential images using motion and chroma information. First, background model is used to find a moving area. In this procmoving area. edure, intensity values for reference images are averaged, then skin-color are detected in We use HCr color-space model and adaptive threshold method for detection. Second, binary image labeling is applied to acquire candidate regions for faces. Candidates for mouth and eyes on a face are obtained using differences between green(G) and blue(B), intensity(I) and chroma-red(Cr) value. We also considered distances between eye points and mouth on a face. Experimental results show effectiveness of real-time detection for human faces in sequential images.