Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

For a graph G, let D (G) be the set of all strong orientations of G. The orientation number of G is (Formula presented), where d(D) denotes the diameter of the digraph D. In this paper, we consider the problem of determining the orientation number of three complete graphs with linkages. © 2021

Department of Mathematics

School of Advanced Sciences

Vellore Campus

World University root node

Turkish World Mathematical Society Journal of Applied and Engineering Mathematics

THE ORIENTATION NUMBER OF THREE COMPLETE GRAPHS WITH LINKAGES

Medical imaging requires capturing different aspects of a human body. To capture tissues, cartilages, bones and nerves one needs different sensors and different modalities which results in different images from each modality of the same body part. Image fusion is a process by which one can fuse such images from different modalities in a single image. In this paper, a novel DWT-type2 fuzzy method is proposed to fuse two images (CT and MRI images). In this method, initially, the source images are decomposed into low-level and high-level subbands by discrete wavelet transformation (DWT). As the second step, for fusion, Type-2 fuzzy technique is applied on a low-level subband and average fusion method is applied on the high-level subbands in order to enhance the most prominent features present in CT image and MRI image. Finally, the fused low-level subband and highlevel subbands are reconstructed to form the final fused image using inverse-DWT. To test the proposed fusion method, the experiment is carried out on the MRI-T2 image, functional MRI image and CT image. The fused images have been subjectively and objectively evaluated based on certain evaluation measures and the obtained results have been presented in the paper. From the results, one can observe that the proposed method provides an improvement over other primitive fusion methods.

VIT Unitversity

Department of Information Security

School of Computer Science and Engineering

International Journal of Intelligent Engineering and Systems

CT and MRI Image Fusion Based on Discrete Wavelet Transform and Type-2 Fuzzy Logic

For two vertices u and v in a strong digraph D, the strong distance between u and v is the minimum number of arcs of a strong subdigraph of D containing u and v. The strong eccentricity of a vertex v of D is the strong distance between v and a vertex farthest from v. The strong diameter (strong radius) of D is the maximum (minimum) strong eccentricity among all vertices of D. The lower orientable strong diameter (lower orientable strong radius), sdiam(G) ( srad(G) ), of a 2-edge-connected graph G is the minimum strong diameter (minimum strong radius) over all strong orientations of G. In this paper, a conjecture of Chen and Guo is disproved by proving sdiam(K3 □ K3) = sdiam(K3 □K4) = 5, sdiam(Km □ Pn) is determined, sdiam(G) and srad(G) for cycle vertex multiplications are computed, and some results concerning sdiam(G) are described.

ARS Combinatoria

Lower orientable strong diameter and strong radius of some graphs

The contrast enhancement, brightness preserving and natural look of the output image plays an important role in an infrared (IR) image enhancement process. There are several IR image enhancement algorithms that have been developed, but they may produce artificial looking images, and the images derived from these methods are not suitable for applications such as surveillance, environmental monitoring and so on. In this paper, an algorithm using new top-hat transform and multi-scale sequential toggle operator has been proposed. Firstly, a new white top-hat transform and new black top-hat transform is generated to extract the light and dark regions of the image. Then, the multi-scale sequential toggle operator is used on the extracted light and dark regions to get a sequence of regions. Ultimately, the final image is extracted from a sequence of images. To test the proposed method, the experiment is carried out on the OSU thermal bench mark database images. The enhanced image results have been compared with the popular existing methods such as Histogram Equalization (HE) and Adaptive Histogram Equalization (AHE), max-median (3 × 3) using various evaluation measures. From the results, it is observed that the proposed method works better than the existing methods. © 2017 IEEE.

2017 Innovations in Power and Advanced Computing Technologies (i-PACT)

Adaptive new top-hat transform and multi-scale sequential toggle operator based infrared image enhancement

Stanton and Kocay defined a butterfly factorization for the complete graph K2n and gave a construction for all values of n. Based on the factor of the factorization we give new butterfly factorizations for the complete graph K4t+2.

Bulletin the Institute of Combinatorics and its Applications

Butterfly decompositions of some complete graphs of even order

For a graph G, let D(G) be the set of all strong digraphs D obtained by the orientations of G. The orientation number of G is &nbsp;min {d(D)| D ∈ D(G)}, where d(D) denotes the diameter of the digraph D. In this paper, we determine the orientation number for some subgraphs of complete bipartite graphs.

Transactions on Combinatorics

OPTIMAL ORIENTATIONS OF SUBGRAPHS OF COMPLETE BIPARTITE GRAPHS

For a graph G, let D(G) be the set of all strong orientations of G. The orientation number of G is (Formula Presented), where d(D) denotes the diameter of the digraph D. In this paper, we determine the orientation number for some complete tripartite graphs. © 2015, University of Nis. All rights reserved.