@article{fitz1996hexagon,
    title = "Fingerprint classification using a hexagonal fast fourier transform",
    journal = "Pattern Recognition",
    volume = "29",
    number = "10",
    pages = "1587 - 1597",
    year = "1996",
    note = "",
    issn = "0031-3203",
    doi = "http://dx.doi.org/10.1016/0031-3203(96)00018-0",
    url = "http://www.sciencedirect.com/science/article/pii/0031320396000180",
    author = "A.P. Fitz and R.J. Green",
    keywords = "Filtering",
    keywords = "Segmentation",
    keywords = "Thinning",
    keywords = "Fingerprint classification",
    keywords = "Hexagonal sampling",
    keywords = "Hexagonal Fast Fourier Transform",
    abstract = "In this paper a new method for the analysis of fingerprint images is presented. A Hexagonal Fourier Transform is applied that will classify fingerprints into whorls, loops and arches. The Hexagonal Fourier Transform allows the utilization of hexagonally sampled data and the extention of output data in a rectangular scheme, which is more convenient for treatment and interpretation. Results for fingerprint classification are given.",
    status = "to read"
}

@article{grigoryan2002hexagonalfft,
    author={A. M. Grigoryan},
    journal={IEEE Transactions on Signal Processing},
    title={Efficient algorithms for computing the 2-D hexagonal Fourier transforms},
    year={2002},
    volume={50},
    number={6},
    pages={1438-1448},
    abstract={In this paper, representations of the two-dimensional (2-D) signals are presented that reduce the computation of 2-D discrete hexagonal Fourier transforms (2-D DHFTs). The representations are based on the concept of the covering that reveals the mathematical structure of the transforms. Specifically, a set of unitary paired transforms is derived that splits the 2-D DHFT into a number of smaller one-dimensional (1-D) DFTs. Examples for the 8×4 and 16×8 hexagonal lattices are described in detail. The number of multiplications required for computing the 8×4- and 16×8-point DHFTs are equal 20 and 136, respectively. In the general N⩾8 case, the number of multiplications required to compute the 2N×N-point DHFT by the paired transforms equals N2 (log N-1)+N},
    keywords={discrete Fourier transforms;image representation;2D DFT;2D DHFT;2D discrete hexagonal Fourier transforms;2D signal representation;efficient algorithms;multidimensional signal processing;multiplications;two-dimensional signals;unitary paired transforms;Discrete Fourier transforms;Discrete transforms;Fourier transforms;Image processing;Image sampling;Lattices;Machine vision;Signal processing;Signal sampling;Two dimensional displays},
    doi={10.1109/TSP.2002.1003067},
    ISSN={1053-587X},
    month={Jun},
    url="http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1003067",
    status = "to read"
}

@inproceedings{he2005hexagonal,
    title = {Hexagonal structure for intelligent vision},
    author = {He, Xiangjian and Jia, Wenjing},
    booktitle = {Information and Communication Technologies, 2005. ICICT 2005. First International Conference on},
    pages = {52--64},
    year = {2005},
    organization = {IEEE},
    url = "https://opus.lib.uts.edu.au/bitstream/10453/2661/3/2005002959.pdf",
    status = "to read"
}

@article{hofmann1999reconstruction,
    author        = "Hofmann, W. and Jung, I. and Konopelko, A. and Krawczynski, H. and Lampeitl, H. and Puehlhofer, G.",
    title         = "{Comparison of techniques to reconstruct VHE gamma-ray showers from multiple stereoscopic Cherenkov images}",
    journal       = "Astropart. Phys.",
    volume        = "122",
    year          = "1999",
    pages         = "135-143",
    doi           = "10.1016/S0927-6505(99)00084-5",
    eprint        = "astro-ph/9904234",
    archivePrefix = "arXiv",
    primaryClass  = "astro-ph",
    url           = "http://adsabs.harvard.edu/abs/1999APh....12..135H",
    status = "to read"
}

@book{kazan1999advances,
    title={Advances in Imaging and Electron Physics},
    author={Kazan, B. and Mulvey, T. and Hawkes, P.W.},
    number={vol.~107},
    isbn={9780080577739},
    series={Advances in Imaging and Electron Physics},
    url={https://books.google.fr/books?id=A-zp7M\_qKusC},
    year={1999},
    publisher={Elsevier Science},
    status = "to read"
}

@inproceedings{middleton2001fft,
    title = {The FFT in a hexagonal-image processing framework},
    author = {Middleton, Lee and Sivaswamy, Jayanthi and Coghill, G},
    booktitle = {Proceedings of Image and Vision Computing, New Zealand},
    pages = {231--236},
    year = {2001},
    url = "https://www.researchgate.net/profile/Jayanthi_Sivaswamy2/publication/228977867_The_FFT_in_a_hexagonal-image_processing_framework/links/54340b5a0cf2dc341daf3036.pdf",
    status = "to read"
}

@book{middleton2006hexagonal,
    title     = {Hexagonal Image Processing: A Practical Approach},
    author    = {Middleton, L. and Sivaswamy, J.},
    isbn      = {9781846282034},
    series    = {Advances in Computer Vision and Pattern Recognition},
    url       = {https://books.google.fr/books?id=\_gzSU-SKycMC},
    year      = {2006},
    publisher = {Springer London},
    status = "to read"
}

@article{sahr2011hexagonal,
    title = {Hexagonal discrete global grid systems for geospatial computing},
    author = {Sahr, Kevin},
    journal = {Archiwum Fotogrametrii, Kartografii i Teledetekcji},
    volume = {22},
    pages = {363--376},
    year = {2011},
    url = "https://www.infona.pl/resource/bwmeta1.element.baztech-8fbd4fa0-6092-44bb-83ff-52f2ce89f7e6/content/partDownload/abb42f21-cd25-3733-a377-34e5d47a31a5",
    status = "to read"
}

@Article{Zapata2000fft,
    author="Zapata, Jaime L.
        and Ritter, Gerhard X.",
    title="Fast Fourier Transform for Hexagonal Aggregates",
    journal="Journal of Mathematical Imaging and Vision",
    year="2000",
    volume="12",
    number="3",
    pages="183--197",
    abstract="Hexagonal aggregates are hierarchical arrangements of hexagonal cells. These hexagonal cells may be efficiently addressed using a scheme known as generalized balanced ternary for dimension 2, or GBT2. The objects of interest in this paper are digital images whose domains are hexagonal aggregates. We define a discrete Fourier transform (DFT) for such images. The main result of this paper is a radix-7, decimation-in-space fast Fourier transform (FFT) for images defined on hexagonal aggregates. The algorithm has complexity N log7 N. It is expressed in terms of the p-product, a generalization of matrix multiplication. Data reordering (also known as shuffle permutations) is generally associated with FFT algorithms. However, use of the p-product makes data reordering unnecessary.",
    issn="1573-7683",
    doi="10.1023/A:1008370531376",
    url="http://dx.doi.org/10.1023/A:1008370531376",
    status = "to read"
}