• Transactions of the Korean Society of Mechanical Engineers B
• /
• 제23권3호
• /
• pp.398-407
• /
• 1999

In the present image processing technique, the concept of the gradient indicator(GI) has been introduced to find out the depth-of-field in sizing large particles ranging from $30{\mu}m$ to $30{\mu}m$ where using of the concept of the normalized contrast value(VC) is not appropriate. The gradient indicator is defined as the ratio of the local value to the maximum possible value of the gray-level gradient in an image frame. The gradient indicator decreases with the increases of the particle size and the distance from the exact focal plane. A particle is considered to be in focus when the value of the gradient indicator at its image boundary stays above a critical value. This critical gradient indicator($GI_{critical}$) is defined as the maximum gradient indicator($GI_{max}$) subtracted by a constant ${\Delta}GI$ which is to account for the particle-size effect. In the present ca.so, the value of ${\Delta}GI$ was set to 0.28 to keep the standard deviation of the measured particles mostly within 0.1. It was also confirmed that, to find the depth-of-field for small particles(${\leq}30{\mu}m$) with the same measurement accuracy, tho concept of the critical normalized contrast($VC_{critical}$) is applicable with 85% of the maximum normalized contrast value($VC_{max}$). Finally, the depth-of-field was checked for the size range between $10{\mu}m$ and $300{\mu}m$ when the both in-focus criteria ($GI_{critical}$ and $VC_{critical}$) were adopted. The change of the depth-of-field with the particle size shows good linearity in both the VC-applicable and the GI-applicable ranges with a reasonable accuracy.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• 제23권1호
• /
• pp.27-35
• /
• 2009

The moving picture blur noise of LCD is measured and the characteristics of it are evaluated. From the results, blur noise is generated only when the sight line moves while pursuing the moving image and blur noise is not generated when the sight line is fixed. In addition, decrease of gray level by the image blur has a linearity and velocity dependence. The blur noise simulator based on this experimental results is developed. From the results of blur noise simulation, the faster the moving speed of image is, the more blur noise has increased and these agree with the results of measurement. In the result of simulating blur noise characteristics by the duty ratio control of backlight, noise is reduced by lowering of the duty ratio. but the blur noise increases if there is in the both of adjacent two frames. Moreover, the case of doubling the frame rate to 120[Hz], decreasing the moving speed of the image by making an new image between the adjacent two frames brings the reduction of blur noise.

• Journal of the Korean Institute of Intelligent Systems
• /
• 제25권5호
• /
• pp.483-488
• /
• 2015

This paper presents a local binary pattern(LBP) for effectively classifying textures, which is based on the multidimensional intensity difference between the adjacent pixels in the block image. The intensity difference by considering the a extent of 4 directional changes(verticality, horizontality, diagonality, inverse diagonality) in brightness between the adjacent pixels is applied to reduce the computation load as a results of decreasing the levels of histogram for classifying textures of image. And the binary patterns that is represented by the relevant intensities within a block image, is also used to effectively classify the textures by accurately reflecting the local attributes. The proposed method has been applied to classify 24 block images from USC Texture Mosaic #2 of 128*128 pixels gray image. The block images are different in size and texture. The experimental results show that the proposed method has a speedy classification and makes a free size block images classify possible. In particular, the proposed method gives better results than the conventional LBP by increasing the range of histogram level reduction as the block size becomes larger.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• 제23권11호
• /
• pp.1377-1383
• /
• 2019

Histogram equalization is the most frequently used algorithm for image enhancement. Its hardware implementation significantly outperforms in time its software version. The overall performance of FPGA-based implementation of histogram equalization can be improved by applying pipelining in the design and by exploiting the multipliers and a lot of SRAM blocks which are embedded in recent FPGAs. This work proposes how to implement a fast histogram equalization circuit for 8-bit gray level images. The proposed design contains a FIFO to perform equalization on an image while the histogram for next image is being calculated. Because of some overlap in time for histogram equalization, embedded multipliers and pipelined design, the proposed design can perform histogram equalization on a pixel nearly at a clock. And its dual parallel version outperforms in time almost two times over the original one.

• The Transactions of the Korea Information Processing Society
• /
• 제6권4호
• /
• pp.1112-1119
• /
• 1999

Digital watermarking is to embed imperceptible mark into image, video, audio and text data to prevent the illegal copy of multimedia data, arbitrary modification, and also illegal sales of the copes without agreement of copyright ownership. The DCT(discrete Cosine Transforms) transforms of original image is conducted in this research and these DCT coefficients are expanded by Fourier series expansion algorithm. In order to embed the imperceptible and robust watermark, the Fourier coefficients(lower frequency coefficients) can be calculated using sine and cosine function which have a complete orthogonal basis function, and the watermark is embedded into these coefficients, In the experiment, we can show robustness with respect to image distortion such as JPEG compression, bluring and adding uniform noise. The correlation coefficient are in the range from 0.5467 to 0.9507.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• 제41권4호
• /
• pp.75-86
• /
• 2004

This paper proposes a method to speed up the document image binarization using a water flow model. The proposed method extracts the region of interest (ROI) around characters from a document image and restricts pouring water onto a 3-dimensional terrain surface of an image only within the ROI. The amount of water to be filed into a local valley is determined automatically depending on its depth and slope. The proposed method accumulates weighted water not only on the locally lowest position but also on its neighbors. Therefore, a valley is filed enough with only one try of pouring water onto the terrain surface of the ROI. Finally, the depth of each pond is adaptively thresholded for robust character segmentation, because the depth of a pond formed at a valley varies widely according to the gray-level difference between characters and backgrounds. In our experiments on real document images, the Proposed method has attained good binarization performance as well as remarkably reduced processing time compared with that of the existing method based on a water flow model.

• Journal of Korean Academy of Oral and Maxillofacial Radiology
• /
• 제20권2호
• /
• pp.187-198
• /
• 1990

Examinations of the temporomandibular joints were performed on a 1.5 Tesla magnetic resonance (MR) system. An MR surface receiver coil 3 inch in diameter was placed on plastic frame, the patient's head being placed in the frame so that the coil was pressed against the temporal region. In taking advantage of the magnetic resonance imaging that has been studied briskly till now, author obtained the images of parasagittal and paracoronal planes about the temporomandibular joint by using MPGR (Multi-Planar Gradient Recalled), GRASS (Gradient Recalled Acquisition in the Steady State), and CSMEMP (Contiguous Slice Multiple Echo, Multi-Planar), that differ from the Spin Echo pulse sequence which the previous authors used. Five subjects with no symptoms of temporomandibular joint pain and dysfunction were studied. The plane images obtained by these methods were compared with those by Spin Echo pulse sequence. The results were as follows: 1. The optimal repetition times (TR) and echo times (TE) for T.M.J. image were; a. 400 msec and 18 msec in PMGR pulse sequence. b. 40 msec and 12 msec in GRASS pulse sequence. c. 700 msec and 30 msec in CSMEMP pulse sequence. d. 500 msec and 20 msec in Spin Echo pulse sequence. 2. When the MPGR pulse sequence was using, T2-weighted image was obtained in very short time. On the image of the paracoronal plane by GRASS pulse sequence, meniscus showed the moderate signal intensity, and the meniscus and its anteromedial, posterolateral attachments were observed definitely with gray color. 4. The signal intensity of Spin Echo pulse sequence was equal to that of CSMEMP pulse sequence, but the image by CSMEMP pulse sequence showed relatively lower level in its resolution.

• Journal of the Korea Society of Computer and Information
• /
• 제20권4호
• /
• pp.41-48
• /
• 2015

Recently, the spread of 3D printers has been increasing the demand for 3D models. However, the creation of 3D models should have a trained specialist using specialized softwares. This paper is about an algorithm to produce a 3D model from a single sheet of two-dimensional front face photograph, so that ordinary people can easily create 3D models. The background and the foreground are separated from a photo and predetermined constant number vertices are placed on the seperated foreground 2D image at a same interval. The arranged vertex location are extended in three dimensions by using the gray level of the pixel on the vertex and the characteristics of eyebrows and nose of the nomal human face. The separating method of the foreground and the background uses the edge information of the silhouette. The AdaBoost algorithm using the Haar-like feature is also employed to find the location of the eyes and nose. The 3D models obtained by using this algorithm are good enough to use for 3D printing even though some manual treatment might be required a little bit. The algorithm will be useful for providing 3D contents in conjunction with the spread of 3D printers.

• Journal of Korean Society for Geospatial Information Science
• /
• 제11권1호
• /
• pp.13-19
• /
• 2003

In this paper we discussed the processing procedures of histogram equalization(HE) method and brightness preserving bi-histogram equalization(BBHE) method in the contrast enhancement methods for the performance comparison. With remotely sensed image data of Landsat TM we compared the performances of three methods of Min-Max method, HE method, BBHE method. The experimental results demonstrate that the HE method and BBHE method are more effective in the contrast enhancement performances than the Min-Max method. In the HE method the mean brightness of the resultant output images approached to the middle gray level with regardless of input image mean. In the BBHE method, it is capable of preserving the mean brightness of a original image compared to the HE method while enhancing the contrast of original image effectively. Thus BBHE method is provided more natural enhancement effect than the HE method.

• Journal of KIISE:Computing Practices and Letters
• /
• 제10권6호
• /
• pp.499-506
• /
• 2004

The copper foil surface inspection system is necessary for the factory automation and product quality. The developed system is composed of the high speed line scan camera, the image capture board and the processing computer. For the system resource utilization and real-time processing, multi-threaded architecture is introduced. There are one image capture thread, 2 or more defect detection threads, and one defect communication thread. To process the high-speed input image data, the I/O overlap is used through the double buffering. The defect is first detected by the predetermined threshold. To cope with the light irregularity, the compensation process is applied. After defect detection, defect type is classified with the defect width, eigenvalue ratio of the defect covariance matrix and gray level of defect. In experiment, for high-speed input image data, real-time processing is possible with multi -threaded architecture, and the 89.4% of the total 141 defects correctly classified.