• Journal of Broadcast Engineering
• /
• v.27 no.3
• /
• pp.361-368
• /
• 2022

Quaternary tree plus multi-type tree (QT+MTT) structure was adopted in the Versatile Video Coding (VVC) standard as a block partitioning tool. QT+MTT provides excellent coding gain; however, it has huge encoding complexity due to the flexibility of the binary tree (BT) and ternary tree (TT) splits. This paper proposes a fast inter coding unit (CU) partitioning algorithm for BT and TT split types based on prediction accuracy functions using the mean of the absolute error (MAE). The MAE-based decision model was established to achieve a consistent time-saving encoding with stable coding loss for a practical low complexity VVC encoder. Experimental results under random access test configuration showed that the proposed algorithm achieved the encoding time saving from 24.0% to 31.7% with increasing luminance Bjontegaard delta (BD) rate from 1.0% to 2.1%.

• Journal of the Institute of Convergence Signal Processing
• /
• v.23 no.4
• /
• pp.234-240
• /
• 2022

This paper proposes a customized AI exercise recommendation service for balancing the relative amount of exercise according to the working environment by each occupation. WISDM database is collected by using acceleration and gyro sensors, and is a dataset that classifies physical activities into 18 categories. Our system recommends a adaptive exercise using the analyzed activity type after classifying 18 physical activities into 3 physical activities types such as whole body, upper body and lower body. 1 Dimensional convolutional neural network is used for classifying a physical activity in this paper. Proposed model is composed of a convolution blocks in which 1D convolution layers with a various sized kernel are connected in parallel. Convolution blocks can extract a detailed local features of input pattern effectively that can be extracted from deep neural network models, as applying multi 1D convolution layers to input pattern. To evaluate performance of the proposed neural network model, as a result of comparing the previous recurrent neural network, our method showed a remarkable 98.4% accuracy.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2020.06a
• /
• pp.239-239
• /
• 2020

상수관망은 수용가에게 용수를 공급하는 사회기반시설물로, 용수를 공급하는 과정에서 관내에 이물질, 스케일 등의 생성은 불가피하다. 관로 변경, 단수로 인한 비상시 용수 공급 등의 유향 및 유속이 변화가 발생할 경우 스케일이 박리되어 적수사고 등의 수질문제가 발생 할 수 있으며, 이에 사전에 스케일을 제거 할 필요성이 있다. 스케일을 제거하기 위해서는 주기적인 관세척이 필요하며, 대표적인 공법으로는 플러싱공법이 있다. 현재까지 플러싱공법에 대한 연구는 실험을 통한 적용 권장 기준으로 진행되어 왔으나, 실제 상수관망에서 적용권장 기준을 확보하기 위한 방안에 대한 연구는 미흡한 실정이다. 플러싱공법의 대표적은 종류는 재래식 플러싱공법과 단방향 플러싱공법이 있다. 재래식 플러싱공법은 제수밸브를 조작하지 않는 방법으로, 모든 소화전에서 용수를 방출하는 공법이다. 단방향 플러싱공법은 제수밸브를 조작하여, 일정한 방향으로 요수를 방출하는 공법이다. 단방향 플러싱공법은 재래식 플러싱공법보다 유속확보 측면에서 유리하여 관로 세척을 위한 유량 및 유속 확보가 용이하다. 단방향 플러싱공법을 적용하기 위해서는 관로의 유속을 확보하기 위해 세척구역 정의하는 것이 필요하다. 이에 본 연구에서는 세척구역 정의를 통한 플러싱공법 적용 방안을 제안하고자 한다. 세척구역은 크게 3단계로 구분한다. 먼저 블록단위의 세척순서를 결정하고, 블록 내 관망 세척구역을 결정한다. 이때 관로의 관경, 곡선구간, 세척구역의 길이를 고려하여 세척구역을 정의한다. 마지막으로 결정된 세척구역을 제수밸브의 위치, 조작 횟수에 근거하여 세척순서를 결정한다. 본 연구를 통해 실제 상수관망 플러싱공법 적용 절차 수립에 기여할 수 있다.

• Convergence Security Journal
• /
• v.23 no.5
• /
• pp.125-133
• /
• 2023

This paper proposes an AI model that determines parking and non-parking zones based on return authentication photos to address parking issues that may arise in shared electric scooter systems. In this study, we used a pre-trained Segformer_b0 model on ADE20K and fine-tuned it on tactile blocks and electric scooters to extract segmentation maps of objects related to parking and non-parking areas. We also presented a method to perform binary classification of parking and non-parking zones using the Swin model. Finally, after labeling a total of 1,689 images and fine-tuning the SegFomer model, it achieved an mAP of 81.26%, recognizing electric scooters and tactile blocks. The classification model, trained on a total of 2,817 images, achieved an accuracy of 92.11% and an F1-Score of 91.50% for classifying parking and non-parking areas.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.11-18
• /
• 2000

In this paper we present a new extensible model based upon the concept of subtransactions in real-time transaction systems. The nested transaction model originally proposed by J. Moss is extended for real-time uniprocessor transaction systems by adding explicit timing constraints. Based upon the model, an integrated concurrency control and scheduling algorithm is developed, that not only guarantees timing constraints of a set of real-time transactions but also maintains consistency of the database. The algorithm is based on the priority ceiling protocol of Sha et al. We prove that the Real-Time Nested Priority Ceiling Protocol prevents unbounded blocking and deadlock, and maintains the serializability of a set of real-time transactions. We use the upper bound on the duration that a transaction can be blocked to show that it is possible to analyze the schedulability of a transaction set using rate-monotonic priority assignment. This work is viewed as a step toward multiprocessor and distributed real-time nested transaction systems. Also, it is possible to be extended to include the real-time multimedia transactions in the emerging web-based database application areas.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.2
• /
• pp.17-23
• /
• 2000

Wireless link has high bit error rate compared with wired link and many users share this limited bandwidth. So it needs more powerful error control code and efficient media access control(MAC) to provide multimedia service reliably. In this paper we proposed efficient MAC frame format based on TDMA using mini-slot for request access. The number of mini-slots is variable based on the result of collision in the previous frame. This dynamic allocation of request mini-slots helps resolve the contention situation quickly and avoids the waste of bandwidth that may occur when there are several unneeded request mini-slots. The simulation results are also presented in terms of channel utilization, call blocking probability and cell transmission delay for mixed traffic environment.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.286-296
• /
• 2005

This paper presents a stereo-based image compression and transmission system for 3D realistic television. In the proposed system, a disparity map is extracted from an input stereo image pair and the extracted disparity map and one of two input images are transmitted or stored at a local or remote site. However, correspondences can not be determined in occlusion areas. Thus, it is not easy to recover 3D information in such regions. In this paper, a reconstruction image compensation algorithm based on error block concealment and in-loop filtering is proposed to minimize the reconstruction error in generating stereo image pair. The effectiveness of the proposed algorithm is shown in term of objective accuracy of reconstruction image with several real stereo image pairs.

• Journal of Cadastre & Land InformatiX
• /
• v.53 no.1
• /
• pp.21-36
• /
• 2023

Activity-based modeling systems have increasingly been developed to address the limitations of widely used traditional four-step transportation demand forecasting models. Accordingly, this paper introduces the Activity-BAsed Traveler Analyzer (ABATA) system. This system consists of multiple components, including an hourly total population estimator, activity profile constructor, hourly activity population estimator, spatial activity population estimator, and origin/destination estimator. To demonstrate the proposed system, the emission impact of land use changes in the 5-1 block Sejong smart city is evaluated as a case study. The results indicate that the land use with the scenario of work facility dispersed plan produced more emissions than the scenario of work facility centralized plan due to the longer travel distance. The proposed ABATA system is expected to provide a valuable tool for simulating the impacts of future changes in population, activity schedules, and land use on activity populations and travel demands.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.5
• /
• pp.294-302
• /
• 2020

In a genetic algorithm, computer simulations are performed based on the natural evolution process of life, such as selection, crossover, and mutation. The genetic algorithm searches the approximate optimal solution by the parallel arrangement of Schema, which has a short definition length, low order, and high adaptability. This study examined the possibility of improving the efficiency of the optimal solution by considering the characteristics of the building block hypothesis, which are one of the key operating principles of a genetic algorithm. This study evaluated the efficiency of the optimization results according to the gene sequence for the implementation in solving problems. The optimal design problem of the water pipe was selected, and the genetic arrangement order reflected the engineering specificity by dividing into the existing, the network topology-based, and the flowrate-based arrangement. The optimization results with a flowrate-based arrangement were, on average, approximately 2-3% better than the other batches. This means that to increase the efficiency of the actual engineering optimization problem, a methodology that utilizes clear prior knowledge (such as hydraulic properties) to prevent such excellent solution characteristics from disappearing is essential. The proposed method will be considered as a tool to improve the efficiency of large-scale water supply network optimization in the future.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.9
• /
• pp.327-336
• /
• 2015

Mobile game servers usually execute frequent dynamic memory allocation for generating the buffers that deal with clients requests. It causes to deteriorate the performance of game servers since it increases system workload and memory fragmentation. In this paper, we propose fixed-sized memory pool management method. Memory pool for the proposed method has a sequential memory structure based on circular linked list data structure. It solves memory fragmentation problem and saves time for searching the memory blocks which are required for memory allocation and deallocation. We showed the efficiency of the proposed method by evaluating the performance of dynamic memory allocation, through the proposed method and the memory pool management method based on boost open source library.