Topographic distance and watershed lines
Signal Processing - Special issue on mathematical morphology and its applications to signal processing
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Detection of Critical Structures in Scale Space
SCALE-SPACE '99 Proceedings of the Second International Conference on Scale-Space Theories in Computer Vision
An Optimization Approach to Unsupervised Hierarchical Texture Segmentation
ICIP '97 Proceedings of the 1997 International Conference on Image Processing (ICIP '97) 3-Volume Set-Volume 3 - Volume 3
Texture Segmentation by Multiscale Aggregation of Filter Responses and Shape Elements
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Graph Partition by Swendsen-Wang Cuts
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Multiclass Spectral Clustering
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
Segmentation Given Partial Grouping Constraints
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Graph-Based Image Segmentation
International Journal of Computer Vision
Segmentation Induced by Scale Invariance
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Spectral Segmentation with Multiscale Graph Decomposition
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
| Hi-index | 0.00 |
Extracting numerous cells in a large microscopic image is often required in medical research. The challenge is to reduce the segmentation complexity on a large image without losing the fine segmentation granularity of small structures. We propose a constrained spectral graph partitioning approach where the segmentation of the entire image is obtained from a set of patch segmentations, independently derived but subject to stitching constraints between neighboring patches. The constraints come from mutual agreement analysis on patch segmentations from a previous round. Our experimental results demonstrate that the constrained segmentation not only stitches solutions seamlessly along overlapping patch borders but also refines the segmentation in the patch interiors.