|Title:||On the Performance of Connected Components Grouping
|Authors:||Alexander Berengolts and Michael Lindenbaum
|Abstract:||Grouping processes may benefit, computationally, from using simple algorithms as part of the grouping process. In this paper we consider an extremely fast grouping process, based on the common connected components algorithm, and focus on analyzing it performance. We take an analytic approach, and, relying on a probabilistic model, show that the connected components approach leads to predictable results. In particular, we derive the expected number of addition errors and the group fragmentation rate. We show that these performance figures depend on a few inherent and intuitive parameters. Furthermore, we show that the grouping process may be controlled so that the performance may be chosen within a given tradeoff. The analytic results are supported by implementing the algorithm and testing it on synthetic and real images.|
|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/CIS9905), 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