Sciweavers

417 search results - page 16 / 84
» Convex Shape Decomposition
Sort
View
ICPR
2004
IEEE
14 years 8 months ago
Missing Microarray Data Estimation Based on Projection onto Convex Sets Method
DNA microarrays have gained widespread uses in biological studies. Missing values in a microarray experiment must be estimated before further analysis. In this paper, we propose a...
Alan Wee-Chung Liew, Hong Yan, Xiangchao Gan
CVPR
2005
IEEE
14 years 9 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade
ESA
2000
Springer
110views Algorithms» more  ESA 2000»
13 years 11 months ago
Polygon Decomposition for Efficient Construction of Minkowski Sums
Several algorithms for computing the Minkowski sum of two polygons in the plane begin by decomposing each polygon into convex subpolygons. We examine different methods for decompo...
Pankaj K. Agarwal, Eyal Flato, Dan Halperin
ICPR
2008
IEEE
14 years 8 months ago
A coordinate system for articulated 2D shape point correspondences
A framework for mapping a polar-like coordinate system to a non-rigid shape is presented. Using a graph pyramid, a binary shape is decomposed into connected parts, based on its st...
Adrian Ion, Salvador B. López Mármol...
TIP
1998
97views more  TIP 1998»
13 years 7 months ago
Estimation of shape of binary polygonal object from scattered field
—We present a method of estimating the shape of a weakly scattering binary convex polygonal object from the backscattered field. We use the concept scattering centers where it h...
A. Buvaneswari, Prabhakar S. Naidu