Sciweavers

224 search results - page 10 / 45
» Homogeneous Decomposition of Polynomials
Sort
View
93
Voted
CVPR
2000
IEEE
16 years 2 months ago
A Robust and Efficient Motion Segmentation Based on Orthogonal Projection Matrix of Shape Space
A novel algorithm for motion segmentation is proposed. The algorithm uses the fact that shape of an object with homogeneous motion is represented as 4 dimensional linear space. Th...
Naoyuki Ichimura
JSC
2007
106views more  JSC 2007»
15 years 10 days ago
Computing multihomogeneous resultants using straight-line programs
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
Gabriela Jeronimo, Juan Sabia
86
Voted
TIT
2008
74views more  TIT 2008»
15 years 10 days ago
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication
A certain modular representation of multilinear polynomials is considered. The modulo 6 representation of polynomial f is just any polynomial f + 6g. The 1-a-strong representation ...
Vince Grolmusz
ICIP
2006
IEEE
16 years 2 months ago
Image Segmentation Model using Active Contour and Image Decomposition
This paper proposes an image segmentation model based on the active contour model, the Mumford-Shah functional and the image decomposition process. Generally speaking, the active ...
Xavier Bresson, Jean-Philippe Thiran
105
Voted
CCCG
2008
15 years 1 months ago
Polynomial irreducibility testing through Minkowski summand computation
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] wh...
Deepanjan Kesh, Shashank K. Mehta