Sciweavers

906 search results - page 67 / 182
» Matching Subsequences in Trees
Sort
View
SIBGRAPI
1999
IEEE
14 years 1 months ago
Deterministic Texture Analysis and Synthesis Using Tree Structure Vector Quantization
Texture analysis and synthesis is very important for computer graphics, vision, and image processing. This paper describes an algorithm which can produce new textures with a matchi...
Li-Yi Wei
SODA
1998
ACM
144views Algorithms» more  SODA 1998»
13 years 10 months ago
Analysis of Random Processes via And-Or Tree Evaluation
We introduce a new set of probabilistic analysis tools based on the analysis of And-Or trees with random inputs. These tools provide a unifying, intuitive, and powerful framework ...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
3DIM
2005
IEEE
13 years 11 months ago
Bayesian Modelling of Camera Calibration and Reconstruction
Camera calibration methods, whether implicit or explicit, are a critical part of most 3D vision systems. These methods involve estimation of a model for the camera that produced t...
Rashmi Sundareswara, Paul R. Schrater
ICIP
2005
IEEE
14 years 10 months ago
Motion-compensation using variable-size block-matching with binary partition trees
A new approach to Variable Size Block Matching is proposed, based on the binary partitioning of blocks. If a particular block does not allow for accurate motion compensation, then...
Marc Servais, Theodore Vlachos, Thomas Davies
ICEIS
2009
IEEE
14 years 3 months ago
A Natural and Multi-layered Approach to Detect Changes in Tree-Based Textual Documents
Several efficient and very powerful algorithms exist for detecting changes in tree-based textual documents, such as those encoded in XML. An important aspect is still underestimat...
Angelo Di Iorio, Michele Schirinzi, Fabio Vitali, ...