Maximally selective fractional fourier pooling
buir.contributor.author | Koç, Emirhan | |
buir.contributor.author | Ekiz, Yunus Emre | |
buir.contributor.author | Özaktaş, Haldun | |
buir.contributor.orcid | Koç, Emirhan|0000-0002-7275-1570 | |
buir.contributor.orcid | Koç, Aykut|0000-0002-6348-2663 | |
dc.contributor.author | Koç, Emirhan | |
dc.contributor.author | Ekiz, Yunus Emre | |
dc.contributor.author | Özaktaş, Haldun | |
dc.contributor.author | Koç, Aykut | |
dc.coverage.spatial | Tarsus Univ Campus, Mersin, TURKEY | |
dc.date.accessioned | 2025-02-22T20:23:27Z | |
dc.date.available | 2025-02-22T20:23:27Z | |
dc.date.issued | 2024-06-23 | |
dc.department | Department of Electrical and Electronics Engineering | |
dc.description | Conference Name:2024 32nd Signal Processing and Communications Applications Conference (SIU) | |
dc.description | Date of Conference:15-18 May 2024 | |
dc.description.abstract | In traditional image classification models, global average pooling is typically employed in the final layer to mitigate model complexity. However, this approach is prone to loss of information while reducing the complexity. Recent studies have proposed alternatives, replacing this layer by propagating information in various domains. In our work, we propose replacing this conventional pooling layer with a fractional Fourier transform (FrFT) based pooling layer. We first transform the feature of the last convolutional layer to the FrFT domain and transfer only the k-largest coefficients to the following layer in each channel, thereby enhancing efficiency by preserving only the essential information. To support our proposal, we conducted experiments on two datasets using various image classification models. Our results show that the integration of the FrFT as a pooling layer not only improves model performances but also does not add significant computational burden to model complexity. | |
dc.description.provenance | Submitted by Aleyna Demirkıran (aleynademirkiran@bilkent.edu.tr) on 2025-02-22T20:23:27Z No. of bitstreams: 1 Maximally_Selective_Fractional_Fourier_Pooling.pdf: 322318 bytes, checksum: b0656ba9773ff5f77d797bce411de36f (MD5) | en |
dc.description.provenance | Made available in DSpace on 2025-02-22T20:23:27Z (GMT). No. of bitstreams: 1 Maximally_Selective_Fractional_Fourier_Pooling.pdf: 322318 bytes, checksum: b0656ba9773ff5f77d797bce411de36f (MD5) Previous issue date: 2024-06-23 | en |
dc.identifier.doi | 10.1109/SIU61531.2024.10600916 | |
dc.identifier.isbn | 979-8-3503-8896-1 | |
dc.identifier.issn | 2165-0608 | |
dc.identifier.uri | https://hdl.handle.net/11693/116661 | |
dc.language.iso | Turkish | |
dc.publisher | IEEE | |
dc.relation.isversionof | https://dx.doi.org/10.1109/SIU61531.2024.10600916 | |
dc.subject | Fractional Fourier transform | |
dc.subject | Global average pooling | |
dc.subject | Image classification | |
dc.subject | Deep neural network smachine learning | |
dc.title | Maximally selective fractional fourier pooling | |
dc.type | Conference Paper |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Maximally_Selective_Fractional_Fourier_Pooling.pdf
- Size:
- 314.76 KB
- Format:
- Adobe Portable Document Format
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: