• 제목/요약/키워드: adaptive sampling region

검색결과 12건 처리시간 0.027초

A new structural reliability analysis method based on PC-Kriging and adaptive sampling region

  • Yu, Zhenliang;Sun, Zhili;Guo, Fanyi;Cao, Runan;Wang, Jian
    • Structural Engineering and Mechanics
    • /
    • 제82권3호
    • /
    • pp.271-282
    • /
    • 2022
  • The active learning surrogate model based on adaptive sampling strategy is increasingly popular in reliability analysis. However, most of the existing sampling strategies adopt the trial and error method to determine the size of the Monte Carlo (MC) candidate sample pool which satisfies the requirement of variation coefficient of failure probability. It will lead to a reduction in the calculation efficiency of reliability analysis. To avoid this defect, a new method for determining the optimal size of the MC candidate sample pool is proposed, and a new structural reliability analysis method combining polynomial chaos-based Kriging model (PC-Kriging) with adaptive sampling region is also proposed (PCK-ASR). Firstly, based on the lower limit of the confidence interval, a new method for estimating the optimal size of the MC candidate sample pool is proposed. Secondly, based on the upper limit of the confidence interval, an adaptive sampling region strategy similar to the radial centralized sampling method is developed. Then, the k-means++ clustering technique and the learning function LIF are used to complete the adaptive design of experiments (DoE). Finally, the effectiveness and accuracy of the PCK-ASR method are verified by three numerical examples and one practical engineering example.

Optimal Design of the Adaptive Searching Estimation in Spatial Sampling

  • Pyong Namkung;Byun, Jong-Seok
    • Communications for Statistical Applications and Methods
    • /
    • 제8권1호
    • /
    • pp.73-85
    • /
    • 2001
  • The spatial population existing in a plane ares, such as an animal or aerial population, have certain relationships among regions which are located within a fixed distance from one selected region. We consider with the adaptive searching estimation in spatial sampling for a spatial population. The adaptive searching estimation depends on values of sample points during the survey and on the nature of the surfaces under investigation. In this paper we study the estimation by the adaptive searching in a spatial sampling for the purpose of estimating the area possessing a particular characteristic in a spatial population. From the viewpoint of adaptive searching, we empirically compare systematic sampling with stratified sampling in spatial sampling through the simulation data.

  • PDF

Optimal SVM learning method based on adaptive sparse sampling and granularity shift factor

  • Wen, Hui;Jia, Dongshun;Liu, Zhiqiang;Xu, Hang;Hao, Guangtao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권4호
    • /
    • pp.1110-1127
    • /
    • 2022
  • To improve the training efficiency and generalization performance of a support vector machine (SVM) in a large-scale set, an optimal SVM learning method based on adaptive sparse sampling and the granularity shift factor is presented. The proposed method combines sampling optimization with learner optimization. First, an adaptive sparse sampling method based on the potential function density clustering is designed to adaptively obtain sparse sampling samples, which can achieve a reduction in the training sample set and effectively approximate the spatial structure distribution of the original sample set. A granularity shift factor method is then constructed to optimize the SVM decision hyperplane, which fully considers the neighborhood information of each granularity region in the sparse sampling set. Experiments on an artificial dataset and three benchmark datasets show that the proposed method can achieve a relatively higher training efficiency, as well as ensure a good generalization performance of the learner. Finally, the effectiveness of the proposed method is verified.

Fast Volume Visualization Techniques for Ultrasound Data

  • Kwon Koo-Joo;Shin Byeong-Seok
    • 대한의용생체공학회:의공학회지
    • /
    • 제27권1호
    • /
    • pp.6-13
    • /
    • 2006
  • Ultrasound visualization is a typical diagnosis method to examine organs, soft tissues and fetus data. It is difficult to visualize ultrasound data because the quality of the data might be degraded by artifact and speckle noise, and gathered with non-linear sampling. Rendering speed is too slow since we can not use additional data structures or procedures in rendering stage. In this paper, we use several visualization methods for fast rendering of ultrasound data. First method, denoted as adaptive ray sampling, is to reduce the number of samples by adjusting sampling interval in empty space. Secondly, we use early ray termination scheme with sufficiently wide sampling interval and low threshold value of opacity during color compositing. Lastly, we use bilinear interpolation instead of trilinear interpolation for sampling in transparent region. We conclude that our method reduces the rendering time without loss of image quality in comparison to the conventional methods.

적응거리 조건을 이용한 순차적 실험계획의 민감도법 (Sensitivity Approach of Sequential Sampling Using Adaptive Distance Criterion)

  • 정재준;이태희
    • 대한기계학회논문집A
    • /
    • 제29권9호
    • /
    • pp.1217-1224
    • /
    • 2005
  • To improve the accuracy of a metamodel, additional sample points can be selected by using a specified criterion, which is often called sequential sampling approach. Sequential sampling approach requires small computational cost compared to one-stage optimal sampling. It is also capable of monitoring the process of metamodeling by means of identifying an important design region for approximation and further refining the fidelity in the region. However, the existing critertia such as mean squared error, entropy and maximin distance essentially depend on the distance between previous selected sample points. Therefore, although sufficient sample points are selected, these sequential sampling strategies cannot guarantee the accuracy of metamodel in the nearby optimum points. This is because criteria of the existing sequential sampling approaches are inefficient to approximate extremum and inflection points of original model. In this research, new sequential sampling approach using the sensitivity of metamodel is proposed to reflect the response. Various functions that can represent a variety of features of engineering problems are used to validate the sensitivity approach. In addition to both root mean squared error and maximum error, the error of metamodel at optimum points is tested to access the superiority of the proposed approach. That is, optimum solutions to minimization of metamodel obtained from the proposed approach are compared with those of true functions. For comparison, both mean squared error approach and maximin distance approach are also examined.

적합탐색 관찰을 이용한 층화 공간표본설계에서의 추정 (Adaptive Searching Estimation in Stratified Spatial Sample design)

  • 변종석
    • 응용통계연구
    • /
    • 제13권2호
    • /
    • pp.353-369
    • /
    • 2000
  • 관찰 단위들간 특정한 공간 종속관계를 지닌 공간모집단에서 사각형의 칸들로 분할한 후 각 칸마다 하나의 표본점을 임의추출하여 관심 변수의 모수를 추정할 때 탐색 관찰조건을 만족하는 인접한 표본단위만을 추가 관찰하여 모수를 추정하는 적합탐색 추정 방법을 층화 공간표본설계에 적용시켜 보았다. 모의자료를 설정한 가상의 2차원 공간모집단을 층화 공간표본설계에 의해 층화시킨 후 적합 탐색 추정방법을 적용시켜 본 결과, 단순히 공간모집단을 분할하는 전통적인 공간표본설계보다 적은 수의 표본이 관찰되었으며, 효율성이 크게 감소하지 않는 결과를 얻음으로써 층화효과와 적합탐색 관찰효과가 동시에 존재하는 적절한 추정 결과를 얻을 수 있었다.

  • PDF

얼굴의 색상과 모양정보를 이용한 조명 변화에 강인한 얼굴 추적 시스템 구현 (Development of Face Tracking System Using Skin Color and Facial Shape)

  • 이형수
    • 정보처리학회논문지B
    • /
    • 제10B권6호
    • /
    • pp.711-718
    • /
    • 2003
  • 얼굴 인식 시스템과 표정인식 시스템과 같은 고차원 처리를 수행하는 시스템의 전처리 과정으로써 이미지 영역 내에서 얼굴을 추적하는 것은 중요한 과정이다. 본 논문에서는 피부색과 얼굴의 형태 정보를 단서로 하는 CONDENSATION 알고리즘을 사용하여 얼굴의 위치를 추적하였다. 컬러의 가중치와 형태의 가중치를 결합시키는데 어려움이 있으므로 각각을 단서로 사용하는 두 개의 추적기를 가진 시스템을 제안한다. 제안된 시스템은 복잡한 배경, 피부색의 물체가 이미지 내에 존재하는 경우, 다른 얼굴이 이미지 내에 존재하는 경우 모두에 대해서 훌륭한 성능을 보여 주었다.

실시간 적응 학습 진화 알고리듬을 이용한 자기 동조 PID 제어 (The Self-tuning PID Control Based on Real-time Adaptive Learning Evolutionary Algorithm)

  • 장성욱;이진걸
    • 대한기계학회논문집A
    • /
    • 제27권9호
    • /
    • pp.1463-1468
    • /
    • 2003
  • This paper presented the real-time self-tuning learning control based on evolutionary computation, which proves its superiority in finding of the optimal solution at the off-line learning method. The individuals of the populations are reduced in order to learn the evolutionary strategy in real-time, and new method that guarantee the convergence of evolutionary mutations is proposed. It is possible to control the control object slightly varied as time changes. As the state value of the control object is generated, evolutionary strategy is applied each sampling time because the learning process of an estimation, selection, mutation is done in real-time. These algorithms can be applied; the people who do not have knowledge about the technical tuning of dynamic systems could design the controller or problems in which the characteristics of the system dynamics are slightly varied as time changes.

3차원 배우 모델링을 위한 깊이 영상의 손실된 머리카락 영역 복원 (Reconstruction of the Lost Hair Depth for 3D Human Actor Modeling)

  • 조지호;장인엽;이관행
    • 한국HCI학회논문지
    • /
    • 제2권2호
    • /
    • pp.1-9
    • /
    • 2007
  • 본 논문에서는 3차원 배우 모델링을 위해, 깊이 카메라를 이용하여 깊이 영상 획득 시 손실되는 머리카락 영역에 대한 복원기법을 제안한다. 대상 객체의 동적인 3차원 정보는 적외선 센서가 장착된 깊이 카메라를 통하여 실시간으로 획득한다. 이때, 깊이 비디오뿐만 아니라 각 프레임마다 컬러영상이 동시에 획득된다. 그러나 대상 객체의 일부 또는 전체가 반짝이면서 어두운 재질로 되어있을 경우 획득한 깊이 영상에서 그 부분 전체가 손실되는데, 이는 특히 방송용 콘텐츠로서 연기자의 3차원 정보를 획득할 때 머리카락 영역이 손실되어 매우 부자연스러운 결과를 초래한다. 이러한 문제점을 손실된 영역의 복원을 통해 해결한다. 먼저 컬러 영상을 이용하여 손실된 영역의 위치 정보를 알아내고, 손실된 영역 내 경계부분의 깊이 정보를 복원한 후 2차 베지어 커브로 보간하여 내부의 깊이 정보를 복원한다. 개선된 깊이 영상을 기반으로 일련의 모델링 과정을 수행하면 보다 자연스러운 3차원 모델을 생성할 수 있다. 생성된 3차원 모델은 실감방송용 콘텐츠로 사용될 수 있으며, 시청자에게 시각상호작용과 촉각상호작용 등 다차원 감각의 상호작용을 제공할 수 있다.

  • PDF

진화 연산을 이용한 실시간 자기동조 학습제어 (The Real-time Self-tuning Learning Control based on Evolutionary Computation)

  • 장성욱;이진걸
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2001년도 춘계학술대회논문집B
    • /
    • pp.105-109
    • /
    • 2001
  • This paper discuss the real-time self-tuning learning control based on evolutionary computation, which proves its the superiority in the finding of the optimal solution at the off-line learning method. The individuals are reduced in order to learn the evolutionary strategy in real-time, and new method that guarantee the convergence of evolutionary mutations are proposed. It possible to control the control object varied as time changes. As the state value of the control object is generated, applied evolutionary strategy each sampling time because the learning process of an estimation, selection, mutation in real-time. These algorithms can be applied, the people who do not have knowledge about the technical tuning of dynamic systems could design the controller or problems in which the characteristics of the system dynamics are slightly varied as time changes.

  • PDF