• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.204-207
• /
• 2002

The current paper proposes a new multispectral image data compression algorithm that can efficiently reduce spatial and spectral redundancies by applying classified prediction, a Karhunen-Loeve transform (KLT), and the three-dimensional set partitioning in hierarchical trees (3-D SPIHT) algorithm In the wavelet transform (WT) domain. The classification is performed in the WT domain to exploit the interband classified dependency, while the resulting class information is used for the interband prediction. The residual image data on the prediction errors between the original image data and the predicted image data is decorrelated by a KLT. Finally, the 3D-SPIHT algorithm is used to encode the transformed coefficients listed in a descending order spatially and spectrally as a result of the WT and KLT. Simulation results showed that the reconstructed images after using the proposed algorithm exhibited a better quality and higher compression ratio than those using conventional algorithms.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.155-158
• /
• 2000

In this paper, the quantization noise in block-based video coding is analyzed, and a post-processing method based on the analysis is presented for reducing the quantization noise by using a wavelet transform(WT). In the proposed method, the quantization noise is considered as the sum of a blocking noise expressed as a deterministic profile and the random remainder noise. Each noise is removed in a viewpoint of image restoration using a 1-D WT, which yields a regularized differentiation. The blocking noise first is reduced by weakening the strength of each blocking noise component that appears as an impulse in the first scale wavelet domain. The impulse strength estimation is performed using median filter, quantization parameter(QP), and local activity. The remainder noise, which is considered as a white noise at non-edge pixels, then is reduced by soft-thresholding. The experimental results show that the proposed method yields better performance in terms if subjective quality as well as PSNR performance over VM post-filter in MPEG-4 for all test sequences of various compression ratios. We also present a fast post-processing in spatial domain equivalent to that in wavelet domain for real-time application.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.178-180
• /
• 2004

In this work, we propose new method of sigma filtering for efficient filtering and preserving edge regions in DCT Domain. In block-based image compression technique, the image is first divided into non-overlapping $8{\times}8$ blocks. Then, the two-dimensional DCT is computed for each $8{\times}8$ block. Once the DCT coefficients are obtained, they are quantized using a specific quantization table. Quantization of the DCT coefficients is a lossy process, and in this step, noise is added. In this work, we combine IDCT matrix and filter matrix to a new matrix to simplify filtering process to remove noise after IDCT in spatial domain, for each $8{\times}8$ DCT coefficient block, we determine whether this block is edge or homogeneous region. If this block is edge region, we divide this $8{\times}8$ block into four $4{\times}4$ sub-blocks, and do filtering process for sub-blocks which is homogeneous region. By this process, we can remove blocking artifacts efficiently preserving edge regions at the same time.

• Journal of IKEEE
• /
• v.2 no.1 s.2
• /
• pp.96-100
• /
• 1998

Due to expected wide spread use of DCT based image/video coding standard, it is advantageous to process data directly in the DCT domain rather than decoding the source back to the spatial domain. The block processing algorithm provides a parallel processing method since multiple input data are processed in the block filter structure. Hence a fast implementation of the algorithm is well suited. In this paper, we propose the JPEG browse by Block Transform Domain Filtering(BTDF) using subband filter banks. Instead of decompressing the entire image to retrieve at full resolution from compressed format, a user can select the level of expansion required$(2^N{\times}2^N)$. Also this approach reduces the computer cpu time by reducing the number of multiplication through BTDF in the filter banks.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.19 no.1
• /
• pp.9-14
• /
• 2005

Mode missing of Fabry-Perot laser diodes has been modeled using the time domain laser model(TDLM). Fabry-Perot laser diodes that have structure of ripple in the waveguide of active layer or defects inside the active layer were simulated. For accurate simulation, the nonlinear effects were included such as spatial hole burning(SHB) and gain saturation. From the simulation results, it was founded that the defect inside the active layer in laser diodes has a strong influence on mode missing rather than the waveguide ripple. The simulation results are confirmed with the fabricated Fabry-Perot laser diodes by measuring the longitudinal mode spectra as a function of temperature from $25[^{\circ}C]\;to\;85[^{\circ}C]$.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.18 no.6
• /
• pp.303-310
• /
• 2023

A single vision system limits the ability to accurately understand the spatial constraints and interactions between robots and dynamic workers caused by gantry robots and collaborative robots during production manufacturing. In this paper, we propose a 3D pose registration method for dynamic workers based on a multi-domain vision system for safety monitoring in manufacturing environments. This method uses OpenPose, a deep learning-based posture estimation model, to estimate the worker's dynamic two-dimensional posture in real-time and reconstruct it into three-dimensional coordinates. The 3D coordinates of the reconstructed multi-domain vision system were aligned using the ICP algorithm and then registered to a single 3D coordinate system. The proposed method showed effective performance in a manufacturing process environment with an average registration error of 0.0664 m and an average frame rate of 14.597 per second.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.22 no.3
• /
• pp.107-116
• /
• 2020

In this data paper, we share the dataset obtained during 2019 from the test-bed to develop soil moisture estimation technology for upland fields, which was built in Seosan and Taean, South Korea on May 3. T his dataset includes various eco-hydro-meteorological variables such as soil moisture, evapotranspiration, precipitation, radiation, temperature, humidity, and vegetation indices from the test-bed nearby the Automated Agricultural Observing System (AAOS) in Seosan operated by the Korea Meteorological Administration. T here are three remarkable points of the dataset: (1) It can be utilized to develop and evaluate spatial scaling technology of soil moisture because the areal measurement with wide spatial representativeness using a COSMIC-ray neutron sensor as well as the point measurement using frequency/time domain reflectometry (FDR/TDR) sensors were conducted simultaneously, (2) it can be used to enhance understanding of how soil moisture and crop growth interact with each other because crop growth was also monitored using the Smart Surface Sensing System (4S), and (3) it is possible to evaluate the surface water balance by measuring evapotranspiration using an eddy covariance system.

• Journal of Internet Computing and Services
• /
• v.19 no.1
• /
• pp.67-76
• /
• 2018

This paper addresses the problem of efficient processing of region monitoring queries. The centralized methods used for existing region monitoring query processing assumes that the mobile object periodically sends location-updates to the server and the server continues to update the query results. However, a large amount of location updates seriously degrade the system performance. Recently, some distributed methods have been proposed for region monitoring query processing. In the distributed methods, the server allocates to all objects i) a resident domain that is a subspace of the workspace, and ii) a number of nearby query regions. All moving objects send location updates to the server only when they leave the resident domain or cross the boundary of the query region. In order to allocate the resident domain to the moving object along with the nearby query region, we use a query index structure that is constructed by splitting the workspace recursively into equal halves. However, However, the above index structure causes unnecessary division, resulting in deterioration of system performance. In this paper, we propose an adaptive split method to reduce unnecessary splitting. The workspace splitting is dynamically allocated i) considering the spatial relationship between the query region and the resultant subspace, and ii) the distribution of the query region. We proposed an enhanced QR-tree with a new splitting method. Through a set of simulations, we verify the efficiency of the proposed split methods.

• Proceedings of the KIEE Conference
• /
• 2008.04a
• /
• pp.91-92
• /
• 2008

본 논문에서는 기존의 H.264/AVC의 spatial 영역에서 Intra prediction 기법과 달리 H.264/AVC에서 사용하는 Integer DCT 영역에서 Intra prediction 기법을 제안한다. 이를 위하여 Integer DCT 영역에서 Intra prediction을 수행하는 모든 과정을 matrix multiplication으로 표현하여 Intra prediction을 수행하는 matrix를 유도한다. Intra prediction을 수행하는 matrix를 각 모드에 알맞게 설계하고, 이 matrix를 Integer DCT 영역에서 사용할 수 있도록 orthogonal한 Integer matrix를 설계한다. 실험을 통하여 제안한 Integer DCT 영역에서 Intra prediction 기법이 기존의 H.264/AVC의 spatial 영역에서 intra prediction 기법과 성능이 동일하면서 어떻게 matrix multiplication에 연산들을 포함시켜서 단순화 할 수 있는지를 보여주겠다. 또한 H.264/AVC에서 제공하는 intra prediction 각 모드에 대해 계산상 복잡도를 분석하였다.

• Journal of Korean Association for Spatial Structures
• /
• v.20 no.2
• /
• pp.77-85
• /
• 2020

This paper examined the dynamic instability of a shallow arch according to the response characteristics when nearing critical loads. The frequency changing feathers of the time-domain increasing the loads are analyzed using Fast Fourier Transformation (FFT), while the response signal around the critical loads are analyzed using Hilbert-Huang Transformation (HHT). This study reveals that the models with an arch shape of h = 3 or higher exhibit buckling, which is very sensitive to the asymmetric initial conditions. Also, the critical buckling load increases as the shape increases, with its feather varying depending on the asymmetric initial conditions. Decomposition results show the decrease in predominant frequency before the threshold as the load increases, and the predominant period doubles at the critical level. In the vicinity of the critical level, sections rapidly manifest the displacement increase, with the changes in Instantaneous Frequency (IF) and Instant Energy (IE) becoming apparent.