IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/9141735.html
   My bibliography  Save this article

Closed-Form Distance Estimators under Kalman Filtering Framework with Application to Object Tracking

Author

Listed:
  • Vladimir Shin
  • Georgy Shevlyakov
  • Woohyun Jeong
  • Yoonsoo Kim
  • António M. Lopes

Abstract

In this paper, the minimum mean square error (MMSE) estimation problem for calculation of distances between two signals via the Kalman filtering framework is considered. The developed algorithm includes two stages: the Kalman estimate of a state vector computed at the first stage is nonlinearly transformed at the second stage based on a distance function and the MMSE criterion. In general, the most challenging aspect of application of the distance estimator is calculation of the multivariate Gaussian integral. However, it can be successfully overcome for the specific metrics between two points in line, between point and line, between point and plane, and others. In these cases, the MMSE estimator is defined by an analytical closed-form expression. We derive the exact closed-form bilinear and quadratic MMSE estimators that can be effectively applied for calculation of an inner product, squared norm, and Euclidean distance. A novel low-complexity suboptimal estimator for special composite functions of linear, bilinear, and quadratic forms is proposed. Radar range-angle responses are described by the functions. The proposed estimators are validated through a series of experiments using real models and metrics. Experimental results show that the MMSE estimators outperform existing estimators that calculate distance and angle in nonoptimal manner.

Suggested Citation

  • Vladimir Shin & Georgy Shevlyakov & Woohyun Jeong & Yoonsoo Kim & António M. Lopes, 2020. "Closed-Form Distance Estimators under Kalman Filtering Framework with Application to Object Tracking," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-16, August.
  • Handle: RePEc:hin:jnlmpe:9141735
    DOI: 10.1155/2020/9141735
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/9141735.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/9141735.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2020/9141735?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:9141735. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.