Sökning: "Euclidean distance fields"

Hittade 5 uppsatser innehållade orden Euclidean distance fields.

  1. 1. Machine Learning-based MIMO Indoor Positioning

    Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknik

    Författare :Qiyi Chen; [2023]
    Nyckelord :Technology and Engineering;

    Sammanfattning : The most widely used positioning system is Global Navigation Satellite System (GNSS), which uses traditional positioning techniques and cannot achieve satisfactory positioning performance in indoor scenarios due to Non-Line-of-Sight (NLoS) transmission. Fingerprinting is a non-traditional positioning technique that is robust to NLoS transmission in indoor scenarios. LÄS MER

  3. 2. Real-Time Continuous Euclidean Distance Fields for Large Indoor Environments

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Erik Warberg; [2023]
    Nyckelord :Room segmentation; Gaussian processes; Euclidean distance fields; mapping; line segment detection; mobile robots; spectral clustering; Rumssegmentering; Gaussiska processer; Euklidiska avståndsfält; kartläggning; detektering av linjesegment; mobila robotar; spektral klustring;

    Sammanfattning : Real-time spatial awareness is essential in areas such as robotics and autonomous navigation. However, as environments expand and become increasingly complex, maintaining both a low computational load and high mapping accuracy remains a significant challenge. LÄS MER

  4. 3. Effect of distance measures and feature representations on distance-based accessibility measures

    Master-uppsats, Lunds universitet/Institutionen för naturgeografi och ekosystemvetenskap

    Författare :Jeremy Azzopardi; [2018]
    Nyckelord :geography; GIS; Bland-Altman; Euclidean distance; geographic accessibility; network distance; recreational area; Earth and Environmental Sciences;

    Sammanfattning : Distance-based accessibility measures are often built using vector representations of origin and destination features, and Euclidean or network-based distances. There are few comparisons of how the choice of feature representations and distance types affects results. Existing comparisons often use Spearman’s rank correlation coefficients. LÄS MER

  5. 4. An extended BIRCH-based clustering algorithm for large time-series datasets

    Master-uppsats, Mittuniversitetet/Avdelningen för informations- och kommunikationssystem

    Författare :Jiahuan Lei; [2017]
    Nyckelord :Time series; Data stream; Clustering; BIRCH; DTW; DBA.;

    Sammanfattning : Temporal data analysis and mining has attracted substantial interest due to theproliferation and ubiquity of time series in many fields. Time series clustering isone of the most popular mining methods, and many time series clustering algorithmsprimarily focus on detecting the clusters in a batch fashion that will use alot of memory space and thus limit the scalability and capability for large timeseries. LÄS MER

  7. 5. Comparison of A*, Euclidean and Manhattan distance using Influence map in MS. Pac-Man

    Master-uppsats, Blekinge Tekniska Högskola/Institutionen för datalogi och datorsystemteknik

    Författare :Hari Sagar Ranjitkar; Sudip Karki; [2016]
    Nyckelord :Ms. Pac-Man; algorithm; influence maps; potential fields; distance measure; A*; Euclidean; Manhattan; optimal parameter space;

    Sammanfattning : Context An influence map and potential fields are used for finding path in domain of Robotics and Gaming in AI. Various distance measures can be used to find influence maps and potential fields. However, these distance measures have not been compared yet. LÄS MER