• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3C
• /
• pp.398-407
• /
• 2004

In this paper, a blind watermarking method which is suitable to the video compression using 2-D discrete wavelet transform was proposed and implemented into the hardware using VHDL(VHSIC Hardware Description Language). The goal of the proposed watermarking algorithm is the authentication about the manipulation of the watermark embedded image and the detection of the error positions. Considering the compressed video image, the proposed watermarking scheme is unrelated to the quantization and is able to concurrently embed or extract the watermark. We experimentally verified that the lowest frequency subband(LL4) is not sensitive to the change in the spatial domain, so LL4 subband was selected for the mark space. And the combination of the bitplanes which has the properties of both the minimum degradation of the image and the robustness was chosen as the embedded Point in the mark space in LL4 subband. Since we know the watermark embedded positions and the watermark is embedded by not varying the value but changing the value, the watermark can be extracted without the original image. Also, for the security when exposing the watermark embedded position, we embed the encrypted watermark by the block cipher. The proposed watermark algorithm shows the robustness against the general image manipulation and is easily transplanted into the image or video compressor with the minimal changing in the structure. The designed hardware has 4037 LABs(24％) and 85 ESBs(3％) in APEX20KC EP20K400CF672C7 FPGA of Altera and stably operates in 82MHz clock frequency.

• Journal of Broadcast Engineering
• /
• v.7 no.1
• /
• pp.45-54
• /
• 2002

This paper proposes a video compression algorithm using characteristics of wavelet coefficients. The proposed algorithm can provide lowed bit rate and faster running time while guaranteeing the reconstructed image qualify by the human virtual system. In this approach, each video sequence is decomposed into a pyramid structure of subimages with various resolution to use multiresolution capability of discrete wavelet transform. Then similarities between two neighboring frames are obtained from a low-frequency subband which Includes an important information of an image and motion informations are extracted from the similarity criteria. Four legion selection filters are designed according to the similarity criteria and compression processes are carried out by encoding the coefficients In preservation legions and replacement regions of high-frequency subbands. Region selection filters classify the high-frequency subbands Into preservation regions and replacement regions based on the similarity criteria and the coefficients In replacement regions are replaced by that of a reference frame or reduced to zero according to block-based similarities between a reference frame and successive frames. Encoding is carried out by quantizing and arithmetic encoding the wavelet coefficients in preservation regions and replacement regions separately. A reference frame is updated at the bottom point If the curve of similarity rates looks like concave pattern. Simulation results show that the proposed algorithm provides high compression ratio with proper Image quality. It also outperforms the previous Milton's algorithm in an Image quality, compression ratio and running time, leading to compression ratio less than 0.2bpp. PSNR of 32 dB and running tome of 10ms for a standard video image of size 352${\times}$240 pixels.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.5
• /
• pp.11-20
• /
• 2002

Based on regularization principles, we propose a new dequantization scheme on DCT-based transform coding for reducing of blocking artifacts and minimizing the quantization error. The conventional image dequantization is simply to multiply the received quantized DCT coefficients by the quantization matrix. Therefore, for each DCT coefficients, we premise that the quantization noise is as large as half quantizer step size (in DCT domain). Our approach is based on basic constraint that quantization error is bounded to ${\pm}$(quantizer spacing/2) and at least there are not high frequency components corresponding to discontinuities across block boundaries of the images. Through regularization, our proposed dequantization scheme, sharply reduces blocking artifacts in decoded images. Our proposed algorithm guarantees that the dequantization process will map the quantized DCT coefficients will be evaluated against the standard JPEG, MPEG-1 and H.263 (with Annex J deblocking filter) decoding process. The experimental results will show visual improvements as well as numerical improvements in terms of the peak-signal-to-noise ratio (PSNR) and the blockiness measure (BM) to be defined.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.1
• /
• pp.9-18
• /
• 2004

This paper presents an efficient image compression method for memory reduction in multimedia processor which can be simply implemented in hardware and provides high performance. The multimedia processor, which includes processing of high-resolution images and videos, requires large memories: they are external frame memories to store frames and internal line memories for implementing some linear filters. If we can reduce those memories by adopting a simple compression method in multimedia processor, it will strengthen its cost competitiveness. There exist many standards for efficiently compressing images and videos. However, those standards are too complex for our purpose and most of them are 2-D block-based methods, which do not support raster scanned input and output. In this paper, we propose a low-complexity compression method which has good performance, can be implemented with simple hardware logic, and supports raster scan. We have adopted 1${\times}$8 Hadamard transform for simple implementation in hardware and compression efficiency. After analyzing the coefficients, we applied an adaptive thresholding and quantization. We provide some simulation results to analyze its performance and compare with the existing methods. We also provide its hardware implementation results and discuss about cost reduction effects when applied in implementing a multimedia processor.

• Journal of Biosystems Engineering
• /
• v.29 no.4
• /
• pp.341-346
• /
• 2004

Recent livestock people concern not only increase of production, but also superior quality of animal-breeding environment. So far, the optimization of the breeding and air environment has been focused on the production increase. In the very near future, the optimization will be emphasized on the environment for the animal welfare and health. Especially, cattle farming demands the precision livestock farming and special attention has to be given to the management of feeding, animal health and fertility. The management of individual animal is the first step for precision livestock farming and animal welfare, and recognizing each individual is important for that. Though electronic identification of a cattle such as RFID(Radio Frequency Identification) has many advantages, RFID implementations practically involve several problems such as the reading speed and distance. In that sense, computer vision might be more effective than RFID for the identification of an individual animal. The researches on the identification of cattle via image processing were mostly performed with the cows having black-white patterns of the Holstein. But, the native Korean and Japanese cattle do not have any definite pattern on the body. The purpose of this research is to identify the Japanese black cattle that does not have a body pattern using computer vision technology and neural network algorithm. Twelve heads of Japanese black cattle have been tested to verify the proposed scheme. The values of input parameters were specified and then computed using the face images of cattle. The images of cattle faces were trained using associate neural network algorithm, and the algorithm was verified by the face images that were transformed using brightness, distortion, and noise factors. As a result, there was difference due to transform ratio of the brightness, distortion, and noise. And, the proposed algorithm could identify 100% in the range from -3 to +3 degrees of the brightness, from -2 to +4 degrees of the distortion, and from 0% to 60% of the noise transformed images. It is concluded that our system can not be applied in real time recognition of the moving cows, but can be used for the cattle being at a standstill.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2010.02a
• /
• pp.362-362
• /
• 2010

Today, vast attention has been paid to periodic arrays of nanostructures due to their potential for applications such as memory with huge storage density. Such application requires large-scale fabrication of well ordered nano-sized structures. One of the most widely used methods for the ordered nanostructures is lithography. This top-down process, however, has the limit to reduce size. Here the promising alternative is the self-organization of ordered nano-sized structures such as large scale 2d carbon-induced reconstructions on W(110). In the present study, we report on the first well-resolved atomic resolution STM studies of the well-known R($15{\times}3$) and R($15{\times}12$) carbon induced reconstruction of the W(110). From the atomic image of R($15{\times}3$) for different values of tunneling gap resistance, we can tell there are no missing atoms in unit cells of R($15{\times}3$) and some atomic displacements are substantial from the clean W(110), even though not all the imaged position of atoms correspond to tungsten, but may include those of carbon. We are considering two cases; First case is related to lattice deformation, or top layer of W(110) is deformed in the process of relief of strain caused by random inserting of carbon atoms possibly in the interstitial position. In the second case, R($15{\times}3$) unit cell results from a coincidence lattice between clean W(110) substrate and tungsten carbide overlayer which has rectangular atomic arrangement and giving R($15{\times}3$) coincidence lattice. beta-W2C showing rectangular unit cell should be a candidate. Further, we report on new reconstructions. Unlike the well-known R($15{\times}12$) consisting of two parts, two inner structures between two "Backbone" structures. The new reconstruction, which we found for the first time, contains more parts between the "Backbone"s. Sometimes we can observe the reconstruction consists of only inner parts without "Backbone" parts. Thus, the observed reconstruction can be built by constructing of two types of "Lego"-like block. Moreover, the rectangle shape of "Backbone" transform to parallelogram-like shape over time, the so-called wavy-R($15{\times}12$). Adsorption of hydrogen can be the reason for this transformation.

• Journal of Advanced Navigation Technology
• /
• v.26 no.4
• /
• pp.211-218
• /
• 2022

Continuous wave (CW) radar has the advantage of reliability and accuracy compared to other sensors such as camera and lidar. In addition, binarized neural network (BNN) has a characteristic that dramatically reduces memory usage and complexity compared to other deep learning networks. Therefore, this paper proposes binarized neural network based human identification and motion classification system using CW radar. After receiving a signal from CW radar, a spectrogram is generated through a short-time Fourier transform (STFT). Based on this spectrogram, we propose an algorithm that detects whether a person approaches a radar. Also, we designed an optimized BNN model that can support the accuracy of 90.0% for human identification and 98.3% for motion classification. In order to accelerate BNN operation, we designed BNN hardware accelerator on field programmable gate array (FPGA). The accelerator was implemented with 1,030 logics, 836 registers, and 334.904 Kbit block memory, and it was confirmed that the real-time operation was possible with a total calculation time of 6 ms from inference to transferring result.

• Journal of Practical Engineering Education
• /
• v.16 no.3_spc
• /
• pp.391-399
• /
• 2024

All highway toll gates in Korea use low-speed WIM(Weight-In-Motion) to block overloaded cargo vehicles from entering the main highway, but some cargo vehicle owners are illegally modifying vehicles to operate variable axles and evading crackdowns by manipulating the axles. In previous studies detect all tires of a running vehicle were detected to determine whether there is axle manipulation. However, because the vehicle entry area at the highway toll gate checkpoint is very narrow, there is a problem that it is realistically difficult to film all tires of the entering vehicle in one video frame. In this paper, we proposed a system that can determine whether the axle is being operated through changes in the height of the vehicle's cargo box rather than by detecting tires. To detect changes in the height of a cargo box, we propose a method to extract the representative line of the cargo box using Hough transform and then measure the change in height of the representative line to detect the change in height of the cargo box. In addition, we propose a method to detect changes in the vertical height of a cargo box by accumulating motion vectors of pixels within a certain area of the image using optical flow. And the two methods were compared and their advantages and disadvantages were analyzed and presented.

• Korean Journal of Soil Science and Fertilizer
• /
• v.43 no.6
• /
• pp.968-974
• /
• 2010

We assessed the feasibility of discrete wavelet transform (DWT) applied for the spectral processing to enhance the estimation performance quality of soil organic matters using visible-near infrared spectra and mapped their distribution via block Kriging model. Continuum-removal and $1^{st}$ derivative transform as well as Haar and Daubechies DWT were used to enhance spectral variation in terms of soil organic matter contents and those spectra were put into the PLSR (Partial Least Squares Regression) model. Estimation results using raw reflectance and transformed spectra showed similar quality with $R^2$ > 0.6 and RPD> 1.5. These values mean the approximation prediction on soil organic matter contents. The poor performance of estimation using DWT spectra might be caused by coarser approximation of DWT which not enough to express spectral variation based on soil organic matter contents. The distribution maps of soil organic matter were drawn via a spatial information model, Kriging. Organic contents of soil samples made Gaussian distribution centered at around 20 g $kg^{-1}$ and the values in the map were distributed with similar patterns. The estimated organic matter contents had similar distribution to the measured values even though some parts of estimated value map showed slightly higher. If the estimation quality is improved more, estimation model and mapping using spectroscopy may be applied in global soil mapping, soil classification, and remote sensing data analysis as a rapid and cost-effective method.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.3 s.118
• /
• pp.248-256
• /
• 2007

In this paper, we propose a selective DFT spreading method to solve a high PAPR problem in uplink OFDMA system. A selective characteristic is added to the DFT spreading, so the DFT spreading method is mixed with SLM method. However, to minimize increment of computational complexity, differently with common SLM method, our proposed method uses only one DFT spreading block. After DFT, several copy branches are generated by multiplying with each different matrix. This matrix is obtained by linear transforming the each phase rotation in front of DFT block. And it has very lower computational complexity than one DFT process. For simulation, we suppose that the 512 point IFFT is used, the number of effective sub-carrier is 300, the number of allowed sub-carrier to each user's is 1/4 and 1/3 and QPSK modulation is used. From the simulation result, when the number of copy branch is 4, our proposed method has more than about 5.2 dB PAPR reduction effect. It is about 1.8 dB better than common DFT spreading method and 0.95 dB better than common SLM which uses 32 copy branches. And also, when the number of copy branch is 2, it is better than SLM using 32 copy branches. From the comparison, the proposed method has 91.79 % lower complexity than SLM using 32 copy branches in similar PAPR reduction performance. So, we can find a very good performance of our proposed method. Also, we can expect the similar performance when all number of sub-carrier is allocated to one user like the OFDM.