Title: A new split and merge algorithm based on discrete map
Authors: Brun, Luc
Domenger, Jean Phillipe
Citation: Journal of WSCG. 1997, vol. 5, no. 1-3, p. 21-30.
Issue Date: 1997
Publisher: Václav Skala - UNION Agency
Document type: článek
URI: http://hdl.handle.net/11025/15875
ISSN: 1213-6972 (print)
1213-6980 (CD-ROM)
1213-6964 (online)
Keywords: segmentace;rozdělovací a slučovací algorithmy;samostatné mapy
Keywords in different language: segmentation;split and merge algorithms;discrete map
Abstract in different language: Usually, the segmentation algorithms implementing the split and merge operations are restricted to a split stage followed by a merge stage. In this paper, we present a new split and merge algorithm combining alternatively split and merge operations at each recursive step. This algorithm is based on a data structure called discrete map [BD96a]. This data structure provides an efficient framework to implement split and merge operations.
Rights: © Václav Skala - UNION Agency
Appears in Collections:Volume 5, number 1-3 (1997)

Files in This Item:
File Description SizeFormat 
Brun_97.pdfPlný text1,24 MBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/15875

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.