|
| |
|
|
Nový algoritmus hledání cesty pro sešívání obrazů a pokročilé dlaždicování textur
Somol, Petr ; Haindl, Michal
We propose a fast and adjustable sub-optimal path search algorithm for finding minimum error boundaries between overlapping images. The algorithm may serve as an alternative to traditional slow path search algorithms like the dynamical programming. We use the algorithm in combination with novel adaptive blending to stitch image regions. The technique is then exploited in a framework for sampling-based texture synthesis where the learning phase is clearly separated and the synthesis phase is very simple.
|
|
|
Váleček - rychlá metoda syntézy textur založená na vzorkování
Haindl, Michal ; Hatka, M.
This paper describes a method for synthesizing natural textures that realistically matches given colour texture appearance. The novel texture synthesis method, which we call the roller, is based on the overlapping tiling and subsequent minimum error boundary cut. An optimal double toroidal patch is seamlessly repeated during the synthesis step. While the method allows only moderate texture compression it is extremely fast and easily implementable in a graphical hardware for purpose of real-time rendering.
|
|
|
Multispectral texture segmentation
Mikeš, Stanislav ; Haindl, Michal
An efficient and robust type of unsupervised multispectral texture segmentation method is presented. The algorithm starts with spectral factorization of an input multispectral texture image using the Karhunen-Loeve expansion. Monospectral factors of single texture patches are assumed to be modelled using a Gaussian Markov random field model. The texture segmentation is done by K-means algorithm in the Markov model parameter space evaluated for each pixel centered image window.
|
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
guest ::
