$ H _{ 2 } $ O: Reversible Hexagonal-Orthogonal Grid Conversion by 1-D Filtering

In this work, we propose a new grid conversion algorithm between the hexagonal lattice and the orthogonal (a.k.a. Cartesian) lattice. The conversion process, named $ H _{ 2 } $ O, is easy to implement and is perfectly reversible using the same algorithm to return from one lattice to the other. The key observation of our approach is a decomposition of the lattice conversion as a sequence of shearing operations along three well-chosen directions. Hence, only 1-D fractional sample delay operators are required, which can be implemented by simple convolutions. The proposed algorithm combines reversibility and fast 1-D operations, together with high-quality resampled images.


Published in:
Proceedings of the 2007 IEEE International Conference on Image Processing (ICIP'07), San Antonio TX, USA, II-73–II-76
Year:
2007
Publisher:
IEEE
Laboratories:




 Record created 2015-09-18, last modified 2018-03-17

External links:
Download fulltextURL
Download fulltextURL
Download fulltextURL
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)