Sciweavers

137 search results - page 6 / 28
» A Method for Classification of Convex Polygons
Sort
View
TIP
1998
114views more  TIP 1998»
13 years 5 months ago
An optimal polygonal boundary encoding scheme in the rate distortion sense
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
Guido M. Schuster, Aggelos K. Katsaggelos
PR
2007
126views more  PR 2007»
13 years 5 months ago
Convex hull based skew estimation
Skew estimation and page segmentation are the two closely related processing stages for document image analysis. Skew estimation needs proper page segmentation, especially for doc...
Bo Yuan, Chew Lim Tan
ICCSA
2007
Springer
13 years 12 months ago
Weak Visibility of Two Objects in Planar Polygonal Scenes
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi
ICRA
2008
IEEE
170views Robotics» more  ICRA 2008»
14 years 5 days ago
Fast grasp planning for hand/arm systems based on convex model
— This paper discusses the grasp planning of a multifingered hand attached at the tip of a robotic arm. By using the convex models and the new approximation method of the fricti...
Kensuke Harada, Kenji Kaneko, Fumio Kanehiro
ICML
2007
IEEE
14 years 6 months ago
Uncovering shared structures in multiclass classification
This paper suggests a method for multiclass learning with many classes by simultaneously learning shared characteristics common to the classes, and predictors for the classes in t...
Yonatan Amit, Michael Fink 0002, Nathan Srebro, Sh...