| 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 article |
| URI: | http://hdl.handle.net/11025/15875 http://wscg.zcu.cz/wscg1997/wscg97.htm |
| 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 | Size | Format | |
|---|---|---|---|---|
| Brun_97.pdf | Plný text | 1,24 MB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/15875Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.