mlsanityData to 14 Oct 2026

Anomaly Triplet-Net: Progress Recognition Model Using Deep Metric Learning Considering Occlusion for Manual Assembly Work

arXiv 2501.03533 ↗First posted 7 Jan 2025cs.CVcited by 1

Not on the map. Why?

Abstract (arXiv)

In this paper, a progress recognition method consider occlusion using deep metric learning is proposed to visualize the product assembly process in a factory. First, the target assembly product is detected from images acquired from a fixed-point camera installed in the factory using a deep learning-based object detection method. Next, the detection area is cropped from the image. Finally, by using a classification method based on deep metric learning on the cropped image, the progress of the product assembly work is estimated as a rough progress step. As a specific progress estimation model, we propose an Anomaly Triplet-Net that adds anomaly samples to Triplet Loss for progress estimation considering occlusion. In experiments, an 82.9% success rate is achieved for the progress estimation method using Anomaly Triplet-Net. We also experimented with the practicality of the sequence of detection, cropping, and progression estimation, and confirmed the effectiveness of the overall system.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 7 of its 25 references that are in the map. First posted on arXiv 7 Jan 2025.

Builds on

7 of 25 references.

References · 7

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Microsoft COCO: Common Objects in Contextcited by 17,608
  3. 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,639
  4. 2015Fast R-CNNcited by 2,933
  5. 2013Rich feature hierarchies for accurate object detection and semantic segmentationcited by 2,162
  6. 2014Deep metric learning using Triplet networkcited by 422
  7. 2018Fast Online Object Tracking and Segmentation: A Unifying Approachcited by 272

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.