An Efficient Uniform Cost Algorithm Applied to Distance Transforms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Introduction to algorithms
Graphical Models and Image Processing
On digital distance transforms in three dimensions
Computer Vision and Image Understanding
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
On Clustering Validation Techniques
Journal of Intelligent Information Systems
Fuzzy distance transform: theory, algorithms, and applications
Computer Vision and Image Understanding
The Image Foresting Transform: Theory, Algorithms, and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
A decomposition scheme for 3D fuzzy objects based on fuzzy distance information
Pattern Recognition Letters
Image processing system for localising macromolecules in cryo-electron tomography
Machine Graphics & Vision International Journal
Hi-index | 0.00 |
We present a method for calculating fuzzy distances between pairs of points in an image using the A∗ algorithm and, furthermore, apply this method for fuzzy distance based hierarchical clustering. The method is general and can be of use in numerous applications. In our case we intend to use the clustering in an algorithm for delineation of objects corresponding to parts of proteins in 3D images. The image is defined as a fuzzy object and represented as a graph, enabling a path finding approach for distance calculations. The fuzzy distance between two adjacent points is used as edge weight and a heuristic is defined for fuzzy sets. A∗ is applied to the calculation of fuzzy distance between pair of points and hierarchical clustering is used to group the points. The normalised Hubert's statistic is used as validity index to determine the number of clusters. The method is tested on three 2D images; two synthetic images and one fuzzy distance transformed microscopy image of stem cells. All experiments show promising initial results.