• 제목/요약/키워드: computer based estimation

Search Result 1,367, Processing Time 0.025 seconds

Adaptive control for robot manipulator using speed-gradient algorithm (S-G 알고리즘을 이용한 로보트 매니플레이터의 적응제어)

  • 정사철;김진환;이정휴;함운철
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10a
    • /
    • pp.1-7
    • /
    • 1993
  • In this paper we propose the new adaptive control algorithm by using S-G algorithm based on the error equations derived by Slotine. We verify the validity of the proposed controller and convergence of three type parameter estimation law based on S-G algorithm from the computer simulation.

  • PDF

Estimation of Rotation Center and Rotation Angle for Real-time Image Stabilization of Roll Axis. (실시간 회전영상 안정화를 위한 회전중심 및 회전각도 추정 방법)

  • Cho, Jae-Soo;Kim, Do-Jong
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.153-155
    • /
    • 2004
  • This paper proposes a real-time approach on the rotational motion estimation and correction for the roll stabilization of the sight system. This method first estimates a rotation center by the least-mean square algorithm based on the motion vectors of some feature points. And, then, a rotation angle is searched for a best matching block between a reference block image and seccessive input images using MPC(maximum pixel count) matching criterion. Finally, motion correction is performed by the bilinear interpolation technique. Various computer simulations show that the estimation performance is good and the proposed algorithm is a real-time implementable one to the TMS320C6415(500MHz) DSP.

  • PDF

Motion Estimation Method Based on Correlations of Motion Vectors for Multi-view Video Coding (다시점 비디오 부호화를 위한 움직임 벡터들의 상관성을 이용한 움직임 추정 기법)

  • Yoon, Hyo-Sun;Kim, Mi-Young
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.10
    • /
    • pp.1131-1141
    • /
    • 2018
  • Motion Estimation which is used to reduce the redundant data plays an important role in video compressions. However, it requires huge computational complexity of the encoder part. And therefore many fast motion estimation methods has been developed to reduce complexity. Multi-view video is obtained by using many cameras at different positions and its complexity increases in proportion to the number of cameras. In this paper, we proposed a fast motion estimation method for multi-view video. The proposed method predicts a search start point by using correlated candidate vectors of the current block. According to the motion size of the start search point, a search start pattern of the current block is decided adaptively. The proposed method proves to be about 2 ~ 5 times faster than existing methods while maintaining similar image quality and bitrates.

A Technique of Angle-of-Arrival Estimation in an Ultra wide Band(UWB) Indoor Wireless Communication (초광대역 옥내 무선 통신에서 신호 도착 방향 추정 기법)

  • Lee Yong-Up;Seo Young-Jun;Cho Gin-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.3C
    • /
    • pp.279-285
    • /
    • 2006
  • In this study, a new signal model suitable for UWB indoor environments with random angle spread is proposed to estimate the angle-of-arrivals(AOAs) of UWB cluster signals in an UWB wireless communication. A subspace based estimation technique adopted for this model is investigated and the estimates of the AOA and distribution parameter on the received UWB cluster signals are obtained. The proposed model and estimation technique are verified using computer simulations, and the performance of the estimation error is analyzed.

Measurement Allocation by Shapley Value in Wireless Sensor Networks

  • Byun, Sang-Seon
    • Journal of information and communication convergence engineering
    • /
    • v.16 no.1
    • /
    • pp.38-42
    • /
    • 2018
  • In this paper, we consider measurement allocation problem in a spatially correlated sensor field. Our goal is to determine the probability of each sensor's being measured based on its contribution to the estimation reliability; it is desirable that a sensor improving the estimation reliability is measured more frequently. We consider a spatial correlation model of a sensor field reflecting transmission power limit, noise in measurement and transmission channel, and channel attenuation. Then the estimation reliability is defined distortion error between event source and its estimation at sink. Motivated by the correlation nature, we model the measurement allocation problem into a cooperative game, and then quantify each sensor's contribution using Shapley value. Against the intractability in the computation of exact Shapley value, we deploy a randomized method that enables to compute the approximate Shapley value within a reasonable time. Besides, we envisage a measurement scheduling achieving the balance between network lifetime and estimation reliability.

Alternating-Projection-Based Channel Estimation for Multicell Massive MIMO Systems

  • Chen, Yi Liang;Ran, Rong;Oh, Hayoung
    • Journal of information and communication convergence engineering
    • /
    • v.16 no.1
    • /
    • pp.17-22
    • /
    • 2018
  • In massive multiple-input multiple-output (MIMO) systems, linear channel estimation algorithms are widely applied owing to their simple structures. However, they may cause pilot contamination, which affects the subsequent data detection performance. Therefore, herein, for an uplink multicell massive multiuser MIMO system, we consider using an alternating projection (AP) for channel estimation to eliminate the effect of pilot contamination and improve the performance of data detection in terms of the bit error rates as well. Even though the AP is nonlinear, it iteratively searches the best solution in only one dimension, and the computational complexity is thus modest. We have analyzed the mean square error with respect to the signal-to-interference ratios for both the cooperative and non-cooperative multicell scenarios. From the simulation results, we observed that the channel estimation results via the AP benefit the following signal detection more than that via the least squares for both the cooperative and non-cooperative multicell scenarios.

A robust center estimation of the circular parts based on the weighted circle chords (가중치가 부가된 현들을 이용한 원형부품 중심위치의 강건한 추정)

  • 성효경;최흥문
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.10
    • /
    • pp.51-58
    • /
    • 1997
  • In this paper, a technique ot estimate center positions of the circular parts under noisy condition is presented. The circle chords are segmented from the circle with successively varying angle and weighted to reduce the center estimation errors effected by the orientations of the circle chords. The weighting factors for variable length chords are adaptively detemined according to the error contribution of each chord in center estimation. Robust estimation of the center positions of the circular parts are possible even though the edge informations are partially contaminated by the non-uniform lighting or the background textures. Computer simulations for several images which are obtained for same object under real environment y camera, show that the proposed techniqeu yields 1.85 and 2.77 of estimated error-distribution for center position and radius in mean square error, that the proposed has more robust estimation than those of the conventional methods.

  • PDF

Particle Filter Based Robust Multi-Human 3D Pose Estimation for Vehicle Safety Control (차량 안전 제어를 위한 파티클 필터 기반의 강건한 다중 인체 3차원 자세 추정)

  • Park, Joonsang;Park, Hyungwook
    • Journal of Auto-vehicle Safety Association
    • /
    • v.14 no.3
    • /
    • pp.71-76
    • /
    • 2022
  • In autonomous driving cars, 3D pose estimation can be one of the effective methods to enhance safety control for OOP (Out of Position) passengers. There have been many studies on human pose estimation using a camera. Previous methods, however, have limitations in automotive applications. Due to unexplainable failures, CNN methods are unreliable, and other methods perform poorly. This paper proposes robust real-time multi-human 3D pose estimation architecture in vehicle using monocular RGB camera. Using particle filter, our approach integrates CNN 2D/3D pose measurements with available information in vehicle. Computer simulations were performed to confirm the accuracy and robustness of the proposed algorithm.

Genetic Algorithm Based Feature Reduction For Depth Estimation Of Image (이미지의 깊이 추정을 위한 유전 알고리즘 기반의 특징 축소)

  • Shin, Sung-Sik;Gwun, Ou-Bong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.2
    • /
    • pp.47-54
    • /
    • 2011
  • This paper describes the method to reduce the time-cost for depth estimation of an image by learning, on the basis of the Genetic Algorithm, the image's features. The depth information is estimated from the relationship among features such as the energy value of an image and the gradient of the texture etc. The estimation-time increases due to the large dimension of an image's features used in the estimating process. And the use of the features without consideration of their importance can have an adverse effect on the performance. So, it is necessary to reduce the dimension of an image's features based on the significance of each feature. Evaluation of the method proposed in this paper using benchmark data provided by Stanford University found that the time-cost for feature extraction and depth estimation improved by 60% and the accuracy was increased by 0.4% on average and up to 2.5%.

An Efficient Search Method for Binary-based Block Motion Estimation (이진 블록 매칭 움직임 예측을 위한 효율적인 탐색 알고리듬)

  • Lim, Jin-Ho;Jeong, Je-Chang
    • Journal of Broadcast Engineering
    • /
    • v.16 no.4
    • /
    • pp.647-656
    • /
    • 2011
  • Motion estimation using one-bit transform and two-bit transform reduces the complexity for computation of matching error; however, the peak signal-to-noise ratio (PSNR) is degraded. Modified 1BT (M1BT) and modified 2BT (M2BT) have been proposed to compensate degraded PSNR by adding conditional local search. However, these algorithms require many additional search points in fast moving sequences with a block size of $16{\times}16$. This paper provides more efficient search method by preparing candidate blocks using the number of non-matching points (NNMP) than the conditional local search. With this NNMP-based search, we can easily obtain candidate blocks with small NNMP and efficiently search final motion vector. Experimental results show that the proposed algorithm not only reduces computational complexity, but also improves PSNR on average compared with conventional search algorithm used in M1BT, M2BT and AM2BT.