• 응용통계연구
• /
• 제22권6호
• /
• pp.1277-1287
• /
• 2009

For stratifying skewed populations, the Lavall$\acute{e}$e-Hidiroglou(LH) algorithm is often considered to have a take-all stratum with the largest units and some take-some strata with the middle-size and small units. Related to its iterative nature have been reported some numerical difficulties such as the dependency of the ultimate stratum boundaries to a choice of initial boundaries and the slow convergence to locally-optimum boundaries. The geometric stratification has been recently proposed to provide initial boundaries that can avoid such numerical difficulties in implementing the LH algorithm. Since the geometric stratification does not pursuit the optimization but the equalization of the stratum CVs, the corresponding stratum boundaries may not be (near) optimal. This paper revisits these issues concerning convergence and near-optimality of optimal stratification algorithms using artificial numerical examples. We also discuss the formation of the strata and the sample allocation under the optimization process and some aspects related to discontinuity arisen from the finiteness of both population and sample as well.

• 대한산업공학회지
• /
• 제25권2호
• /
• pp.274-281
• /
• 1999

In this paper, we determine the required storage capacity of a unit-load automated storage/retrieval system(AS/RS) under random storage assignment(RAN) and n-class turnover-based storage assignment(CN) policies. For each of the storage policies, an analytic model to determine the optimal storage capacity of the AS/RS is formulated so that the total cost related to storage space and space shortage is minimized while satisfying a desired service level. A closed form of optimal solutions for the RAN policy is derived from the model. For the CN policy, an optimal storage capacity is shown to be determined by applying the existing iterative search algorithm developed for the full turnover-based storage(FULL) policy. Finally, an application of the approach to the standard economic-order-quantity inventory model is provided.

• 한국정보처리학회논문지
• /
• 제7권1호
• /
• pp.286-295
• /
• 2000

본 논문은 MR 영상의 비지도 분할을 위하여 MDL원리를 이용한 통계적 모델기반의 적응적 방법을 제안한다. 이 방법에서 조직 영역을 MRF로 모델링함으로써 잡음에 대응하고, 창으로 정의되는 국소영역 내의 밝기값을 가우스 혼합으로 모델링함으로써 영상의 비균일성을 흡수한다. 분할 알고리즘은 ICM을 기반으로 하며 MAP를 근사적으로 추정하고, 모델 파라미터를 국소영역으로부터 구한다. 파라미터 추정과 분할을 위한 창의 크기는 MDL원리를 이용하여 영상으로부터 추정한다. 실험에서 제안한 방법이 특히 비균일성이 있는 MR영상의 분할에서 국소영역의 영상특성을 잘 반영하였으며, 기존의 방법보다 더 좋은 결과를 보여주었다.

• 한국광학회지
• /
• 제33권6호
• /
• pp.267-274
• /
• 2022

쉴리렌 이미징을 위한 랜덤 도트 배열 투영용 이진 회절광학소자를 설계하고 제작하였다. 이 연구에서 적용된 회절광학소자는 단 두 단계의 위상 및 10 ㎛의 피치를 갖는 이진 위상 회절 격자로, 제작 단가 및 제작 공정의 용이성을 위하여 선택되었다. 회절광학소자의 설계는 최종 패턴의 밝기 정보를 목적 함수로 사용하는 iterative Fourier transform algorithm을 적용하였다. 먼저 균일 밝기의 랜덤 도트 이미지를 생성하였고, 이를 최종 목표 이미지(패턴)로 적용한 결과, 위치(시야)에 따른 랜덤 도트의 밝기 변화를 확인하였다. 이를 해결하기 위하여 최종 목표 패턴에 가우시안 가중치를 적용한 개선 설계를 적용하였고, 그 결과 패턴 밝기 균일도를 52.7%에서 90.8%까지 향상시켰다. 이후, 바이너리 회절 소자 및 이를 적용한 빔 투사기를 제작하여 설계 결과를 검증하였다. 검증 결과 투사 거리 5 m에서 설계 목표인 430 mm × 430 mm 투광면적, 10,000개 이상의 랜덤 도트 패턴의 생성을 확인하였다. 측정된 균일도는 시뮬레이션에서 예상되었던 균일도보다 다소 적은 84.5%이나, 이는 회절 격자 형상, 특히 모서리 뭉개짐 및 간격 오류에 의한 것으로 추정된다.

• Communications for Statistical Applications and Methods
• /
• 제29권1호
• /
• pp.27-40
• /
• 2022

In this paper, the focus on the removal noise in the binary image based on the variational Bayesian method with the Ising model. The observation and the latent variable are the degraded image and the original image, respectively. The posterior distribution is built using the Markov random field and the Ising model. Estimating the posterior distribution is the same as reconstructing a degraded image. MCMC and variational Bayesian inference are two methods for estimating the posterior distribution. However, for the sake of computing efficiency, we adapt the variational technique. When the image is restored, the iterative method is used to solve the recursive problem. Since there are three model parameters in this paper, restoration is implemented using the VECM algorithm to find appropriate parameters in the current state. Finally, the restoration results are shown which have maximum peak signal-to-noise ratio (PSNR) and evidence lower bound (ELBO).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권1호
• /
• pp.81-98
• /
• 2013

Since Probabilistic Latent Semantic Analysis (PLSA) and Latent Dirichlet Allocation (LDA) were introduced, many revised or extended topic models have appeared. Due to the intractable likelihood of these models, training any topic model requires to use some approximation algorithm such as variational approximation, Laplace approximation, or Markov chain Monte Carlo (MCMC). Although these approximation algorithms perform well, training a topic model is still computationally expensive given the large amount of data it requires. In this paper, we propose a new method, called non-simultaneous sampling deactivation, for efficient approximation of parameters in a topic model. While each random variable is normally sampled or obtained by a single predefined burn-in period in the traditional approximation algorithms, our new method is based on the observation that the random variable nodes in one topic model have all different periods of convergence. During the iterative approximation process, the proposed method allows each random variable node to be terminated or deactivated when it is converged. Therefore, compared to the traditional approximation ways in which usually every node is deactivated concurrently, the proposed method achieves the inference efficiency in terms of time and memory. We do not propose a new approximation algorithm, but a new process applicable to the existing approximation algorithms. Through experiments, we show the time and memory efficiency of the method, and discuss about the tradeoff between the efficiency of the approximation process and the parameter consistency.

• Structural Engineering and Mechanics
• /
• 제54권6호
• /
• pp.1097-1109
• /
• 2015

A novel optimization approach for reinforced concrete (RC) biaxially loaded columns is proposed. Since there are several design constraints and influences, a new computation methodology using iterative analyses for several stages is proposed. In the proposed methodology random iterations are combined with music inspired metaheuristic algorithm called harmony search by modifying the classical rules of the employed algorithm for the problem. Differently from previous approaches, a detailed and practical optimum reinforcement design is done in addition to optimization of dimensions. The main objective of the optimization is the total material cost and the optimization is important for RC members since steel and concrete are very different materials in cost and properties. The methodology was applied for 12 cases of flexural moment combinations. Also, the optimum results are found by using 3 different axial forces for all cases. According to the results, the proposed method is effective to find a detailed optimum result with different number of bars and various sizes which can be only found by 2000 trial of an engineer. Thus, the cost economy is provided by using optimum bars with different sizes.

• 한국멀티미디어학회논문지
• /
• 제7권3호
• /
• pp.327-339
• /
• 2004

본 논문에서는 반복적인 에러 최소화 기법을 이용한 하프톤 영상의 워터마킹 알고리즘을 제안하였다. 워터마크는 하프톤 영상의 랜덤한 위치의 픽셀값으로 저장된다. 삽입된 워터마크로 인한 하프톤 영상의 왜곡을 최소화하고 비가시성을 증대하기 위하여 반복적인 에러 최소화 기법이 사용된다. 원영상과 HVS(Human Visual System) 필터 처리된 하프톤 영상과의 차이를 하프토닝 에러로 정의하고 반복적으로 각각의 픽셀 위치에서 이 하프토닝 에러를 최소화할 수 있는 픽셀 패턴을 찾아서 이것으로 원래의 픽셀패턴을 대치한다. 절단이나 회전과 같은 기하학적인 변형에 견고하게 하기 위하여 동일한 워터마크를 반복하여 하프톤 영상안에 삽입하였다. 실제 인쇄 및 스캐닝 실험을 통하여 제안된 알고리즘이 기하학적 변형에 견고함을 보였고 또한 기존과 방법과 비교하여 제안된 방법이 많은 양의 워터마크 정보에도 불구하고 우수한 품질의 하프톤 영상을 생성함을 보였다.

• ETRI Journal
• /
• 제38권4호
• /
• pp.714-723
• /
• 2016

Considerable attention has been given to processing graph data in recent years. An efficient method for computing the node proximity is one of the most challenging problems for many applications such as recommendation systems and social networks. Regarding large-scale, mutable datasets and user queries, top-k query processing has gained significant interest. This paper presents a novel method to find top-k answers in a node proximity search based on the well-known measure, Personalized PageRank (PPR). First, we introduce a distribution state transition graph (DSTG) to depict iterative steps for solving the PPR equation. Second, we propose a weight distribution model of a DSTG to capture the states of intermediate PPR scores and their distribution. Using a DSTG, we can selectively follow and compare multiple random paths with different lengths to find the most promising nodes. Moreover, we prove that the results of our method are equivalent to the PPR results. Comparative performance studies using two real datasets clearly show that our method is practical and accurate.

• Journal of Communications and Networks
• /
• 제5권2호
• /
• pp.167-173
• /
• 2003

We treat the problem of channel estimation and interference cancellation in multiuser ultra-wide-band (UWB) communication systems over multipath fading channels. The UWB system under consideration employs a random time-hopping impulse radio format. We develop a channel estimation method based on linear weighted algorithm. An iterative channel estimation and interference cancellation scheme is proposed to successively improve the receiver performance. We also consider systems employing multiple transmit and/or receive antennas. For systems with multiple receive antennas, we develop a diversity receiver for the wellseparated antennas. For systems with multiple transmit antennas, we propose to make use of Alamouti’s space-time transmission scheme, and develop the corresponding channel estimation and interference cancellation receiver techniques. Simulation results are provided to demonstrate the performance of various UWB receiver techniques developed in this paper.