Sciweavers

1363 search results - page 206 / 273
» The road coloring problem
Sort
View
ICCV
1999
IEEE
16 years 1 months ago
Appearance Compression and Synthesis based on 3D Model for Mixed Reality
Rendering photorealistic virtual objects from their real images is one of the main research issues in mixed reality systems. We previously proposed the Eigen-Texture method, a new...
Ko Nishino, Yoichi Sato, Katsushi Ikeuchi
ICIP
2001
IEEE
16 years 1 months ago
On the estimation of spectral data: a genetic algorithm approach
Spectral data estimation from image data is an ill-posed problem since (i) due to the integral nature of solid-state light sensors the same output can be obtained from an infinity...
Amâncio Santos, António Dourado, Bern...
ICPR
2006
IEEE
16 years 28 days ago
A Texture Based Matching Approach for Automated Assembly of Puzzles
The puzzle assembly problem has many application areas such as restoration and reconstruction of archeological findings, repairing of broken objects, solving jigsaw type puzzles, ...
Mahmut Samil Sagiroglu, Aytül Erçil
CVPR
2000
IEEE
15 years 4 months ago
Perceptual Grouping and Segmentation by Stochastic Clustering
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
Yoram Gdalyahu, Noam Shental, Daphna Weinshall
MFCS
1995
Springer
15 years 3 months ago
Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
Osamu Maruyama, Satoru Miyano