• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1232-1239
• /
• 2006

In video standards such as MPEG-1/2/4 and H.264/AVC, motion estimation / compensation(ME/MC) process causes the most encoding complexity of video encoder. The full search method, which is used in general video codecs, exhausts much encoding time because it compares current macroblock with those at all positions within search window for searching a matched block. For the alleviation of this problem, the fast search methods such as TSS, NTSS, DS and HEXBS are exploited at first. Thereafter, DS based MVFAST, PMVFAST, MAS and FAME, which utilize temporal or spacial correlation characteristics of motion vectors, are developed. But there remain the problems of image quality degradation and algorithm complexity increase. In this thesis, the proposed algorithm maximizes search speed and minimizes the degradation of image quality by determining initial search point correctly and using simple one-dimension search patterns considering motion characteristics of each frame.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9C
• /
• pp.573-580
• /
• 2011

WSNs (Wireless Sensor Networks) are becoming more widely used in various fields, and improving localization performance is a crucial and essential issue for sensor network applications. In this paper, we propose a low-complexity localization mechanism for WSNs that operates in 3D (Three-Dimensional) space. The basic idea is to use aerial vehicles or flying objects that are deliberately equipped with the anchor nodes. These anchor nodes periodically broadcast beacon signals containing their current locations, and the unknown nodes receive these signals as soon as they enter the communication range of the anchors. We estimate the locations of the unknown nodes based on the proposed scheme that transforms the 3D problem into 2D computations to reduce the complexity of 3D localization. Simulated results show that our approach is an effective scheme for 3D self-positioning in WSNs.

• Journal of KIISE:Software and Applications
• /
• v.30 no.1_2
• /
• pp.103-116
• /
• 2003

States explosion due to composition of spaces of data, temporal, and locational values is one of the well-known critical problems which cause difficulty in understanding and analysing real-time systems specified with state-based formal methods. In order to overcome this problem, this paper presents an abstraction method for state minimization based on an abstraction in system specification and an abstraction in system execution. The first is named the syntactic in system specification and an abstraction in system execution. The first is named the syntactic abstraction, through which the patterns of the unconditionally internalized computation and the repetition and selection structures are abstracted. The latter is named the semantic abstraction, through which the patterns of the execution space represented with data. Through the abstractions, the components of a system in specification and execution model is hierarchically organized. The system can be analyzed briefly in the upper level in an skeleton manner with low complexity. The system, however, can be abstraction method for the state minimization and the decrease in analysis complexity through the abstraction with examples.

• Journal of Korean Society for Geospatial Information Science
• /
• v.17 no.4
• /
• pp.31-38
• /
• 2009

Most 3D models found in the literature focus on theoretical topology for exterior 3D volumes. Although there are a few indoor models such as CityGML or IFC, implementing a full topology for the indoor spaces is either less practical due to the complexity or not even necessary in some application domains. Moreover, current spatial DBMSs do not support functionalities explicitly for 3D topological relations. In this study, an alternative method to build a 3D indoor model with less complexity ernativespatial DBMS is suggested. Focusnation the fact that semantic attributes can be storedion the floor surface, we suggestivemulti-layered 3D model for indoor spaces. We show the process to build the proposed model in the PostGIS, a spatial DBMS. And, then, as an example application, we illustrate the process to build and run a campus building information system.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.1
• /
• pp.37-43
• /
• 2020

In this paper, we propose an efficient AB² multiplication algorithm using SPB(shifted polynomial basis) over finite fields. Using the feature of the SPB, we split the equation for AB² multiplication into two parts. The two partitioned equations are executable at the same time, and we derive an algorithm that processes them in parallel. Then we propose an efficient semi-systolic AB² multiplier based on the proposed algorithm. The proposed multiplier has less area-time (AT) complexity than related multipliers. In detail, the proposed AB² multiplier saves about 94%, 87%, 86% and 83% of the AT complexity of the multipliers of Wei, Wang-Guo, Kim-Lee, Choi-Lee, respectively. Therefore, the proposed multiplier is suitable for VLSI implementation and can be easily adopted as the basic building block for various applications.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2017.04a
• /
• pp.170-170
• /
• 2017

기후변화 따른 스마트팜 돈사 외부 환경의 변화에 대응하고, 사육 환경을 능동적으로 개선하기 위한 연구가 수행 중이다. 돈사 내 열전달 요소 간 상호 역학성 분석을 위해서 고려해야할 사항은 입기구, 보온 등, 열풍기, 단열제, 위치, 방향, 돈사의 연평균 온도, 습도, 연중 일사량, 가축의 열복사 등 상호 복잡하게 연관되어 있는 물리량이다. 돈사 전체 열손실, 자연발생 에너지량, 강제발생 에너지량, 난방용량 등을 고려한 순간 열부하 산정을 위한 여러 방법 중 우선적으로 CFD(Computational Fluid Dynamics)를 이용하였다. 순간 열부하 산정을 위한 해석 도구 선정에 있어서 다양한 유체 및 기체 전산 유체역학 Solver(Fluent, Open-FOAM, Blender)를 고려하였다. 공간 Mech를 수행하기 위한 도구로는 공개 소프트웨어 인 FreeFem++ 3.51-4 (http://www.freefem.org)를 이용하였다. 이 과정에서 일부 기체 (암모니아)의 농도를 난수로 변화시키는 기법을 적용하여 가상적으로 돈사의 환경을 Pseudo 시뮬레이션 하였다. 결과적으로 Fluent에 비하여 OpenFOAM을 이용하여 얻은 열유동의 방향(속도)과 크기 백터가 상대적으로 크게 나타났다. Fluent가 시계열 상에서 혼합 기체 물리량 변화를 무시할 수 있는 안정되고 균일한 환경에 적합하기 때문인 것으로 판단되었다. Blender의 경우 Lattice Boltzmann methods 과 Smoothed-particle hydrodynamics 방법을 이용한 유체/입자 동력학 모델링을 제공함에 있어 시각적 효과를 강조하는 기능에 중점을 두었다. Fluent와 Blender에서 제공하는 해석 연산 모듈의 정확성 검증을 위해선 공간 분해능을 높인 정밀 계측 시스템을 이용하여 검증할 필요가 있다. Open-FOAM를 이용한 열부하 분석 수행이 상대적으로 높은 절대값을 보이는 특성은 열부하 제어 시스템의 Overshoot를 유발할 가능성이 있으므로 이에 대한 해석 모델의 보정이 추가적으로 필요할 것이다. CFD의 한계인 시간 복잡도를 낮추고 상대적으로 높은 시계열 분해능을 확보할 경우 돈사 내 환기시스템에 맞는 소요 환기량 실시간 산정이 가능해지고 외부기상 및 돈사내부 복사열을 활용함과 동시에 돈군 순환에 상응하는 실시간 열부하 관리 시스템 도출이 가능할 것이다.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.7 no.3
• /
• pp.239-247
• /
• 2005

A new railway line of about 17km length was planned between Dongbaeksan and the neighboring town Dokye to improve the existing decrepit railway system. New line about 17km of the distance will almost be in circular alignment tunnels owing to the difference of elevation about 380m. Since the geology of the area is rather unusual compared to the normal in South Korea, extensive geological investigations have been carried out to prepare geological maps and profiles along the planned tunnel routes. The tunnel will almost be in sedimentary rock formations, such as limestone, sandstone, shale, coal etc and be near abandoned mines Various rock formations have the complicated, alter ed those rocks, but are well developed with laminated formations. Each rock formations have been classified using the Q-system and the cost of tunnel excavation, support has been estimated and compared for three alternative routes in the design stage. Based on these estimates, the final route of t he railway line was chosen.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.1C
• /
• pp.87-92
• /
• 2006

An $AB^2$ modular operation is an efficient basic operation for the public key cryptosystems and various systolic architectures for $AB^2$ modular operation have been proposed. However, these architectures have a shortcoming for cryptographic applications due to their high area complexity. Accordingly, this paper presents an partitioned $AB^2$ systolic modular multiplier over GF($2^m$). A dependency graph from the MSB $AB^2$ modular multiplication algorithm is partitioned into 1/3 to get an partitioned $AB^2$ systolic multiplier. The multiplier reduces the area complexity about 2/3 compared with the previous multiplier. The multiplier could be used as a basic building block to implement the modular exponentiation for the public key cryptosystems based on smartcard which has a restricted hardware requirements.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.6
• /
• pp.673-679
• /
• 2014

The important requirements of designing a pattern classifier are high throughput and low memory requirements, and low cost hardware implementation. A pattern classifier by using Multiple Attractor Cellular Automata(MACA) proposed by Maji et al. reduced the complexity of the classification algorithm from $O(n^3)$ to O(n) by using Dependency Vector(DV) and Dependency String(DS). In this paper, we generate a pattern classifier using LFSR to improve efficiently the space and time complexity and we propose a method for finding DV by using the 0-basic path. Also we investigate DV and the attractor of the generated pattern classifier. We can divide an n-bit DS by m number of $DV_i$ s and generate various pattern classifiers.

• The Transactions of the Korea Information Processing Society
• /
• v.13 no.7
• /
• pp.311-318
• /
• 2024

As the amount of data increases due to the development of artificial intelligence and the Internet, data management is becoming increasingly important, and the efficient utilization of data retrieval and memory space is crucial. In this study, we investigate how to optimize search speed and memory efficiency by analyzing data structure based on metadata. As a research method, we compared and analyzed the performance of the array, association list, dictionary binary tree, and graph data structures using metadata of photographic images, focusing on temporal and space complexity. Through experimentation, it was confirmed that dictionary data structure performs best in collection speed and graph data structure performs best in search speed when dealing with large-scale image data. We expect the results of this paper to provide practical guidelines for selecting data structures to optimize search speed and memory efficiency for the images data.