Extracting Salient Curves from Images: An Analysis of the Saliency Network

Abstract

The Saliency Network proposed by Shashua and Ullman (1988) is a well-known approach to the problem of extracting salient curves from images while performing gap completion. This paper analyzes the Saliency Network. Although the network is attractive for a number reasons, our analysis reveals certain weaknesses with the method. In particular, we show cases in which the most salient element does not lie on the perceptually most salient curve. Furthermore, the saliency measure may change its preferences when curves are scaled uniformly. Also, for certain fragmented curves the measure prefers large gaps over a few small gaps of the same total size. We analyze the time complexity required by the method and discuss problems due to coarse sampling of the range of possible orientations. We show that with proper sampling the complexity of the network becomes cubic in the size of the network. Finally, we consider the possibility of using the Saliency Network for grouping. We show that the Saliency Network recovers the most salient curve efficiently, but it has problems with identifying any salient curve other than the most salient one.