Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimal Surface Segmentation in Volumetric Images-A Graph-Theoretic Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Cuts and Efficient N-D Image Segmentation
International Journal of Computer Vision
MICCAI '08 Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I
Automatic Detection of Pre-ocular Tear Film Break-Up Sequence in Dry Eyes
DICTA '08 Proceedings of the 2008 Digital Image Computing: Techniques and Applications
Computer Methods and Programs in Biomedicine
Hi-index | 0.00 |
We address the problem of identifying dry areas in the tear film as part of a diagnostic tool for dry-eye syndrome. The requirement is to identify and measure the growth of the dry regions to provide a time-evolving map of degrees of dryness. We segment dry regions using a multi-label graph-cut algorithm on the 3D spatio-temporal volume of frames from a video sequence. To capture the fact that dryness increases over the time of the sequence, we use a time-asymmetric cost function that enforces a constraint that the dryness of each pixel monotonically increases. We demonstrate how this increases our estimation's reliability and robustness. We tested the method on a set of videos and suggest further research using a similar approach.