| bibtype |
C -
Conference Paper (international conference)
|
| ARLID |
0411290 |
| utime |
20240103182315.9 |
| mtime |
20060210235959.9 |
| ISBN |
80-903100-7-9 |
| title
(primary) (eng) |
Novel path search algorithm for image stitching and advanced texture tiling |
| publisher |
| place |
Plzeň |
| name |
Západočeská univerzita |
| pub_time |
2005 |
|
| specification |
|
| serial |
| title
|
WSCG'2005. 13th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2005. Proceedings |
| page_num |
155-162 |
| editor |
|
|
| title
(cze) |
Nový algoritmus hledání cesty pro sešívání obrazů a pokročilé dlaždicování textur |
| keyword |
path search |
| keyword |
image stitching |
| keyword |
image transfer |
| author
(primary) |
| ARLID |
cav_un_auth*0101197 |
| name1 |
Somol |
| name2 |
Petr |
| institution |
UTIA-B |
| full_dept |
Department of Pattern Recognition |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| author
|
| ARLID |
cav_un_auth*0101093 |
| name1 |
Haindl |
| name2 |
Michal |
| institution |
UTIA-B |
| full_dept |
Department of Pattern Recognition |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| source |
|
| COSATI |
09K |
| COSATI |
09J |
| cas_special |
| project |
| project_id |
IST-2001-34744 |
| agency |
Commission EU |
| country |
XE |
| ARLID |
cav_un_auth*0200688 |
|
| project |
| project_id |
507752 |
| country |
XE |
| agency |
EC |
| ARLID |
cav_un_auth*0200689 |
|
| project |
| project_id |
IAA2075302 |
| agency |
GA AV ČR |
| country |
CZ |
| ARLID |
cav_un_auth*0001801 |
|
| project |
| project_id |
1M0572 |
| agency |
GA MŠk |
| ARLID |
cav_un_auth*0001814 |
|
| research |
CEZ:AV0Z10750506 |
| abstract
(eng) |
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. |
| abstract
(cze) |
Navrhujeme rychlý a upravitelný sub-optimální algoritmus pro vyhledávání hranic s minimální chybou mezi překrývajícími se obrázky. Algoritmus slouží jako alternativa tradičních pomalých algoritmů, jako je dynamické programování. Náš algoritmus používáme v kombinaci s adaptivním rozpíjením k sešívání oblastí obrázku. Tato technika je dále využita v kontextu vzorkovací syntézy textur, kde navrhujeme algoritmus s oddělenou fází analýzy a syntézy. Syntéza je zde velmi jednoduchá a rychlá. |
| action |
| ARLID |
cav_un_auth*0213159 |
| name |
WSCG 2005 /13./ |
| place |
Plzeň |
| country |
CZ |
| dates |
31.01.2005-04.02.2005 |
|
| RIV |
BD |
| reportyear |
2006 |
| department |
RO |
| permalink |
http://hdl.handle.net/11104/0131373 |
| ID_orig |
UTIA-B 20050018 |
| arlyear |
2005 |
| mrcbU10 |
2005 |
| mrcbU10 |
Plzeň Západočeská univerzita |
| mrcbU12 |
80-903100-7-9 |
| mrcbU63 |
WSCG'2005. 13th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2005. Proceedings 155 162 |
| mrcbU67 |
Skála V. 340 |
|