|
It includes a couple of algorithms implemented in C++ for speed while operating in numpy arrays.
The main algorithms are Otsu thresholding and watershed.
Here are some key features of "Mahotas":
Algorithms used:
· Watershed.
· Thresholding.
· Convolution.
· Sobel edge detection.
· Convex points calculations.
· Hit & miss. thinning.
· Zernike & Haralick, LBP, and TAS features.
· Freeimage based numpy image loading (requires freeimage libraries to be installed).
· Speeded-Up Robust Features (SURF), a form of local features.
What's New in This Release: [ read full changelog ]
· Python 3 support (you need to use ``2to3``).
· Haar wavelets (forward and inverse transform).
· Daubechies wavelets (forward and inverse transform).
· Corner case fix in Otsu thresholding.
· Add soft_threshold function.
· Have polygon.convexhull return an ndarray (instead of a list).
· Memory usage improvements in regmin/regmax/close_holes.
Via: Mahotas 0.9.1
0 Comment:
Post a Comment