FastMapSVM: Classifying Complex Objects Using the FastMap Algorithm and Support-Vector Machines

• URL: http://arxiv.org/abs/2204.05112v1
• Date: Thu, 7 Apr 2022 18:01:16 GMT
• Title: FastMapSVM: Classifying Complex Objects Using the FastMap Algorithm and Support-Vector Machines
• Authors: Malcolm C. A. White, Kushal Sharma, Ang Li, T. K. Satish Kumar, and Nori Nakata
• Abstract summary: We present FastMapSVM, a novel framework for classifying complex objects. FastMapSVM combines the strengths of FastMap and Support-Map Machines. We show that FastMapSVM's performance is comparable to that of other state-of-the-art methods.
• Score: 12.728875331529345
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Neural Networks and related Deep Learning methods are currently at the leading edge of technologies used for classifying objects. However, they generally demand large amounts of time and data for model training; and their learned models can sometimes be difficult to interpret. In this paper, we present FastMapSVM, a novel interpretable Machine Learning framework for classifying complex objects. FastMapSVM combines the strengths of FastMap and Support-Vector Machines. FastMap is an efficient linear-time algorithm that maps complex objects to points in a Euclidean space, while preserving pairwise non-Euclidean distances between them. We demonstrate the efficiency and effectiveness of FastMapSVM in the context of classifying seismograms. We show that its performance, in terms of precision, recall, and accuracy, is comparable to that of other state-of-the-art methods. However, compared to other methods, FastMapSVM uses significantly smaller amounts of time and data for model training. It also provides a perspicuous visualization of the objects and the classification boundaries between them. We expect FastMapSVM to be viable for classification tasks in many other real-world domains.

Related papers

• A Paradigm Shift in Mouza Map Vectorization: A Human-Machine Collaboration Approach [2.315458677488431]
  Current manual digitization methods are time-consuming and labor-intensive. Our study proposes a semi-automated approach to streamline the digitization process, saving both time and human resources.
  arXiv  Detail & Related papers  (2024-10-21T12:47:36Z)
• MGMapNet: Multi-Granularity Representation Learning for End-to-End Vectorized HD Map Construction [75.93907511203317]
  We propose MGMapNet (Multi-Granularity Map Network) to model map element with a multi-granularity representation. The proposed MGMapNet achieves state-of-the-art performance, surpassing MapTRv2 by 5.3 mAP on nuScenes and 4.4 mAP on Argoverse2 respectively.
  arXiv  Detail & Related papers  (2024-10-10T09:05:23Z)
• DTCLMapper: Dual Temporal Consistent Learning for Vectorized HD Map Construction [20.6143278960295]
  This paper focuses on temporal instance consistency and temporal map consistency learning. DTCLMapper is a dual-stream temporal consistency learning module that combines instance embedding with geometry maps. Experiments on well-recognized benchmarks indicate that the proposed DTCLMapper achieves state-of-the-art performance in vectorized mapping tasks.
  arXiv  Detail & Related papers  (2024-05-09T02:58:55Z)
• Unified Functional Hashing in Automatic Machine Learning [58.77232199682271]
  We show that large efficiency gains can be obtained by employing a fast unified functional hash. Our hash is "functional" in that it identifies equivalent candidates even if they were represented or coded differently. We show dramatic improvements on multiple AutoML domains, including neural architecture search and algorithm discovery.
  arXiv  Detail & Related papers  (2023-02-10T18:50:37Z)
• MapTR: Structured Modeling and Learning for Online Vectorized HD Map Construction [33.30177029735497]
  MapTR is a structured end-to-end framework for efficient online vectorized HD map construction. MapTR achieves the best performance and efficiency among existing vectorized map construction approaches.
  arXiv  Detail & Related papers  (2022-08-30T17:55:59Z)
• Sparse Instance Activation for Real-Time Instance Segmentation [72.23597664935684]
  We propose a conceptually novel, efficient, and fully convolutional framework for real-time instance segmentation. SparseInst has extremely fast inference speed and achieves 40 FPS and 37.9 AP on the COCO benchmark.
  arXiv  Detail & Related papers  (2022-03-24T03:15:39Z)
• Region Comparison Network for Interpretable Few-shot Image Classification [97.97902360117368]
  Few-shot image classification has been proposed to effectively use only a limited number of labeled examples to train models for new classes. We propose a metric learning based method named Region Comparison Network (RCN), which is able to reveal how few-shot learning works. We also present a new way to generalize the interpretability from the level of tasks to categories.
  arXiv  Detail & Related papers  (2020-09-08T07:29:05Z)
• Multi-scale Interaction for Real-time LiDAR Data Segmentation on an Embedded Platform [62.91011959772665]
  Real-time semantic segmentation of LiDAR data is crucial for autonomously driving vehicles. Current approaches that operate directly on the point cloud use complex spatial aggregation operations. We propose a projection-based method, called Multi-scale Interaction Network (MINet), which is very efficient and accurate.
  arXiv  Detail & Related papers  (2020-08-20T19:06:11Z)
• Embedding Directed Graphs in Potential Fields Using FastMap-D [24.525270899573734]
  We present FastMap-D, an efficient generalization of FastMap to directed graphs. FastMap-D embeds vertices using a potential field to capture the asymmetry between the pairwise distances in directed graphs. In experiments on various kinds of directed graphs, we demonstrate the advantage of FastMap-D over other approaches.
  arXiv  Detail & Related papers  (2020-06-04T19:50:04Z)
• Real-Time High-Performance Semantic Image Segmentation of Urban Street Scenes [98.65457534223539]
  We propose a real-time high-performance DCNN-based method for robust semantic segmentation of urban street scenes. The proposed method achieves the accuracy of 73.6% and 68.0% mean Intersection over Union (mIoU) with the inference speed of 51.0 fps and 39.3 fps.
  arXiv  Detail & Related papers  (2020-03-11T08:45:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.