Layered mean shift methods
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F13%3A86088520" target="_blank" >RIV/61989100:27240/13:86088520 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-642-38267-3_39" target="_blank" >http://dx.doi.org/10.1007/978-3-642-38267-3_39</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-38267-3_39" target="_blank" >10.1007/978-3-642-38267-3_39</a>
Alternative languages
Result language
angličtina
Original language name
Layered mean shift methods
Original language description
Segmentation is one of the most discussed problems in image processing. Many various methods for image segmentation exist. The mean-shift method is one of them and it was widely developed in recent years and it is still being developed. In this paper, wepropose a new method called Layered Mean Shift that uses multiple mean-shift segmentations with different bandwidths stacked for elimination of the over-segmentation problem and finding the most appropriate segment boundaries. This method effectively reduces the need for the use of large kernels in the mean-shift method. Therefore, it also significantly reduces the computational complexity
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Lecture Notes in Computer Science. Volume 7893
ISBN
978-3-642-38266-6
ISSN
0302-9743
e-ISSN
—
Number of pages
12
Pages from-to
465-476
Publisher name
Springer
Place of publication
Berlin
Event location
Leibnitz
Event date
Jun 2, 2013
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—