• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.3
• /
• pp.21-29
• /
• 2000

In this paper, we propose a way to detect a moving object efficiently and to track it using the active blocks. Instead of all Pixels in 8*8 Pixel value, any special pixel is extracted and we detect a moving object by comparison and by analysis the difference image information from darkness value of the same area. In the acquisition of image data by software processing, we reduce the number of data which obtain by convert high resolution image to low resolution image, and we can track a moving object in real time. So it can track a moving object in simple system without all the pixel value of the image data or additional VxD(Virtual x Driver). This system can be useful to track of a moving object in fixed block on PC(Personal Computer) and low custom.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.5
• /
• pp.155-161
• /
• 2009

This paper proposes a high capacity data hiding method using modulus function of pixel-value differencing (PVD) and least significant bit (LSB) replacement method. Many novel data hiding methods based on LSB and PVD methods were presented to enlarge hiding capacity and provide an imperceptible quality. A small difference value for two consecutive pixels is belonged to a smooth area and a large difference one is located on an edge area. In our proposed method, the secret data are hidden on the smooth area by the LSB substitution method and PVD method on the edge area. From the experimental results, the proposed method sustains a higher capacity and still a good quality compared with other LSB and modified PVD methods.

• International Journal of Advanced Culture Technology
• /
• v.6 no.2
• /
• pp.123-128
• /
• 2018

Learning data is composed of 100 characters with 10 different fonts, and test data is composed of 10 characters with a new font that is not used for the learning data. In order to consider the variety of learning data with several different fonts, 10 learning masks are constructed by accumulating pixel values of same characters with 10 different fonts. This process eliminates minute difference of characters with different fonts. After finding maximum values of learning masks, test data is expanded by multiplying these maximum values to the test data. The algorithm calculates sum of differences of two corresponding pixel values of the expanded test data and the learning masks. The learning mask with the smallest value among these 10 calculated sums is selected as the result of the recognition process for the test data. The proposed algorithm can recognize various types of fonts, and the learning data can be modified easily by adding a new font. Also, the recognition process is easy to understand, and the algorithm makes satisfactory results for character recognition.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.8
• /
• pp.1-12
• /
• 2016

In this paper, we propose a very efficient reversible data hiding algorithm using spatial locality and the surface characteristics of image. Spacial locality and a variety of surface characteristics are present in natural images. So, it is possible to precisely predict the pixel value using the locality and surface characteristics of image. Therefore, the frequency is increased significantly at the peak point of the difference histogram using the precisely predicted pixel values. Thus, it is possible to increase the amount of data to be embedded in image using the spatial locality and surface characteristics of image. By using the proposed reversible data hiding algorithm, visually high quality stego-image can be generated, the embedded data and the original cover image can be extracted without distortion from the stego-image, and the embedding data are much greater than that of the previous algorithm. The experimental results show the superiority of the proposed algorithm.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.82-85
• /
• 2004

This paper proposes an advanced circuit for the capacitive type fingerprint sensor signal processing and an effective isolation structure for minimizing an electrostatic discharge(ESD) influence and for removing a signal coupling noise of each sensor pixel. The proposed detection circuit increases the voltage difference between a ridge and valley about $80\%$ more than old circuit. The test chip is composed of $160\;\times\;192$ array sensing cells $(9,913\times11,666\;um^2).$ The sensor plate area is $58\;\times\;58\;um^2$ and the pitch is 60um. The image resolution is 423 dpi. The chip was fabricated on a 0.35um standard CMOS process. It successfully captured a high-quality fingerprint image and performed the registration and identification processing. The sensing and authentication time is 1 sec(.) with the average power consumption of 10 mW at 3.0V. The reveal ESD tolerance is obtained at the value of 4.5 kV.

• Progress in Medical Physics
• /
• v.24 no.4
• /
• pp.259-264
• /
• 2013

The DICOM converter program of the Geant4 Monte Carlo simulation code for the application of radiotherapy was developed. We analysis the header part of the DICOM file and find various parameters, such as matrix size, pixel size, stored data bits, high bit, and padding values. Especially we evaluate every pixel value of the DICOM files. To conform the exact convert of the pixel values, we developed the verify program. As a result, the DICOM formats generated from difference CT vendors can be converted and verified for Genat4 calculations.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.1049-1052
• /
• 2000

In this paper, an efficient method to find cut in the MPEG stream data is proposed. For this purpose, histogram difference and pixel difference is considered as a noise signal. The signal is then filtered out by a median filter to make the frame difference larger. The frame difference obtained in this way is classified into cut frame and non-cut frame by the 2-means clustering without using any threshold value. To improve the classification ratio, a back-propagation neural network is constructed, where outputs of 2-means clustering are used as the inputs of the network. The simulation results demonstrate the performance of the proposed methods.

• Proceedings of the IEEK Conference
• /
• 2000.06d
• /
• pp.58-61
• /
• 2000

In this paper, we propose a new performance comparison method of various Interpolation methods for image enlargement The conventional methods employs PSNR and edge characteristic evaluation for performance comparison of interpolation methods. The proposed performance comparison method uses the position Information for each difference pixel's value and the frequency characteristic information between original image and Interpolated image. The proposed methods might be useful for performance comparison of various Interpolation methods through the computer simulation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10a
• /
• pp.177-178
• /
• 2007

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2830-2837
• /
• 1999

Image processing steps are consist of image acquisition, preprocessing, region, segmentation and recognition. But image corrupted commonly by noise reduction methods, many filters were proposed like mean filter, median filter, weighted median filter, Cheikh filter, and Kyu-cheol lee filter as spatial noise reduction filtering. We propose a new edge detection algorithm so that we find out edge existence and nonexistence. In non-edge area, we selectively apply weighted median filter based upon using information of difference value between weighted median filter's value and center pixel's value. As a result, we finally prove a better performance of noise reduction by applying adaptive weighted median filter and improvement of processing time through using simple algorithm.