Research Article  Open Access
Metric Induced Morphological Operators on Intuitionistic Fuzzy Hypergraphs
Abstract
A hypergraph consisting of hyperedges and nodes can be made intuitionistic fuzzy hypergraph (IFHG) by assigning membership and nonmembership degrees for both nodes and edges. Just as a hypergraph, an IFHG is also having hyperedges consisting of many nodes. Many flavours of a given IFHG can be created by applying morphological operators like dilation, erosion, adjunction, etc. The focus of this paper is to define morphological adjunction, opening, closing, and Alternative Sequential Filter (ASF) on IFHG. The system modeled in this way finds application in text processing, image processing, network analysis, and many other areas.
1. Introduction
Let be an intuitionistic fuzzy hypergraph with nodes and hyperedges . is the set of nodes with membership degree and non membership degree . Depending on the membership degree , the node can be treated as high priority, medium priority, and low priority. The non membership degree . The sum of the membership degree and non membership degree of the node is less than or equal to 1 [1], i.e., . is the set of hyperedges with membership degree and non membership degree . If all the nodes in a hyperedge have , then is the supremum of all in that edge. In such a case . If there is at least one node with , then of that edge is the supremum of all in that edge. In such a case . If all the nodes of an edge are having , then its = = 0.5. The sum of the membership degree and non membership degree of the hyperedge is less than or equal to 1 [1], i.e., . Depending on the membership degree , the hyperedge can be treated as high priority, medium priority, and low priority. Since can take any value from 0.0 to 1.0, priorities are not limited to the above three. Also range priorities can be set for nodes and edges. Morphological operations like dilation, erosion, adjunction are already defined on hypergraphs [2]. Dilation operation [3] and erosion [4] is already defined on IFHG. The purpose of this paper is to define adjunction, opening, closing, and ASF on IFHG.
2. Related Works
Many morphological operators [5] like dilation, erosion, adjunction, and duality were applied on lattice of all subgraphs, where these are further applied in binary and grey scale image denoising. The authors have designed filters for which graph is both the input and the output. Various edgevertex correspondences [6], edgevertex adjunctions, vertex dilation, vertex erosion, edge dilation, edge erosion, graph dilation, graph erosion, opening, closing filters, half opening, and half closing on graphs, are illustrated with examples which finds application in image filtering. Images were represented using set union [7] of hyperedges and were subjected to contraharmonic mean filter for salt and pepper noise removal. The method gave better results in terms of visual quality, peak signal to noise ratio, and mean absolute error. A framework was proposed to build morphological operators for analyzing and filtering objects defined on simplicial complex spaces [8] where a simplex is any finite nonempty set. This finds application in mesh and image filtering. Applications of mathematical morphology to weighted graphs [9] were also developed. By converting the image to a tree representation, the authors have shown how to filter the image using connected filters. Mathematical morphology [10], which is the basis of morphological image processing, finds application in the field of digital image processing, area of graphs, surface mesh, solids, and other spatial structures.
Now coming to the field of hypergraphs, lattice structures on hypergraphs introduced in [11] have shown many properties like partial ordering, infimum, supremum, isomorphism, etc. The authors also introduced complete lattice, dualities, discrete probability distribution on vertices and hypergraph similarity based on dilation. Mathematical morphology of hypergraphs were also used for classification or matching problems [12] on data represented by hypergraphs. As an example, the authors have applied it on a 2D image and they proposed further applications of hypergraph in image analysis. New similarity measures and pseudometrics on lattices of hypergraphs are detailed in [13] which can be incorporated in existing system for hypergraphbased feature selection, indexing, retrieval, and matching.
Intuitionistic fuzzy graphs [14] are used for clustering with the help of many operations like complement, join, union, intersection, ringsum, Cartesian product, composition, etc. The concepts like cut, edge strength, incidence matrix of an IFHG [1] are also used in clustering. Isomorphism between two IFHG and the Cartesian product of two IFS over the same universe are detailed in [15], where they also illustrated indegree and outdegree of vertex , weak isomorphism, and coweak isomorphism. A hypernetwork [16] can be created with processors as vertices and connections between the processors modeled as hyperedge. Radio coverage networks in a geographic region can be modeled with radio receivers as vertices, where the membership values signify the quality of reception of a station/radio. The authors also proposed further research in intuitionistic fuzzy soft hypergraphs and rough hypergraphs. An application with intuitionistic fuzzy sets for career choice [17] which is a decisionmaking system was developed where the system represented the performance of students using membership, nonmembership, and hesitation margin. They applied normalized Euclidian distance to determine the apt career choice. Operations on transversals of IFDHG, their union, intersection, addition, structural subtraction, multiplication, and complement are defined and discussed in [18]. The authors also propose to work on application in coloring of IFHG. Generalized strong IFHG (GSIFHG), spanning IFHG, and generalized strong spanning IFHG were discussed in [19], which can be used to analyze the structure of a system and to represent a partition, covering, and clustering.
3. Preliminary Definitions
Let us define , where and as given in Figure 1. Here nodes with low priority are having , nodes of medium priority are having , and nodes of high priority are with . Let be obtained by cut on . Let be obtained by cut on . Here corresponds to membership degree and corresponds to nonmembership degree. The details of the IFHGs , , and are given in Tables 1, 2, and 3, respectively.



Given the above intuitionistic fuzzy hypergraphs, namely, , , and , we can apply morphological operations like dilation and erosion on them. These operations in turn retrieve subIFHGs which are of various priorities. Some of them will be high priority, medium priority, and low priority or different combinations of these. Here is the dilation operator. Let us define as the set of all nodes within the hyperedges in . This operation will retrieve only priority nodes (high/medium), since the hyperedges in itself are of high priority. Now is the set of hyperedges in which consists of nodes in . This operation can retrieve all hyperedges in and also some low/medium priority edges in which contain those high priority nodes in . Let us define erosion with the help of the operator . Now is the set of all hyperedges in which consists of nodes of only. This will retrieve only priority edges. Similarly is the set of all nodes in but not in . This will retrieve priority nodes within only and not seen in any other edges.
4. Adjunction of IFHG
The adjunctions that we are going to state here are already defined on hypergraphs in [2]. We are extending these adjunctions to IFHG.
Proposition 1. Let be the intuitionistic fuzzy hypergraph and let and be the subIFHGs, be the erosion operator, and be the dilation operator. We observe that are adjunctions if the following holdsand
Proof. Let us consider erosion operator ; let be an edge in . That is, . We know that . Since , we get . Therefore . This edge is a priority edge in . Now let us consider dilation operator . Let be a node in , i.e., . Since , . Therefore . Therefore . This node is definitely a priority node of .
Illustration. Let us check their results on IFHG by considering , , and IFHGs. Here, in R.H.S of (1), means the set of edges in , which consists of nodes in only. That is, . This operation returns the high priority edges in . Now we know as the hyperedges in X, i.e., . Therefore . Now in L.H.S of (2), find which is the set of nodes in edges of . That is, . This operation returns priority nodes in which are part of . We get as the nodes in Y. That is, . We find that . Therefore are adjunctions and the results are shown in Figure 2.
Proposition 2. Let be the intuitionistic fuzzy hypergraph; let and be the subIFHGs, be the erosion operator, and be the dilation operator. We observe that if are adjunctions thenand
Proof. Let be an edge in , i.e.,theni.e.,Let us consider R.H.S of (3). Let be an edge of , i.e., . That is,Equation (3) is implied from (7) and (8). The edge is a priority edge present in .
Consider L.H.S of (4). Let be a node in , i.e., , i.e., . So we can write . That is,Now consider R.H.S of (4). Let be a node of , i.e., . We getEquation (4) is implied from (9) and (10).
Illustration. In L.H.S of (3), is the set of edges in , which consists of any node . We know that . Thus . Therefore . Both these operations return priority edges in and the same are shown in Figures 3(a) and 3(b), respectively. Now consider L.H.S of (4), which is the set of nodes in . That is, = . Now = . Now . We get as the set of nodes in which are not in . That is, .
5. Materials and MethodsConstruction of Various IFHG Filters
A filter is something which gives the same result if a function is repeatedly applied on it. Consider a water/sand filter where the filtrate on repeated passage through the same filter gives the same filtrate. Similarly in the case of a IFHG, a filter applied on a subIFHG should produce the same set of edges and nodes even if it is filtered many times. If is the dilation operator and is the erosion operator, is an opening filter and is a closing filter.
5.1. Half Opening Filter with Respect to Nodes
If is the parent IFHG, is the subIFHG, is the dilation operator, and is the erosion operator, then is a half opening filter with respect to the nodes in . Here is the set of edges in which consists of only. That is, . Now is the set of nodes within those edges. That is, . This will retrieve all nodes within all edges in . To this result if we apply half opening again, it will retrieve the same set of nodes. Thus we can prove that half opening is a filter. Here only a part of is retrieved as shown in Figure 4(a).
5.2. Half Opening Filter with Respect to Hyperedges
If is the parent IFHG, is the subIFHG, is the dilation operator, and is the erosion operator, then is a half opening filter with respect to the hyperedges in . Here is the set of all nodes in but not in . That is, . Now is the set of all hyperedges in which consists of such nodes. That is, . Here is the filtrate obtained. If we repeatedly apply to this filtrate, we get the same results. Thus this half opening is a filter as shown in Figure 4(b).
5.3. Half Closing Filter with Respect to Hyperedges
If is the parent IFHG, is the subIFHG, is the dilation operator, and is the erosion operator, then is a half closing filter with respect to the hyperedges in . Here is the set of nodes within the hyperedges of . That is, . Now is the set of all edges in which consists of the above nodes only. That is, . Here only a part of is retrieved as seen in Figure 4(c).
5.4. Half Closing Filter with Respect to Nodes
If is the parent IFHG, is the subIFHG, is the dilation operator, and is the erosion operator, then is a half closing filter with respect to the nodes in . Here is the set of all edges in which has nodes in . That is, . Now is the nodes not in . From the given example, . Now . The result is shown in Figure 4(d).
6. Metric Induced Opening and Closing Filters
We can consider as a metric induced opening where is a natural number which shows the number of edges/nodes to be included in the retrieved subIFHG after opening operation. That is, . Similarly is a metric induced closing, where is the number of edges/nodes to be included in the result after closing. Here should be from 1 to number of elements in . So let us see different flavours of and .
6.1. Metric Induced Opening with Respect to Nodes
If is a parent IFHG, is a subIFHG, is the dilation operator, and is the erosion operator, then is a metric induced opening with respect to the nodes where top nodes with high membership degrees are selected. Here not all nodes in are retrieved. Only top priority nodes are retrieved. The results of this opening are shown in Figures 5(a)–5(f). Here takes a maximum value of 6, since returns a maximum of only 6 nodes with respect to IFHGs in Figure 1.
6.2. Metric Induced Opening with Respect to Hyperedges
If is a parent IFHG, is a subIFHG, is the dilation operator, and is the erosion operator, then is a metric induced opening with respect to the hyperedges where top edges with high membership degrees are selected. Here takes a maximum value of 2, since returns only maximum of 2 edges with respect to IFHGs in Figure 1. The results of this opening are shown in Figures 6(a) and 6(b) for different values of .
6.3. Metric Induced Closing with Respect to Hyperedges
If is a parent IFHG, is a subIFHG, is the dilation operator, and is the erosion operator, then is a metric induced closing with respect to the hyperedges where top edges with high membership degrees are selected. Here takes a maximum value of 2, since returns only 2 edges with respect to IFHGs in Figure 1. The results of this closing operation are shown in Figures 6(c) and 6(d) for different values of .
6.4. Metric Induced Closing with Respect to Nodes
If is a parent IFHG, is a subIFHG, is the dilation operator, and is the erosion operator, then is a metric induced closing with respect to nodes where top nodes from edges which contain and which do not belong to the complement edges are selected. Here takes a maximum value of 10, since returns a maximum of 10 nodes with respect to IFHGs in Figure 1. The results of this closing are shown in Figures 7(a)–7(j) for various values of .
7. Alternate Sequential Filters
If is a parent IFHG, is a subIFHG, is an opening of the form , and is a closing operator of the form , then is also a filter. Now an alternate sequential filter can be obtained as . The operations repeated number of times will retrieve the same set of hyperedges/nodes for a particular value of , but we can have different results by varying the value of .
7.1. Illustration
Consider as a parent IFHG and as a subIFHG as shown in Figures 8(a) and 8(b), respectively. Let us apply on these IFHGs. In Figure 8, those marked in black represent the node numbers and those in red show the edge numbers. Let . Since the value of is determined by the maximum nodes retrieved by , we get in . We get . Now . Now . We get . Now , where = 13. Applying to these nodes will again retrieve the same set of nodes for the value. Different results can be obtained for 1 for which algorithm is shown above. The results of this ASF for value are shown in Figure 9 (Algorithm 1).

(a)
(b)
8. Applications
Modeling systems with intuitionistic fuzzy Hypergraphs find application in the field of medical report processing, where a patient can be modeled as a hyperedge and the symptoms can be modeled as nodes. When multiple patients are having the same symptom, such a node forms part of multiple edges. In Figure 10(a), symptom 5 is present in all the three patients. An IFHG constructed in this way can be subjected to many information retrieval operations. Membership and non membership values can be assigned to different nodes/symptoms based on the severity of the symptoms. Likewise membership and nonmembership values can be assigned to patients following the rules given in Section 1. IFHG modeling can be done in the area of social networking where a network group can be modeled as a hyperedge and the members/nodes of the network group can be converted to nodes. One member may be part of many network groups as shown in Figure 10(b). They can be assigned different membership value based on their life/character background.
(a)
(b)
The systems modeled in this way can be subjected to various morphological operations like dilation, erosion, adjunction, opening, closing, and filtering. An cut can be applied on the medical report IFHGs to find sub IFHG . Let us consider this subIFHG as the set of all patients with severe diseases and set of all severe symptoms. Let be the subIFHG of Figure 10(b), which consists of all blacklisted groups and low priority members. The operations applied to this and are given in Table 4. All these operations can be further expanded to opening, closing, filtering, etc. A detailed medical analysis of patients in a particular area can be done with such systems which opens a wide range of possibilities.

9. Data Availability, Results, and Discussion
The filters mentioned in this paper are tested on IFHGs consisting of maximum of 9,000 nodes. The method has shown 100% accurate results. The dataset can be produced on demand. The ASF algorithm designed on IFHG has a complexity of , since we are searching through the hyperedges and nodes within those hyperedges. The parameters and are working as filter parameters, since a high value of these parameters results in less amount of filtrate and low value of these parameters results in large amount of filtrate. With respect to text processing application using medical reports, patients with “minor," “moderate," “major," and “extreme" medical conditions are retrieved, when we vary the cut. The algorithm to find the optimal number of nodes/hyperedges in ASF iterates till the following condition is satisfied:where is an opening filter, is a closing filter, is an ASF, and is the cardinality of the filter. In (11), is a positive number. The algorithm converges when . Also the algorithm may exit without an output if no subIFHG is obtained after cut. That is, in terms of medical report analysis we can say that if we have set cut such as to retrieve patients with “extreme" medical condition and if the area considered for analysis is not having such patients, then the algorithm exits without generating an output. In such a case we have to reduce the level of cut such as to retrieve all patients in that area with “major" medical conditions. Likewise when we set the level of cut such as to retrieve patients in the area with “minor" medical conditions and get an empty subIFHG, this implies that the area under consideration is the one with “good" medical conditions.
10. Conclusion
Here we have successfully defined the morphological operations like adjunction, opening, closing, half opening, half closing, and alternate sequential filter on intuitionistic fuzzy hypergraph. The results are substantiated with sample parent IFHG and subIFHG. Such filter designs find application in image processing, text processing, computer networks, etc. The cut used to generate the subhypergraphs can be varied with different values of . Different subhypergraphs with varying cuts when applied with the above morphological operators will produce results accordingly with various priority ranges of hyperdges/nodes. One who is working with text/image processing and network analysis can find numerous applications with these operations. A filter designed on text results in text summary. Such applications are left as future enhancements of this paper.
Data Availability
The filters mentioned in this article are tested on IFHGs consisting of maximum 9,000 nodes. The method has shown 100% accurate results. The dataset can be produced on demand.
Conflicts of Interest
The authors declare that there are no conflicts of interest regarding the publication of this paper.
References
 R. Parvathi, S. Thilagavathi, and M. G. Karunambigai, “Intuitionistic fuzzy hypergraphs,” Cybernetics and Information Technologies, vol. 9, no. 2, pp. 46–53, 2009. View at: Google Scholar  MathSciNet
 B. Kannan, S. Bino, A. Unnikrishnan, and P. B. Ramkumar, “Morphological filtering on Hypergraphs,” https://arxiv.org/abs/1402.4258. View at: Google Scholar
 P. M. Dhanya, A. Sreekumar, M. Jathavedan, and P. B. Ramkumar, “Algebra of morphological dilation on intuitionistic fuzzy hypergraphs,” International journal of Scientific Research in Science, Engineering and Technology, vol. 4, no. 1, pp. 300–308, 2018. View at: Google Scholar
 P. M. Dhanya, A. Sreekumar, M. Jathavedan, and P. B. Ramkumar, “On constructing morphological erosion of intuitionistic fuzzy hypergraphs,” Journal of Analysis, Springer, 2018. View at: Google Scholar
 J. Cousty, N. Laurent, D. Fabio, and J. Serra, “Morphological filtering on graphs,” in Computer Vision and Image Understanding, pp. 1–20, Elsevier, https://hal.archivesouvertes.fr/hal00700784v1. View at: Google Scholar
 J. Cousty, L. Najman, and J. Serra, “Some morphological operators in graph spaces,” in Mathematical morphology and its application to signal and image processing, vol. 5720 of Lecture Notes in Comput. Sci., pp. 149–160, Springer, Berlin, Germany, 2009. View at: Publisher Site  Google Scholar  MathSciNet
 R. Dharmarajan and K. Kannan, “A hypergraphbased algorithm for image restoration from salt and pepper noise,” AEÜ  International Journal of Electronics and Communications, vol. 64, no. 12, pp. 1114–1122, 2010. View at: Publisher Site  Google Scholar
 F. Dias, J. Cousty, and L. Najman, “Some morphological operators on simplicial complex spaces,” in Discrete Geometry for Computer Imagery, vol. 6607 of Lecture Notes in Comput. Sci., pp. 441–452, Springer, 2011. View at: Publisher Site  Google Scholar  MathSciNet
 L. Najman and F. Meyer, “Fernand Meyer et.al. A short tour of mathematical morphology on edge and vertex weighted graphs,” Image Processing and Analysis with Graphs: Theory and Practice, pp. 141–174, 2012. View at: Google Scholar
 L. Najman and H. Talbot, Mathematical Morphology, from Theory to Applications, John Wiley & Sons, Inc., Hoboken, NJ, USA, 2013. View at: Publisher Site
 I. Bloch and A. Bretto, “Mathematical morphology on hypergraphs: preliminary definitions and results,” in Discrete Geometry for Computer Imagery, vol. 6607 of Lecture Notes in Comput. Sci., pp. 429–440, Springer, 2011. View at: Publisher Site  Google Scholar  MathSciNet
 I. Bloch and A. Bretto, “Mathematical morphology on hypergraphs, application to similarity and positive kernel,” Computer Vision and Image Understanding, vol. 117, no. 4, pp. 342–354, 2013. View at: Publisher Site  Google Scholar
 I. Bloch, A. Bretto, and A. Leborgne, “Similarity between Hypergraphs Based on Mathematical Morphology,” in Mathematical Morphology and Its Applications to Signal and Image Processing, vol. 7883 of Lecture Notes in Computer Science, pp. 1–12, Springer Berlin Heidelberg, Berlin, Germany, 2013. View at: Publisher Site  Google Scholar
 R. Parvathi, S. Thilagavathi, and M. G. Karunambigai, “Operations on intuitionistic fuzzy hypergraphs,” International Journal of Computer Applications, vol. 51.5, pp. 46–54, 2012. View at: Google Scholar
 R. Parvathi, S. Thilagavathi, and K. T. Atanassov, “Isomorphism on Intuitionistic Fuzzy Directed Hypergraphs,” International Journal of Scientific and Research Publications, pp. 1–8, 2013. View at: Google Scholar
 M. Akram and W. A. Dudek, “Intuitionistic fuzzy hypergraphs with applications,” Information Sciences, vol. 218, pp. 182–193, 2013. View at: Publisher Site  Google Scholar  MathSciNet
 P. A. Ejegwa, A. J. Akubo, and O. M. Joshua, “Intuitionistic fuzzy set and its application in career determination via normalized Euclidean distance method,” European Scientific Journal, vol. 10, pp. 529–536, 2014. View at: Google Scholar
 K. Myithili and R. Parvathi, “Transversals of intuitionistic fuzzy directed hypergraphs,” Notes on IFS, vol. 21, pp. 66–79, 2015. View at: Google Scholar
 T. K. Samanta and S. Mohinta, “Generalized strong intuitionstic fuzzy hypergraph,” Mathematica Moravica, vol. 18, no. 1, pp. 55–65, 2014. View at: Publisher Site  Google Scholar  MathSciNet
Copyright
Copyright © 2018 P. M. Dhanya et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.