Sciweavers

5210 search results - page 119 / 1042
» Exact geometric computation
Sort
View
CVPR
2006
IEEE
15 years 12 months ago
Uncertainty Models in Quasiconvex Optimization for Geometric Reconstruction
Geometric reconstruction problems in computer vision can be solved by minimizing the maximum of reprojection errors, i.e., the L-norm. Unlike L2-norm (sum of squared reprojection ...
Qifa Ke, Takeo Kanade
ICPR
2000
IEEE
15 years 11 months ago
Robust Dense Matching Using Local and Global Geometric Constraints
A new robust dense matching algorithm is introduced in this paper. The algorithm starts from matching the most textured points, then a match propagation algorithm is developed wit...
Maxime Lhuillier, Long Quan
SAC
2006
ACM
15 years 3 months ago
Spatial geometric constraint solving based on k-connected graph decomposition
We propose a geometric constraint solving method based on connectivity analysis in graph theory, which can be used to decompose a well-constrained problem into some smaller ones i...
Gui-Fang Zhang, Xiao-Shan Gao
ICMCS
2005
IEEE
87views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Correlation-based model of color picture watermarking against random geometric distortion
Random geometric distortion is one of the most difficult kinds of image processing to survive and has been a noted problem in watermarking research. Previous methods for dealing ...
Isao Echizen, Yasuhiro Fujii, Takaaki Yamada, Sato...
GD
2006
Springer
15 years 1 months ago
Choosing Colors for Geometric Graphs Via Color Space Embeddings
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
Michael B. Dillencourt, David Eppstein, Michael T....