Abstract

A systematic design procedure is used to develop Laplacian operators that facilitate the computation of hexagonal feature map pyramids. Our focus is the development of algorithms that can operate on hexagonal images over a range of scales. We show how scalable operators can be explicitly constructed using a Gaussian neighbourhood function. We extend this approach to achieve an efficient approximation via a feature map pyramid that implicitly embodies operator scaling. In both cases we provide performance evaluation with respect to edge localisation.