3 resultados para Equal Priority

em Cochin University of Science


Relevância:

60.00% 60.00%

Publicador:

Resumo:

A spectral angle based feature extraction method, Spectral Clustering Independent Component Analysis (SC-ICA), is proposed in this work to improve the brain tissue classification from Magnetic Resonance Images (MRI). SC-ICA provides equal priority to global and local features; thereby it tries to resolve the inefficiency of conventional approaches in abnormal tissue extraction. First, input multispectral MRI is divided into different clusters by a spectral distance based clustering. Then, Independent Component Analysis (ICA) is applied on the clustered data, in conjunction with Support Vector Machines (SVM) for brain tissue analysis. Normal and abnormal datasets, consisting of real and synthetic T1-weighted, T2-weighted and proton density/fluid-attenuated inversion recovery images, were used to evaluate the performance of the new method. Comparative analysis with ICA based SVM and other conventional classifiers established the stability and efficiency of SC-ICA based classification, especially in reproduction of small abnormalities. Clinical abnormal case analysis demonstrated it through the highest Tanimoto Index/accuracy values, 0.75/98.8%, observed against ICA based SVM results, 0.17/96.1%, for reproduced lesions. Experimental results recommend the proposed method as a promising approach in clinical and pathological studies of brain diseases

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Given a graph G and a set X ⊆ V(G), the relative Wiener index of X in G is defined as WX (G) = {u,v}∈X 2  dG(u, v) . The graphs G (of even order) in which for every partition V(G) = V1 +V2 of the vertex set V(G) such that |V1| = |V2| we haveWV1 (G) = WV2 (G) are called equal opportunity graphs. In this note we prove that a graph G of even order is an equal opportunity graph if and only if it is a distance-balanced graph. The latter graphs are known by several characteristic properties, for instance, they are precisely the graphs G in which all vertices u ∈ V(G) have the same total distance DG(u) = v∈V(G) dG(u, v). Some related problems are posed along the way, and the so-called Wiener game is introduced.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Financial inclusion for inclusive growth is central to the developmental philosophy of most of the nations over the past decade. It has been a priority for policy makers and regulators in financial sector development for improving access and usage of financial services to achieve comprehensive financial inclusion. The initiatives taken towards financial inclusion can promote a more effective and efficient process to achieve significant improvements in financial inclusion are to establish and achieve shared and sustainable development and growth. Realising this, an increasing number of countries are committing to promote financial inclusion, encouraged by the growing body of country level experiences (World Bank, 2012). Financial inclusion basically means, broad based growth through participation as well as sharing the benefits from the growth process along with the under privileged and marginal segments of the economy. Evidence suggests that it has substantial benefits for equitable and sustainable growth. Inclusive growth ensures that while economy grows rapidly, all segments of society are involved in this growth process, ensuring equal opportunities, devoid of any regional or sectoral disparitiesIt is widely acknowledged that the objective ofinclusive growth is accomplished through the process of financial inclusion. Financial inclusion envisages bringing everyone, irrespective of financial status, into the banking fold for the individual progress and development and thereby achieving comprehensive growth with equity