• 제목/요약/키워드: minimum resolution

검색결과 370건 처리시간 0.02초

최소 오차 원 해석을 위한 최적 해상도에 관한 연구 (The Optimal Resolution for Circle Analysis with the Minimum Error)

  • 김태현;문영식;한창수
    • 한국정밀공학회지
    • /
    • 제17권5호
    • /
    • pp.55-62
    • /
    • 2000
  • In this paper, an algorithm for determining the optimal resolution has been described for measuring the actual length of circular objects. As the resolution gets higher, the measurement error in general becomes smaller because of the reduced distance per pixel. However, the higher resolution makes circular objects enlarged, which may produce an ill-conditioned system. That is, a small error in the boundary positions may result in a large error in the analysis of the circular objects. Taking this fact into account, a new measure is proposed to determine the optimal resolution. The actual errors have been calculated with various resolutions and the resolution with the minimum error has been decided as the optimal resolution. The analysis using various circles with different sizes indicates that the minimum measurement error is obtained when the whole circle appears in the screen as large as possible, regardless of the size of circle. The experimental results using real images have verified the validity of our analysis.

  • PDF

대역 확산 신호를 위한 고유치 해석 기반의 초 분해능 지연 시간 추정 알고리즘 (Eigen-Analysis Based Super-Resolution Time Delay Estimation Algorithms for Spread Spectrum Signals)

  • 박형래;신준호
    • 한국통신학회논문지
    • /
    • 제38A권12호
    • /
    • pp.1013-1020
    • /
    • 2013
  • 본 논문에서는 대역 확산 신호를 위한 고유치 해석 기반의 초 분해능 지연 시간 추정(super-resolution time delay estimation) 알고리즘을 개발하고 각 알고리즘의 성능을 비교, 분석한다. 먼저, 고유치 해석 기반의 대표적인 도래각 추정 알고리즘인 MUSIC, ESPRIT, Minimum-Norm을 이용하여 초 분해능 지연 시간 추정 알고리즘을 개발하고 직접 대역확산 방식의 ISO/IEC 24730-2.1 실시간 위치 추적 시스템 (real-time locating system: RTLS)에 적용하여 RTLS 환경에서 각 알고리즘의 성능을 시뮬레이션을 통해 비교, 분석한다. 시뮬레이션 결과로부터 세 알고리즘 모두 레일리이 분해능 한계 이내로 수신되는 다중 신호의 지연 시간을 모두 분리, 추정함을 알 수 있었다. 그러나, RTLS 환경에서는 MUSIC과 Minimum-Norm의 성능은 서로 비슷하나 ESPRIT은 두 알고리즘에 비해 성능이 현격히 저하됨을 알 수 있다.

레이저 거리계의 이론적 최소 분해능에 관한 연구 (A study on the theoretical minimum resolution of the laser range finder)

  • 차영엽;권대갑
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
    • /
    • pp.644-647
    • /
    • 1996
  • In this study the theoretical minimum resolution analysis of an active vision system using laser range finder is performed for surrounding recognition and 3D data acquisition in unknown environment. The laser range finder consists of a slitted laser beam generator, a scanning mechanism, CCD camera, and a signal processing unit. A laser beam from laser source is slitted by a set of cylindrical lenses and the slitted laser beam is emitted up and down and rotates by the scanning mechanism. The image of laser beam reflected on the surface of an object is engraved on the CCD array. In the result, the resolution of range data in laser range finder is depend on distance between lens center of CCD camera and light emitter, view and beam angles, and parameters of CCD camera.

  • PDF

형태제어에 기초한, 여유자유도를 갖는 로보트 머니퓰레이터의 여유자유도 이용에 관한 연구 (Redundancy Utilizations of Redundant Robot Manipulators Based on Configuration Control)

  • 최영규
    • 대한전기학회논문지
    • /
    • 제41권4호
    • /
    • pp.422-432
    • /
    • 1992
  • Previous investigations of redundant manipulators have often focussed on local optimization for redundancy resolution by using the Jacobian pseudoinverse to solve the instantaneous relationship between the joint and end-effector velocities. This paper establishes some new goals for redundancy resolution at position level by using configuration control approach which has been recently developed. Minimum gravity loading, joint limit avoidance, minimum sensitivity, maximum stiffness and minimum impulse are introduced as redundancy resolution goals. These new goals for redundancy resolution allow more efficient utilizations of the redundant joints based on the desired task requirements. Simple computer simulation examples are given for illustration.

  • PDF

PRISM과 GEV 방법을 활용한 30 m 해상도의 격자형 기온 극값 추정 방법 연구 (A Study on the Method for Estimating the 30 m-Resolution Daily Temperature Extreme Value Using PRISM and GEV Method)

  • 이준리;안중배;정하규
    • 대기
    • /
    • 제26권4호
    • /
    • pp.697-709
    • /
    • 2016
  • This study estimates and evaluates the extreme value of 30 m-resolution daily maximum and minimum temperatures over South Korea, using inverse distance weighting (IDW), parameter-elevation regression on independent slopes model (PRISM) and generalized extreme value (GEV) method. The three experiments are designed and performed to find the optimal estimation strategy to obtain extreme value. First experiment (EXP1) applies GEV firstly to automated surface observing system (ASOS) to estimate extreme value and then applies IDW to produce high-resolution extreme values. Second experiment (EXP2) is same as EXP1, but using PRISM to make the high-resolution extreme value instead of IDW. Third experiment (EXP3) firstly applies PRISM to ASOS to produce the high-resolution temperature field, and then applies GEV method to make high resolution extreme value data. By comparing these 3 experiments with extreme values obtained from observation data, we find that EXP3 shows the best performance to estimate extreme values of maximum and minimum temperatures, followed by EXP1 and EXP2. It is revealed that EXP1 and EXP2 have a limitation to estimate the extreme value at each grid point correctly because the extreme values of these experiments with 30 m-resolution are calculated from only 60 extreme values obtained from ASOS. On the other hand, the extreme value of EXP3 is similar to observation compared to others, since EXP3 produces 30m-resolution daily temperature through PRISM, and then applies GEV to that result at each grid point. This result indicates that the quality of statistically produced high-resolution extreme values which are estimated from observation data is different depending on the combination and procedure order of statistical methods.

Resolution of kinematic redundancy using contrained optimization techniques under kinematic inequality contraints

  • Park, Ki-Cheol;Chang, Pyung-Hun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 Proceedings of the Korea Automatic Control Conference, 11th (KACC); Pohang, Korea; 24-26 Oct. 1996
    • /
    • pp.69-72
    • /
    • 1996
  • This paper considers a global resolution of kinematic redundancy under inequality constraints as a constrained optimal control. In this formulation, joint limits and obstacles are regarded as state variable inequality constraints, and joint velocity limits as control variable inequality constraints. Necessary and sufficient conditions are derived by using Pontryagin's minimum principle and penalty function method. These conditions leads to a two-point boundary-value problem (TPBVP) with natural, periodic and inequality boundary conditions. In order to solve the TPBVP and to find a global minimum, a numerical algorithm, named two-stage algorithm, is presented. Given initial joint pose, the first stage finds the optimal joint trajectory and its corresponding minimum performance cost. The second stage searches for the optimal initial joint pose with globally minimum cost in the self-motion manifold. The effectiveness of the proposed algorithm is demonstrated through a simulation with a 3-dof planar redundant manipulator.

  • PDF

Minimum Aberration $3^{n-k}$ Designs

  • Park, Dong-Kwon
    • Journal of the Korean Statistical Society
    • /
    • 제25권2호
    • /
    • pp.277-288
    • /
    • 1996
  • The minimum aberration criterion is commonly used for selecting good fractional factorial designs. In this paper we give same necessary conditions for $3^{n-k}$ fractional factorial designs. We obtain minimum aberration $3^{n-k}$ designs for k = 2 and any n. For k > 2, minimum aberration designs have not found yet. As an alternative, we select a design with minimum aberration among minimum-variance designs.

  • PDF

Long-term analysis of tropospheric delay and ambiguity resolution rate of GPS data

  • Kim, Su-Kyung;Bae, Tae-Suk
    • 한국측량학회지
    • /
    • 제30권6_2호
    • /
    • pp.673-680
    • /
    • 2012
  • Long-term GPS data analysis was performed in order to analyze the seasonal variation of tropospheric delay and the success rate of the ambiguity resolution. For this analysis, a total of 57 stations including 10 IGS stations in East Asia were processed together with double-differenced observables using Bernese GPS Software V5.0. The time span for this study ranges from 2002.0 to 2012.5 (10.5 years). The average baseline length is 339.0 km and the maximum reaches up to 2,000 km. The analysis is focused on two things: the annual variation of the tropospheric delay and the ambiguity resolution rate. The tropospheric delay is closely related to the weather condition, especially relative humidity, therefore it was estimated that the maximum would be in summer, while reaching its minimum in winter with the apparent seasonal variations. On the contrary, however, the success rate of the ambiguity resolution shows the opposite pattern: its maximum was in winter and minimum in summer. The fact seems to be induced by the surrounding conditions; that is, the trees thick with leaves near the GPS antenna interfere with GPS signals in summer. This seems to confirm partly that there is a distinct trend in the decreasing success rate since 2006 because the trees are growing every year. It is necessary to eliminate the factors that degrade the GPS quality and the tropospheric modeling for Korea needs to be studied further.

동부호화 최적화 기법의 성능개선을 위한 과거 검색정보의 활용 (Improvement of Dynamic encoding algorithm with history information)

  • 박영수;김종욱;김연탁
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2006년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.111-113
    • /
    • 2006
  • DEAS is an direct searching and optimization method that based on the binary code space. It can be classified as an direct hill climbing searching. However, because of binary code space based searching, the searching in low resolution has random property. As the resolution of code increases during the search, its property of searching changes like that of hill climbing search. This paper propose a method for improving the performance of minimum seeking ability of DEAS with history information. The cost evaluation is increased. However the minimum searching ability of DEAS is improved along the same starting resolution.

  • PDF

A Study on High Resolution Ranging Algorithm for The UWB Indoor Channel

  • Lee, Chong-Hyun
    • 조명전기설비학회논문지
    • /
    • 제21권4호
    • /
    • pp.96-103
    • /
    • 2007
  • In this paper, we present a novel and numerically efficient algorithm for high resolution TOA(Time Of Arrival) estimation under indoor radio propagation channels. The proposed algorithm is not dependent on the structure of receivers, i.e, it can be used with either coherent or non-coherent receivers. The TOA estimation algorithm is based on a high resolution frequency estimation algorithm of Minimum-norm. The efficiency of the proposed algorithm relies on numerical analysis techniques in computing signal or noise subspaces. The algorithm is based on the two step procedures, one for transforming input data to frequency domain data and the other for estimating the unknown TOA using the proposed efficient algorithm. The efficiency in number of operations over other algorithms is presented. The performance of the proposed algorithm is investigated by means of computer simulations.. Throughout the analytic and computer simulation results, we show that the proposed algorithm exhibits superior performance in estimating TOA estimation with limited computational cost.