An investigation of least squares based methods for source localization from time difference of arrival measurements Variş Zaman Farki Ölçümleri ile Kaynak Konumlandirmada En Küçük Kareler Temelli Yötemlerin İncelenmesi

Date

2017-06-27

Author

Celenk, Nusret
Candan, Çağatay

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

74
views

0
downloads

The least squares based methods for source localization from time difference of arrival (TDOA) measurements are investigated. Also, the weighted least squares based version of an existing method is proposed. The proposed method and the existing ones in the literature are compared in terms of the performance under several source and sensors position scenarios and different noise levels.

Subject Keywords

TDOA, Source localization

URI

https://hdl.handle.net/11511/39582

DOI

https://doi.org/10.1109/siu.2017.7960272

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

An observational study of the precedence effect Hacıhabiboğlu, Hüseyin (2006-05-01) This paper proposes a framework model for the analysis of sound source localisation under the precedence effect using Gaussian mixtures. The model quantifies the effect of the lagging sound over the angular position and the width of the perceived auditory event, and incorporates some well-known aspects of the precedence effect in a single framework. Two sound source localisation experiments were carried out in order to show the utility of the proposed model. In the first experiment, the localisation accurac...
An algorithm for line matching in an image by mapping into an n-dimensional vector space Sultanov, Raiymbek; Atakan, Ahmet; Ismailova, Rita (2019-01-01) This paper proposes a minimal length difference algorithm for construction of a line in an image by solving the problem of optimal contour approximation. In this algorithm, a method for finding interest points is proposed, and the object matching (classification) is done by mapping interest points onto a vector space. In cases where the lines in the representation of the images are not smooth, the algorithm converges rapidly. The results of the experiments showed that for convergence of the contour simplifi...
A Recurrent and Meta-learned Model of Weakly Supervised Object Localization Sariyildiz, Mert Bulent; Sumbul, Gencer; Cinbiş, Ramazan Gökberk (2022-01-01) The object localization and detection has improved greatly over the past decade, thanks to developments in deep learning based representations and localization models. However, a major bottleneck remains at the reliance on fully-supervised datasets, which can be difficult to gather in many real-world scenarios. In this work, we focus on the problem of weakly-supervised localization, where the goal is to localize instances of objects based on simple image-level class annotations. In particular, instead of en...
A survey on quaternary codes and their binary images Özkaya, Derya; Yücel, Melek D; Department of Cryptography (2009) Certain nonlinear binary codes having at least twice as many codewords as any known linear binary code can be regarded as the binary images of linear codes over Z4. This vision leads to a new concept in coding theory, called the Z4-linearity of binary codes. This thesis is a survey on the linear quaternary codes and their binary images under the Gray map. The conditions for the binary image of a linear quaternary code to be linear are thoroughly investigated and the Z4-linearity of the Reed-Muller and Hammi...
A study on the set choice of multiple factor graph belief propagation decoders for polar codes Akdoğan, Şükrü Can; Diker Yücel, Melek; Department of Electrical and Electronics Engineering (2018) Polar codes are linear block codes with low encoding and decoding complexity that are proven to achieve the channel capacity for any given binary-input discrete memoryless channel as the codeword length {u1D441} goes to infinity. The main idea of polar codes is about channel polarization. Special factor graphs are used to represent the encoding and decoding structure of polar codes. These factor graphs consist of {u1D45B} stages for ({u1D441},{u1D43E}) codes, where {u1D45B} = {u1D459}{u1D45C}{u1D454}2{u1D44...

Citation Formats

N. Celenk and Ç. Candan, “An investigation of least squares based methods for source localization from time difference of arrival measurements Variş Zaman Farki Ölçümleri ile Kaynak Konumlandirmada En Küçük Kareler Temelli Yötemlerin İncelenmesi,” 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/39582.