Sciweavers

750 search results - page 94 / 150
» Hardware-determined feature edges
Sort
View
112
Voted
ICVGIP
2004
15 years 2 months ago
On Learning Shapes from Shades
Shape from Shading (SFS) is one of the most extensively studied problems in Computer Vision. However, most of the approaches only deal with Lambertian or other specific shading mo...
Subhajit Sanyal, Mayank Bansal, Subhashis Banerjee...
110
Voted
VMV
2001
129views Visualization» more  VMV 2001»
15 years 2 months ago
Compression of Isosurfaces
In many applications surfaces containing a large number of primitives occur. Geometry compression reduces storage space and transmission time for such models. A special case is gi...
Dietmar Saupe, Jens-Peer Kuska
72
Voted
MVA
1992
118views Computer Vision» more  MVA 1992»
15 years 1 months ago
A Mobile Robot for Visual Measurements in Architectural Applications
This paper describes a method to perform distance measurements inside buildings using a single video camera mounted on a mobile robot. This algorithm is designed specifically to c...
Xavier Lebègue, Jake K. Aggarwal
91
Voted
COR
2008
92views more  COR 2008»
15 years 21 days ago
Lagrangean relaxation with clusters for point-feature cartographic label placement problems
This paper presents two new mathematical formulations for the Point-Feature Cartographic Label Placement Problem (PFCLP ) and a new Lagrangean relaxation with clusters (LagClus) t...
Glaydston Mattos Ribeiro, Luiz Antonio Nogueira Lo...
EOR
2010
133views more  EOR 2010»
15 years 20 days ago
A memetic algorithm for graph coloring
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
Zhipeng Lü, Jin-Kao Hao