• 대한원격탐사학회지
• /
• 제17권4호
• /
• pp.335-344
• /
• 2001

Texture is extensively studied in a variety of image processing applications such as image segmentation and classification because it is an important property to perceive regions and surfaces. This paper focused on the analysis and synthesis of textured single and multiband images using Markov Random Field model considering the existent spatial correlation. Especially, for multiband images, the cross-channel correlation existing between bands as well as the spatial correlation within band should be considered in the model. Although a local interaction is assumed between the specified neighboring pixels in MRF models, during the maximization process, short-term correlations among neighboring pixels develop into long-term correlations. This result in exhibiting phase transition. In this research, the role of temperature to obtain the most probable state during the sampling procedure in discrete Markov Random Fields and the stopping rule were also studied.

• Bulletin of the Korean Chemical Society
• /
• 제35권10호
• /
• pp.3089-3091
• /
• 2014

• 한국산림과학회지
• /
• 제65권1호
• /
• pp.68-73
• /
• 1984

Simple random sampling과 P.P.S. sampling의 효율을 비교하기 위하여 오스트리아 Salzburg 부근의 침엽수 장령림 임분에서 임목조사를 실시하였다. 축적 1:10,000의 흑백 적외선 사진을 판독하여, 조사 임지를 제지, 유령림, 너도 밤나무 장령림, 침엽수 장령림으로 구분하고, 침엽수 장령림 내에서 random sampling에 의한 99개의 표본점과 P.P.S. sampling에 의한 75개의 표본점을 흉고 단면적 제수 4인 Relascope에 의하여 야외 조사한 자료를 비교한 결과는 다음과 같다. 1) random sampling에 의한 임분 재적의 추정치는 $422.0m^3/ha$이었고, P.P.S. sampling에 의해서는 $433.5m^3/ha$이었으나 이들간의 통계적 유의성은 없었다. 2) 5 %의 허용 오차내에서는 P.P.S. sampling에 의하여는 170점, random sampling에 의하여는 237점이 필요하였다. 3) P.P.S. sampling은 random sampling에 비하여 야외 조사 시간을 17% 감소시킬 수 있었다.

• 대한수학회지
• /
• 제44권6호
• /
• pp.1441-1451
• /
• 2007

A general law of the iterated logarithm (LIL) is established for $l^p$-valued Gaussian random fields under explicit conditions.

• 대한수학회지
• /
• 제32권2호
• /
• pp.321-328
• /
• 1995

Ibragimov(1975) showed the central limit theorem and the invariance principle for $\rho$-mixing random variables satisfying $\sigma^2(n) = nh(n) \longrightarrow \infty$ and $E$\mid$\zeta_0$\mid$^{2+\delta} < \infty$ for some $\delta > 0$ where $\sigma^2(n)$ denotes the variance of the partial sum $S_n$ and h(n) is a slowly varying function.

• Journal of the Korean Statistical Society
• /
• 제11권2호
• /
• pp.118-130
• /
• 1982

Random walks as specia Markov stochastic processes have received particular attention in recent years. Not only the applicability of the theory already developed but also its extension within the frame work of probability measures on algebraic-topological structures such as semigroups, groups and linear spaces became a new challenge for research work in the field. At the same time new insights into classical problems were obtained which in various cases lead to a more efficient presentation of the subject. Consequently the teaching of random walks at all levels should profit from the recent development.

• 대한수학회지
• /
• 제31권4호
• /
• pp.679-689
• /
• 1994

Let ${X_\underline{j} : \underline{j} \in Z^d}$ be a random field on some probability space $(\Omega, F, P)$ with $EX_\underline{j} = 0, EX_\underline{j}^2 < \infty$.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제16권2호
• /
• pp.185-190
• /
• 2016

A 70-${\AA}$ nanowire field-effect transistor (FET) for sub-10-nm CMOS technology is designed and simulated in order to investigate the impact of an oxide trap on random telegraph noise (RTN) in the device. It is observed that the drain current fluctuation (${\Delta}I_D/I_D$) increases up to a maximum of 78 % due to the single electron trapping. In addition, the effect of various trap positions on the RTN in the nanowire FET is thoroughly analyzed at various drain and gate voltages. As the drain voltage increases, the peak point for the ${\Delta}I_D/I_D$ shifts toward the source side. The distortion in the electron carrier density and the conduction band energy when the trap is filled with an electron at various positions in the device supports these results.

• 전자공학회논문지
• /
• 제51권1호
• /
• pp.145-151
• /
• 2014

본 논문에서는 한 장의 영상에서 안개를 제거하는 알고리즘을 제안한다. 기존의 Dark Channel Prior(DCP) 알고리즘은 영상의 어두운 정보를 계산하여 전달량을 추정한 후, 매팅(matting) 기법을 사용하여 안개 영역을 보완하여 검출한다. 이 과정에서 블록현상이 발생하는 문제가 있으며 이로 인해 안개를 효율적으로 제거하는데 한계점이 있다. 이 문제를 해결하기 위해 본 논문에서는 Hidden Markov Random Field(HMRF) 와 Expectation-Maximization(EM) 알고리즘을 이용하여 매팅 과정에서 발생하는 블록문제를 해결하고자 하였다. 실험 결과를 통하여 제안한 방법은 기존 방법보다 안개제거에서 더 향상된 결과를 얻을 수 있음을 확인하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권2호
• /
• pp.714-727
• /
• 2015

The hierarchical structure in networks is widely applied in many practical scenarios especially in some emergency cases. In this paper, we focus on a tree network with and without packet loss where one source sends data to n destinations, through m relay nodes employing random linear network coding (RLNC) over a Galois field in parallel transmission systems. We derive closed-form probability expressions of successful decoding at a destination node and at all destination nodes in this multicast scenario. For the convenience of computing, we also propose an upper bound for the failure probability. We then investigate the impact of the major parameters, i.e., the size of finite fields, the number of internal nodes, the number of sink nodes and the channel failure probability, on the decoding performance with simulation results. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized. When failure decoding probabilities are given, the operation is simple and its complexity is low in a small finite field.