• Title/Summary/Keyword: Point estimation method

Search Result 1,039, Processing Time 0.038 seconds

Experimental Verification of Displacement Estimation Algorithm using Velocity Time History (속도시간이력을 이용한 변위 추정 알고리즘에 관한 실험적 검증)

  • Joh, Sung-Ho;Jeon, Jun-Chang;Hwang, Seon Keun;Lee, Hee-Hyun
    • Journal of the Korean Society of Safety
    • /
    • v.30 no.4
    • /
    • pp.99-105
    • /
    • 2015
  • In this study, displacement estimation algorithm, which is not requiring an absolute reference point unlike the conventional displacement measurement method, is developed using the geophone. To estimate displacement of the bridge, measured velocity time signal is integrated in the frequency domain. And, the estimated displacement is compared with the measured result using a conventional method. Based on the dynamic field test results, it was found that the estimated displacement by the present algorithm is similar to that of a conventional method. The displacement estimation algorithm proposed in this paper can be effectively applied to measure the displacement of a structure, which is difficult to install a displacement transducer at the fixed point.

Probability Constrained Search Range Determination for Fast Motion Estimation

  • Kang, Hyun-Soo;Lee, Si-Woong;Hosseini, Hamid Gholam
    • ETRI Journal
    • /
    • v.34 no.3
    • /
    • pp.369-378
    • /
    • 2012
  • In this paper, we propose new adaptive search range motion estimation methods where the search ranges are constrained by the probabilities of motion vector differences and a search point sampling technique is applied to the constrained search ranges. Our new methods are based on our previous work, in which the search ranges were analytically determined by the probabilities. Since the proposed adaptive search range motion estimation methods effectively restrict the search ranges instead of search point sampling patterns, they provide a very flexible and hardware-friendly approach in motion estimation. The proposed methods were evaluated and tested with JM16.2 of the H.264/AVC video coding standard. Experiment results exhibit that with negligible degradation in PSNR, the proposed methods considerably reduce the computational complexity in comparison with the conventional methods. In particular, the combined method provides performance similar to that of the hybrid unsymmetrical-cross multi-hexagon-grid search method and outstanding merits in hardware implementation.

A Fast Search Algorithm for Sub-Pixel Motion Estimation (부화소 움직임 추정을 위한 고속 탐색 기법)

  • Park, Dong-Kyun;Jo, Seong-Hyeon;Cho, Hyo-Moon;Lee, Jong-Hwa
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.26-28
    • /
    • 2007
  • The motion estimation is the most important technique in the image compression of the video standards. In the case of next generation standards in the video codec as H.264, a high compression-efficiency can be also obtained by using a motion compensation. To obtain the accurate motion search, a motion estimation should be achieved up to 1/2 pixel and 1/4 pixel uiuts. To do this, the computational complexity is increased although the image compression rate is increased. Therefore, in this paper, we propose the advanced sub-pixel block matching algorithm to reduce the computational complexity by using a statistical characteristics of SAD(Sum of Absolute Difference). Generally, the probability of the minimum SAD values is high when searching point is in the distance 1 from the reference point. Thus, we reduced the searching area and then we can overcome the computational complexity problem. The main concept of proposed algorithm, which based on TSS(Three Step Search) method, first we find three minimum SAD points which is in integer distance unit, and then, in second step, the optimal point is in 1/2 pixel unit either between the most minimum SAD value point and the second minimum SAD point or between the most minimum SAD value point and the third minimum SAD point In third step, after finding the smallest SAD value between two SAD values on 1/2 pixel unit, the final optimized point is between the most minimum SAD value and the result value of the third step, in 1/2 pixel unit i.e., 1/4 pixel unit in totally. The conventional TSS method needs an eight.. search points in the sub-pixel steps in 1/2 pixel unit and also an eight search points in 1/4 pixel, to detect the optimal point. However, in proposed algorithm, only total five search points are needed. In the result. 23 % improvement of processing speed is obtained.

  • PDF

Algorithm to Improve Accuracy of Location Estimation for AR Games (AR 게임을 위한 위치추정 정확도 향상 알고리즘)

  • Han, Seo Woo;Suh, Doug Young
    • Journal of Broadcast Engineering
    • /
    • v.24 no.1
    • /
    • pp.32-40
    • /
    • 2019
  • Indoor location estimation studies are needed in various fields. The method of estimating the indoor position can be divided into a method using hardware and a method using no hardware. The use of hardware is more accurate, but has the disadvantage of hardware installation costs. Conversely, the non-hardware method is not costly, but it is less accurate. To estimate the location for AR game, you need to get the solution of the Perspective-N-Point (PnP). To obtain the PnP problem, we need three-dimensional coordinates of the space in which we want to estimate the position and images taken in that space. The position can be estimated through six pairs of two-dimensional coordinates matching the three-dimensional coordinates. To further increase the accuracy of the solution, we proposed the use of an additional non-coplanarity degree to determine which points would increase accuracy. As the non-coplanarity degree increases, the accuracy of the position estimation becomes higher. The advantage of the proposed method is that it can be applied to all existing location estimation methods and that it has higher accuracy than hardware estimation.

Improved Function Point Measurement Model for Software Size Estimation (소프트웨어 규모 산정을 위한 개선된 기능 점수 측정 모델)

  • Jung, In-Yong;Woo, Doug-Je;Park, Jin-Hyeong;Jeong, Chang-Sung
    • Journal of Internet Computing and Services
    • /
    • v.10 no.4
    • /
    • pp.115-126
    • /
    • 2009
  • A software size estimation has to be analyzed in the beginning of the software life-cycle and helpful to the prediction of its size and cost. The software cost has been calculated by estimating software size from the user's point of view since the function point method based on international standards was introduced for the estimation of software size in 2004. However, the current function point method is not easy to be exploited for unfamiliar user, and has a problem that it cannot estimate the proper size for software such as engineering software, scientific calculations and simulation with complicated internal computational logic. This paper presents an improved model which can simplify the existing function point measurement procedure, and perform the estimation of software size in easy and fast way at the initial stage of project. Moreover, it presents a mathematical weighted value calculation model which can solve the problem of the fixed complexity weighted value and reflect the characteristics of organization as its data is pilled up. Our evaluation shows that the presented model has advantage that it can measure the size more rapidly than the existing FPA methods and has more correlation with LOC.

  • PDF

Sub-pixel Point Spread function Estimation for Fully Digital Auto-Focusing System (완전디지털 자동초점 시스템 구현을 위한 부화소단위 점확산함수 추정)

  • 황성현;신정호;백준기
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.1727-1730
    • /
    • 2003
  • In this paper we propose a sub-pixel point spread function (PSF) estimation method for a fully digital auto-focusing system. We assume that the amount of out-of-focus is the same along the concentric circle. In order to estimate the accurate PSF, sub-pixel information is considered in the proposed PSF estimation procedure. The feasibility of the proposed algorithm is experimentally demonstrated.

  • PDF

A Nonparametric Approach for Noisy Point Data Preprocessing

  • Xi, Yongjian;Duan, Ye;Zhao, Hongkai
    • International Journal of CAD/CAM
    • /
    • v.9 no.1
    • /
    • pp.31-36
    • /
    • 2010
  • 3D point data acquired from laser scan or stereo vision can be quite noisy. A preprocessing step is often needed before a surface reconstruction algorithm can be applied. In this paper, we propose a nonparametric approach for noisy point data preprocessing. In particular, we proposed an anisotropic kernel based nonparametric density estimation method for outlier removal, and a hill-climbing line search approach for projecting data points onto the real surface boundary. Our approach is simple, robust and efficient. We demonstrate our method on both real and synthetic point datasets.

Multiple change-point estimation in spectral representation

  • Kim, Jaehee
    • Communications for Statistical Applications and Methods
    • /
    • v.29 no.1
    • /
    • pp.127-150
    • /
    • 2022
  • We discuss multiple change-point estimation as edge detection in piecewise smooth functions with finitely many jump discontinuities. In this paper we propose change-point estimators using concentration kernels with Fourier coefficients. The change-points can be located via the signal based on Fourier transformation system. This method yields location and amplitude of the change-points with refinement via concentration kernels. We prove that, in an appropriate asymptotic framework, this method provides consistent estimators of change-points with an almost optimal rate. In a simulation study the proposed change-point estimators are compared and discussed. Applications of the proposed methods are provided with Nile flow data and daily won-dollar exchange rate data.

A Study on the Speed-based Active Compensation of the Kiss-Point of Dry-type Clutch Equipped with Automated Manual Transmission (자동화 수동변속기용 건식클러치의 속도기반 Kiss-Point 능동 보상에 관한 연구)

  • Choi, Woo-Seok;Lee, Kyo-Bum;Lim, Wonsik
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.24 no.3
    • /
    • pp.372-378
    • /
    • 2016
  • Clutch torque control is the key to the ride comfort improvement of a vehicle equipped with AMT (automated manual transmission). For such control, the torque transfer starting point, known as the "kiss point," should be indicated or at least estimated to compensate for the clutch torque. The kiss point changes due to wear, high temperature, and fatigue; as such, it should be estimated while the vehicle is being driven. In this study, the method of kiss point active estimation for an AMT vehicle with a dry-type clutch was devised. The kiss point is learned while the engine is in an idle state and while the transmission is at a neutral gear position. It is determined when the input shaft of the transmission starts to rotate by slowly engaging the clutch. The noise of the shaft speed signal during the slow engagement process is filtered for accurate control. The kiss point estimation at various clutch engagement speeds was analyzed via a vehicle test.

Unbiased Balanced Half-Sample Variance Estimation in Stratified Two-stage Sampling

  • Kim, Kyu-Seong
    • Journal of the Korean Statistical Society
    • /
    • v.27 no.4
    • /
    • pp.459-469
    • /
    • 1998
  • Balanced half sample method is a simple variance estimation method for complex sampling designs. Since it is simple and flexible, it has been widely used in large scale sample surveys. However, the usual BHS method overestimate the true variance in without replacement sampling and two-stage cluster sampling. Focusing on this point , we proposed an unbiased BHS variance estimator in a stratified two-stage cluster sampling and then described an implementation method of the proposed estimator. Finally, partially BHS design is explained as a tool of reducing the number of replications of the proposed estimator.

  • PDF