• Journal of Information Processing Systems
• /
• v.16 no.4
• /
• pp.832-844
• /
• 2020

The degree of dispersion of a random variable can be described by the variance, which reflects the distance of the random variable from its mean. However, the time complexity of the traditional variance calculation algorithm is O(n), which results from full calculation of all samples. When the number of samples increases or on the occasion of high speed signal processing, algorithms with O(n) time complexity will cost huge amount of time and that may results in performance degradation of the whole system. A novel multi-step recursive algorithm for variance calculation of the time-varying data series with O(1) time complexity (constant time) is proposed in this paper. Numerical simulation and experiments of the algorithm is presented and the results demonstrate that the proposed multi-step recursive algorithm can effectively decrease computing time and hence significantly improve the variance calculation efficiency for time-varying data, which demonstrates the potential value for time-consumption data analysis or high speed signal processing.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.835-838
• /
• 2000

Popular methods for extracting a text region in video images are in general based on analysis of a whole image such as merge and split method, and comparison of two frames. Thus, they take long computing time due to the use of a whole image. Therefore, this paper suggests the faster method of extracting a text region without processing a whole image. The proposed method uses line sampling methods, FFT and neural networks in order to extract texts in real time. In general, text areas are found in the higher frequency domain, thus, can be characterized using FFT The candidate text areas can be thus found by applying the higher frequency characteristics to neural network. Therefore, the final text area is extracted by verifying the candidate areas. Experimental results show a perfect candidate extraction rate and about 92% text extraction rate. The strength of the proposed algorithm is its simplicity, real-time processing by not processing the entire image, and fast skipping of the images that do not contain a text.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.4
• /
• pp.240-250
• /
• 1988

This pc-vision system digitizes/displays 512*512*8 bit pixel image in real time and is capable of the various image processing. This system provides a versatile solution to those users pursuing high performance image processing system compatible with the VME bus, and is general purpose imaging system giving the optimal efficiency for machine vision, medical use and various task. In this paper, Image processing technique has classified image enhancement and image analysis in order to design and implement the pc-vision system. In order to improve processing speed, This system unilizing ROI processing performs point operation, local operation and global operation as well as common arithmetic/logic operation in real time.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.267-269
• /
• 2005

This paper describes a consideration on the sampling in linearly time-varying (LTV) systems in view of the convenience in digital signal processing. The relation between a continuous-time and a discrete-time system models is investigated for a simple linear time-invariant system. Based on the results of the investigation, we first consider discrete-time models for LTV systems, Then the simplicity of the models in terms of microprocessor-based digital signal processing is compared.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.17 no.6
• /
• pp.355-365
• /
• 2022

This paper addresses the problem of real-time tracking a high-speed ballistic target. Particle filters can be considered to overcome the nonlinearity in motion and measurement models in the ballistic target. However, it is difficult to apply particle filters to real-time systems because particle filters generally require much computation time. This paper proposes an accelerated particle filter using graphics processing unit (GPU) for real-time ballistic target tracking. The real-time performance of the proposed method was tested and analyzed on a widely-used embedded system. The comparison results with the conventional particle filter on CPU (central processing unit) showed that the proposed method improved the real-time performance by reducing computation time significantly.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.27 no.1
• /
• pp.76-86
• /
• 2023

Radars used by air-crafts have two important characteristics; First, they should have a real-time signal processing system finishing signal processing before deadline while getting and processing successive in-phase and quadrature data. Second, they can cover a lot of modes including A2A(Air to Air), A2G(Air to Gound), A2S(Air to Sea), and Ground Map(GM). So the structure of radar signal processing SWs in modern airborne radars are becoming more complicate. Also, the implementation of radar signal processing SW needs to reuse common code blocks between other modes for efficiency or change some of the code blocks into alternative algorithm blocks. These are the reason why the radar signal processing SW framework suggested in this paper is taking advantage of modular programming. This paper proposes an modular framework applicable on the airborne radar signal processing SW maintaining the real-time characteristic using the signal processing procedures for A2G/A2S as examples.

• The KIPS Transactions:PartD
• /
• v.11D no.7 s.96
• /
• pp.1385-1398
• /
• 2004

This paper discusses an effective processing of subsequence matching under time warping in time-series databases. Time warping is a trans-formation that enables finding of sequences with similar patterns even when they are of different lengths. Through a preliminary experiment, we first point out that the performance bottleneck of Naive-Scan, a basic method for processing of subsequence matching under time warping, is on the CPU processing step. Then, we propose a novel method that optimizes the CPU processing step of Naive-Scan. The proposed method maximizes the CPU performance by eliminating all the redundant calculations occurring in computing the time warping distance between the query sequence and data subsequences. We formally prove the proposed method does not incur false dismissals and also is the optimal one for processing Naive-Scan. Also, we discuss the we discuss to apply the proposed method to the post-processing step of LB-Scan and ST-Filter, the previous methods for processing of subsequence matching under time warping. Then, we quantitatively verify the performance improvement ef-fects obtained by the proposed method via extensive experiments. The result shows that the performance of all the three previous methods im-proves by employing the proposed method. Especially, Naive-Scan, which is known to show the worst performance, performs much better than LB-Scan as well as ST-Filter in all cases when it employs the proposed method for CPU processing. This result is so meaningful in that the performance inversion among Nive- Scan, LB-Scan, and ST-Filter has occurred by optimizing the CPU processing step, which is their perform-ance bottleneck.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1910-1916
• /
• 1999

This paper suggested to solve ATM switch performance and service rate which was input buffer managed scheme in ATM network with burst traffic characteristics, For this purpose, ATM multiplexer is prepared before sending for handling burst random input traffic to multiplex and then sort based on cell inter-arrival time and cell processing due time which had been marked after that. The server looks for cell header with the most shortest due time and sends it, thus it is satisfied that real time traffic for instance CBR and rt-VBR was guaranteed cell processing time to send fast than non real time traffic. For analysis of ATM switch performance with cell processing due time and priority, each output port has divided into four different virtual buffer and each buffer has assigned different cell inter-arrival time and processing due time according to ATM Forum for example CBT/rt-VBR, nrt-VBR, ABR and UBR and showed it’s optimal service parameters then analyzed service rate behaviors according to each traffic characteristics.

• Journal of Internet Computing and Services
• /
• v.18 no.3
• /
• pp.1-9
• /
• 2017

Smart Cities intelligently manage numerous infrastructures, including Smart-City IoT devices, and provide a variety of smart-city applications to citizen. In order to provide various information needed for smart-city applications, Smart Cities require a function to intelligently process large-scale streamed big data that are constantly generated from a large number of IoT devices. To provide smart services in Smart-City, the Smart-City Consortium uses stream reasoning. Our stream reasoning requires real-time processing of big data. However, there are limitations associated with real-time processing of large-scale streamed big data in Smart Cities. In this paper, we introduce one of our researches on cloud computing based real-time distributed-parallel-processing to be used in stream-reasoning of IoT big data in Smart Cities. The Smart-City Consortium introduced its previously developed smart-city middleware. In the research for this paper, we made cloud computing based real-time distributed-parallel-processing available in the cloud computing platform of the smart-city middleware developed in the previous research, so that we can perform real-time distributed-parallel-processing with them. This paper introduces a real-time distributed-parallel-processing method and system for stream reasoning with IoT big data transmitted from various sensors of Smart Cities and evaluate the performance of real-time distributed-parallel-processing of the system where the method is implemented.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.2
• /
• pp.25-42
• /
• 2013

We consider a project time-cost tradeoff problem with two milestones, where one of the jobs has an uncertain processing time. Unless each milestone is completed on time, some penalty cost may be imposed. However, the penalty costs can be avoided by compressing the processing times of some jobs, which requires additional resources or costs. The objective is to minimize the expected total costs subject to the constraint on the expected project completion time. We show that the problem can be solved in polynomial time if the precedence graph of a project is a chain.