|Title:||A probabilistic interpretation of the Saliency Network
|Authors:||Michael Lindenbaum and Alexander Berengolts
|Abstract:||The calculation of salient structures is one of the early and basic ideas of perceptual organization in Computer Vision. Saliency algorithms aim to find image curves, maximizing some deterministic quality measure which grows with the length of the curve, its smoothness, and its continuity. This note proposes a modified saliency estimation mechanism, which is based on probabilistically specified grouping cue and on length estimation. In the context of the proposed method, the well known saliency mechanism, proposed by Shaashua and Ullman may be interpreted as a process trying to detect the curve with maximal expected length. Besides giving a new interpretation and a principled justification to older measures, the proposed saliency mechanism is able to use different grouping cues and thus generalizes the scope of saliency detection to other domains, in a systematic rigorous way.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1999/CIS/CIS9909), rather than to the URL of the PDF or PS files directly. The latter URLs may change without notice.
To the list of the CIS technical reports of 1999
To the main CS technical reports page
Computer science department, Technion