Structural Correspondence as a Contour Grouping Problem
Abstract
We present a novel viewpoint which approaches the structural correspondence across an image stack in the 3D space as solving a contour grouping problem. Finding 3D cellular tubes becomes finding closed contours. We derive grouping cues between cells in adjacent slices based on their ability to relate in the 3D space. Those that form a long 3D tube in the space become the most salient contour, while those of shorter lengths become less salient. In the spectral graph-theoretical framework for contour grouping, such a separation by the contour length is reflected in complex eigenvectors of different magnitudes, from which these 3D tubes of varying lengths can thus be extracted, obviating the need for identifying missing correspondences.
Cite
Text
Bernardis and Yu. "Structural Correspondence as a Contour Grouping Problem." IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, 2010. doi:10.1109/CVPRW.2010.5543585Markdown
[Bernardis and Yu. "Structural Correspondence as a Contour Grouping Problem." IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, 2010.](https://mlanthology.org/cvprw/2010/bernardis2010cvprw-structural/) doi:10.1109/CVPRW.2010.5543585BibTeX
@inproceedings{bernardis2010cvprw-structural,
title = {{Structural Correspondence as a Contour Grouping Problem}},
author = {Bernardis, Elena and Yu, Stella X.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops},
year = {2010},
pages = {194-199},
doi = {10.1109/CVPRW.2010.5543585},
url = {https://mlanthology.org/cvprw/2010/bernardis2010cvprw-structural/}
}