• Journal of Broadcast Engineering
• /
• v.18 no.2
• /
• pp.178-184
• /
• 2013

In this paper, we propose an efficient parallelization technique of PU-level motion estimation (ME) in the next generation video coding standard, high efficiency video coding (HEVC) to reduce the time complexity of video encoding. It is difficult to encode video in real-time because ME has significant complexity (i.e., 80 percent at the encoder). In order to solve this problem, various techniques have been studied, and among them is the parallelization, which is carefully concerned in algorithm-level ME design. In this regard, merge estimation method using merge estimation region (MER) that enables ME to be designed in parallel has been proposed; but, parallel ME based on MER has still unconsidered problems to be implemented ideally in HEVC test model (HM). Therefore, we propose two strategies to implement stable parallel ME using MER in HM. Through experimental results, the excellence of our proposed methods is shown; the encoding time using the proposed method is reduced by 25.64 percent on average of that of HM which uses sequential ME.

• Journal of KIISE:Computing Practices and Letters
• /
• v.11 no.1
• /
• pp.36-49
• /
• 2005

Recently, many researchers have given high attention to the semantic web services based on the semantic web technology While existing web services use the XML-based web service description language, WSDL, semantic web services are utilizing web service description languages such as DAML-S in ontology languages. The researchers of semantic web services are generally focused on web service discovery, web service invocation, web service selection and composition, and web service execution monitoring. Especially, the semantic web service discovery as the basis to accomplish the ultimate semantic web service environment has some different properties from previous information discovery areas. Hence, it is necessary to develop the storage system and discovery mechanism appropriate to the semantic well description languages. Even though some related systems have been developed, they are not appropriate for the embedded system environment, such as intelligent robotics, in which there are some limitations on memory disk space, and computing power In this regard, we in the embedded system environment have developed the document management system which efficiently manages the web service documents described by DAML-S for the purpose of the semantic web service discovery, In addition, we address the distinguishing characteristics of the system developed in this paper, compared with the related researches.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1170-1181
• /
• 2012

Wireless Sensor Networks(WSNs) are used in diverse applications. In general, sensor nodes that are easily deployed on specific areas have many resource constrains such as battery power, memory sizes, MCUs, RFs and so on. Hence, first of all, the efficient energy consumption is strongly required in WSNs. In terms of event states, event-driven deliverly model (i.e. surveillance and reconnaissance applications) has several characteristics. On the basis of such a model, clustering algorithms can be mostly used to manage sensor nodes' energy efficiently owing to the advantages of data aggregations. Since a specific node collects packets from its child nodes in a network topology and aggregates them into one packet to relay them once, amount of transmitted packets to a sink node can be reduced. However, most clustering algorithms have been designed without considering can be reduced. However, most clustering algorithms have been designed without considering characteristics of event-driven deliverly model, which results in some problems. In this paper, we propose enhanced clustering algorithms regarding with both targets' movement and energy efficiency in order for applications of surveillance and reconnaissance. These algorithms form some clusters to contend locally between nodes, which have already detected certain targets, by using a method which called CHEW (Cluster Head Election Window). Therefore, our proposed algorithms enable to reduce not only the cost of cluster maintenance, but also energy consumption. In conclusion, we analyze traces of the clusters' movements according to targets' locations, evaluate the traces' results and we compare our algorithms with others through simulations. Finally, we verify our algorithms use power energy efficiently.

• Journal of KIISE:Software and Applications
• /
• v.33 no.9
• /
• pp.776-786
• /
• 2006

This paper proposes XML based mobile information visualization system using rectangle layout to show effectively XML based information to user on mobile devices which do not have a rich display feature. We define XML schema that can describes information in graph with cycle as well as information in tree form. It suggests using rectangle layout method that is an improvement of the traditional method of the radial layout because the specificity of the mobile display should be considered when XML information is rendered on the screen. And then, it applies DOI of fisheye view algorithm to information on the rectangle layout to represent all and user interest information. And it also suggests an effective method considering capability of mobile devices to decrease user's confusion and improve awareness of user when a user Interest target selected. The proposed information visualization system in the form of focus+context supports an effective interface for information retrieval via mobile devices, such as PDA, cellular phone and smart phone, that usually have less power of CPU than that of PC and the constraints of display and memory. In this paper, it performs experiments and makes an evaluation comparing information visualization method between the traditional radial layout and the proposed rectangle layout.

• Journal of the Institute of Convergence Signal Processing
• /
• v.8 no.3
• /
• pp.156-162
• /
• 2007

The parallel beam SPECT system acquires projection data by using collimators in conjunction with photon detectors. The projection data of the parallel beam SPECT system is, however, blurred by the point response function of the collimator that is used to define the range of directions where photons can be detected. By increasing the number of parallel holes per unit area in collimator, one can reduce such blurring effect. This approach also, however, has the blurring problem if the distance between the object and the collimator becomes large. In this paper we consider correction methods for artifacts caused by non-circular orbit of parallel beam SPECT with many parallel holes per detector cell. To do so, we model the relationship between the object and its projection data as a linear system, and propose an iterative reconstruction method including artifacts correction. We compute the projector and the backprojector, which are required in iterative method, as a sum of convolutions with distance-dependent point response functions instead of matrix form, where those functions are analytically computed from a single function. By doing so, we dramatically reduce the computation time and memory required for the generation of the projector and the backprojector. We conducted several simulation studies to compare the performance of the proposed method with that of conventional Fourier method. The result shows that the proposed method outperforms Fourier methods objectively and subjectively.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.5
• /
• pp.169-176
• /
• 2020

Recently, deep neural networks (DNNs) have brought revolutions to many mobile and embedded devices by providing human-level machine intelligence for various applications. However, high inference accuracy of such DNNs comes at high computational costs, and, hence, there have been significant efforts to reduce computational overheads of DNNs either by compressing off-the-shelf models or by designing a new small footprint DNN architecture tailored to resource constrained devices. One notable recent paradigm in designing small footprint DNN models is sharing parameters in several layers. However, in previous approaches, the parameter-sharing techniques have been applied to large deep networks, such as ResNet, that are known to have high redundancy. In this paper, we propose a parameter-sharing method for already parameter-efficient small networks such as ShuffleNetV2. In our approach, small templates are combined with small layer-specific parameters to generate weights. Our experiment results on ImageNet and CIFAR100 datasets show that our approach can reduce the size of parameters by 15%-35% of ShuffleNetV2 while achieving smaller drops in accuracies compared to previous parameter-sharing and pruning approaches. We further show that the proposed approach is efficient in terms of latency and energy consumption on modern embedded devices.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.10a
• /
• pp.292-294
• /
• 2018

Recently, damage caused by natural disasters such as fire, earthquake, heavy rains and heavy snow is increasing. In addition, traffic accidents due to freezing, fog and fire in tunnels and bridges are frequently occurring. In such a disaster situation, it is very important to take prompt action by the person in charge of managing the facility and area.To this end, a disaster broadcasting system is used, but in the existing system, the broadcasting room and the speaker are connected by a wired connection. Also, the person in charge has to be in the broadcasting room to broadcast, which has a problem of delaying the time. In this paper, we design a disaster broadcasting system using LTE modem. The designed system enables a broadcasting person to make a call to a broadcasting system from anywhere using a cellular phone and a public telephone. Broadcasting via telephone is possible only with the telephone number pre-registered in the system and can be registered / deleted by the administrator. The registered telephone number, incoming voice file, and announcement voice for automatic broadcasting are stored in the system internal SD memory for convenient management. This disaster broadcasting system is expected to contribute to quick and convenient disaster broadcasting.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.2
• /
• pp.19-30
• /
• 2013

We study sub-Peres functions that are defined recursively as Peres function for random number generation. Instead of using two parameter functions as in Peres function, the sub-Peres functions uses only one parameter function. Naturally, these functions produce less random bits, hence are not asymptotically optimal. However, the sub-Peres functions runs in linear time, i.e., in O(n) time rather than O(n logn) as in Peres's case. Moreover, the implementation is even simpler than Peres function not only because they use only one parameter function but because they are tail recursive, hence run in a simple iterative manner rather than by a recursion, eliminating the usage of stack and thus further reducing the memory requirement of Peres's method. And yet, the output rate of the sub-Peres function is more than twice as much as that of von Neumann's method which is widely known linear-time method. So, these methods can be used, instead of von Neumann's method, in an environment with limited computational resources like mobile devices. We report the analyses of the sub-Peres functions regarding their running time and the exact output rates in comparison with Peres function and other known methods for random number generation. Also, we discuss how these sub-Peres function can be implemented.

• Proceedings of the ESK Conference
• /
• 1993.04a
• /
• pp.111-123
• /
• 1993

TravTek이란 Travel Technology의 합성어이며, 미래의 여행자들이 차를 사용하여 여행할 때, 보다 편리하고 쾌적한 여행이 될 수 있도록 차에 컴퓨터단말기를 부착하여 현재 주행하고 있는 도로 를 차안에서 화면을 통하여 볼 수 있고, 컴퓨터가 최단경로를 운전자에게 제시하고, 도로의 상황과 여 행정보(즉 호텔, 관공명소, 행사안내등)를 컴퓨터화면으로 나타내고, 그 정보를 컴퓨터음성으로 들려 주는 것등이 TravTek 시스템의 주된 요소들이다. 현재 미국 플로리다주의 올란도시에서 GM회사가 TravTek 시스템을 설치한 차 100대를 가지고 10개의 기관이 합작으로 평가연구중에 있으며, 이 논문에서 다루고자 하는 것은 그중에서 이차의 인간공학적 평가로 제한하고자 한다. 이러한 시스템을 설치한 차 를 타고 여행할 때, 여행자가 과연 얼마나 안락하게 여행할 수 있으며, 도로의 체증현상을 줄이고, 사 고를 예방하며, 차의 설계와 목적이 인간공학적으로 합당한 가를 알아보고자 하는 연구이다. 인간공학적 평가 인자들은 (1) 운전자의 수행도, (2) 사용자 선호도, (3) 사용자 인식, (4) 운행정보등이다. 그리고 컴퓨터음성을 사용하였을 때와 사용하지 않았을 때의 두가지 경우와 (1) 움직이는 컴퓨터 지도를 사용하 였을 때, (2) 단순화 한 도로안내를 사용하였을 때, (3) 컴퓨터 지도를 사용하지 않았을 경우(종이지도 사용)에 관해 위의 4가지 인간공학적 인자들을 평가하고자 한다. 이 연구는 아직도 진행중이라 발표하 고자 하는 논문역시 현재까지의 연구결과를 토대로 발표하는 것이므로 완전한 결론을 내릴 수는 없고, 진행과정의 내용과 토의사항과 잠정적인 결론을 제시하고자 한다.기서 사용된 아이콘에 대해서만 타당한 것으로 이것을 모든 아이콘에 대해 일반화시키기는 어려우나 이후에 행해질 Icon-based User Interface 분야의 많은 연구들의 기초가 될 것이다. 더불어 아이콘과 관련된 많은 요인들(문화적 영향, 아이콘 색깔, 크기, 아이콘의 위치등이 인식에 미치는 영향)에 대해서도 연구가 행해져야 할 것이다. 확인하고 각각의 기능을 분명히 했다.가 수월하게 하였고 메모리를 동적으로 관리할 수 있게 하였다. 또한 기존의 smpl에 디버깅용 함수 및 설비(facility) 제어용 함수를 추가하여 시뮬레이션 프로그램 작성을 용이하게 하였다. 예를 들면 who_server(), who_queue(), pop_Q(), push_Q(), pop_server(), push_server(), we(), wf(), printfct() 같은 함수들이다. 또한 동시에 발생되는 사건들의 순서를 조종하기 위해, 동시에 발생할 수 있는 각각의 사건에 우선순위를 두어 이 우선 순위에 의하여 사건 리스트(event list)에서 자동적으로 사건들의 순서가 결정되도록 확장하였으며, 설비 제어방식에 있어서도 FIFO, LIFO, 우선 순위 방식등을 선택할 수 있도록 확장하였다. SIMPLE는 자료구조 및 프로그램이 공개되어 있으므로 프로그래머가 원하는 기능을 쉽게 추가할 수 있는 장점도 있다. 아울러 SMPLE에서 새로이 추가된 자료구조와 함수 및 설비제어 방식등을 활용하여 실제 중형급 시스템에 대한 시뮬레이션 구현과 시스템 분석의 예를 보인다._3$", chain segment, with the activation energy of carriers from the shal

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2524-2532
• /
• 1999

In this paper, we present a new buffer pool management scheme designed for video type news objects to build a cost-effective News On Demand storage server for serving users requests beyond the limitation of disk bandwidth. In a News On Demand Server where many of users request for video type news objects have to be serviced keeping their playback deadline, the maximum numbers of concurrent users are limited by the maximum disk bandwidth the server provides. With our proposed buffer cache management scheme, a requested data is checked to see whether or not it is worthy of caching by checking its average arrival interval and current disk traffic density. Subsequently, only granted news objects are permitted to get into the buffer pool, where buffer allocation is made not on the block basis but on the object basis. We evaluated the performance of our proposed caching algorithm through simulation. As a result of the simulation, we show that by using this caching scheme to support users requests for real time news data, compared with serving those requests only by disks, 30% of extra requests are served without additional cost increase.