• ETRI Journal
• /
• v.42 no.2
• /
• pp.258-271
• /
• 2020

A correlation exists between luminance samples and chrominance samples of a color image. It is beneficial to exploit such interchannel redundancy for color image compression. We propose an algorithm that predicts chrominance components Cb and Cr from the luminance component Y. The prediction model is trained by supervised learning with Laplacian-regularized least squares to minimize the total prediction error. Kernel principal component analysis mapping, which reduces computational complexity, is implemented on the same point set at both the encoder and decoder to ensure that predictions are identical at both the ends without signaling extra location information. In addition, chrominance subsampling and entropy coding for model parameters are adopted to further reduce the bit rate. Finally, luminance information and model parameters are stored for image reconstruction. Experimental results show the performance superiority of the proposed algorithm over its predecessor and JPEG, and even over JPEG-XR. The compensation version with the chrominance difference of the proposed algorithm performs close to and even better than JPEG2000 in some cases.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.8 no.5
• /
• pp.285-293
• /
• 2013

The procedure of the arbitration which is the tag collision is essential because the multiple tags response simultaneously in the same frequency to the request of the Reader. This procedure is known as Anti-collision and it is a key technology in the RFID system. In this paper, we propose the Bit Pattern Prediction Algorithm(BPPA) for the efficient identification of the multiple tags. The BPPA is based on the tree algorithm using the time slot and identify the tag quickly and efficiently using accurate bit pattern prediction method. Through mathematical performance analysis, We proved that the BPPA is an O(n) algorithm by analyzing the worst-case time complexity and the BPPA's performance is improved compared to existing algorithms. Through MATLAB simulation experiments, we verified that the BPPA require the average 1.2 times query per one tag identification and the BPPA ensure stable performance regardless of the number of the tags.

• Journal of Multimedia Information System
• /
• v.8 no.3
• /
• pp.147-158
• /
• 2021

Versatile Video Coding (VVC) is the latest video coding standard developed by Joint Video Exploration Team (JVET). In VVC, the quadtree plus multi-type tree (QT+MTT) structure of coding unit (CU) partition is adopted, and its computational complexity is considerably high due to the brute-force search for recursive rate-distortion (RD) optimization. In this paper, we aim to reduce the time complexity of inter-picture prediction mode since the inter prediction accounts for a large portion of the total encoding time. The problem can be defined as classifying the split mode of each CU. To classify the split mode effectively, a novel convolutional neural network (CNN) called multi-level tree (MLT-CNN) architecture is introduced. For boosting classification performance, we utilize additional information including inter-picture information while training the CNN. The overall algorithm including the MLT-CNN inference process is implemented on VVC Test Model (VTM) 11.0. The CUs of size 128×128 can be the inputs of the CNN. The sequences are encoded at the random access (RA) configuration with five QP values {22, 27, 32, 37, 42}. The experimental results show that the proposed algorithm can reduce the computational complexity by 11.53% on average, and 26.14% for the maximum with an average 1.01% of the increase in Bjøntegaard delta bit rate (BDBR). Especially, the proposed method shows higher performance on the sequences of the A and B classes, reducing 9.81%~26.14% of encoding time with 0.95%~3.28% of the BDBR increase.

• Structural Engineering and Mechanics
• /
• v.83 no.3
• /
• pp.401-413
• /
• 2022

The collapse of civil infrastructure due to natural disasters results in financial losses and many casualties. In particular, the recent increase in earthquake activities has highlighted on the importance of assessing the seismic performance and predicting the seismic risk of a structure. However, the nonlinear behavior of a structure and the uncertainty in ground motion complicate the accurate seismic response prediction of a structure. Artificial intelligence can overcome these limitations to reasonably predict the nonlinear behavior of structures. In this study, a deep learning-based algorithm was developed to estimate the time-history seismic response of bridge structures. The proposed deep neural network was trained using structural and ground motion parameters. The performance of the seismic response prediction algorithm showed the similar phase and magnitude to those of the time-history analysis in a single-degree-of-freedom system that exhibits nonlinear behavior as a main structural element. Then, the proposed algorithm was expanded to predict the seismic response and fragility prediction of a bridge system. The proposed deep neural network reasonably predicted the nonlinear seismic behavior of piers and bearings for approximately 93% and 87% of the test dataset, respectively. The results of the study also demonstrated that the proposed algorithm can be utilized to assess the seismic fragility of bridge components and system.

• Economic and Environmental Geology
• /
• v.56 no.1
• /
• pp.65-73
• /
• 2023

As one of the most vulnerable countries to floods, there should be an increased necessity for accurate and reliable flood forecasting in Indonesia. Therefore, a new prediction model using a machine learning algorithm is proposed to provide daily flood prediction in Indonesia. Data crawling was conducted to obtain daily rainfall, streamflow, land cover, and flood data from 2008 to 2021. The model was built using a Random Forest (RF) algorithm for classification to predict future floods by inputting three days of rainfall rate, forest ratio, and stream flow. The accuracy, specificity, precision, recall, and F1-score on the test dataset using the RF algorithm are approximately 94.93%, 68.24%, 94.34%, 99.97%, and 97.08%, respectively. Moreover, the AUC (Area Under the Curve) of the ROC (Receiver Operating Characteristics) curve results in 71%. The objective of this research is providing a model that predicts flood events accurately in Indonesian regions 3 months prior the day of flood. As a trial, we used the month of June 2022 and the model predicted the flood events accurately. The result of prediction is then published to the website as a warning system as a form of flood mitigation.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2137-2142
• /
• 2003

One of the important performance metrics of the World Wide Web is how fast and precise a request from users will be serviced successfully. Shared Web Caching (SWC) is one of the techniques to improve the performance of the network system. In Shared Web Caching Systems, the key issue is on deciding when and where an item is cached, and also how to transfer the correct and reliable information to the users quickly. Such SWC distributes the items to the proxies which have sufficient capacity such as the processing time and the cache sizes. In this study, the Hot Spot Prediction Algorithm (HSPA) has been suggested to improve the consistent hashing algorithm in the point of the load balancing, hit rate with a shorter response time. This method predicts the popular hot spots using a prediction model. The hot spots have been patched to the proper proxies according to the load-balancing algorithm. Also a simulator is developed to utilize the suggested algorithm using PERL language. The computer simulation result proves the performance of the suggested algorithm. The suggested algorithm is tested using the consistent hashing in the point of the load balancing and the hit rate.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.406-409
• /
• 2007

This paper proposes an algorithm that predicts current electrostatic charge in a factory. The algorithm based on LSM(Least Square Method) dynamically takes the number of sample while calculating the value of electrostatic charge. The simulation results show that the proposed algorithm gains 73.18161 standard deviation with 95% trust probability and is better than conventional algorithm. We design the electrostatic prediction embedded system based on pxa255 with the proposes algorithm.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.15-18
• /
• 2005

A ribonucleic acid (RNA) is one of the two types of nucleic acids found in living organisms. An RNA molecule represents a long chain of monomers called nucleotides. The sequence of nucleotides of an RNA molecule constitutes its primary structure, and the pattern of pairing between nucleotides determines the secondary structure of an RNA. Non-coding RNA genes produce transcripts that exert their function without ever producing proteins. Predicting the secondary structure of non-coding RNAs is very important for understanding their functions. We focus on Nussinov's algorithm as useful techniques for predicting RNA secondary structures. We introduce a new traceback matrix and scoring table to improve above algorithm. And the improved prediction algorithm provides better levels of performance than the originals.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.6
• /
• pp.617-625
• /
• 2017

In this paper, an effective reversible data embedding algorithm was proposed to embed secrete data into image. In the proposed algorithm, prediction image is generated by accurately predicting pixel values using local similarity existing in image, difference sequence is generated using the generated prediction image and original cover image, and then histogram shift technique is applied to create a stego-image with secrete data hidden. Applying the proposed algorithm, secrete data can be extracted from the stego-image and the original cover image can be restored without loss. Experimental results show that it is possible to embed more secrete data into cover image than APD algorithm by applying the proposed algorithm.

• ETRI Journal
• /
• v.22 no.4
• /
• pp.32-39
• /
• 2000

In low earth orbit (LEO) satellite communication systems, more severe phase distortion due to Doppler shift is frequently detected in the received signal than in cases of geostationary earth orbit (GEO) satellite systems or terrestrial mobile systems. Therefore, an estimation of Doppler shift would be one of the most important factors to enhance performance of LEO satellite communication system. In this paper, a new adaptive Doppler compensation scheme using location information of a user terminal and satellite, as well as a weighting factor for the reduction of prediction error is proposed. The prediction performance of the proposed scheme is simulated in terms of the prediction accuracy and the cumulative density function of the prediction error, with considering the offset variation range of the initial input parameters in LEO satellite system. The simulation results showed that the proposed adaptive compensation algorithm has the better performance accuracy than Ali's method. From the simulation results, it is concluded the adaptive compensation algorithm is the most applicable method that can be applied to LEO satellite systems of a range of altitude between 1,000 km and 2,000 km for the general error tolerance level, M = 250 Hz.