• 제목/요약/키워드: boundary-adaptive

검색결과 266건 처리시간 0.022초

경계면 처리 개선을 통한 다중해상도 유동해석 기법 개선 연구 (IMPROVEMENT OF FLOW SIMULATIONS METHOD WITH MULTI-RESOLUTION ANALYSIS BY BOUNDARY TREATMENT)

  • 강형민
    • 한국전산유체공학회지
    • /
    • 제20권4호
    • /
    • pp.44-50
    • /
    • 2015
  • The computational efficiency of flow simulations with Multi-resolution analysis (MRA) was enhanced via the boundary treatment of the computational domain. In MRA, an adaptive dataset to a solution is constructed through data decomposition with interpolating polynomial and thresholding. During the decomposition process, the basis points of interpolation should exceed the boundary of the computational domain. In order to resolve this problem, the weight coefficients of interpolating polynomial were adjusted near the boundaries. By this boundary treatment, the computational efficiency of MRA was enhanced while the numerical accuracy of a solution was unchanged. This modified MRA was applied to two-dimensional steady Euler equations and the enhancement of computational efficiency and the maintenance of numerical accuracy were assessed.

전기 임피던스 단층촬영 기법에서 효과적인 초기치 설정을 통한 상 경계 추정 (Phase boundary estimation with effective initial guess in electrical impedance tomography)

  • 김봉석;김신;김경연
    • 전기전자학회논문지
    • /
    • 제16권3호
    • /
    • pp.211-216
    • /
    • 2012
  • 상 경계 추정 문제에서는 초기치에 따라 그 추정성능이 달라질 수 있다. 하지만 실제의 유동 공정에서는 초기치 설정을 위한 기포의 개수와 개략적인 위치 정보를 알 수가 없기 때문에, 초기치 설정 문제는 더욱 중요하다. 따라서 이 논문에서는 상 경계 추정을 위한 초기치 설정을 위해 우선 차이(difference) 복원 방법을 사용하여 미지의 저항률 분포를 추정하고, 중간모드(intermodes) 방법을 사용하여 적응 문턱치를 자동으로 계산하였으며, 이를 바탕으로 기포의 개수와 초기 위치를 결정하였다. 이로써 잡음이 존재하는 경우에도 기포의 상 경계를 잘 추정할 수 있는 방법을 개발하였다. 이에 몇 가지 시나리오를 설정하고 모의실험을 통해 제안한 방법의 상 경계 추정성능을 평가하였다.

적응적 컨벡스헐 알고리즘을 이용한 항공라이다 데이터의 건물 경계 재구성 (Building Boundary Reconstruction from Airborne Lidar Data by Adaptive Convex Hull Algorithm)

  • 이정호;김용일
    • 한국측량학회지
    • /
    • 제30권3호
    • /
    • pp.305-312
    • /
    • 2012
  • 본 논문은 항공라이다 데이터로부터 추출한 건물점으로부터 건물 경계를 재구성하는데 있어서 정확도와 연산 효율성을 향상시키는 것을 목적으로 한다. 이를 위하여 국지적 컨벡스헐 알고리즘을 3가지 측면에서 수정한 적응적 컨벡스헐 알고리즘을 제안하였다. 첫째, 연산 효율성을 향상시키기 위하여 점들의 밀도에 따라 경계 후보점을 먼저 추출한 후 경계점을 추출한다. 둘째, 폐색이나 오차가 포함된 건물에서 보다 안정적으로 건물 경계점을 추출하기 위하여 원시 데이터 구조를 바탕으로 탐색 반경을 적응적으로 변화시킨다. 셋째, 안마당과 오차에 의한 홀을 구분하기 위하여 점들 간의 거리와 ID를 이용한 내부 경계 초기점 탐지 기법을 적용한다. 제안 방법의 활용가능성을 평가하기 위하여 다양한 건물들을 포함하는 두 도시 지역에 적용한 결과, 모양상이성이 8.5%로써 기존의 대표적인 경계점 추출 방법에 비하여 우수하였으며 연산 효율성은 약 2배 향상된 것을 확인할 수 있었다.

Particle Swarm Optimization Using Adaptive Boundary Correction for Human Activity Recognition

  • Kwon, Yongjin;Heo, Seonguk;Kang, Kyuchang;Bae, Changseok
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권6호
    • /
    • pp.2070-2086
    • /
    • 2014
  • As a kind of personal lifelog data, activity data have been considered as one of the most compelling information to understand the user's habits and to calibrate diagnoses. In this paper, we proposed a robust algorithm to sampling rates for human activity recognition, which identifies a user's activity using accelerations from a triaxial accelerometer in a smartphone. Although a high sampling rate is required for high accuracy, it is not desirable for actual smartphone usage, battery consumption, or storage occupancy. Activity recognitions with well-known algorithms, including MLP, C4.5, or SVM, suffer from a loss of accuracy when a sampling rate of accelerometers decreases. Thus, we start from particle swarm optimization (PSO), which has relatively better tolerance to declines in sampling rates, and we propose PSO with an adaptive boundary correction (ABC) approach. PSO with ABC is tolerant of various sampling rate in that it identifies all data by adjusting the classification boundaries of each activity. The experimental results show that PSO with ABC has better tolerance to changes of sampling rates of an accelerometer than PSO without ABC and other methods. In particular, PSO with ABC is 6%, 25%, and 35% better than PSO without ABC for sitting, standing, and walking, respectively, at a sampling period of 32 seconds. PSO with ABC is the only algorithm that guarantees at least 80% accuracy for every activity at a sampling period of smaller than or equal to 8 seconds.

블록 분류와 적응적 필터링을 이용한 후처리에서의 양자화 잡음 제거 기법 (Postprocessing Method for Quantization Noise Reduction Using Block Classification and Adaptive Filtering)

  • 이석환;권성근;이종원;이승진;이건일
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2000년도 하계종합학술대회 논문집(4)
    • /
    • pp.66-69
    • /
    • 2000
  • In this paper, we proposed a postprocessing algorithm for quantization effects reduction in block coded images using the block classification and adaptive filtering. The proposed method consists of classification, adaptive inter-block filtering, and intra-block filtering. First, each block is classified into one of seven classes based on the characteristics of 8${\times}$8 DCT coefficients. Then each block boundary is filtered by adaptive inter-block filters according to the block classification. Finally for blocks which are classified into edge block, intra-block filtering is peformed. Experimental results show that the proposed method gives better results than the conventional methods from both a subjective and an objective viewpoint.

  • PDF

Adaptive Contrast Stretching for Land Observation in Cloudy Low Resolution Satellite Imagery

  • Lee, Hwa-Seon;Lee, Kyu-Sung
    • 대한원격탐사학회지
    • /
    • 제28권3호
    • /
    • pp.287-296
    • /
    • 2012
  • Although low spatial resolution satellite images like MODIS and GOCI can be important to observe land surface, it is often difficult to visually interpret the imagery because of the low contrast by prevailing cloud covers. We proposed a simple and adaptive stretching algorithm to enhance image contrast over land areas in cloudy images. The proposed method is basically a linear algorithm that stretches only non-cloud pixels. The adaptive linear stretch method uses two values: the low limit (L) from image statistics and upper limit (U) from low boundary value of cloud pixels. The cloud pixel value was automatically determined by pre-developed empirical function for each spectral band. We used MODIS and GOCI images having various types of cloud distributions and coverage. The adaptive contrast stretching method was evaluated by both visual interpretation and statistical distribution of displayed brightness values.

Robust Adaptive Control of A HexaSlide Type Parallel Manipulator

  • Kim, Jong-Phil;Kim, Sung-Gaun;Ryu, Jeha
    • Transactions on Control, Automation and Systems Engineering
    • /
    • 제3권4호
    • /
    • pp.262-267
    • /
    • 2001
  • Jeha Ryu Department of Mechatronics, Kwangju Institute of Science and Technology This paper presents an application of a robust adaptive control strategy to HexaSlide type six degrees-of-freedom parallel manipulators. The HexaSlide type parallel manipulators are characterized as an architecture with constant link lengths that are attached to moving sliders on the ground and to a mobile platform. The proposed control law is developed based on a simplified second order system dynamic equation in joint space with uncertain mass, damper, spring, and Coulomb friction terms. These uncertain parameters are updated by an adaptation law that is derived by Lyapunov stability theorem. A robust adaptive control law by using the boundary layer is designed for the purpose of compensating for the neglected dynamic effects of the mobile platform and the six moving links that are modeled as a disturbance term. Experimental results show good and fast tracking performance.

  • PDF

Local stereo matching using combined matching cost and adaptive cost aggregation

  • Zhu, Shiping;Li, Zheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권1호
    • /
    • pp.224-241
    • /
    • 2015
  • Multiview plus depth (MVD) videos are widely used in free-viewpoint TV systems. The best-known technique to determine depth information is based on stereo vision. In this paper, we propose a novel local stereo matching algorithm which is radiometric invariant. The key idea is to use a combined matching cost of intensity and gradient based similarity measure. In addition, we realize an adaptive cost aggregation scheme by constructing an adaptive support window for each pixel, which can solve the boundary and low texture problems. In the disparity refinement process, we propose a four-step post-processing technique to handle outliers and occlusions. Moreover, we conduct stereo reconstruction tests to verify the performance of the algorithm more intuitively. Experimental results show that the proposed method is effective and robust against local radiometric distortion. It has an average error of 5.93% on the Middlebury benchmark and is compatible to the state-of-art local methods.

미지의 회전자 저항을 갖는 유도기의 적응 자속 관측자 설계 (An Adaptive Flux Observer of Induction Motors with Unknown Rotor Resistance)

  • 김도우;양해원;윤지섭;박병석;김홍필
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1998년도 추계학술대회 논문집 학회본부 B
    • /
    • pp.438-441
    • /
    • 1998
  • In this paper, we proposes an adaptive flux observer to estimate initial values of rotor fluxes and unknown rotor resistance. The error system between the model of induction motor and a proposed observer is devided as a fast subsystem and a slow one by a singular perturbation system. The fast subsystem is exponentially convergent on a boundary-layer. And the overall error system is reduced to a quasi-steady-state system. The adaptive law for an unknown rotor resistance is designed to stabilize the approximate error system. As computer simulation results show, the proposed adaptive flux observer estimates fast initial values of rotor fluxes and unknown rotor resistance.

  • PDF