| Attributes | Values |
|---|
| rdf:type
| |
| rdfs:seeAlso
| |
| 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 from over-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 terms, e.g., the term requiring a short length of boundaries between the segments or the term requiring the flatness (in intensity) of the corresponding filtered image are not present, which explains the behaviour of mean shift. On the basis of this knowledge, we solve the problems with mean shift by modifying the functional. We show how the new functional can be maximised in practice, and we also show that the usual mean-shift algorithm can be regarded as a special case of the method we propose. The experimental results are also presented.
- 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 from over-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 terms, e.g., the term requiring a short length of boundaries between the segments or the term requiring the flatness (in intensity) of the corresponding filtered image are not present, which explains the behaviour of mean shift. On the basis of this knowledge, we solve the problems with mean shift by modifying the functional. We show how the new functional can be maximised in practice, and we also show that the usual mean-shift algorithm can be regarded as a special case of the method we propose. The experimental results are also presented. (en)
|
| Title
| - Mean shift with flatness constraints
- Mean shift with flatness constraints (en)
|
| skos:prefLabel
| - Mean shift with flatness constraints
- Mean shift with flatness constraints (en)
|
| skos:notation
| - RIV/61989100:27240/13:86088922!RIV14-MSM-27240___
|
| http://linked.open...avai/predkladatel
| |
| http://linked.open...avai/riv/aktivita
| |
| http://linked.open...avai/riv/aktivity
| |
| http://linked.open...vai/riv/dodaniDat
| |
| http://linked.open...aciTvurceVysledku
| |
| http://linked.open.../riv/druhVysledku
| |
| http://linked.open...iv/duvernostUdaju
| |
| http://linked.open...titaPredkladatele
| |
| http://linked.open...dnocenehoVysledku
| |
| http://linked.open...ai/riv/idVysledku
| - RIV/61989100:27240/13:86088922
|
| http://linked.open...riv/jazykVysledku
| |
| http://linked.open.../riv/klicovaSlova
| - mean-shift image segmentation; mean-shift image filtering (en)
|
| http://linked.open.../riv/klicoveSlovo
| |
| http://linked.open...ontrolniKodProRIV
| |
| http://linked.open...v/mistoKonaniAkce
| |
| http://linked.open...i/riv/mistoVydani
| |
| http://linked.open...i/riv/nazevZdroje
| - Lecture Notes in Computer Science. Volume 7944
|
| http://linked.open...in/vavai/riv/obor
| |
| http://linked.open...ichTvurcuVysledku
| |
| http://linked.open...cetTvurcuVysledku
| |
| http://linked.open...UplatneniVysledku
| |
| http://linked.open...iv/tvurceVysledku
| - Gaura, Jan
- Sojka, Eduard
- Šurkala, Milan
|
| http://linked.open...vavai/riv/typAkce
| |
| http://linked.open.../riv/zahajeniAkce
| |
| issn
| |
| number of pages
| |
| http://bibframe.org/vocab/doi
| - 10.1007/978-3-642-38886-6_11
|
| http://purl.org/ne...btex#hasPublisher
| |
| https://schema.org/isbn
| |
| http://localhost/t...ganizacniJednotka
| |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)