← Latest papers
🔢 mathematics

Gegenbauer Polynomial Convolution for Bi-Univalent Functions with Applications to Image Enhancement

This paper introduces a new subclass of bi-univalent functions defined via Gegenbauer polynomial convolution to derive coefficient bounds and Fekete-Szegö inequalities, which are then utilized to develop a GCEA algorithm that effectively enhances digital images by improving edge detection, preserving structural features, and increasing contrast.

Original authors: TARAL D SHAH, V. SIVASANKARI, O. KARTHIYAYINI

Published 2026-08-11
📖 5 min read🧠 Deep dive

Original authors: TARAL D SHAH, V. SIVASANKARI, O. KARTHIYAYINI

Original paper licensed under CC BY 4.0 (https://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are standing in a vast, invisible library where every book is a unique shape drawn on a piece of paper. Mathematicians who study "Geometric Function Theory" are like librarians trying to sort these shapes. They are particularly interested in "univalent" functions, which are shapes that never fold back on themselves or overlap—think of a smooth, perfect circle that doesn't crumple. But there's a special, trickier group called "bi-univalent" functions. These are shapes that are perfect not just when you look at them, but also when you look at their mirror image (or "inverse"). It's like a dance move that looks graceful whether you are doing it forward or in reverse.

To understand these shapes, mathematicians often use "polynomials," which are like building blocks made of numbers and variables. One famous family of blocks is called "Gegenbauer polynomials." You can think of these as a super-flexible set of LEGO bricks that can snap together to describe all sorts of complex patterns, from the way sound waves travel to how planets orbit. When you mix these mathematical building blocks with "convolution," you get a powerful tool. Convolution is like a stencil or a cookie cutter that slides over an image, looking at a small group of pixels at a time and mixing them together to highlight specific features, like edges or textures.

Why does anyone care about this? Because the rules that govern these abstract mathematical shapes can actually be used to fix real-world problems, like making blurry photos look sharp. If we can figure out the exact "limits" or boundaries of how these shapes behave, we can turn those numbers into instructions for computers to clean up images. This is exactly what the researchers in this paper set out to do: they wanted to see if the strict rules of these fancy mathematical shapes could help us take better pictures.


The Paper: Turning Math Shapes into Picture Perfection

In this paper, a team of researchers led by Taral D. Shah, V. Sivasankari, and O. Karthiyayini introduces a brand-new way to organize these "bi-univalent" shapes. They created a special club, which they named Bη,αΣ(f,g,h;x)B_{\eta,\alpha}^{\Sigma}(f, g, h; x), where every member is a function that behaves nicely when mixed with Gegenbauer polynomials. Think of this club as a VIP section where only the most well-behaved mathematical dancers are allowed, provided they follow a specific rhythm defined by these polynomials.

The authors didn't just invite people to the club; they measured them. They calculated the "coefficient estimates," which are essentially the first few numbers that describe the size and shape of these functions. They found the maximum and minimum values these numbers could possibly be. They also proved a famous type of inequality called the "Fekete-Szegö inequality," which acts like a safety net, ensuring that the relationship between these numbers stays within a predictable range. In simpler terms, they figured out the exact "speed limits" for how fast these mathematical shapes can grow or twist.

But here is where it gets really cool: they didn't stop at math class. They asked, "What if we use these speed limits to fix photos?"

They developed a new image enhancement tool called the Gegenbauer Polynomial Convolution Enhancement Algorithm (GCEA). Imagine you have a slightly blurry or dull photo of an apple, a flower, or a leg X-ray. The computer needs a set of instructions (a "mask" or "kernel") to go through the photo pixel by pixel and sharpen the edges. Usually, these instructions are just random numbers or standard patterns. In this paper, the authors used the exact numbers they calculated from their new mathematical club to create these instructions.

They turned the math numbers into a 3x3 grid (a small window) that slides over the image. They made four different versions of this grid, each pointing in a different direction: horizontal (0°), vertical (90°), and two diagonals (45° and 135°). It's like having four different flashlights, each shining from a different angle to reveal hidden details in the dark.

To test if this magic math actually worked, they tried it on three very different pictures:

  1. An Apple: A smooth fruit with gentle curves.
  2. A Gerbera Flower: A busy flower with lots of tiny, detailed petals.
  3. A Leg X-ray: A medical image showing bones and a metal pin, where seeing fine cracks is crucial.

The results were impressive. When they used their math-based masks, the images became sharper, and the edges of the objects stood out more clearly. They measured the quality using three standard tests:

  • PSNR (Peak Signal-to-Noise Ratio): This checks how much "noise" or static was added. Higher is better.
  • SSIM (Structural Similarity Index): This checks if the picture still looks like the original object, just sharper.
  • PCC (Pearson Correlation Coefficient): This measures how perfectly the new picture matches the old one in terms of brightness patterns.

The team found that their method kept the images looking very true to the original. For the X-ray, the vertical mask (90°) worked the best, giving a PSNR of 34.81 dB and an SSIM of 0.9518, which is a very high score. This makes sense because leg bones are mostly vertical. For the flower, the method preserved the complex texture beautifully, achieving an SSIM of 0.982. Across the board, the PCC values were all above 0.996, meaning the enhanced images were almost perfectly correlated with the originals.

The researchers concluded that by taking the strict, abstract rules of bi-univalent functions and turning them into a practical algorithm, they could enhance images effectively without losing their structure. They showed that the "speed limits" they calculated for these mathematical shapes are not just theoretical; they can be used as a real-world tool to make digital photos look clearer and more detailed. While they didn't claim this is the final solution for every image problem, their experiments suggest that this bridge between complex geometry and digital photography is a promising path forward, especially for medical images where seeing fine details matters.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →