Mean shift with flatness constraints

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F13%3A86088922" target="_blank" >RIV/61989100:27240/13:86088922 - isvavai.cz</a>
Result on the web
<a href="http://link.springer.com/chapter/10.1007%2F978-3-642-38886-6_11#page-1" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-642-38886-6_11#page-1</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-642-38886-6_11" target="_blank" >10.1007/978-3-642-38886-6_11</a>

Result language
angličtina
Original language name
Mean shift with flatness constraints
Original language description
Mean shift still belongs to the intensively developed image-segmentation methods. Appropriately setting so called bandwidth, which is richly discussed in literature, seems to be one of its problems. If the bandwidth is too small, the results suffer fromover-segmentation. If it is too big, the edges need not be preserved sufficiently and the details can be lost. In this paper, we address the problem of over-segmentation and preserving the edges in mean shift too. However, we do not aim at proposing a further method for determining the bandwidth. Instead, we modify the mean-shift method itself. We show that the problems with over-segmentation are inherent for mean shift and follow from its theoretical essence. We also show that the mean-shift process can be seen as a process of solving a certain Euler-Lagrange equation and as a process of maximising a certain functional. In contrast with other known functional approaches, however, only the fidelity term is present in it. Other usual ter
Czech name
—
Czech description
—

Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)