## Archive for the ‘Algorithms’ Category

## A Tessellation (1-, 2-, 3- unit length edges)

Here’s a neat tiling I saw on the ground recently.

This tiling happens to be a solution that ensures that graph nodes are regularly spaced 1-, 2-, or 3- unit lengths apart.

If we re-orient all of the tiles in the same direction, the nodes then become two unit lengths apart — and the graph becomes homomorphic with a hexagonal tiling.

I’ll let you know if I find an application to the 1-, 2-, 3- hop pattern.

## Fuzzy c-means for greylevel image segmentation

Here’s a script I threw together to do grey-level segmentation using fuzzy c-means. This appeared as a small part of a project in the image processing course I took. The algorithm deployed was really a proof of concept meant to replicate and verify the results of another author — as such, I don’t recommend ever using fuzzy c-means for this task as it’s pretty inefficient. This software will handle any number of grey-level-segments you desire, but I recommend eight as a maximum.

*The code and course project paper are originally dated April 20th, 2011.*

>>> **Download:** FCMProjectPaper.pdf | FCMProject.tgz <<<

( *Requires* pypng — *Python PNG encoder/decoder* )

Here are the examples included in the above archive. I like pictures.

Sunny in 8-bit greyscale, 3-bit greyscale, 2-bit greyscale.

Auryo in 8-bit greyscale, 3-bit greyscale, 2-bit greyscale.

Enjoy 😀