• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.10
• /
• pp.838-844
• /
• 2013

In this paper, we propose a novel spectrum sensing scheme based on sensing time partitioning for cognitive radio systems in high traffic environments. Specifically, we partition a sensing time into K sub-sections, and then, propose a spectrum sensing scheme that determines if a primary user signal is present based on the sensing results on the partitioned sub-sections. From numerical results, it is confirmed that the proposed scheme outperforms the conventional schemes in high traffic environments.

• Korean Journal of Remote Sensing
• /
• v.18 no.6
• /
• pp.359-367
• /
• 2002

In this paper, a new embedded wavelet packet image coder algorithm is proposed for an effective image coder using correlation between partitioned coefficients. This new algorithm presents parent-child relationship for reducing image reconstruction error using relations between individual frequency sub-bands. By parent-child relationship, every coefficient is partitioned and encoded for the zerotree data structure. It is shown that the proposed wavelet packet image coder algorithm achieves low bit rates and rate-distortion. It also demonstrates higher PSNR under the same bit rate and an improvement in image compression time. The perfect rate control is compared with the conventional method. These results show that the encoding and decoding processes of the proposed coder are simpler and more accurate than the conventional ones for texture images that include many mid and high-frequency elements such as aerial and satellite photograph images. The experimental results imply the possibility that the proposed method can be applied to real-time vision system, on-line image processing and image fusion which require smaller file size and better resolution.

• Korean Journal of Remote Sensing
• /
• v.16 no.2
• /
• pp.145-156
• /
• 2000

Clustering is the process of partitioning a data set into meaningful clusters. As the data to process increase, a laster algorithm is required than ever. In this paper, we propose a clustering algorithm to partition a multispectral remotely sensed image data set into several clusters using a hash search algorithm. The processing time of our algorithm is compared with that of clusters algorithm using other speed-up concepts. The experiment results are compared with respect to the number of bands, the number of clusters and the size of data. It is also showed that the processing time of our algorithm is shorter than that of cluster algorithms using other speed-up concepts when the size of data is relatively large.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.23 no.4
• /
• pp.251-267
• /
• 2021

Remotely sensed vegetation indices (VIs) are empirically related with gross primary productivity (GPP) in various spatio-temporal scales. The uncertainties in GPP-VI relationship increase with temporal resolution. Uncertainty also exists in the eddy covariance (EC)-based estimation of GPP, arising from the partitioning of the measured net ecosystem CO2 exchange (NEE) into GPP and ecosystem respiration (RE). For two forests and two agricultural sites, we correlated the EC-derived GPP in various time scales with three different near-surface remotely sensed VIs: (1) normalized difference vegetation index (NDVI), (2) enhanced vegetation index (EVI), and (3) near infrared reflectance from vegetation (NIRv) along with NIRvP (i.e., NIRv multiplied by photosynthetically active radiation, PAR). Among the compared VIs, NIRvP showed highest correlation with half-hourly and monthly GPP at all sites. The NIRvP was used to test the reliability of GPP derived by two different NEE partitioning methods: (1) original KoFlux methods (GPP_Ori) and (2) machine-learning based method (GPP_ANN). GPP_ANN showed higher correlation with NIRvP at half-hourly time scale, but there was no difference at daily time scale. The NIRvP-GPP correlation was lower under clear sky conditions due to co-limitation of GPP by other environmental conditions such as air temperature, vapor pressure deficit and soil moisture. However, under cloudy conditions when photosynthesis is mainly limited by radiation, the use of NIRvP was more promising to test the credibility of NEE partitioning methods. Despite the necessity of further analyses, the results suggest that NIRvP can be used as the proxy of GPP at high temporal-scale. However, for the VIs-based GPP estimation with high temporal resolution to be meaningful, complex systems-based analysis methods (related to systems thinking and self-organization that goes beyond the empirical VIs-GPP relationship) should be developed.

• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.4
• /
• pp.41-50
• /
• 2012

Network life time is very important issue for wireless sensor network(WSN). It is very important to design sensor networks for sensors to utilize their energies in effective ways. A-PEGASIS that basically bases on PEGASIS and enhances in two aspects-an elegant chain generation algorithm and periodical update of chains. However, it has problems in the chain generation mechanism and some possibility of network partitioning or sensing hole problem in the network, in LEACH related protocols. This dissertation proposes a new clustering protocol to solve the co-shared problems in the previous protocols. The basic idea of our scheme is using the table for node connectivity. The results show that the network life time would be extended in about 1.8 times longer than LEACH and 1.5 times longer than PEGASIS-A.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.12
• /
• pp.31-38
• /
• 2010

This paper presents the design of a graphic memory for QVGA-scale LCD Driver IC (LDI). The graphic memory is designed based on the pseudo-SHAM for the purpose of small area, and the memory cell structure is designed using a bit line partitioning method to improve sensing characteristics and drivabilties in the line-read operation. Also, a collision protection circuit using C-gate is designed to control collisions between read/write operations and self-refresh/line-read operations effectively. The graphic memory circuit has been designed in transistor level using $0.18{\mu}m$ CMOS technology library and the operations of the graphic memory have been verified using Hspice. The results show that the bit-bitb line voltage difference, ${\Delta}V$ increases by 40%, the charge sharing time between bit and bitb voltages $T_{CHGSH}$ decreases by 30%, and the current during line-read decreases by 40%.