## An Algorithm for Computing the Approximate IoU Between Oriented 2D boxes

This post shows an *approximation method to compute the IoU between oriented 2D boxes*.

Number-Smithy

A Blog of Programming, Algorithms and Software Tools

Number-Smithy

A Blog of Programming, Algorithms and Software Tools

This post shows an *approximation method to compute the IoU between oriented 2D boxes*.

I implemented in Python an algorithm that fits the distribution of the sum of independent Gamma random variables.

In this post we are going to work out a vectorized Mann-Kendall trend test implementation using numpy and scipy.

This post covers the derivations of back-propagation in a convolution layer, with numpy implementations.

This post shares a Python implementation to compute the Silhouette Values in a clustering analysis.

The Ramer-Douglas-Peucker (RDP) algorithm is a curve simplification method. To apply it on coordinates defined by latitudes/longitudes, we need to replace the Cartesian geometry with a spherical one.

Peak prominence can be used to identify relatively organized regional maxima while filtering out local disturbances.