• Journal of Satellite, Information and Communications
• /
• v.11 no.4
• /
• pp.1-9
• /
• 2016

This paper was studied in two ways with respect to the information received from the video signal separation technique of PPI Scop radar device. The proposed technique consists in generating an image signal through the video signal separation and synthesis, symbol generation, the residual image signal generation process. This technology can greatly improve the operating convenience with improved ease of discrimination, screen readability for the operator in analyzing radar information. The first proposed method was constructed for high-speed FPGA-based information processing systems for high speed operation stability of the system. The second proposed method was implemented intelligent algorithms and a software algorithm function curve associated resources.This was required to meet the constraints on the radar information, analysis system. Existing radar systems have not the frame data analysis unit image. However, this study was designed to image data stored in the frame-by-frame analysis of radar images with express information MPEG4 video. Key research content is to highlight the key observations expresses the target, the object-specific monitoring information to the positive image processing algorithm and the function curve delays. For high-definition video, high-speed to implement data analysis and expressing a variety of information was applied to the ARM Processor Support in Pro ASIC3.

• The KIPS Transactions:PartD
• /
• v.12D no.3 s.99
• /
• pp.345-354
• /
• 2005

Subsequence matching is one of the most important operations in the field of data mining. The existing subsequence matching algorithms use only one index, and their performance gets worse as the difference between the length of a query sequence and the site of windows, which are subsequences of a same length extracted from data sequences to construct the index, increases. In this paper, we propose a new subsequence matching method based on index interpolation to overcome such a problem. An index interpolation method constructs two or more indexes, and performs search ing by selecting the most appropriate index among them according to the given query sequence length. In this paper, we first examine the performance trend with the difference between the query sequence length and the window size through preliminary experiments, and formulate a search cost model that reflects the distribution of query sequence lengths in the view point of the physical database design. Next, we propose a new subsequence matching method based on the index interpolation to improve search performance. We also present an algorithm based on the search cost formula mentioned above to construct optimal indexes to get better search performance. Finally, we verify the superiority of the proposed method through a series of experiments using real and synthesized data sets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.8B
• /
• pp.667-680
• /
• 2008

In this work, we present the results of our empirical study on 802.11 wireless LAN network traffic. We collect the packet trace from existing campus wireless LAN infra-structure. We analyzed four different data sets: aggregate traffic, upstream traffic, downstream traffic, tcp only packet trace from aggregate traffic. We analyze the time series aspect of underlying traffic (byte count process and packet count process), marginal distribution of time series, and packet size distribution. We found that in all four data sets there exist long-range dependent property in byte count and packet count process. Inter-arrival distribution is well fitted with Pareto distribution. Upstream traffic, i.e. from the user to Internet, exhibits significant difference in its packet size distribution from the rests. Average packet size of upstream traffic is 151.7 byte while average packet size of the rest of the data sets are all greater than 260 bytes. Packets with full data payloads constitutes 3% and 10% in upstream traffic and the downstream traffic, respectively. Despite the significant difference in packet size distribution, all four data sets have similar Hurst values. The Hurst alone does not properly explain the stochastic characteristics of the underlying traffic. We model the underlying traffic using fractional-ARIMA (FARIMA) and fractional Gaussian Noise (FGN). While the fractional Gaussian Noise based method is computationally more efficient, FARIMA exhibits superior performance in accurately modeling the underlying traffic.

• The Journal of the Acoustical Society of Korea
• /
• v.7 no.4
• /
• pp.31-53
• /
• 1988

In this work we study extensively the structures and performance characteristics of the block least mean-square (BLMS) adaptive digital filters (ADF's) that can be realized efficiently using the fast Fourier transform (FFT). The weights of a BLMS ADF realized using the FFT can be adjusted either in the time domain or in the frequency domain, leading to the time-domain BLMS(TBLMS) algorithm or the frequency-domain BLMS (FBLMS) algorithm, respectively. In Part Ⅰof the paper, we first present new results on the overlap-add realization and the number-theoretic transform realization of the FBLMS ADF's. Then, we study how we can incorporate the concept of different frequency-weighting on the error signals and the self-orthogonalization of weight adjustment in the FBLMS ADF's , and also in the TBLMS ADF's. As a result, we show that the TBLMS ADF can also be made to have the same fast convergence speed as that of the self-orthogonalizing FBLMS ADF. Next, based on the properties of the sectioning operations in weight adjustment, we discuss unconstrained FBLMS algorithms that can reduce two FFT operations both for the overlap-save and overlap-add realizations. Finally, we investigate by computer simulation the effects of different parameter values and different algorithms on the convergence behaviors of the FBLMS and TBLMS ADF's. In Part Ⅱ of the paper, we will analyze the convergence characteristics of the TBLMS and FBLMS ADF's.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.15 no.5
• /
• pp.11-24
• /
• 2011

A real-time hybrid test of a 3 story-3 bay reinforced concrete frame which is divided into numerical and physical substructure models under uniaxial earthquake excitation was run using a fixed iteration implicit HHT time integration method. The first story inner non-ductile column was selected as the physical substructure model, and uniaxial earthquake excitation was applied to the numerical model until the specimen failed due to severe damage. A finite-element analysis program, Mercury, was newly developed and optimized for a real-time hybrid test. The drift ratio based on the top horizontal displacement of the physical substructure model was compared with the result of a numerical simulation by OpenSees and the result of a shaking table test. The experiment in this paper is one of the most complex real-time hybrid tests, and the description of the hardware, algorithm and models is presented in detail. If there is an improvement in the numerical model, the evaluation of the tangent stiffness matrix of the physical substructure model in the finite element analysis program and better software to reduce the computational time of the element state determination for the force-based beam-column element, then the comparison with the results of the real-time hybrid test and the shaking table test deserves to make a recommendation. In addition, for the goal of a "Numerical simulation of the complex structures under dynamic loading", the real time hybrid test has enough merit as an alternative to dynamic experiments of large and complex structures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1643-1651
• /
• 1999

Video-On-Demand (VOD) is expected to provide the user with interactive operations such as VCR functions. In particular, fast scan functions like “Fast Forward” of “Fast Backward” for a certain speedup playback are required. Since they require a significant amount of system resources, schemes to reduce bandwidth requirements for the network or disk are needed. In MPEG standard, Group-of-Pictures (GoP) is a random access unit which can be decoded independently. Since storing and transmitting a video stream based on GoP is efficient, it is practical to support fast scan functions based on GoP. In this paper, we present a dynamic transmission scheduling scheme to support fast scan functions with m-times normal playback rate for a stored video. The proposed scheme writes a transmission schedule whenever user requests a fast scan function. That is, the scheme constructs the data set to be smoothed by skipping GoPs according to a given speedup factor, and then writes the transmission schedule by applying a bandwidth smoothing. Finally, the scheme restarts the transmission of video data to a client according to the new schedule. The proposed scheme results in speeding up the playback rate by utilizing “GoP skipping”, and then reduces the computational overhead by applying a bandwidth smoothing based on GoP.

• The KIPS Transactions:PartD
• /
• v.9D no.2
• /
• pp.185-194
• /
• 2002

Most of mobile computing systems allow mostly read-only transactions from mobile clients for retrieving various types of Information such as stock data, traffic information and news updates. Since previous concurrence control protocols, however, do not consider such a particular characteristics, the performance degradation occurs when previous schemes are applied to the broadcast environment. In this paper, we propose OCC/UTF(Optimistic Concurrence Control with Update Transaction First) that is most appropriate for broadcast environment. OCC/UTF lets a query transaction, that has already read the data item which was invalidated by update transaction, read again the same data item without the abort of the query transaction due to non-serializability. Therefore, serializable order is maintained and the query transaction is committed safely regardless of commitment of update transactions. In OCC/UTF, Clients need not require server to commit their query transactions. Because of broadcasting the validation reports including values updated recently to clients, it reduces the overhead of requesting recent values from the server and the server need not also re-broadcast the newest values. As a result, OCC/UTF makes full use of the asymmetric bandwidth. It can also improve transaction throughput by increasing the commit ratio of query transactions as much as possible.

• Journal of the Korea Computer Graphics Society
• /
• v.21 no.3
• /
• pp.1-10
• /
• 2015

One way to create a visually immersive environment is to utilize a front projection system. Especially, when enough space is not available behind the screen, it becomes difficult to install a back projection system, making the front projection an appropriate choice. A drawback associated with the front projection is, however, the interference of shadow. The shadow can be cast on the screen when the user is located between the screen and the projector. This shadow can negatively affect the user experience and reduce the sense of immersion by removing important information. There have been various attempts to eliminating shadows cast on the screen by using multiple projectors that compensate for each other with missing information. There is trade-off between calculataion time and desired accuracy in this mutual compensation. Accurate estimation of the shadow usually requires heavy computation while simple approaches suffer from inclusion of non-shadow regions in the result. We propose a novel approach to removing shadows created in the front projection system using the skeleton data obtained from a depth camera. The skeleton data helps accurately extract the shape of the shadow that the user cast without requiring much computation. Our method also utilizes a distance field to remove the afterimage of shadow that may occur when the user moves. We verify the effectiveness of our system by performing various experiments in an interactive environment created by a front projection system.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.1
• /
• pp.29-38
• /
• 2012

Due to the rapid development of network environment and wireless communication technology, the distribution of digital video has made easily and the importance of the protection for digital video has been increased. This paper proposes the digital video encryption system based on multiple chaos maps for MPEG-2 video encoding process. The proposed method generates secret hash key of having 128-bit characteristics from hash chain using Tent map as a basic block and generates $8{\times}8$ lattice cipher by applying this hash key to Logistic map and Henon map. The method can reduce the encryption overhead by doing selective XOR operations between $8{\times}8$ lattice cipher and some coefficient of low frequency in DCT block and it provides simple and randomness characteristic because it uses the architecture of combining chaos maps. Experimental results show that PSNR of the proposed method is less than or equal to 12 dB with respect to encrypted video, the time change ratio, compression ratio of the proposed method are 2%, 0.4%, respectively so that it provides good performance in visual security and can be applied in real time.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.4
• /
• pp.64-72
• /
• 2008

Researchers nowadays are trying to implement u-Healthcare (ubiquitous Healthcare) systems for real-time monitoring and analysis of patients' status through a low-cost and low-power wireless sensor network. u-Healthcare system has an aim to provide reliable and fast medical services for patients regardless of time and space by transmitting to doctors a large quantity of vital signs collected from sensor networks. Existing u-Healthcare systems can merely monitor patients' health status. However, it is not easy to derive physiologically meaningful results by analyzing rapidly vital signs through the existing u-Healthcare systems. We introduce a Grid computing technology for deriving the results by analyzing rapidly the vital signs collected from the sensor network. Since both sensor network and Grid computing use different protocols, a gateway is needed. In addition, we also need to construct a gateway which includes the functions such as an efficient management and control of the sensor network, real-time monitoring of the vital signs and communication services related to the Grid network for providing u-Healthcare services effectively. In this paper, to build an advanced u-Healthcare system by using these two technologies most efficiently, we design and present the results to implement a SensorGrid gateway which connects transparently the sensor network and the grid network.