About: Fast Mean Shift Algorithm Based on Discretisation and Interpolation

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Fast Mean Shift Algorithm Based on Discretisation and Interpolation Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	A fast mean shift algorithm for processing the image data is presented. Although it is based on the known basic principles of the original mean shift method, it improves the computational speed substantially. It is being assumed that the spatial image coordinates and range coordinates can be discretised by introducing a regular grid. Firstly, the algorithm precomputes the values of shifts at the grid points. The mean shift iterations are then carried out by making use of the grid values and trilinear interpolation. Measured by the order of complexity, the values at all grid points can be precomputed in the time that is equal to the time required, in the original method, for computing only one mean shift iteration for all image points. The interpolation step is computationally inexpensive. The experimental results confirming the theoretical expectations are presented. The use of the step kernel for computing the shifts, and the images with only a single value at each pixel are required. A fast mean shift algorithm for processing the image data is presented. Although it is based on the known basic principles of the original mean shift method, it improves the computational speed substantially. It is being assumed that the spatial image coordinates and range coordinates can be discretised by introducing a regular grid. Firstly, the algorithm precomputes the values of shifts at the grid points. The mean shift iterations are then carried out by making use of the grid values and trilinear interpolation. Measured by the order of complexity, the values at all grid points can be precomputed in the time that is equal to the time required, in the original method, for computing only one mean shift iteration for all image points. The interpolation step is computationally inexpensive. The experimental results confirming the theoretical expectations are presented. The use of the step kernel for computing the shifts, and the images with only a single value at each pixel are required. (en)
Title	Fast Mean Shift Algorithm Based on Discretisation and Interpolation Fast Mean Shift Algorithm Based on Discretisation and Interpolation (en)
skos:prefLabel	Fast Mean Shift Algorithm Based on Discretisation and Interpolation Fast Mean Shift Algorithm Based on Discretisation and Interpolation (en)
skos:notation	RIV/61989100:27240/10:86076024!RIV11-MPO-27240___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(FR-TI1/262)
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Fabián, Tomáš Sojka, Eduard Gaura, Jan Krumnikl, Michal
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola báňská - Technická univerzita Ostrava / Fakulta elektrotechniky a informatiky
http://linked.open...dnocenehoVysledku	258830
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/10:86076024
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	interpolation; discretisation; image segmentation; mean shift (en)
http://linked.open.../riv/klicoveSlovo	image segmentation interpolation mean shift discretisation
http://linked.open...ontrolniKodProRIV	[94E386BCABAF]
http://linked.open...v/mistoKonaniAkce	Sydney
http://linked.open...i/riv/mistoVydani	Berlin Heidelberg
http://linked.open...i/riv/nazevZdroje	ADVANCED CONCEPTS FOR INTELLIGENT VISION SYSTEMS
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	4 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	*Research and development of equipment for marking of long products from metal
http://linked.open...UplatneniVysledku	2010
http://linked.open...iv/tvurceVysledku	Fabián, Tomáš Gaura, Jan Krumnikl, Michal Sojka, Eduard
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open...ain/vavai/riv/wos	000287941400038
http://linked.open.../riv/zahajeniAkce	2010-12-13 (xsd:date)
issn	0302-9743
number of pages	10 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Springer-Verlag. (Berlin; Heidelberg)
https://schema.org/isbn	978-3-642-17687-6
http://localhost/t...ganizacniJednotka	27240
is http://linked.open...avai/riv/vysledek of	Fast Mean Shift Algorithm Based on Discretisation and Interpolation Fast Mean Shift Algorithm Based on Discretisation and Interpolation Fast Mean Shift Algorithm Based on Discretisation and Interpolation

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 116 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software