• Journal of Korea Multimedia Society
• /
• v.13 no.2
• /
• pp.225-236
• /
• 2010

This study proposes a method for the recognition of emergency situation according to the bimodal information of camera image sensor and gravity sensor. This method can recognize emergency condition by mutual cooperation and compensation between sensors even when one of the sensors malfunction, the user does not carry gravity sensor, or in the place like bathroom where it is hard to acquire camera images. This paper implemented HMM(Hidden Markov Model) based learning and recognition algorithm to recognize actions such as walking, sitting on floor, sitting at sofa, lying and fainting motions. Recognition rate was enhanced when image feature vectors and gravity feature vectors are combined in learning and recognition process. Also, this method maintains high recognition rate by detecting moving object through adaptive background model even in various illumination changes.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.11
• /
• pp.1395-1406
• /
• 2001

In order to cover a widespread service range, terrestrial/satellite-mixed network is being combined with terrestrial ATM network. This dissertation analyzes and investigates several previously existent CDV compensation methods in order to compensate CDV arising from interfacing satellite TDMA and ATM. Specifically to supplement the problems of timestamp and cell number counting methods, new Variable Timestamp method for CDV compensation is proposed. To evaluate the proposed method, MMPP(Markov Modulated Poisson Process), which can express VBR service very well, is selected as a cell input traffic model of terrestrial transmitting earth station. After several simulation, it is also confirmed that CDV compensation capability for VBR services is very superior to the cell number counting method. In this case, as the timestamp number Nts increases, CDV compensation capability increases, and the CDV distribution length is reduced.

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.174-180
• /
• 2010

Automatic Repeat reQuest (ARQ) is a very effective technique against transmission error at the medium access control (MAC) layer. An erroneous MAC protocol data unit can be typically retransmitted within a given limit. In order to improve the IP-level performance, which directly affects the user-perceived quality-of-service (QoS), we propose a new truncated ARQ strategy, called MAC service data unit-based ARQ (S-ARQ), where the finite number of opportunities for retransmissions are shared by multiple fragments out of an IP datagram. We describe how SARQ can be implemented in a practical system, and then propose another variant of S-ARQ employing a functionality called early detection of failure. Basically, we evaluate the performance of SARQ in two different manners. First, assuming i.i.d. error process, we analyze both the probability of the delivery failure and the average delay of IP datagram. Then, we assess the performance of S-ARQ via simulation over a 2-state Markov channel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5A
• /
• pp.355-362
• /
• 2009

In real-time communication services, delay constraints are among the most important QoS (Quality of Service) factors. In particular, it is difficult to guarantee the delay requirement over wireless channels, since they exhibit dynamic time-varying behavior and even severe burst-errors during periods of deep fading. Channel throughput may be increased, but at the cost of the additional delays when ARQ (Automatic Repeat Request) schemes are used. For real-time communication services, it is very essential to predict data deliverability. This paper derives the delay distribution and the successful delivery probability within a given delay budget using a priori channel model and a posteriori information from the perspective of queueing theory. The Gilbert-Elliot burst-noise channel is employed as an a Priori channel model, where a two-state Markov-modulated Bernoulli process $(MMBP_2)$ is used. for a posteriori information, the channel parameters, the queue-length and the initial channel state are assumed to be given. The numerical derivation is verified and analyzed via Monte Carlo simulations. This numerical derivation is then applied to a rate control scheme for real-time video transmission, where an optimal encoding rate is determined based on the future channel capacity and the distortion of the reconstructed pictures.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.4
• /
• pp.293-298
• /
• 2003

In this paper. we propose a fast search algorithm for nearest neighbor vector quantization (NNVQ). The proposed algorithm rejects those codewords which can not be the nearest codeword and reduces the search range of codebook. Hence it reduces computational time and complexity in encoding process, while it provides the same SD performance as the conventional full search algorithm. We apply the proposed algorithm to the adaptive multi-rate (AMR) speech coder and a general vector quantizer designed by LBG. algorithm. Simulation results show effectiveness of the proposed algorithm.

• The Korean Journal of Applied Statistics
• /
• v.27 no.6
• /
• pp.959-973
• /
• 2014

Asset pricing models that account for asymmetric volatility in asset prices have been recently proposed. This article presents an efficient Bayesian method to analyze asset-pricing models. The method is developed by devising a partially collapsed Gibbs sampler that capitalizes on the functional incompatibility of conditional distributions without complicating the updates of model components. The proposed method is illustrated using simulated data and applied to daily S&P 500 data observed from September 1980 to August 2014.

• Journal of Korea Multimedia Society
• /
• v.5 no.5
• /
• pp.523-529
• /
• 2002

The present study describes neural networks for stereoscopic vision, which are applied to identifying human speech. In speech recognition based on stereoscopic vision neural networks (SVNN), the similarities are first obtained by comparing input vocal signals with standard models. They are then given to a dynamic process in which both competitive and cooperative processes are conducted among neighboring similarities. Through the dynamic processes, only one winner neuron is finally detected. In a comparative study, the two-layered SVNN was 7.7% higher in recognition accuracies than the hidden Markov model (HMM). From the evaluation results, it was noticed that SVNN outperformed the existing HMM recognizer.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.4
• /
• pp.464-469
• /
• 2009

This paper discusses a robust observer-based output-feedback stabilization of an uncertain Takagi-Sugeno (T-S) fuzzy system in a network. In the networked control system, the input delay occurs inevitably and it is expressed by the Markovian stochastic process. To design robust sampled-data observer-based output-feedback controller, we discretize the T-S fuzzy system and represent as a jump system. Stochastic robust stabilization condition is formulated in terms of linear matrix inequalities.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.3
• /
• pp.135-151
• /
• 1998

The demand of large capacity in coming cellular systems makes inevitable the deployment of small cells, rendering more frequent handoff occurrences of calls than in the conventional system. The key issue is then how effectively to reduce the chance of unsuccessful handoffs, since the handoff failure is less desirable than that of a new call attempt. In this study, we consider the control policies which give priority to handoff calls by limiting channel assignment for the originating new calls, and allow queueing the new calls which are rejected at their first attempts. On this system. we propose the problem of finding an optimal call control strategy which optimizes the objective function value, while satisfying the requirements on the handoff/new call blocking probabilities and the new call delay. The objective function takes the most general form to include such well-known performance measures as the weighted average carried traffic and the handoff call blocking probability. The problem is formulated into two different linear programming (LP) models. One is based on the direct employment of steady state equations, and the other uses the theory of semi-Markov decision process. Two LP formulations are competitive each other, having its own strength in the numbers of variables and constraints. Extensive experiments are also conducted to show which call control strategy is optimal under various system environments having different objective functions and traffic patterns.

• Journal of Korean Society of Transportation
• /
• v.28 no.1
• /
• pp.125-134
• /
• 2010

It is occurred bus arrival time errors when a bus arrives at a bus stop because of a variety of traffic condition such as traffic signal cycle, the time to get on and off a bus, a bus-only lane and so on. In this paper, bus delay time which is occurred as the result of traffic condition was estimated with Markov Chain process and bus arrival time at each bus stop was predicted with it. As the result of the study, it is confirmed to improve accuracy than the method of bus arrival time prediction with existing method (weighed moving average method) in case predicting bus arrival time using 7 by 7 and 9 by 9 matrixes.