Table of Contents
Fetching ...

On knot detection via picture recognition

Anne Dranowski, Yura Kabkov, Daniel Tubbenhauer

TL;DR

This work tackles automatic knot recognition from images by proposing an image-to-PD-to-invariant pipeline that combines perception via neural networks with topological invariants for robust classification. It advocates a two-stage approach: first predict a knot diagram from a photo, then reconstruct a PD presentation to enable invariant computations such as the Jones polynomial for final labeling. The study provides baselines using a vanilla NN, a CNN, and a CvT architecture to predict knot crossing numbers from skeletonized diagrams, finding that spatial inductive bias improves accuracy (CNN and CvT outperform Vanilla). The authors justify focusing on small-crossing knots due to physical and observational biases and discuss extensions to 3D data and real-world applications in DNA and protein knots, highlighting the practical potential of integrating perception with symbolic topology. Overall, the paper presents a principled, interpretable path toward automated knot recognition that leverages both modern machine learning and classical topological invariants to achieve robust classification in a challenging visual domain.

Abstract

Our goal is to one day take a photo of a knot and have a phone automatically recognize it. In this expository work, we explain a strategy to approximate this goal, using a mixture of modern machine learning methods (in particular convolutional neural networks and transformers for image recognition) and traditional algorithms (to compute quantum invariants like the Jones polynomial). We present simple baselines that predict crossing number directly from images, showing that even lightweight CNN and transformer architectures can recover meaningful structural information. The longer-term aim is to combine these perception modules with symbolic reconstruction into planar diagram (PD) codes, enabling downstream invariant computation for robust knot classification. This two-stage approach highlights the complementarity between machine learning, which handles noisy visual data, and invariants, which enforce rigorous topological distinctions.

On knot detection via picture recognition

TL;DR

This work tackles automatic knot recognition from images by proposing an image-to-PD-to-invariant pipeline that combines perception via neural networks with topological invariants for robust classification. It advocates a two-stage approach: first predict a knot diagram from a photo, then reconstruct a PD presentation to enable invariant computations such as the Jones polynomial for final labeling. The study provides baselines using a vanilla NN, a CNN, and a CvT architecture to predict knot crossing numbers from skeletonized diagrams, finding that spatial inductive bias improves accuracy (CNN and CvT outperform Vanilla). The authors justify focusing on small-crossing knots due to physical and observational biases and discuss extensions to 3D data and real-world applications in DNA and protein knots, highlighting the practical potential of integrating perception with symbolic topology. Overall, the paper presents a principled, interpretable path toward automated knot recognition that leverages both modern machine learning and classical topological invariants to achieve robust classification in a challenging visual domain.

Abstract

Our goal is to one day take a photo of a knot and have a phone automatically recognize it. In this expository work, we explain a strategy to approximate this goal, using a mixture of modern machine learning methods (in particular convolutional neural networks and transformers for image recognition) and traditional algorithms (to compute quantum invariants like the Jones polynomial). We present simple baselines that predict crossing number directly from images, showing that even lightweight CNN and transformer architectures can recover meaningful structural information. The longer-term aim is to combine these perception modules with symbolic reconstruction into planar diagram (PD) codes, enabling downstream invariant computation for robust knot classification. This two-stage approach highlights the complementarity between machine learning, which handles noisy visual data, and invariants, which enforce rigorous topological distinctions.

Paper Structure

This paper contains 30 sections, 1 theorem, 33 equations, 19 figures, 7 tables.

Key Result

Theorem 1

The Jones polynomial detects alternating links with probability zero, and the detection probability decays exponentially with the crossing number.

Figures (19)

  • Figure 1: In knot theory, a knot is a closed loop rather than a strand with free ends, since loose ends could simply be undone. (Some of the knots we discuss, such as protein knots, are not knots in this mathematical sense, but we will ignore the difference.) In \ref{['fig:other']} we have a diagram of the unknot that looks anything but trivial. Pictures from https://en.wikipedia.org/wiki/Trefoil_knot and MR3193721.
  • Figure 2: \ref{['fig:pair1']} shows how a cat can be detected locally, while \ref{['fig:pair2']} shows two knots that look almost identical. Pictures from somewhere (and then marked) and https://en.wikipedia.org/wiki/Kinoshita-Terasaka_knot.
  • Figure 3: The right knot in \ref{['Fig:Trefoil']} is actually not knotted at all. Picture from MR3193721.
  • Figure 4: Top row in \ref{['fig:DNA2']}: microscopy images of DNA knots; middle: human sketches; bottom: matches to known knots as in \ref{['fig:DNA1']}. Wouldn’t it be better to have this automated? Pictures from https://en.wikipedia.org/wiki/Prime_knot and Dean1985.
  • Figure 5: Percentage of unique values.
  • ...and 14 more figures

Theorems & Definitions (12)

  • Remark 1
  • Remark 2
  • Remark 3
  • Remark 4
  • Remark 5
  • Remark 6
  • Remark 7
  • Theorem 1
  • proof
  • Remark 8
  • ...and 2 more