53 search results - page 4 / 11 » Affine Grassmann codes |
ECCC
2010
13 years 7 months ago
2010
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
ICIP
1999
IEEE
14 years 9 months ago
1999
IEEE
Long-term memory prediction extends motion compensation from the previous frame to several past frames with the result of increased coding efficiency. In this paper we demonstrate...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
In this article, new regular incidence structures are presented. They arise from sets of conics in the affine plane blown
IEEEPACT
1998
IEEE
13 years 11 months ago
1998
IEEE
We study in this paper the problem of polyhedron scanning which appears for example when generating code for transformed loop nests in automatic parallelization. After a review of...
Source Code
The code is a (good, in my opinion) implementation of a segmentation engine based on normalised cuts (a spectral clustering algorithm) and a pixel affinity matrix calculation algor...