Convexity rule for shape decomposition based on discrete contour evolution
Computer Vision and Image Understanding
On Median Graphs: Properties, Algorithms, and Applications
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Distance measures for image segmentation evaluation
EURASIP Journal on Applied Signal Processing
Ensemble Combination for Solving the Parameter Selection Problem in Image Segmentation
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
2D Shape Decomposition Based on Combined Skeleton-Boundary Features
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Approximate convex decomposition of polygons
Computational Geometry: Theory and Applications
A new shape decomposition scheme for graph-based representation
Pattern Recognition
Image segmentation fusion using general ensemble clustering methods
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part IV
A class of generalized median contour problem with exact solution
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Generalized median string computation by means of string embedding in vector spaces
Pattern Recognition Letters
Minimum near-convex decomposition for robust shape representation
ICCV '11 Proceedings of the 2011 International Conference on Computer Vision
Hi-index | 0.00 |
Ensemble techniques have been very successful in pattern recognition. In this work we investigate ensemble solution for shape decomposition. A clustering-based approach is proposed to determine a final decomposition from an ensemble of input decompositions. A recently published performance evaluation framework consisting of a benchmark database with manual ground truth together with evaluation measures is used to demonstrate the benefit of the proposed ensemble technique.