MCA has gained a reputation for being a very useful statistical method for determining the association between two or more categorical variables and their graphical description. For performance this method, we must calculate the singular vectors through (SVD). Which is an important primary tool that allows user to construct a low-dimensional space to describe the association between the variables categories. As an alternative procedure to use (SVD), we can use the (BMD) method, which involves using orthogonal polynomials to reflect the structure of ordered categorical responses. When the features of BMD are combined with SVD, the (HD) is formed. The aim of study is to use alternative method of (MCA) that is appropriate with ordered categorical data, this method is known as (HD). When compared the results of (HD) with (MCA), the (HD), will give the same representation, and we get a clear association interpretation among the categories in terms of linear, quadratic and higher order components for variables, also graphical display of the individual units will show an automatic clustering.
Face recognition is required in various applications, and major progress has been witnessed in this area. Many face recognition algorithms have been proposed thus far; however, achieving high recognition accuracy and low execution time remains a challenge. In this work, a new scheme for face recognition is presented using hybrid orthogonal polynomials to extract features. The embedded image kernel technique is used to decrease the complexity of feature extraction, then a support vector machine is adopted to classify these features. Moreover, a fast-overlapping block processing algorithm for feature extraction is used to reduce the computation time. Extensive evaluation of the proposed method was carried out on two different face ima
... Show MoreSeveral attempts have been made to modify the quasi-Newton condition in order to obtain rapid convergence with complete properties (symmetric and positive definite) of the inverse of Hessian matrix (second derivative of the objective function). There are many unconstrained optimization methods that do not generate positive definiteness of the inverse of Hessian matrix. One of those methods is the symmetric rank 1( H-version) update (SR1 update), where this update satisfies the quasi-Newton condition and the symmetric property of inverse of Hessian matrix, but does not preserve the positive definite property of the inverse of Hessian matrix where the initial inverse of Hessian matrix is positive definiteness. The positive definite prope
... Show MoreChromatographic and spectrophotometric methods for the estimation of mebendazole in
pharmaceutical products were developed. The flow injection method was based on the oxidation of
mebendazole by a known excess of sodium hypochlorite at pH=9.5. The excess sodium hypochlorite is then
reacted with chloranilic acid (CAA) to bleach out its color. The absorbance of the excess CAA was recorded
at 530 nm. The method is fast, simple, selective, and sensitive. The chromatographic method was carried out
on a Varian C18 column. The mobile phase was a mixture of acetonitrile (ACN), methanol (MeOH), water
and triethylamine (TEA), (56% ACN, 20% MeOH, 23.5% H2O, 0.5% TEA, v/v), adjusted to pH = 3.0 with
1.0 M hy
In current article an easy and selective method is proposed for spectrophotometric estimation of metoclopramide (MCP) in pharmaceutical preparations using cloud point extraction (CPE) procedure. The method involved reaction between MCP with 1-Naphthol in alkali conditions using Triton X-114 to form a stable dark purple dye. The Beer’s law limit in the range 0.34-9 μg mL-1 of MCP with r =0.9959 (n=3) after optimization. The relative standard deviation (RSD) and percentage recoveries were 0.89 %, and (96.99–104.11%) respectively. As well, using surfactant cloud point extraction as a method to extract MCP was reinforced the extinction coefficient(ε) to 1.7333×105L/mol.cm in surfactant-rich phase. The small volume of organi
... Show MoreA method for Approximated evaluation of linear functional differential equations is described. where a function approximation as a linear combination of a set of orthogonal basis functions which are chebyshev functions .The coefficients of the approximation are determined by (least square and Galerkin’s) methods. The property of chebyshev polynomials leads to good results , which are demonstrated with examples.
Image pattern classification is considered a significant step for image and video processing. Although various image pattern algorithms have been proposed so far that achieved adequate classification, achieving higher accuracy while reducing the computation time remains challenging to date. A robust image pattern classification method is essential to obtain the desired accuracy. This method can be accurately classify image blocks into plain, edge, and texture (PET) using an efficient feature extraction mechanism. Moreover, to date, most of the existing studies are focused on evaluating their methods based on specific orthogonal moments, which limits the understanding of their potential application to various Discrete Orthogonal Moments (DOM
... Show MoreImage pattern classification is considered a significant step for image and video processing.Although various image pattern algorithms have been proposed so far that achieved adequate classification,achieving higher accuracy while reducing the computation time remains challenging to date. A robust imagepattern classification method is essential to obtain the desired accuracy. This method can be accuratelyclassify image blocks into plain, edge, and texture (PET) using an efficient feature extraction mechanism.Moreover, to date, most of the existing studies are focused on evaluating their methods based on specificorthogonal moments, which limits the understanding of their potential application to various DiscreteOrthogonal Moments (DOMs). The
... Show MoreThe chemical properties of chemical compounds and their molecular structures are intimately connected. Topological indices are numerical values associated with chemical molecular graphs that help in understanding the physicochemical properties, chemical reactivity and biological activity of a chemical compound. This study obtains some topological properties of second and third dominating David derived (DDD) networks and computes several K Banhatti polynomial of second and third type of DDD.