Abstract
The 2D-SSA method provides a decomposition of a 2D-array (a function of two variables, e.g. digital image) into a sum of identiable components. For the decomposition to be proper, these components should be close to 2D-arrays of finite rank. This paper is devoted to study of arrays of finite rank by means of polynomial ideals generated by arrays. The 2D-arrays are considered as functionals of polynomials. A general form of arrays of finite rank is obtained. The structure of finite-rank arrays and their trajectory spaces is investigated.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 6th St.Petersburg Workshop on Simulation, St. Petersburg, Russia, 28 Jun - 04 Jul 2009. |
| Editors | S Ermakov, V Melas, A Pepelyshev |
| Publisher | VVM com. Ltd |
| Pages | 308-313 |
| Number of pages | 6 |
| Volume | 1 |
| ISBN (Print) | 978-5-9651-0354-6 |
| Publication status | Published - 28 Jun 2009 |
| Event | Unknown - Duration: 28 Jun 2009 → … |
Conference
| Conference | Unknown |
|---|---|
| Period | 28/06/09 → … |
Bibliographical note
S Ermakov, V Melas, A PepelyshevKeywords
- Finite Rank