"Krumnikl, Michal" . "27240" . . "ADVANCED CONCEPTS FOR INTELLIGENT VISION SYSTEMS" . . . "Gaura, Jan" . "Berlin Heidelberg" . . . "4"^^ . "Sojka, Eduard" . . . "interpolation; discretisation; image segmentation; mean shift"@en . . . . "10"^^ . . . "2010-12-13+01:00"^^ . "Fast Mean Shift Algorithm Based on Discretisation and Interpolation" . "4"^^ . "[94E386BCABAF]" . . . . "Fast Mean Shift Algorithm Based on Discretisation and Interpolation" . "Sydney" . "RIV/61989100:27240/10:86076024!RIV11-MPO-27240___" . "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." . . "RIV/61989100:27240/10:86076024" . "978-3-642-17687-6" . "Fabi\u00E1n, Tom\u00E1\u0161" . "000287941400038" . . . "P(FR-TI1/262)" . "0302-9743" . "Fast Mean Shift Algorithm Based on Discretisation and Interpolation"@en . "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 . "Fast Mean Shift Algorithm Based on Discretisation and Interpolation"@en . "258830" . . "Springer-Verlag. (Berlin; Heidelberg)" . .