Fast Mean Shift Algorithm Based on Discretisation and Interpolation

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F10%3A86076024" target="_blank" >RIV/61989100:27240/10:86076024 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Fast Mean Shift Algorithm Based on Discretisation and Interpolation
Original language 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 interpolationstep 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.
Czech name
—
Czech description
—

Project
<a href="/en/project/FR-TI1%2F262" target="_blank" >FR-TI1/262: *Research and development of equipment for marking of long products from metal</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)