Texture analysis using Horadam polynomial coefficient estimate for the class of Sakaguchi kind function

This present work provides the initial co-efficient bounds of the function f(z) which is defined in open unit disk \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {D}$$\end{document}D. We introduced bi-univalent class \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {C}_{\Sigma }(\lambda , t,\nu )$$\end{document}CΣ(λ,t,ν). Making use of Horadam polynomials \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$h_{n}(\nu )$$\end{document}hn(ν) and the generating function \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\Pi (\nu ,z)$$\end{document}Π(ν,z), we estimated the bounds of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$a_{2}$$\end{document}a2 and \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$a_{3}$$\end{document}a3 for the given function to be in the defined class. Moreover Fekete-Szego inequalities are calculated. In addition to all the results obtained mathematically, we provide application for Horadam polynomial in computer vision.

While a subclass S contains all univalent functions in open unit disk D .Every function f ∈ S has an inverse which is defined as f −1 ((z)) = z, (z ∈ D) and f (f −1 (w)) = w , (|w| < r 0 (f ); r 0 ≥ 1  4 ), where A bi-univalent function is a complex-valued function that is both bijective and univalent in the open unit disk of the complex plane.In other words, a bi-univalent function is a function that maps the open unit disk onto a bijective image in the complex plane, such that the function is one-to-one and has a single-valued inverse function in the open unit disk.
More formally, a function f(z) is bi-univalent in the open unit disk if and only if: • f(z) is analytic and injective in the open unit disk, i.e., for any two distinct points z 1 and z 2 in the open unit disk, f (z 1 ) does not equal f (z 2 ).• f(z) maps the open unit disk onto a bijective image, i.e., for every point w in the image, there exists a unique point z in the open unit disk such that f (z) = w.• The inverse function f −1 (z) is also analytic and injective in the image of f(z).
Bi-univalent functions have been studied extensively in complex analysis and geometric function theory due to their properties and applications in various fields such as mathematical physics, engineering, and image processing.One of the fundamental results related to bi-univalent functions is the Bieberbach conjecture, which states that the Taylor coefficients of a bi-univalent function in the open unit disk satisfy certain inequalities.This conjecture was proved by Louis de Branges in 1985, and it has many important consequences in complex analysis.Examples of bi-univalent functions include the Koebe function, the Bessel function, and various subclasses of bi-univalent functions such as starlike and convex functions.
Precisely if a function f ∈ A and its inverse f −1 are univalent in D then the function f is said to be bi-univalent in D .Let is the symbol of the class of bi-univalent functions in D of the form (1) Suppose u ∈ S is claimed to be star-like function relevant to the origin, if u maps the unit disk U onto a star- like domain in view of the origin.The family S * denotes the collection of all star-like functions in view of origin.Equivalently, Definition 2 Convex functions (Goodman 1983) In a complex plane C , a domain D is supposed to be convex if it is star-like concerning each of its points, (i.e) if every pair of points of D can be joined by a line segment, which completly lies in D.
A function u ∈ S is claimed to be a convex function if u maps the unit disk U onto a convex domain.The family C indicates the collection of all convex functions.For two analytic functions f(z) and g(z) , if f(z) subordinate to g(z) and it can be written as f ≺ g if there exists a Schwartz function w with |w(z)| < 1 and w(0 The Horadam polynomials h n (ν) are defined by the following relation (see 10 ), with where a, b, e 1 , e 2 are real constants.The generating function of the Horadam polynomials h n (ν) (see 11 ) is given by Frasin 12 investigated the inequalities of co-efficient for certain classes of generalized Sakaguchi type function f satisfying the following geometrical property s, t are complex numbers with s = t and 0 ≤ α < 1.
For the fixed values of a, b, e 1 and e 2 the Horadam polynomial h n (ν) provides various types of polynomials, from these, we have listed a few here (see 13-21 ): , we reaches the pell polynomial P n (ν) 5.When a = 2, b = e 1 = 2 and e 2 = −1 , we have the chebyshev polynomials U n (ν) of the second kind.6.When a = b = 1 and e 1 = 2, e 2 = −1 , we get the chebyshev polynomials T n (ν) of the first kind.
n=2 a n z n ∈ is said to be in the class C � ( , t, ν) if it satisfies the following subordination conditions which are follows, (5) where 0 ≤ ≤ 1 , |t| ≤ 1 with t = 1 , ν ∈ R and a is a real constant, the function r = f −1 is given by (2).
Special Case:1 For t = 0 the class C � ( , t, ν) is reduced to C � ( , ν) satisfying the following conditions and Special Case:2 For the case = 0 in the class C � ( , t, ν) reduces to the class C � (t, ν) satisfying the following conditions, and

Application
The Horadam polynomial is an illustration of a mathematical sequence used in texture analysis and image processing.The Horadam polynomial, a specific kind of polynomial sequence, can be used to perform procedures like filtering and resampling.In image processing and computer vision, scale-space representations of images can be created and modified using the Horadam polynomial.This polynomial can be used for edge identification, texture analysis, and multi-scale image analysis.About texture analysis, the Horadam polynomial has been used for feature extraction, segmentation, and picture denoising.This technique can be used to analyze the statistical properties of textures, including the distribution of gray levels and the spatial organization of textures.This article focuses on texture analysis utilizing canny images by convoluting the calculated co-efficient values to the image pixels using masking at eight different angles and displaying the best result.
The image used to comprehend is a closed palm image of resolution 600×600.The original image and its corresponding Hist Value are shown in the Fig. 1.

Elucidation
Figure 2 displays the GLCM values for the canny image at various angles.The tabulation also shows that the Horadam polynomial examines the texture of the supplied image and that the values are also quite good for the contrast, correlation, energy, homogeneity, and entropy requirements.The suggested Texture method thus yields superior outcomes.The results of the image taken at various angles are shown in Fig. 3.

Conclusion
The goal of the manuscript was to link geometric function theory and image processing, specifically texture analysis.The image selected is solely a canny image, and it is treated using the outcomes of the work's mathematical analysis, the study is justified by the obtained values of the metrics utilised, such as contrast, correlation, entropy, energy, and homogeneity.The work also sheds lime light to work with coloured images and investigate various image-processing techniques like enhancement, sharpening, pattern identification, restoration, and retrieval.Mathematically future research can be carried out with the results of Fekete inequality obtained for inverse functions and can be applied in image processing.
Equivalently, Recently Srivastava et al. 2 have studied analytic and bi-univalent functions.Many authors have studied and provided various subclasses of bi-univalent functions and fixed the initial co-efficients |a 2 | and |a 3 | [see 3-8 and 9 ].

Remark 6 Theorem 7
https://doi.org/10.1038/s41598-023-41734-wwww.nature.com/scientificreports/This completes the proof of the theorem (4).If we take = 0 in Theorem 4, we obtain the following corollary, Corollary 5 A function f ∈ A and of the form (1) is in the class C � (t, ν) , then When t = 0,The class C � (t, ν) is reduced to the class C � (ν).For any complex number τ , Let f (z) = z + ∞ n=2 a n z n ∈ A be in the class C � ( , t, ν) then where and Proof From (20) and(21)

Figure 3 .
Figure 3.The original Image is the canny image of a closed palm, using the quality metrics, contrast, correlation, entropy, energy, and homogeneity.Above images show the canny image of the same at angles of 180 • , 90 • , 0 • , 270 • , 45 • , 135 • , 315 • , and255 • , respectively, with increased contrast, correlation, and entropy and decreased energy and homogeneity.The final figure shows a canny representation of the average of the aforementioned angles along with the relevant metrics.
Starlike functions1A simple connected domain D ⊂ C is supposed to be starlike with regard to w 0 ∈ D , if there exists a line segment which joins w 0 to any other point of D and it completly lies in D.