arXiv Computer Vision

Adaptive Dual-Constrained Line Aggregation for Cross-Paradigm Line Segment Detection

The paper introduces Adaptive Dual-Constrained Line Aggregation (ADLA), a framework that extracts line segments across multiple detection paradigms by aggregating pixels from an edge strength map under orientation coherence and bounded orthogonal distance constraints. ADLA dynamically updates line centroids and orientations, incorporates edge strength into various stages, and reduces parameter tuning. Experiments on generic, wireframe, and Manhattan line segment datasets show strong performance, achieving F^H scores of 0.8665, 0.8720, and 0.7297 respectively.

arXiv Computer Vision
Sep 23

NPLSD: Accelerating Line-Segment Detection on NPU Microcontrollers

The paper introduces NPLSD, a pair of line‑segment detectors optimized for the Neural‑ART NPU on STM32N6 microcontrollers. NPLSD‑H retains a convolutional backbone and replaces transformer components with a fully‑convolutional head, while NPLSD‑M adapts a lightweight trunk to the NPU’s supported operators. Trained on ImageNet and ShanghaiTech Wireframe, the models achieve competitive accuracy with 2.63 M and 0.62 M parameters, respectively, and ablation studies show initialization contributes significantly to performance.

By Parsa Hassani Shariat Panahi, Amir Hossein Jalilvand, M. Hassan Najafi
arXiv Computer Vision
Sep 21

ALINA: Advanced Line Identification and Notation Algorithm

arXiv:2406.08775v2 Announce Type: replace Abstract: Labels are the cornerstone of supervised machine learning algorithms. Most visual recognition methods are fully supervised, using bounding boxes or...

By Mohammed Abdul Hafeez Khan, Parth Ganeriwala, Siddhartha Bhattacharyya, Natasha Neogi, Raja Muthalagu
arXiv Computer Vision
Oct 12

A Real-World CAD Segmentation Benchmark: Comparing Rule-Based and Learning-Based Approaches through Hole Detection

The paper introduces a real‑world CAD segmentation benchmark focused on fastener‑relevant hole detection, a task that demands human annotation and presents higher geometric complexity than typical synthetic datasets. It presents two rule‑based methods—a graph‑wire‑search and a multi‑view approach—and trains learning‑based models (UV‑Net and AAGNet) on a newly annotated engineering CAD dataset. Extensive experiments evaluate parameter tuning, cross‑domain generalisation, and performance across dataset sizes and IoU thresholds, revealing that rule‑based methods generalise without training data while learning‑based methods excel with sufficient annotations but are less robust to domain shift. "whyItMatters":"The study provides a realistic benchmark and actionable insights into the trade‑offs between data requirements and robustness for CAD segmentation, informing future research and practical applications in engineering tasks."

By Kai Sch\"utte, Edgar Heinert, Matthias Rottmann