• Title/Summary/Keyword: Least Squares Algorithm

Search Result 565, Processing Time 0.022 seconds

Array Shape Estimation Method Using Heading Sensors (방위센서를 이용한 배열 형상 추정기법)

  • 조요한;서희선;조치영
    • Journal of KSNVE
    • /
    • v.10 no.5
    • /
    • pp.886-891
    • /
    • 2000
  • In this paper, an iterative array shape estimation technique is presented, which is based on the use of the least squares polynomial fitting to the data from heading sensors. The estimated polynomial shape model is then used for calculating the hydrophone positions on the assumption that the arc distances between sensors are constant. In order to verify the applicability of the proposed algorithm, numerical simulations are performed using two types of non-linear array shapes. In addition the noise effects of heading sensors on the array shape estimation results and the performance of beamformer are also investigated.

  • PDF

Frequency Domain Waveform Inversion Using $l_1$ -norm ($l_1$-norm을 이용한 주파수 영역 파형역산)

  • Pyun, Suk-Joon;Shin, Chang-Soo
    • 한국지구물리탐사학회:학술대회논문집
    • /
    • 2007.06a
    • /
    • pp.118-123
    • /
    • 2007
  • A robust objective function in the frequency domain is applied to the acoustic full waveform inversion. The proposed objective function is defined as $l_1$-norm of residual wavefields in the frequency domain. Generally, the full waveform inversion is extremely sensitive to a number of factors such as parameterization, initial model, noise and so on. The numerical tests were performed for checking the sensitivity to attenuation and several noises. For the comparison with other objective functions, the conventional least-squares method and the logarithmic method were tested under the same condition. The synthetic data examples show that the proposed algorithm is more robust than the well-known methods.

  • PDF

A Modified Weighted Least Squares Approach to Range Estimation Problem (보완 가중 최소자승기법을 이용한 피동거리 추정필터 설계)

  • Whang, Ick-Ho;Ra, Won-Sang
    • Proceedings of the KIEE Conference
    • /
    • 2003.07d
    • /
    • pp.2088-2090
    • /
    • 2003
  • A practical recursive weighted least square(WLS) solution is proposed to solve the passive ranging problem. Apart from the previous works based on the extended Kalman filter(EKF), to ensure the convergency at long-range, the proposed scheme makes use of line-of-sight(LOS) rate instead of bearing information. The influence of LOS rate measurement errors is investigated and it is asserted that the WLS estimates contain bias and scale factor errors. Together with simple compensation algorithm, the estimation errors of proposed filter can be reduced dramatically.

  • PDF

Using Kalman Filtering and Segmentation Techniques to Capture and Detect Cracks in Pavement

  • Hsu, C.J.;Chen, C.F.
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.930-932
    • /
    • 2003
  • For this study we used a CCD video camera to capture the pavement image information via the computer. During investigation processing, the CCD video camera captured 10${\sim}$30 images per second. If the vehicle velocity is too fast, the collected images will be duplicated and if the velocity is too slow there will be a gapped between images. Therefore, in order to control the efficiency of the image grabber we should add accessory tools such as the Differential Global Positioning System (DGPS) and odometer. Furthermore, Kalman Filtering can also solve these problems. After the CCD video camera captured the pavement images, we used the Least-Squares method to eliminate images of gradation which have non-uniform surfaces due to the illumination at night. The Fuzzy Entropy method calculates images of threshold segments and creates binary images. Finally, the Object Labeling algorithm finds objects that are cracks or noises from the binary image based on volume pixels of the object. We used these algorithms and tested them, also providing some discussion and suggestions.

  • PDF

Modified Sub-aperture Stitching Algorithm using Image Sharpening and Particle Swarm Optimization

  • Chen, Yiwei;Miao, Erlong;Sui, Yongxin;Yang, Huaijiang
    • Journal of the Optical Society of Korea
    • /
    • v.18 no.4
    • /
    • pp.341-344
    • /
    • 2014
  • This study proposes a modified sub-aperture stitching algorithm, which uses an image sharpening algorithm and particle swarm optimization to improve the stitching accuracy. In sub-aperture stitching interferometers with high positional accuracy, the high-frequency components of measurements are more important than the low-frequency components when compensating for position errors using a sub-aperture stitching algorithm. Thus we use image sharpening algorithms to strengthen the high-frequency components of measurements. When using image sharpening algorithms, sub-aperture stitching algorithms based on the least-squares method easily become trapped at locally optimal solutions. However, particle swarm optimization is less likely to become trapped at a locally optimal solution, thus we utilized this method to develop a more robust algorithm. The results of simulations showed that our algorithm compensated for position errors more effectively than the existing algorithm. An experimental comparison with full aperture-testing results demonstrated the validity of the new algorithm.

P2P Ranging-Based Cooperative Localization Method for a Cluster of Mobile Nodes Containing IR-UWB PHY

  • Cho, Seong Yun;Kim, Joo Young;Enkhtur, Munkhzul
    • ETRI Journal
    • /
    • v.35 no.6
    • /
    • pp.1084-1093
    • /
    • 2013
  • problem of pedestrian localization using mobile nodes containing impulse radio ultra wideband (IR-UWB) is considered. IEEE 802.15.4a-based IR-UWB can achieve accurate ranging. However, the coverage is as short as 30 m, owing to the restricted transmit power. This factor may cause a poor geometric relationship among the mobile nodes and anchor nodes in certain environments. To localize a group of pedestrians accurately, an enhanced cooperative localization method is proposed. We describe a sequential algorithm and define problems that may occur in the implementation of the algorithm. To solve these problems, a batch algorithm is proposed. The batch algorithm can be carried out after performing the sequential algorithm to linearize the nonlinear range equation. When a sequential algorithm cannot be performed due to a poor geometric relationship among nodes, a batch algorithm can be carried out directly. Herein, Monte Carlo simulations are presented to illustrate the proposed method and verify its performance.

Error Compensation Algorithm for Higher Surface Accuracy of Freeform Mirrors Based On the Method of Least Squares

  • Jeong, Byeongjoon;Pak, Soojong;Kim, Sanghyuk;Lee, Kwang Jo;Chang, Seunghyuk;Kim, Geon Hee;Hyun, Sangwon;Jeon, Min Woo
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.40 no.2
    • /
    • pp.40.1-40.1
    • /
    • 2015
  • Off-axis reflective optical systems have attractive advantages relative to their on-axis or refractive counterparts, for example, zero chromatic aberration, no obstruction, and a wide field of view. For the efficient operation of off-axis reflective system, the surface accuracy of freeform mirrors should be higher than the order of wavelengths at which the reflective optical systems operate. Especially for applications in shorter wavelength regions, such as visible and ultraviolet, higher surface accuracy of freeform mirrors is required to minimize the light scattering. In this work, we propose the error compensation algorithm (ECA) for the correction of wavefront errors on freeform mirrors. The ECA converts a form error pattern into polynomial expression by fitting a least square method. The error pattern is measured by using an ultra-high accurate 3-D profilometer (UA3P, Panasonic Corp.). The measured data are fitted by two fitting models: Sag (Delta Z) data model and form (Z) data model. To evaluate fitting accuracy of these models, we compared the fitted error patterns with the measured error pattern.

  • PDF

Development of an Adaptive Feedback based Actuator Fault Detection and Tolerant Control Algorithms for Longitudinal Autonomous Driving (적응형 되먹임 기반 종방향 자율주행 구동기 고장 탐지 및 허용 제어 알고리즘 개발)

  • Oh, Kwangseok;Lee, Jongmin;Song, Taejun;Oh, Sechan;Yi, Kyongsu
    • Journal of Auto-vehicle Safety Association
    • /
    • v.12 no.4
    • /
    • pp.13-22
    • /
    • 2020
  • This paper presents an adaptive feedback based actuator fault detection and tolerant control algorithms for longitudinal functional safety of autonomous driving. In order to ensure the functional safety of autonomous vehicles, fault detection and tolerant control algorithms are needed for sensors and actuators used for autonomous driving. In this study, adaptive feedback control algorithm to compute the longitudinal acceleration for autonomous driving has been developed based on relationship function using states. The relationship function has been designed using feedback gains and error states for adaptation rule design. The coefficients in the relationship function have been estimated using recursive least square with multiple forgetting factors. The MIT rule has been adopted to design the adaptation rule for feedback gains online. The stability analysis has been conducted based on Lyapunov direct method. The longitudinal acceleration computed by adaptive control algorithm has been compared to the actual acceleration for fault detection of actuators used for longitudinal autonomous driving.

An Improved Two-Terminal Numerical Algorithm of Fault Location Estimation and Arcing Fault Detection for Adaptive AutoReclosure (고속 적응자동재폐로를 위한 사고거리추정 및 사고판별에 관한 개선된 양단자 수치해석 알고리즘)

  • Lee, Chan-Joo;Kim, Hyun-Houng;Park, Jong-Bae;Shin, Joong-Rin;Radoievic, Zoran
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.54 no.11
    • /
    • pp.525-532
    • /
    • 2005
  • This paper presents a new two-terminal numerical algorithm for fault location estimation and for faults recognition using the synchronized phaser in time-domain. The proposed algorithm is also based on the synchronized voltage and current phasor measured from the assumed PMUs(Phasor Measurement Units) installed at both ends of the transmission lines. Also the arc voltage wave shape is modeled numerically on the basis of a great number of arc voltage records obtained by transient recorder. From the calculated arc voltage amplitude it can make a decision whether the fault is permanent or transient. In this paper the algorithm is given and estimated using DFT(discrete Fourier Transform) and the LES(Least Error Squares Method). The algorithm uses a very short data window and enables fast fault detection and classification for real-time transmission line protection. To test the validity of the proposed algorithm, the Electro-Magnetic Transient Program(EMTP/ATP) is used.

Line feature extraction in a noisy image

  • Lee, Joon-Woong;Oh, Hak-Seo;Kweon, In-So
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10a
    • /
    • pp.137-140
    • /
    • 1996
  • Finding line segments in an intensity image has been one of the most fundamental issues in computer vision. In complex scenes, it is hard to detect the locations of point features. Line features are more robust in providing greater positional accuracy. In this paper we present a robust "line features extraction" algorithm which extracts line feature in a single pass without using any assumptions and constraints. Our algorithm consists of five steps: (1) edge scanning, (2) edge normalization, (3) line-blob extraction, (4) line-feature computation, and (5) line linking. By using edge scanning, the computational complexity due to too many edge pixels is drastically reduced. Edge normalization improves the local quantization error induced from the gradient space partitioning and minimizes perturbations on edge orientation. We also analyze the effects of edge processing, and the least squares-based method and the principal axis-based method on the computation of line orientation. We show its efficiency with some real images.al images.

  • PDF