• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2009.10a
• /
• pp.99-105
• /
• 2009

Crack detection method of a rotating blade was suggested in this paper. A rotating blade was modeled with a cantilever beam connected to a hub undergoing rotating motion. The existence and the location of crack were able to be recognized from the vertical response of end tip of a rotating cantilever beam by employing Discrete Hidden Markov Model (DHMM) and Empirical Mode Decomposition (EMD). DHMM is a famous stochastic method in the field of speech recognition. However, in recent researches, it has been proved that DHMM can also be used in machine health monitoring. EMD is the method suggested by Huang et al. that decompose a random signal into several mono component signals. EMD was used in this paper as the process of extraction of feature vectors which is the important process to developing DHMM. It was found that developed DHMMs for crack detection of a rotating blade have shown good crack detection ability.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.6
• /
• pp.231-236
• /
• 2014

The transit time of contrast agents and the parameters of time-intensity curves in ultrasonography are important factors to diagnose various diseases of a digestive organ. We have implemented an automatic parametric imaging method to overcome the difficulty of the diagnosis by naked eyes. However, the micro-bubble noise and the respiratory motions may degrade the reliability of the parameter images. In this paper, we introduce an optimization technique based on MRF(Markov Random Field) model to enhance the quality of the parameter images, and present an image tracking algorithm to compensate the image distortion by respiratory motions. A method to extract the respiration periods from the ultrasound image sequence has been developed. We have implemented the ROI(Region of Interest) tracking algorithm using the dynamic weights and a momentum factor based on these periods. An energy function is defined for the Gibbs sampler of the image enhancement method. Through the experiments using the data to diagnose liver lesions, we have shown that the proposed method improves the quality of the parametric images.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.5
• /
• pp.54-63
• /
• 2007

The purpose of this study is to present a new energy minimization method for image completion with hierarchical approach. The goal of image completion is to fill in missing part in a possibly large region of an image so that a visually plausible outcome is obtained. An exemplar-based Markov Random Field Modeling(MRF) is proposed in this paper. This model can deal with following problems; detection of global features, flexibility on environmental changes, reduction of computational cost, and generic extension to other related domains such as image inpainting. We use the Priority Belief Propagation(Priority-BP) which is a kind of Belief propagation(BP) algorithms for the optimization of MRF. We propose the hierarchical Priority-BP that reduces the number of nodes in MRF and to apply hierarchical propagation of messages for image completion. We show that our approach which uses hierarchical Priority-BP algorithm in image completion works well on a number of examples.

• Korean Journal of Remote Sensing
• /
• v.25 no.5
• /
• pp.455-464
• /
• 2009

Lee(2009) proposed the boundary-adaptive despeckling method using a Bayesian model which is based on the lognormal distribution for image intensity and a Markov random field(MRF) for image texture. This method employs the Point-Jacobian iteration to obtain a maximum a posteriori(MAP) estimate of despeckled imagery. The boundary-adaptive algorithm is designed to use less information from more distant neighbors as the pixel is closer to boundary. It can reduce the possibility to involve the pixel values of adjacent region with different characteristics. The boundary-adaptive scheme was comprehensively evaluated using simulation data and the effectiveness of boundary adaption was proved in Lee(2009). This study, as an extension of Lee(2009), has suggested a modified iteration algorithm of MAP estimation to enhance computational efficiency and to combine classification. The experiment of simulation data shows that the boundary-adaption results in yielding clear boundary as well as reducing error in classification. The boundary-adaptive scheme has also been applied to high resolution Terra-SAR data acquired from the west coast of Youngjong-do, and the results imply that it can improve analytical accuracy in SAR application.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.2
• /
• pp.62-67
• /
• 2003

This paper deals with a First-Come, First-Served queueing model to analyze the behavior of heterogeneous finite source system with a single server Each sources and the processor are assumed to operate in independently Markovian environments, respectively. Each request is characterized by its own exponentially distributed source and service time with parameter depending on the state of the corresponding environment, that is, the arrival and service rates are subject to random fluctuations. Our aim is to get the usual stationary performance measures of the system, such as, utilizations, mean number of requests staying at the server, mean queue lengths, average waiting and sojourn times. In the case of fast arrivals or fast service asymptotic methods can be applied. In the intermediate situations stochastic simulation Is used. As applications of this model some problems in the field of telecommunications are treated.

• Journal of Korean Society of Transportation
• /
• v.9 no.1
• /
• pp.47-56
• /
• 1991

With respect to stochastic delays at linked signals the solid quantitative information has not been available as yet. On the basis of field data the values of "I" (variance-mean ration of flow) were related with the rate of flow. The stochastic delays with specific "I" values were obtained from the distribution of overflow queue, which were calculated by the use of Markov chains. This examination of the results led to the derivation of a simple method for calculating stochastic dclays through the introduction of "I" into Miller's model. The good agreement was shown between the model and the field. The relationships between the cycle lengths and delays were examinated in a large number of conditions with regard to degree of saturation. signal split and link length. Within the practical range of cycle length uniform delays were dominant and no critical point was found in terms of minimum, delay. In highly saturated conditions however the weight of stochastic delay is noticeable.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.11a
• /
• pp.331-332
• /
• 2011

본 논문에서는 Markov random field (MRF) 프레임워크와 영상의 기울기(gradient) 정보를 이용한 필드영상의 공간적 디인터레이싱(deinterlacing) 알고리즘을 제안한다. 기존의 디인터레이싱 결과를 보면 때때로 에지 부분의 연결이 정밀하지 못하여 눈에 거슬리는 재깅(jagging) 현상 등의 결함이 나타나기도 하는데, 제안하는 알고리즘은 이러한 현상을 줄이고자 영상의 기울기 도메인(gradient domain)에서 디인터레이싱을 수행한다. 즉, 제안하는 방식은 필드 영상으로부터 기울기 영상을 얻고 이를 보간한 후 필드영상과 복원된 기울기 영상을 토대로 원본 영상을 복원한다. 이 과정에서 각각의 픽셀마다 기울기 영상의 보간을 위한 에지 방향의 추정이 필요한데, 이 과정에서는 MRF 모델을 기반으로 에너지 함수를 설계하고 최적화시킴으로써 보다 강건한 추정결과를 얻도록 하였다. 프레임 영상 복원은 기울기 영상과 필드 영상 정보를 사전 정보로 하여 선형 방정식을 세우고 푸는 과정으로 이루어진다. 실험한 결과, 제안된 방법의 결과가 기존 방법에 비하여 눈에 띄는 결함을 줄이고 좋은 성능을 보임을 확인할 수 있다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3A
• /
• pp.240-248
• /
• 2002

This paper presents a new motion-based segmentation algorithm of moving objects in image sequences. The procedure toward complete segmentation consists of two steps: pixel labeling and motion segmentation. In the first step, we assign a label to each pixel according to magnitude of velocity vector. And velocity vector is generated by optical flow. And, in the second step, we have modeled motion field as a markov random field for noise canceling and make a segmentation of motion through energy minimization. We have demonstrated the efficiency of the presented method through experimental results.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.2
• /
• pp.211-221
• /
• 1998

It is becoming apparent that stereo matching algorithms need much information from high level cognitive processes. Otherwise, conventional algorithms based on bottom-up control alone are susceptible to local minima. We introduce a system that consists of two levels. A lower level, using a usual matching method, is based upon the local neighborhood and a second level, that can integrate the partial information, is aimed at contextual matching. Conceptually, the introduction of bottom-up and top-down feedback loop to the usual matching algorithm improves the overall performance. For this purpose, we model the image attributes using a Markov random field (MRF) and thereupon derive a maximum a posteriori (MAP) estimate. The energy equation, corresponding to the estimate, efficiently represents the natural constraints such as occlusion and the partial informations from the other levels. In addition to recognition, we derive a training method that can determine the system informations from the other levels. In addition to recognition, we derive a training method that can determine the system parameters automatically. As an experiment, we test the algorithms using random dot stereograms (RDS) as well as natural scenes. It is proven that the overall recognition error is drastically reduced by the introduction of contextual matching.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2008.11a
• /
• pp.207-210
• /
• 2008

채색화는 흑백 영상에 색 정보를 추가하거나 영상의 색을 변환하는 영상 개선 기법이다. 본 연구는 최소한의 사용자 개입을 통해 흑백 영상을 자연스러운 칼라 (color) 영상으로 전환하는 채색화 기법을 제안한다. 우리는 우선 자연스러운 채색 결과를 위한 채색화 함수를 정의한다. 제안하는 채색화 함수는 유사한 밝기 정보를 가지는 이웃 픽셀들은 비슷한 색 정보를 가질 확률이 높다는 간단한 가정 하에 MRF (Markov Random Field)에 기반하여 모델링한다. 채색화 함수에 의해 색이 전체적으로 자연스럽게 분포될 수 있도록, 확산 신뢰도를 정의한 후 신뢰도에 따라 채색 순서를 결정한다. 이후, 채색 순서에 따라 각 픽셀에 채색화 함수를 적용하여 자연스러운 채색 결과를 도출한다. 실험 결과에서 보듯이, 제안 기법은 적은 색상 정보의 입력을 통해 효과적으로 채색화 하며, 기존 기법에 비해 자연스러운 결과를 제시한다.