English
Related papers

Related papers: The Tiny Triplet Finder as a Versatile Track Segme…

200 papers

Multiple object tracking (MOT) is a task in computer vision that aims to detect the position of various objects in videos and to associate them to a unique identity. We propose an approach based on Constraint Programming (CP) whose goal is…

Computer Vision and Pattern Recognition · Computer Science 2022-04-25 Rémi Nahon , Guillaume-Alexandre Bilodeau , Gilles Pesant

In this work, we propose an efficient algorithm for the calculation of the Betti matching, which can be used as a loss function to train topology aware segmentation networks. Betti matching loss builds on techniques from topological data…

Algebraic Topology · Mathematics 2024-07-08 Nico Stucki , Vincent Bürgin , Johannes C. Paetzold , Ulrich Bauer

The minimum network flow algorithm is widely used in multi-target tracking. However, the majority of the present methods concentrate exclusively on minimizing cost functions whose values may not indicate accurate solutions under occlusions.…

Computer Vision and Pattern Recognition · Computer Science 2023-11-07 Huining Li , Yalong Jiang , Xianlin Zeng , Feng Li , Zhipeng Wang

The combinatorics of track seeding has long been a computational bottleneck for triggering and offline computing in High Energy Physics (HEP), and remains so for the HL-LHC. Next-generation pixel sensors will be sufficiently fine-grained to…

This article describes a new charged-particle track fitting algorithm designed for use in high-speed electronics applications such as hardware-based triggers in high-energy physics experiments. Following a novel technique designed for fast…

This paper provides a novel approach to stitching surface images of rotationally symmetric parts. It presents a process pipeline that uses a feature-based stitching approach to create a distortion-free and true-to-life image from a video…

Computer Vision and Pattern Recognition · Computer Science 2021-06-22 Tobias Schlagenhauf , Tim Brander , Juergen Fleischer

Triangle counting is a fundamental building block in graph algorithms. In this paper, we propose a block-based triangle counting algorithm to reduce data movement during both sequential and parallel execution. Our block-based formulation…

Data Structures and Algorithms · Computer Science 2020-09-29 Abdurrahman Yaşar , Sivasankaran Rajamanickam , Jonathan Berry , Ümit V. Çatalyürek

Many simulation applications require the generation of long sequences of pseudo-random numbers. Linear recurrences modulo 2 are commonly used as the fundamental building block for constructing pseudo-random number generators with extended…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-19 Fabio Cannizzo

Achieving tight bounding boxes of a shape while guaranteeing complete boundness is an essential task for efficient geometric operations and unsupervised semantic part detection. But previous methods fail to achieve both full coverage and…

Computer Vision and Pattern Recognition · Computer Science 2023-12-04 Chanhyeok Park , Minhyuk Sung

Tracking in high density environments plays an important role in many physics analyses at the LHC. In such environments, it is possible that two nearly collinear particles contribute to the same hits as they travel through the ATLAS pixel…

High Energy Physics - Experiment · Physics 2019-10-23 Patrick McCormack , Milan Ganai , Ben Nachman , Maurice Garcia-Sciveres

Accurate tree segmentation is a key step in extracting individual tree metrics from forest laser scans, and is essential to understanding ecosystem functions in carbon cycling and beyond. Over the past decade, tree segmentation algorithms…

Computer Vision and Pattern Recognition · Computer Science 2025-09-16 Yihang She , Andrew Blake , David Coomes , Srinivasan Keshav

Lennard-Jones clusters, while an easy system, have a significant number of non equivalent configurations that increases rapidly with the number of atoms in the cluster. Here, we aim at determining the cluster partition function; we use the…

Computational Physics · Physics 2026-02-20 Lune Maillard , Fabio Finocchi , César Godinho , Martino Trassinelli

Many applications rely on time-intensive matrix operations, such as factorization, which can be sped up significantly for large sparse matrices by interpreting the matrix as a sparse graph and computing a node ordering that minimizes the…

Data Structures and Algorithms · Computer Science 2024-04-25 Lara Ost , Christian Schulz , Darren Strash

Phenomenological proposals of searches for new, long-lived particles face a challenge when estimating the reconstruction efficiency of displaced charged-particle tracks. The efficiency depends not only on the charged-particle's momentum…

High Energy Physics - Experiment · Physics 2025-01-03 Emilie Bertholet , Abner Soffer

Motivation: Seed filtering is critical in DNA read mapping, a process where billions of DNA fragments (reads) sampled from a donor are mapped onto a reference genome to identify genomic variants of the donor. Read mappers 1) quickly…

Vision Transformer (ViT)-based sparse multi-view 3D object detectors have achieved remarkable accuracy but still suffer from high inference latency due to heavy token processing. To accelerate these models, token compression has been widely…

Computer Vision and Pattern Recognition · Computer Science 2026-04-17 Mingqian Ji , Shanshan Zhang , Jian Yang

Object detection is a major challenge in computer vision, involving both object classification and object localization within a scene. While deep neural networks have been shown in recent years to yield very powerful techniques for tackling…

Computer Vision and Pattern Recognition · Computer Science 2018-02-20 Alexander Wong , Mohammad Javad Shafiee , Francis Li , Brendan Chwyl

Predicting equipment anomalies before they escalate into failures is a critical challenge in industrial facility management. Existing approaches rely either on hand-crafted threshold rules, which lack generalizability, or on large neural…

Machine Learning · Computer Science 2026-04-08 Takato Yasuno

With the development of technology, the chemical production process is becoming increasingly complex and large-scale, making fault detection particularly important. However, current detective methods struggle to address the complexities of…

Machine Learning · Computer Science 2024-08-13 Ming Lu , Zhen Gao , Ying Zou , Zuguo Chen , Pei Li

Bounded model checking (BMC) and fuzzing techniques are among the most effective methods for detecting errors and security vulnerabilities in software. However, there are still shortcomings in detecting these errors due to the inability of…

Software Engineering · Computer Science 2024-04-19 Kaled M. Alshmrany , Mohannad Aldughaim , Ahmed Bhayat , Lucas C. Cordeiro