Search Sciweavers | Sciweavers

23

MOC
2002

101views more MOC 2002»

Global and uniform convergence of subspace correction methods for some convex optimization problems

13 years 7 months ago

This paper gives some global and uniform convergence estimates for a class of subspace correction (based on space decomposition) iterative methods applied to some unconstrained con...

Xue-Cheng Tai, Jinchao Xu

claim paper

Read More »

24

click to vote

ICPR
2008
IEEE

107views Computer Vision» more ICPR 2008»

Robust decomposition of a digital curve into convex and concave parts

14 years 8 months ago

Download liris.cnrs.fr

We propose a linear in time and easy-to-implement algorithm that robustly decomposes a digital curve into convex and concave parts. This algorithm is based on classical tools in d...

Tristan Roussillon, Isabelle Sivignon, Laure Tougn...

claim paper

Read More »

17

click to vote

GBRPR
2009
Springer

150views Pattern Recognition» more GBRPR 2009»

Computing and Visualizing a Graph-Based Decomposition for Non-manifold Shapes

14 years 2 months ago

Download www.disi.unige.it

Modeling and understanding complex non-manifold shapes is a key issue in shape analysis and retrieval. The topological structure of a non-manifold shape can be analyzed through its...

Leila De Floriani, Daniele Panozzo, Annie Hui

claim paper

Read More »

17

click to vote

JCIT
2007

75views more JCIT 2007»

A Method for Classification of Convex Polygons

13 years 7 months ago

Download www.aicit.org

Based on the planar polygon shape classification, we propose a method—Standardized Binary String Descriptor of Convex Polygon—for classification of convex polygons, making it ...

Ping Guo, Yan-Xia Wang

claim paper

Read More »

17

click to vote

SCALESPACE
2009
Springer

158views Computer Vision» more SCALESPACE 2009»

Optimization of Convex Shapes: An Approach to Crystal Shape Identification

14 years 2 months ago

Download math.tkk.fi

Timo Eirola, Toni Lassila

claim paper