A Shock Grammar for Recognition
Abstract
We confront the theoretical and practical difficulties of computing a representation for two-dimensional shape, based on shocks or singularities that arise as the shape's boundary is deformed. First, we develop subpixel local detectors for finding and classifying shocks. Second, to show that shock patterns are not arbitrary but obey the rules of a grammar, and in addition satisfy specific topological and geometric constraints. Shock hypotheses that violate the grammar or are topologically or geometrically invalid are pruned to enforce global consistency. Survivors are organized into a hierarchical graph of shock groups computed in the reaction-diffusion space, where diffusion plays a role of regularization to determine the significance of each shock group. The shock groups can be functionally related to the object's parts, protrusions and bends, and the representation is suited to recognition: several examples illustrate its stability with rotations, scale changes, occlusion and movement of parts, even at very low resolutions.
Cite
Text
Siddiqi and Kimia. "A Shock Grammar for Recognition." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1996. doi:10.1109/CVPR.1996.517119Markdown
[Siddiqi and Kimia. "A Shock Grammar for Recognition." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1996.](https://mlanthology.org/cvpr/1996/siddiqi1996cvpr-shock/) doi:10.1109/CVPR.1996.517119BibTeX
@inproceedings{siddiqi1996cvpr-shock,
title = {{A Shock Grammar for Recognition}},
author = {Siddiqi, Kaleem and Kimia, Benjamin B.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {1996},
pages = {507-513},
doi = {10.1109/CVPR.1996.517119},
url = {https://mlanthology.org/cvpr/1996/siddiqi1996cvpr-shock/}
}