Mathematical Morphology module for PyTorch (CUDA), providing differentiable operators and learnable network layers.
This is an uv workspace:
packages/serron- the published kernel package (README).benchmarks- throughput and cross-library benchmarks (results).
One prebuilt wheel per platform covers every supported interpreter, on Linux (x86_64, aarch64) and Windows (x86_64).
pip install serronThe kernels are built against PyTorch's stable C++ ABI, so a wheel loads on torch 2.13 and
every later release (torch>=2.13) rather than only the minor it was compiled against. The
wheel carries no CPython tag either, because the compiled libraries use no CPython API.
Wheels load on both CUDA and CPU-only torch builds; the CUDA kernels are only loaded when the installed torch has CUDA. The CUDA kernels work with a torch built against CUDA 12 or CUDA 13: they bind to the NVIDIA driver at runtime rather than linking a CUDA runtime, so the only requirement is a driver supporting CUDA 12.0 or newer (R525 / 525.60.13 on Linux, 528.33 on Windows).
Serron works on standard PyTorch tensors laid out as (N, C, H, W) and living on a CUDA
or CPU device.
Stateless operators live in serron.functional and are re-exported at the top level.
Each takes an input tensor, a structuring element, and an optional border mode:
import torch
import serron
from serron import BorderMode
from serron import structuring_element as se
x = torch.rand(1, 1, 256, 256, device="cuda")
kernel = se.disk(3, device="cuda")
eroded = serron.erosion(x, kernel)
dilated = serron.dilation(x, kernel)
opened = serron.opening(x, kernel)
closed = serron.closing(x, kernel)
# Derived operators
grad = serron.gradient(x, kernel) # dilate(x) - erode(x)
white = serron.top_hat(x, kernel) # x - open(x)
black = serron.black_hat(x, kernel) # close(x) - x
# Control border handling
eroded_reflect = serron.erosion(x, kernel, border=BorderMode.REFLECT)Available operators: erosion, dilation, opening, closing, gradient,
top_hat, black_hat, reconstruction_by_dilation, reconstruction_by_erosion.
reconstruction_by_dilation floods a marker outwards until it settles, held down by a
mask at every step; reconstruction_by_erosion is its dual. Both iterate the compiled
erode / dilate ops to a fixed point and default to BorderMode.CONSTANT, which is the
geodesic reading of the image boundary.
marker = torch.zeros_like(x)
marker[..., 128, 128] = x[..., 128, 128]
with torch.no_grad(): # no backward pass yet
flooded = serron.reconstruction_by_dilation(marker, x, se.cross(3, device="cuda"))The loop runs on the device, but its convergence test reads one flag back to the host every
check_every steps (16 by default). Raise it to trade a few wasted steps for fewer syncs.
serron.structuring_element builds common SE shapes on the requested device:
from serron import structuring_element as se
se.square(5, device="cuda") # (5, 5) full square
se.cross(5, device="cuda") # (5, 5) plus shape
se.disk(3, device="cuda") # (7, 7) disk, radius 3
se.diamond(3, device="cuda") # (7, 7) diamond, radius 3
se.from_tensor(my_weights) # wrap an arbitrary 2-D tensor as a grayscale SEBorderMode controls how out-of-bounds neighbors are handled:
| Mode | Behavior |
|---|---|
BorderMode.REPLICATE |
Repeat the edge value (default) |
BorderMode.REFLECT |
Mirror across the edge |
BorderMode.CONSTANT |
Pad with a constant |
serron also exposes torch.nn.Module layers with a learnable structuring element,
so morphology can be trained end-to-end inside a network. Each layer takes the number
of channels and a kernel_size:
import torch
from serron import Erosion2d, Dilation2d, Opening2d, Closing2d
from serron import BorderMode
layer = Erosion2d(channels=3, kernel_size=5, border=BorderMode.REPLICATE).cuda()
x = torch.rand(8, 3, 64, 64, device="cuda")
y = layer(x) # forward pass; layer.weight is a trainable (C, k, k) SE
y.sum().backward() # gradients flow into layer.weightAvailable layers: Erosion2d, Dilation2d, Opening2d, Closing2d.
Every operator picks one of a few kernels at call time. The structuring element and the device's shared memory decide which one.
| Path | Runs when | Cost per output |
|---|---|---|
| Separable van Herk–Gil–Werman | Flat SE and max(kH, kW) >= SERRON_SEPARABLE_MIN_K |
O(1) in the window length |
| Tiled 2-D | Otherwise, when the halo tile and the SE fit in shared memory | O(kH × kW) |
| Element-wise | Otherwise; reads through global memory (CUDA only) | O(kH × kW) |
SERRON_SEPARABLE_MIN_K is the window length where the separable path takes over. It
accepts any positive integer. The default differs per backend because it marks where the
separable path starts beating the 2-D one, and that point is not the same on both: 11 on
CUDA, 5 on CPU, where there is no tiled 2-D kernel to soften the kH × kW window.
Splitting a flat kH × kW window into a 1 × kW row pass and a kH × 1 column pass
already drops the per-pixel work from kH × kW to kH + kW, and the Van Herk–Gil–Werman algorithm
drops it further to a constant three operations per ouput, no matter the sequence length.
On CUDA both scans sit in shared memory. A chunk at least a warp wide gets a warp to
itself and the lanes cooperate through shuffles; anything shorter gets a single thread.
On CPU the lines go through at::parallel_for.
Backward needs to know where the winning sample was, not just what it was, so its scans
carry a (value, offset) pair rather than a bare value. Combining two of those keeps the
lower offset on a tie, which is the rule the direct kernel gets from its strict-improvement
loop — reproducing it exactly is what makes the two paths agree on which tap receives the
gradient. The window is one pair-combine as before, so the search is O(1) in the window
length on both the row and the column pass.
It splits on the same condition: a separable row and column argreduce for a flat SE at or above the threshold, and a direct recompute of the winning tap otherwise. The direct recompute stages its window in shared memory the same way the forward's tiled path does.
Per-operator throughput and the cross-library comparison live in
benchmarks/README.md.
Erosion with a flat SE, 8x3x512x512 float32 on an H100 PCIe (with Intel Xeon Platinum 8480+), in milliseconds:
| k | serron | PyTorch | Kornia | CuPy | SciPy (CPU) |
|---|---|---|---|---|---|
| 7 | 0.30 | 0.42 | 2.80 | 0.20 | 159 |
| 31 | 0.23 | 5.46 | 41.87 | 0.58 | 151 |
| 63 | 0.31 | 21.48 | OOM | 1.05 | 144 |
| 127 | 0.25 | 81.03 | OOM | 2.00 | 142 |
git clone git@github.com:vhrabar/serron.git
cd serrontorch is pulled from a specific wheel index via mutually-exclusive dependency groups,
one per backend and end of the supported range: cu132 / cpu at the oldest torch the
kernels target, cu132-newest / cpu-newest at the current release. cu132-newest is
enabled by default, so plain uv sync gives the CUDA 13.2 build against the newest torch.
Because the groups conflict, selecting another one means turning the default off, which
--no-default-groups does in one step:
uv sync # CUDA, newest torch
uv sync --no-default-groups --group dev --group cpu-newest # CPU-only, newest torch
uv sync --no-default-groups --group dev --group cu132 # CUDA, oldest supported torch
uv sync --no-default-groups --group dev --group cpu # CPU-only, oldest supported torchOn Windows on ARM, the cu134-win-arm64 group pulls NVIDIA's +cu134 torch wheels from
https://pypi.nvidia.com/nvtorch_oot/.
uv sync --no-default-groups --group dev --group cu134-win-arm64 # Windows on ARM, CUDA 13.4Building the CUDA extension from source needs a CUDA toolkit (nvcc and cuda.h), 12.8 or newer for the
default architecture list. The toolkit only matters at build time: the result runs next to a CUDA 12 or
CUDA 13 torch either way, but it sets the minimum driver (any 12.x toolkit: R525; a 13.x toolkit: R580).
The release wheels are built with CUDA 12.9:
uv sync --no-install-workspace
uv build --package serron --wheel --no-build-isolationOn a GPU-less machine, sync the CPU torch build instead; the extension then builds
C++ only (no nvcc required):
uv sync --no-install-workspace --no-default-groups --group dev --group cpu-newest
uv build --package serron --wheel --no-build-isolationReleased under the MIT License. See LICENSE.
Copyright © 2026 Vedran Hrabar