• Journal of the Korean Mathematical Society
• /
• v.57 no.2
• /
• pp.401-414
• /
• 2020

It is computationally expensive to compute principal components from scratch at every update or downdate when new data arrive and existing data are truncated from the data matrix frequently. To overcome this limitations, incremental principal component analysis is considered. Specifically, we present a sliding window based efficient incremental principal component computation from a covariance matrix which comprises of two procedures; simultaneous update and downdate of principal components, followed by the rank-one matrix update. Additionally we track the accurate decomposition error and the adaptive numerical rank. Experiments show that the proposed algorithm enables a faster execution speed and no-meaningful decomposition error differences compared to typical incremental principal component analysis algorithms, thereby maintaining a good approximation for the principal components.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.11
• /
• pp.2017-2020
• /
• 2011

Flicker, which is also known as voltage fluctuation, is an electromagnetic phenomenon generated by large scale nonlinear loads, such as arc furnaces and welding machines. Since a severe and continuous flicker can cause to some damages to electrically sensitive loads as well as human's visual irritations, it needs to be appropriately managed by being accurately measured, quantified and assessed. In Korea, an equivalent 10-Hz flicker index, shortly ${\Delta}V10$, is used to determine the permission limit of flicker. This paper presents an efficient calculation of the flicker index by using a half-cycle sliding window and a recursive method, showing a concrete calculating procedure of ${\Delta}V10$ from the viewpoint of signal processing.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.17 no.4
• /
• pp.85-94
• /
• 2021

The LPR system's trigger sensor makes problem occasionally due to the heave weight of vehicle or the obsolescence equipment. If we replace the hardware sensor to the deep-learning based software sensor in order to generate the trigger signal, LPR system maintenance would be a lot easier. In this paper we proposed the deep-learning sliding window based object detection and tracking algorithm for the LPR system's trigger signal generation. The gate passing vehicle's license plate recognition results are combined into the normal tracking algorithm to catch the position of the vehicle on the trigger line. The experimental results show that the deep learning sliding window based trigger signal generating performance was 100% for the gate passing vehicles including the 5.5% trigger signal position errors due to the minimum bounding box location errors in the vehicle detection process.

• Korean Journal of Remote Sensing
• /
• v.22 no.6
• /
• pp.601-612
• /
• 2006

This study proposes RAG (Region Adjancency Graph)-based image segmentation for large imagery in remote sensing. The proposed algorithm uses CN-chain linking for computational efficiency and multi-window operation of sliding structure for memory efficiency. Region-merging due to RAG is a process to find an edge of the best merge and update the graph according to the merge. The CN-chain linking constructs a chain of the closest neighbors and finds the edge for merging two adjacent regions. It makes the computation time increase as much as an exact multiple in the increasement of image size. An RNV (Regional Neighbor Vector) is used to update the RAG according to the change in image configuration due to merging at each step. The analysis of large images requires an enormous amount of computational memory. The proposed sliding multi-window operation with horizontal structure considerably the memory capacity required for the analysis and then make it possible to apply the RAG-based segmentation for very large images. In this study, the proposed algorithm has been extensively evaluated using simulated images and the results have shown its potentiality for the application of remotely-sensed imagery.

• Spatial Information Research
• /
• v.16 no.2
• /
• pp.219-236
• /
• 2008

Data stream collected from sensors contain a large amount of useful information including causality relationships. The causality join query for data stream is to retrieve a set of pairs (cause, effect) from streams of data. A part of causality pairs may however be lost from the query result, due to the delay from sensors to a data stream management system, and the limited size of sliding windows. In this paper, we first investigate spatial, temporal, and spatio-temporal aspects of the causality join query for data stream. Second, we propose several strategies for sliding window management based on these observations. The accuracy of the proposed strategies is studied by intensive experiments, and the result shows that we improve the accuracy of causality join query in data stream from simple FIFO strategy.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.281-288
• /
• 2008

Recently, the advance of multimedia hardware has fostered the development of wireless multimedia sensor network which is able to ubiquitously obtain multimedia content such as image or audio from the environment. The multimedia data which has several characteristics such as large size and correlation between the data requires reliability in transmission. However, the existing solution which take the focus on the efficiency of network mainly, is not appropriate to transmit the multimedia data. In the paper, we proposes a reliable asynchronous image transfer protocol, RAIT. RAIT applies double sliding window method in node-to-node image tansfer to prevent the packet loss caused by network congestion. The double sliding window consists of one sliding window for the receiving queue, which is used for prevention of packet loss caused by communication failure between nodes and the other sliding window for the sending queue which prevents the packet loss caused by network congestion. the routing node prevents the packet loss and guarantees the fairness between the nodes by scheduling the packets based on the image non-preemptively. The RAIT implements the double sliding window method by cross layer design between RAIT layer, routing layer, and queue layer. The experiment shows that RAIT guarantees the reliability of image transmission compared with the existing protocol.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.69-72
• /
• 2000

In CDMA systems, the performance of the typical multipath searcher degrades much according as the signal to noise ratio becomes low. In this paper, multipath searcher algorithm is proposed based on sliding window to overcome this drawback. In searcher systems, correlation values between incoming and local PN sequences are used to acquire multipath components. Therefore more accurate distributions of correlation values obtained through this proposed algorithm enables to get higher detection probability. In computer simulations, it is verified that proposed algorithm has better performances in Rayleigh fading channel and Gaussian channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11A
• /
• pp.1105-1116
• /
• 2008

Cognitive radio is one of the most effective techniques to improve the spectrum utilization efficiency. To implement the cognitive radio, spectrum sensing is considered as the key functionality because only counting on it, can the secondary users identify the spectrum holes and utilize them efficiently without causing interference to primary users. Generally, there are several spectrum sensing methods; the most common and simplest method is energy detection. However, the conventional energy detection has some disadvantages, which are caused by noise, especially, uncertain noise power leads to degradation of energy detector. In this paper, to solve this problem, we proposed sliding window-based energy detection method which can devide the frequency band of primary signal and noise using sliding window to estimate the power of primary user without the noise effect and achieve the better performance. It can calculate the energy of primary user only and can detect the primary signal. The simulation result shows that our proposed method outperforms conventional one.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.2
• /
• pp.25-34
• /
• 2007

Existing approaches that select an order for the join of three or more data streams have always used the simple heuristics. For their disadvantage - only one factor is considered and that is join selectivity or arrival rate, these methods lead to poor performance and inefficiency In some applications. The graph-based sliding window multi -join algorithm with optimal join sequence is proposed in this paper. In this method, sliding window join graph is set up primarily, in which a vertex represents a join operator and an edge indicates the join relationship among sliding windows, also the vertex weight and the edge weight represent the cost of join and the reciprocity of join operators respectively. Then the optimal join order can be found in the graph by using improved MVP algorithm. The final result can be produced by executing the join plan with the nested loop join procedure, The advantages of our algorithm are proved by the performance comparison with existing join algorithms.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.23-33
• /
• 2009

A shot change detection technique is an important technique for effective management of video data, thus it requires an adaptive algorithm for various video sequences to detect an accurate shot change frames. In this paper, we propose an adaptive shot change detection algorithm using histogram mean of frames within extension sliding window. Our algorithm calculates a frame feature value using histogram and defines an adaptive threshold using an average of histogram mean of frames within the extension sliding window and determines a shot change by comparing the feature value and the threshold. We obtained better detection rate than the conventional methods maximally by 15% in the experiment with the same test sequence. We verified real-time operation of shot change detection in the hardware platform with low performance by implementing it on TVUS HM-900 PLUS model of Homecast. The Proposed algorithm can be useful in the hardware platform such as portable multimedia player(PMP) or cellular phone with low CPU performance.