Please use this identifier to cite or link to this item:
|Title:||A rule-based approach for robust clump splitting|
|Authors:||Kumar, S. |
|Citation:||Kumar, S., Ong, S.H., Ranganath, S., Ong, T.C., Chew, F.T. (2006-06). A rule-based approach for robust clump splitting. Pattern Recognition 39 (6) : 1088-1098. ScholarBank@NUS Repository. https://doi.org/10.1016/j.patcog.2005.11.014|
|Abstract:||This paper presents a robust rule-based approach for the splitting of binary clumps that are formed by objects of diverse shapes and sizes. First, the deepest boundary pixels, i.e., the concavity pixels in a clump, are detected using a fast and accurate scheme. Next, concavity-based rules are applied to generate the candidate split lines that join pairs of concavity pixels. A figure of merit is used to determine the best split line from the set of candidate lines. Experimental results show that the proposed approach is robust and accurate. © 2005 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.|
|Source Title:||Pattern Recognition|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Aug 16, 2018
WEB OF SCIENCETM
checked on Jul 30, 2018
checked on Jul 27, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.