• 제목/요약/키워드: Sampling-Based Algorithm

검색결과 477건 처리시간 0.032초

SAHN 모델의 부분적 패턴 추정 방법에 대한 연구 (A Study on Partial Pattern Estimation for Sequential Agglomerative Hierarchical Nested Model)

  • 장경원;안태천
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
    • /
    • pp.143-145
    • /
    • 2005
  • In this paper, an empirical study result on pattern estimation method is devoted to reveal underlying data patterns with a relatively reduced computational cost. Presented method performs crisp type clustering with given n number of data samples by means of the sequential agglomerative hierarchical nested model (SAHN). Conventional SAHN based clustering requires large computation time in the initial step of algorithm. To deal with this concern, we modified overall process with a partial approach. In the beginning of this method, we divide given data set to several sub groups with uniform sampling and then each divided sub data group is applied to SAHN based method. The advantage of this method reduces computation time of original process and gives similar results. Proposed is applied to several test data set and simulation result with conceptual analysis is presented.

  • PDF

철근콘크리트 쌍곡냉각탑의 설계 및 해석 (Design and Analysis of Reinforced Concrete Hyperbolic Cooling)

  • 장현옥;민창식
    • 한국콘크리트학회:학술대회논문집
    • /
    • 한국콘크리트학회 2000년도 봄 학술발표회 논문집
    • /
    • pp.501-506
    • /
    • 2000
  • An iterative numerical computational algorithm is presented to design a plate or shell element subjected to membrane and flexural forces. Based on equilibrium consideration, equations for capacities of top and bottom reinforcements in two orthogonal directions have been derived. The amount of reinforcement is determined locally, i.e., for each sampling point, from the equilibrium between applied and internal forces. Based on nonlinear analyses performed in a hyperbolic cooling tower, the analytically calculated ultimate load exceeded the design ultimate load from 50% to 55% for an analysis with relatively low to high tension stiffening, cases $\gamma$=10 and 15. For these cases, the design method gives a lower bound on the ultimate load with respect to Lower bound theorem, This shows the adequacy of th current practice at least for this cooling tower shell case studied. To generalize the conclusion more designs - analyses should be reformed with different shell configurations.

  • PDF

A Multi-Stage 75 K Fuzzy Modeling Method by Genetic Programming

  • Li Bo;Cho Kyu-Kab
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
    • /
    • pp.877-884
    • /
    • 2002
  • This paper deals with a multi-stage TSK fuzzy modeling method by using Genetic Programming (GP). Based on the time sequence of sampling data the best structural change points of complex systems are detemined by using GP, and also the moving window is simultaneously introduced to overcome the excessive amount of calculation during the generating procedure of GP tree. Therefore, a multi-stage TSK fuzzy model that attempts to represent a complex problem by decomposing it into multi-stage sub-problems is addressed and its learning algorithm is proposed based on the Radial Basis Function (RBF) network. This approach allows us to determine the model structure and parameters by stages so that the problems ran be simplified.

  • PDF

캡쳐링 공격에 강인한 오디오 워터마킹 방법 (Robust Audio Watermarking Method Under Capturing Attacks)

  • 이승재;이상광;서진수
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2006년도 하계종합학술대회
    • /
    • pp.375-376
    • /
    • 2006
  • In this paper, we propose a wavelet-based audio watermarking algorithm to be robust against capturing attack. Commercial capturing tools enable us to obtain audio contents without noticeable degradation in audio quality, and it is possible to be a source of illegal distribution. By adjusting mean values of the lowest subband in audio, the proposed method can survive after capturing attack including sampling rate conversion, random cropping and compression. By applying a simple human auditory model, the inaudibility of the watermark is achieved, and detection probability is improved based on the difference information. This is confirmed by experimental results.

  • 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

특이점 부근의 로봇운동을 효과적으로 제어하기 위한 새로운 방법 개발 (Development of A New Efficient Method for Controlling Robot Motion at and near Singularities)

  • 정원지;최은재;홍대선;서영교;홍형표
    • 한국공작기계학회논문집
    • /
    • 제11권6호
    • /
    • pp.31-37
    • /
    • 2002
  • This paper presents a new motion control strategy for singularity avoidance in 6 DOF articulated robot manipulators, based on a speed limiting algorithm for joint positions and velocities. For a given task, the robot is controlled so that the joints move with acceptable velocities and positions within the reachable range of each joint by considering the velocity limit. This paper aims at the development of a new efficient method to control robot motion near and at singularities. The proposed method has focused on generating the optimal joint trajectory for a Cartesian end-effector path within the speed limit of each joint by using the speed limit avoidance as well as the acceleration/deceleration scheme. The proposed method was verified using MATLAB-based simulations.

형상기반의 CAIP 시스템 개발 (A feature based Computer Aided Inspection Planning system)

  • 윤길상;조명우;이홍희
    • 한국공작기계학회:학술대회논문집
    • /
    • 한국공작기계학회 2002년도 추계학술대회 논문집
    • /
    • pp.353-358
    • /
    • 2002
  • A feature-based inspection planning system is proposed in this research to develop more efficient measuring methodology for the OMM (On-machine measurement) for complicated workpiece having many primitive form features. This paper focuses on the development of the CAIP (computer-aided inspection system) methodologies. The optimum inspection sequences for the features are determined by analyzing the feature information such as the nested relations and the possible probe approaching directions of the features, and forming feature groups. A series of heuristic rules are developed to accomplish it. Also, each feature is decomposed into its constituent geometric elements, and then the number of sampling points, the locations of the measuring point, the optimum probing path are determined by applying the fuzzy logic, Hammersley's method, and the TSP algorithm. To verify the proposed methodologies, simulations are carried out and the results are analyzed.

  • PDF

IMMPDAF를 Sonar Resource Management에 적용한 기동표적분석 연구 (Target Motion Analysis with the IMMPDAF for Sonar Resource Management)

  • 임영택;송택렬
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제53권5호
    • /
    • pp.331-337
    • /
    • 2004
  • Target motion analysis with a sonar system in general uses a regular sampling time and thus obtains regular target information regardless of the target maneuver status. This often results in overconsumption of the limited sonar resources. We propose two methods of the IMM(interacting Multiple Model) PDAF algorithm for sonar resource management to improve target motion analysis performance and to save sonar resources in this paper. In the first method, two different process noise covariance which are used as mode sets are combined based on probability. In the second method, resource time which are processed from two mode sets is calculated based on probability and then considered as update time at next step. Performance of the proposed algorithms are compared with the other algorithms by a series of Monte Carlo simulation.

Quickest Spectrum Sensing Approaches for Wideband Cognitive Radio Based On STFT and CS

  • Zhao, Qi;Qiu, Wei;Zhang, Boxue;Wang, Bingqian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권3호
    • /
    • pp.1199-1212
    • /
    • 2019
  • This paper proposes two wideband spectrum sensing approaches: (i) method A, the cumulative sum (CUSUM) algorithm with short-time Fourier transform, taking advantage of the time-frequency analysis for wideband spectrum. (ii)method B, the quickest spectrum sensing with short-time Fourier transform and compressed sensing, shortening the time of perception and improving the speed of spectrum access or exit. Moreover, method B can take advantage of the sparsity of wideband signals, sampling in the sub-Nyquist rate, and it is more suitable for wideband spectrum sensing. Simulation results show that method A significantly outperforms the single serial CUSUM detection for small SNRs, while method B is substantially better than the block detection based spectrum sensing in small probability of the false alarm.

A Deep Learning-Based Image Semantic Segmentation Algorithm

  • Chaoqun, Shen;Zhongliang, Sun
    • Journal of Information Processing Systems
    • /
    • 제19권1호
    • /
    • pp.98-108
    • /
    • 2023
  • This paper is an attempt to design segmentation method based on fully convolutional networks (FCN) and attention mechanism. The first five layers of the Visual Geometry Group (VGG) 16 network serve as the coding part in the semantic segmentation network structure with the convolutional layer used to replace pooling to reduce loss of image feature extraction information. The up-sampling and deconvolution unit of the FCN is then used as the decoding part in the semantic segmentation network. In the deconvolution process, the skip structure is used to fuse different levels of information and the attention mechanism is incorporated to reduce accuracy loss. Finally, the segmentation results are obtained through pixel layer classification. The results show that our method outperforms the comparison methods in mean pixel accuracy (MPA) and mean intersection over union (MIOU).