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 (DOMs). Therefore, finding a fast PET classification method that accurately classify image pattern is crucial. To this end, this paper proposes a new scheme for accurate and fast image pattern classification using an efficient DOM. To reduce the computational complexity of feature extraction, an election mechanism is proposed to reduce the number of processed block patterns. In addition, support vector machine is used to classify the extracted features for different block patterns. The proposed scheme is evaluated by comparing the accuracy of the proposed method with the accuracy achieved by state-of-the-art methods. In addition, we compare the performance of the proposed method based on different DOMs to get the robust one. The results show that the proposed method achieves the highest classification accuracy compared with the existing methods in all the scenarios considered.
The study of properties of space of entire functions of several complex variables was initiated by Kamthan [4] using the topological properties of the space. We have introduced in this paper the sub-space of space of entire functions of several complex variables which is studied by Kamthan.
This study deals with thirty non-insulin dependent diabetes mellitus patients suffering from diabetic nephropathy in addition to twenty five healthy control.Some biochemical parameters were determined in the serum of all subjects enrolled in the study.These parameters are serum glucose,serum urea,serum creatinine,total serum protein and serum albumin.The aim of the present study was to estimate these parameters in diabetic nephropathy patients. The results of the present study revealed a significant increase in glucose,urea and creatinine in patients as compared to controls . Also a significant decrease was found in total serum protein, serum albumin and albumin to globulin ratio (A/G) in patients compared to controls,whi
... Show MoreThe Video effect on Youths Value
The main object of this paper is to study the representations of monomial groups and characters technique for representations of monomial groups. We refer to monomial groups by M-groups. Moreover we investigate the relation of monomial groups and solvable groups. Many applications have been given the symbol G e.g. group of order 297 is an M-group and solvable. For any group G, the factor group G/G? (G? is the derived subgroup of G) is an M-group in particular if G = Sn, SL(4,R).
A space X is named a πp – normal if for each closed set F and each π – closed set F’ in X with F ∩ F’ = ∅, there are p – open sets U and V of X with U ∩ V = ∅ whereas F ⊆ U and F’ ⊆ V. Our work studies and discusses a new kind of normality in generalized topological spaces. We define ϑπp – normal, ϑ–mildly normal, & ϑ–almost normal, ϑp– normal, & ϑ–mildly p–normal, & ϑ–almost p-normal and ϑπ-normal space, and we discuss some of their properties.
Interval methods for verified integration of initial value problems (IVPs) for ODEs have been used for more than 40 years. For many classes of IVPs, these methods have the ability to compute guaranteed error bounds for the flow of an ODE, where traditional methods provide only approximations to a solution. Overestimation, however, is a potential drawback of verified methods. For some problems, the computed error bounds become overly pessimistic, or integration even breaks down. The dependency problem and the wrapping effect are particular sources of overestimations in interval computations. Berz (see [1]) and his co-workers have developed Taylor model methods, which extend interval arithmetic with symbolic computations. The latter is an ef
... Show MoreSystems on Chips (SoCs) architecture complexity is result of integrating a large numbers of cores in a single chip. The approaches should address the systems particular challenges such as reliability, performance, and power constraints. Monitoring became a necessary part for testing, debugging and performance evaluations of SoCs at run time, as On-chip monitoring is employed to provide environmental information, such as temperature, voltage, and error data. Real-time system validation is done by exploiting the monitoring to determine the proper operation of a system within the designed parameters. The paper explains the common monitoring operations in SoCs, showing the functionality of thermal, voltage and soft error monitors. The different
... Show MoreThis study investigates self-perception and self-branding on Instagram among young Arab women in the UAE, focusing on how they curate, negotiate and perform their digital identities and whether their digital self-presentation in any way compromises their sense of authenticity. The study is based on 11 interviews with young women in the UAE, between the ages of 20 and 30, in addition to online observation to follow the participants’ activities on Instagram. The study demonstrates that while social and digital media platforms may play a role in “empowering” Arab women, women tend to set their boundaries of authenticity shaped according to their audience’s expectations and their in-groups. This confirms the r
... Show MoreIn this thesis, we study the topological structure in graph theory and various related results. Chapter one, contains fundamental concept of topology and basic definitions about near open sets and give an account of uncertainty rough sets theories also, we introduce the concepts of graph theory. Chapter two, deals with main concepts concerning topological structures using mixed degree systems in graph theory, which is M-space by using the mixed degree systems. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are defined and studied. In chapter three we study supra-approximation spaces using mixed degree systems and primary object in this chapter are two topological
... Show More