Full metadata record
DC poleHodnotaJazyk
dc.contributor.authorBrun, Luc
dc.contributor.authorDomenger, Jean Phillipe
dc.contributor.editorSkala, Václav
dc.date.accessioned2015-09-23T07:08:26Z
dc.date.available2015-09-23T07:08:26Z
dc.date.issued1997
dc.identifier.citationJournal of WSCG. 1997, vol. 5, no. 1-3, p. 21-30.en
dc.identifier.issn1213-6972 (print)
dc.identifier.issn1213-6980 (CD-ROM)
dc.identifier.issn1213-6964 (online)
dc.identifier.urihttp://hdl.handle.net/11025/15875
dc.identifier.urihttp://wscg.zcu.cz/wscg1997/wscg97.htm
dc.format10 s.cs
dc.format.mimetypeapplication/pdf
dc.language.isoenen
dc.publisherVáclav Skala - UNION Agencycs
dc.relation.ispartofseriesJournal of WSCGen
dc.rights© Václav Skala - UNION Agencycs
dc.subjectsegmentacecs
dc.subjectrozdělovací a slučovací algorithmycs
dc.subjectsamostatné mapycs
dc.titleA new split and merge algorithm based on discrete mapen
dc.typečlánekcs
dc.typearticleen
dc.rights.accessopenAccessen
dc.type.versionpublishedVersionen
dc.description.abstract-translatedUsually, 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.en
dc.subject.translatedsegmentationen
dc.subject.translatedsplit and merge algorithmsen
dc.subject.translateddiscrete mapen
dc.type.statusPeer-revieweden
Vyskytuje se v kolekcích:Volume 5, number 1-3 (1997)

Soubory připojené k záznamu:
Soubor Popis VelikostFormát 
Brun_97.pdfPlný text1,24 MBAdobe PDFZobrazit/otevřít


Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam: http://hdl.handle.net/11025/15875

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.