• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.10a
• /
• pp.423-426
• /
• 1995

An image processing algorithm is developed in order to recognize the type of cars, the position of a number plate and the characters on the plate. To recognize the type af cars, comparison of two images is used. One has a car image, the other is just a background image without car. After that recognition, a vertical line filter is used to find the location of the plate. Finally the similarity method is used to recognize the numbers on the plates.

• Journal of Environmental Science International
• /
• v.11 no.8
• /
• pp.765-771
• /
• 2002

The current study investigated the relationship between image processed data and human visibility data for natural forest scenes from the perspective of color. In particular, the results indicated relatively low Pearson product-moment correlations between the color ratings obtained from the two methods used in the study. The first method measured the color content of slides using a image processing program, while the second used a panel of human judges to rate the color content of each slide.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.3-6
• /
• 2003

A nonlinear iterative filtering based on local statistics and anisotropic diffusion is introduced. Local statistics determines the diffusion coefficient at each iteration step. Anisotropic diffusion can be seen as estimates a piecewise smooth image from the noisy input image in the experimental section, our results are shown to suppress noise with preserving the edges. Therefore, it enhances the image and improves performance.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1992.10a
• /
• pp.298-301
• /
• 1992

A digital image processing approach has been adopted to measure the flank wear area, which is very difficult to measure using conventional techniques. Automatic thresholding of the gray-level values of an image is very useful in automated analysis of image. 1-D entropy thresholding technique is used for image processing and analysis of the flank wear area. This strategy provides more information about drill wear conditions and should therefore have a higher reliability than previous methods. This study calulated quantitatively the flank were area of drill by computer program.

• 제어로봇시스템학회:학술대회논문집
• /
• 1987.10b
• /
• pp.109-114
• /
• 1987

In this thesis, we work on the curve recognition with real time processing and the Robot tracking method on recognized curve. Image information of segment curve is supplied to computer to run to a Robot so that it is a feedback system. Image coordinate frame to world coordinate transformation represents in this paper and curve matching algorithm subscribes by two method, first transformation matching algorithm, second image coordinate matching algorithm. Also Robot running time to computer image processing time relationships finally includes.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 1990.10a
• /
• pp.1-16
• /
• 1990

In this paper, a system to measure treeing degradation phenomena in organic insulating materials, using an image sensor, is discussed. Using an image processing technique, tree features immediately after tree initiation as well as changes in the configuration of the tree were measured. which up to now have been extremely difficult to observe by conventional visual methods. As a result, it was possible to record the image of tree propagation immediately after its first appearance, and to describe the specific characteristics of tree growth in terms of the length, the degraded area and the sequential images.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.12a
• /
• pp.161-164
• /
• 2000

Recently efficient image coding using zerotree have been proposed. In these methods, the locations of nonzero wavelet coefficient are encoded with a tree structure, called zerotree, which can exploit the self-similarity of the wavelet pyramid decomposition across different scales. These are very especially in low bit rate image coding. In this paper, two zerotree image coding algorithm, EZW and SPHIT are briefly introduced, and a new zerotree searching scheme is proposed to emphasize the significance of a wavelet coefficient by its orientation as well as its scale.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.41 no.1
• /
• pp.25-32
• /
• 2004

Nowadays image processing is very useful for some field of traffic applications. The one reason is we can construct the system in a low price, the other is the improvement of hardware processing power, it can be more fast to processing the data. In traffic field, the development of image using system is interesting issue. Because it has the advantage of price of installation and it does not obstruct traffic during the installation. In this study, 1 propose the traffic monitoring system that implement on the embedded system environment. The whole system consists of two main part, one is host controller board, the other is image processing board. The part of host controller board take charge of control the total system interface of external environment, and OSD(On screen display). The part of image processing board takes charge of image input and output using video encoder and decoder, Image classification and memory control of using FPGA, control of mouse signal. And finally, for stable operation of host controller board, uC/OS-II operating system is ported on the board.

• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.525-534
• /
• 2001

Generally, compression and encryption procedures are performed independently in lossless image compression and encryption. When compression is followed by encryption, the compressed-stream should have the property of randomness because its entropy is decreased during the compression. However, when full data is compressed using image compression methods and then encrypted by encryption algorithms, real-time processing is unrealistic due to the time delay involved. In this paper, we propose to combine compression and encryption to reduce the overall processing time. It is method decomposing gray-scale image by means of quadtree compression algorithms and encrypting the structural part. Moreover, the lossless compression ratio can be increased using a transform that provides an decorrelated image and homogeneous region, and the encryption security can be improved using a reconstruction of the unencrypted quadtree data at each level. We confirmed the increased compression ratio, improved encryption security, and real-time processing by using computer simulations.

• Asian-Australasian Journal of Animal Sciences
• /
• v.18 no.6
• /
• pp.868-872
• /
• 2005

Individual management of the animal is the first step towards reaching the goal of precision livestock farming that aids animal welfare. Accurate recognition of each individual animal is important for precise management. Electronic identification of cattle, usually referred to as RFID (Radio Frequency Identification), has many advantages for farm management. In practice, however, RFID implementations can cause several problems. Reading speed and distance must be optimized for specific applications. Image processing is more effective than RFID for the development of precision farming system in livestock. Therefore, the aim of this paper is to attempt the identification of cattle by using image processing. The majority of the research on the identification of cattle by using image processing has been for the black-and-white patterns of the Holstein. But, native Japanese and Korean cattle do not have a consistent pattern on the body, so that identification by pattern is impossible. This research aims to identify to Japanese black cattle, which does not have a black-white pattern on the body, by using image processing and a neural network algorithm. 12 Japanese black cattle were tested. Values of input parameter were calculated by using the face image values of 12 cows. The face was identified by the associate neural memory algorithm, and the algorithm was verified by the transformed face image, for example, of brightness, distortion, noise and angle. As a result, there was difference due to a transformation ratio of the brightness, distortion, noise, and angle. The algorithm could identify 100% in the range from -30 to +30 degrees of brightness, -20 to +40 degrees of distortion, 0 to 60% of noise and -20 to +30 degree of angle transformed images.