Md Ahadullah
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Md Ahadullah has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Dabbrata Das
Uttara University
1 shared publication Mohamad Rushdan Md Said
Univ Putra Malaysia, Inst Math Res, Serdang 43400, Malaysia
1 shared publication- Mohamad Rushdan Md Said
Institute for Mathematical Research, Universiti Putra Malaysia, 43400 Serdang, Selangor, Malaysia
1 shared publication Nadia M. G. Al-Saidi
Faculty of Science, University of Technology, Baghdad, Iraq
1 shared publicationR.M.N. Said
Institute for Mathematical Research, University Putra Malaysia, Serdang, Malaysia
1 shared publication- Rishadul Bayesh
Department of Computer Science and Engineering Uttara University Dhaka Bangladesh
1 shared publication
Latest Publications
- Open Access
- 14 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 5028-5045
Competitive Improvement of the Time Complexity to Encode Fractal Image: By Applying Symmetric Central Pixel of the Block
By combining the basics of self-similarity, scaling correlation, and statistical components, Benoit Mandelbrot formulated the idea of a natural fractal entity, an entity described by those fundamentals. As a result of these principles, fractal image codings are being used in many substantial applications already, such as image compression, image signature, image watermarking, image attribute extraction, and even image texture segmentation. Thus, while fractal image coding is relatively new in the field of image encoding, it has gained broad acceptance at a rapid pace. In light of its beneficial qualities, such as quick decomposition, high compression ratio, and the independence of resolution at any size make these applications conceivable. However, compared to its advantages, fractal image coding is extremely time-complex and so remarkably expensive, which hinders its prevalence. A wide hunting domain blocks for the relevant range blocks caused this difficulty. We proposed several improvements to the Jacquin design in this paper. We first used max-pooling as an alternative for the medium bonding of spatial contractions to validate the value of the edge textures of the block. Secondly, we construct the odd-size pixel block alternative to an even-size pixel block for validation of the symmetric central pixel (CP). Finally, before the search started, we proposed a shortening of block space, using the central pixel of the block to convert each eight-bit pixel to a two-bit pixel. As a consequence, the symmetrical CP of odd pixels block, reduction of block space, and edge pixel selection accomplished faster coding and competitive image quality than existing known exhaustive search algorithms.
- 14 December 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 5028-5045
Open AccessCompetitive Improvement of the Time Complexity to Encode Fractal Image: By Applying Symmetric Central Pixel of the Block
By combining the basics of self-similarity, scaling correlation, and statistical components, Benoit Mandelbrot formulated the idea of a natural fractal entity, an entity described by those fundamentals. As a result of these principles, fractal image codings are being used in many substantial applications already, such as image compression, image signature, image watermarking, image attribute extraction, and even image texture segmentation. Thus, while fractal image coding is relatively new in the field of image encoding, it has gained broad acceptance at a rapid pace. In light of its beneficial qualities, such as quick decomposition, high compression ratio, and the independence of resolution at any size make these applications conceivable. However, compared to its advantages, fractal image coding is extremely time-complex and so remarkably expensive, which hinders its prevalence. A wide hunting domain blocks for the relevant range blocks caused this difficulty. We proposed several improvements to the Jacquin design in this paper. We first used max-pooling as an alternative for the medium bonding of spatial contractions to validate the value of the edge textures of the block. Secondly, we construct the odd-size pixel block alternative to an even-size pixel block for validation of the symmetric central pixel (CP). Finally, before the search started, we proposed a shortening of block space, using the central pixel of the block to convert each eight-bit pixel to a two-bit pixel. As a consequence, the symmetrical CP of odd pixels block, reduction of block space, and edge pixel selection accomplished faster coding and competitive image quality than existing known exhaustive search algorithms.
- 4 November 2014
- Published by Springer Nature
- p. 27-33
History, Development and Trend of Fractal Based Biometric Cryptography
- 4 November 2014
- Published by Springer Nature
- p. 27-33
History, Development and Trend of Fractal Based Biometric Cryptography