|
|
| Line 1: |
Line 1: |
| '''Near sets''' are [[disjoint sets]] that resemble each other. Resemblance between disjoint sets occurs whenever there are observable similarities between the objects in the sets. Similarity is determined by comparing lists of object feature values. Each list of feature values defines an object's description. Comparison of object descriptions provides a basis for determining the extent that disjoint sets resemble each other. Objects that are perceived as similar based on their descriptions are grouped together. These groups of similar objects can provide information and reveal patterns about objects of interest in the disjoint sets. For example, collections of digital images viewed as disjoint sets of points provide a rich hunting ground for near sets.
| |
|
| |
|
| Near set theory provides methods that can be used to extract resemblance information from objects contained in disjoint sets, ''i.e.'', it provides a formal basis for the observation, comparison, and classification of objects. The discovery of near sets begins with choosing the appropriate method to describe observed objects. This is accomplished by the selection of probe functions representing observable object features. A probe function is a mapping from an object to a real number representing a feature value. For example, when comparing fruit such as apples, the redness of an apple (observed object) can be described by a probe function representing colour, and the output of the probe function is a number representing the degree of redness (or whatever colour apple you prefer to eat). Probe functions provide a basis for describing and discerning affinities between objects as well as between groups of similar objects. Objects that have, in some degree, affinities are considered near each other. Similarly, groups of objects (''i.e.'' sets) that have, in some degree, affinities are also considered near each other.
| |
|
| |
|
| Near sets offer a framework for solving problems based on human [[perception]] that arise in areas such as [[image processing]], [[computer vision]] as well as engineering and science problems. In near set theory, perception is a combination of the view of perception in [[psychophysics]] with a view of perception found in [[Maurice Merleau-Ponty|Merleau-Ponty's]] work. In the context of psychophysics, perception of an object (''i.e.'', in effect, knowledge about an object) depends on signal values gathered by our senses. In this view of perception, our senses are likened to probe functions by considering them as mappings of stimuli to sensations that are a source of values assimilated by the mind. A human sense modelled as a probe measures observable physical characteristics of objects in our environment. The sensed physical characteristics of an object are identified with object features. In Merleau-Ponty's view, an object is perceived to the extent that it can be described. In other words, object description goes hand-in-hand with object perception. It is the mind that identifies relationships between object descriptions to form perceptions of sensed objects. It is also the case that near set theory has been proven to be quite successful in finding solutions to perceptual problems such as measuring image correspondence and segmentation evaluation.
| | Today, there are several other types of web development and blogging software available to design and host your website blogs online and that too in minutes, if not hours. Thus, it is important to keep pace with this highly advanced age and have a regular interaction with your audience to keep a strong hold in the business market. This is a service where people write articles using a specific keyword you have given them. s and intelligently including a substantial amount of key words in the title tags, image links, etc. Understanding how Word - Press works can be a challenge, but it is not too difficult when you learn more about it. <br><br>Word - Press is known as the most popular blogging platform all over the web and is used by millions of blog enthusiasts worldwide. Wordpress have every reason with it which promote wordpress development. This is the reason for the increased risk of Down Syndrome babies in women over age 35. So if you want to create blogs or have a website for your business or for personal reasons, you can take advantage of free Word - Press installation to get started. Akismet is really a sophisticated junk e-mail blocker and it's also very useful thinking about I recieve many junk e-mail comments day-to-day across my various web-sites. <br><br>Minor and medium sized corporations also have a lot to obtain by shelling out in a very good website. As of now, Pin2Press is getting ready to hit the market. I've applied numerous Search engine optimization-ready Word - Press themes and I can say from knowledge that I consider the Genesis Search engine marketing panel one particular of the simplest to use. Newer programs allow website owners and internet marketers to automatically and dynamically change words in their content to match the keywords entered by their web visitors in their search queries'a feat that they cannot easily achieve with older software. If you've hosted your Word - Press website on a shared hosting server then it'll be easier for you to confirm the restricted access to your site files. <br><br>Word - Press installation is very easy and hassle free. And, make no mistake,India's Fertility Clinics and IVF specialists are amongst the best in the world,and have been for some time. Next you'll go by way of to your simple Word - Press site. There are many advantages of hiring Wordpress developers for Wordpress project development:. Here is more on [http://topne.ws/WordpressDropboxBackup360237 wordpress backup plugin] stop by our web page. Now all you have to do is log into your Word - Press site making use of the very same username and password that you initially had in your previous site. <br><br>Someone with a basic knowledge of setting up a website should be able to complete the process in a couple of minutes however even basic users should find they are able to complete the installation in around 20 minutes by following the step by step guide online. In fact portfolio Word - Press themes is a smooth and attractive but considerably flawed Word - Press theme in creating simpler to the photographers or designers to develop a specific internet site showcasing their most current perform since it appear modern-day and has fantastic typography and large photographs which would develop an attractive wanting portfolio internet site. While deciding couple should consider the expertise of the doctor,clinics success rate,the costs of fertility treatment,including fertility tests and IVF costs and overall ones own financial budget. Web developers and newbies alike will have the ability to extend your web site and fit other incredible functions with out having to spend more. Verify whether your company has a team of developers or programmers having hands-on experience and knowledge about all Word - Press concepts. |
| | |
| [[File:Set partition.svg|right|thumb|A [[partition of a set|partition]] of a set]]
| |
| | |
| {{TOClimit|limit=3}}
| |
| | |
| == History ==
| |
| [[File:Rough set.svg|right|thumb|Example of a [[rough set]]]]
| |
| It has been observed that mathematical topics emerge and evolve through interactions among many researchers. This was the case with the discovery of near sets. Work on a perceptual basis for near sets began in 2002, motivated by digital image analysis. It was inspired by a study of the perception of nearness of familiar objects carried out by [[Zdzislaw Pawlak|Z. Pawlak]] and J.F. Peters.<ref>Z. Pawlak, Z. Peters, J.F. Jak blisko (How near), Systemy Wspomagania Decyzji I (2002, 2007) 57, 109, ISBN 83-920730-4-5 [http://witch.ii.pw.edu.pl/rseisp07/presentations/RSEISP07/Day_1/_Commemorative_session/RSEISP07-ZP-wspomnienia.pdf (available here)]. The intuition that led to the discovery of near sets is given in ''How near''.</ref> In this context, ''nearness'' is interpreted to mean ''closely corresponding to or resembling an original''. This collaboration was important in paving the way toward a description-based approach to exploring the nearness of sets.
| |
| | |
| Excitement grew after 2002, when it became apparent that it was possible to introduce measures of nearness based on similarities between classes contained in coverings of disjoint sets (''e.g.'', this is possible if we define coverings of sets representing digital images and then look for similarities between the images such as shades of green in one landscape that resemble one or more shades of green in another landscape). In this context the term ''similarity'' means resemblance between two or more individual objects or sets of objects and almost equal patterns in compared items. Collaboration between J.F. Peters, A. Skowron, and J. Stepaniuk led to a formal basis for the nearness of objects considered in the context of [[proximity space]]s.<ref>Peters J., Skowron, A. Stepaniuk, J. Nearness of objects: Extension of approximation space model. Fundamenta Informaticae 79, 3-4, 2007, 497-512 [http://portal.acm.org/citation.cfm?id=1366089 (available here)]. Where a nearness relation is used to define a particular form of proximity space.</ref> Near sets and an approach to defining resemblance between sets was introduced by J.F. Peters in.<ref>Peters, J.F. Near sets. General theory about nearness of objects, Appl. Math. Sci. 1 (53) (2007) 2029–2609 [http://www.m-hikari.com/ams/ams-password-2007/ams-password53-56-2007/petersAMS53-56-2007.pdf (available here)]. Reminiscent of M. Pavel's approach, descriptions of objects are defined relative to vectors of values of real-valued functions called probes (Sect. 3, n. 2). See Pavel, M. Fundamentals of Pattern Recognition, in the Further reading section below, for the introduction of probe functions considered in the context of [[image registration]]. In the near set approach, a probe is viewed as a model for a sensor typically used in science and engineering. See, also, Peters, J.F., Wasilewski, P., Foundations of near sets, also listed in the Further reading section.</ref><ref>Peters, J.F. Near sets. Special theory about nearness of objects, Fundam. Inform. 75 (1–4) (2007) 407–433 [http://iospress.metapress.com/content/6l6xvxtabn9nh136 (available here)]. The basic distinction between near sets and rough sets is given (Remark 2.1). For a more detailed presentation of this topic, see Peters, J.F., Wasilewski, P., Foundations of near sets, listed in the Further reading section.</ref>
| |
| | |
| [[File:Near sets.svg|right|thumb|Example of near sets]]
| |
| | |
| Near set theory and its applications grew out of a generalization of the approach to the classification of objects proposed by [[Zdzislaw Pawlak|Z. Pawlak]] during his work on [[rough set]]s in the early 1980s, and E. Orłowska's work on approximation spaces. Briefly, a rough set can be described as follows. Consider a non-empty finite set of objects labelled <math>O</math>. The set <math>O</math> can be [[partition of a set|partitioned]] into cells (referred to as classes in near set theory) by grouping together objects that have similar descriptions (using one or more probe functions). A set <math>X\subset O</math> is considered rough when it cannot be formed completely by the union of classes from the partition of <math>O</math>. The set <math>X</math> is considered ''rough'' inasmuch as <math>X</math> cannot be fully described by probe functions selected to describe the individual objects of <math>O</math>.
| |
| | |
| Near sets are considered a generalization of rough sets, since it has been shown that every rough set is a near set but not every near set is a rough set. Near sets grew out of the idea that two or more rough sets can share objects with matching descriptions if they both contain objects belonging to the same class from the partition of <math>O</math>. When this occurs, the sets are considered near each other with respect to the classes contained in the partition.
| |
| | |
| == Definitions ==
| |
| '''Definition 1: Object'''
| |
| | |
| An ''object'' is anything that has its origin in the physical world.
| |
| | |
| An identifying characteristic of an object is that it must have some quantifiable features. The term ''feature'' is used in [[Satoshi Watanabe (physicist)|S. Watanabe's]] sense of the word, ''i.e.'', a feature corresponds to an observable property of physical objects. Each feature has a 1-to-many relationship to real-valued functions called probe functions representing the feature. For each feature (such as colour) one or more probe functions can be introduced to represent the feature (such as [[grayscale]], or [[RGB color model|RGB]] values). Objects and sets of probe functions form the basis of near set theory and are sometimes referred to as perceptual objects due to the focus on assigning values to perceived object features. A non-empty, finite set of objects is denoted by <math>O</math>.
| |
| | |
| '''Definition 2: Probe Function'''
| |
| | |
| A ''probe function'' is a real-valued function, <math>f:O\to\mathbb R</math>, representing a feature of an object.
| |
| | |
| Examples of probe functions are the colour, size, texture, edge-orientation, or weight of an object. Probe functions are used to describe an object to determine the characteristics and perceptual similarity of objects. Perceptual information is always presented with respect to probe functions just as our senses define our perception of the world. For example, our ability to view light in the ''visible spectrum'' rather than infra red or microwaves spectra defines our perception of the world just as the selection of probe functions constrains the amount of perceptual information available for feature extraction from a set of objects. The set of all probe functions is denoted by <math>\mathbb{F}</math>, and a set of specific probe functions for a given application is denoted by <math>\mathcal{B}\subseteq\mathbb{F}</math>
| |
| | |
| '''Definition 3: Perceptual System'''
| |
| | |
| A ''perceptual system'' <math> \langle O, \mathbb{F} \rangle </math> consists of a non-empty set <math>O</math> together with a set <math>\mathbb{F}</math> of real-valued functions.
| |
| | |
| The notion of a perceptual system admits a wide variety of different interpretations that result from the selection of sample objects contained in a particular sample space <math>O</math>. A recent example of a perceptual system is given by D. Hall.<ref>Hall, D. Automatic parameter regulation of perceptual systems. Image and Vision Computing 24, 8, 2006, 870-881 [http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V09-4K9C57K-6&_user=10&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1037015643&_rerunOrigin=google&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=3b4e645e375adb5b3b8f2c933a28cf5e (available here)].</ref> Two other examples of perceptual systems are: a set of microscope images together with a set of image processing probe functions, or a set of results from a web query together with some measures (probe functions) indicating, ''e.g.'', relevancy of the results.
| |
| | |
| '''Definition 4: Object Description'''
| |
| | |
| Consider a perceptual system <math> \langle O, \mathbb{F} \rangle </math>. The description of an object <math>x\in O, \phi_i\in \mathcal{B}\subseteq \mathbb{F}</math> is given by the vector
| |
| | |
| :<math>\boldsymbol{\phi}_{\mathcal{B}}(x) = (\phi_1(x),\phi_2(x),\ldots,\phi_i(x),\ldots,\phi_\ell(x)),</math>
| |
| | |
| where <math>l</math> is the length of the vector <math>\boldsymbol{\phi}</math>, and each <math>\phi_i</math> is a probe function belonging to the set <math>\mathcal{B}</math>.
| |
| | |
| '''Definition 5: Perceptual Indiscernibility Relation'''
| |
| | |
| Let <math>\langle O, \mathbb{F} \rangle</math> be a perceptual system. For every <math>\mathcal{B}\subseteq\mathbb{F}</math> the perceptual indiscernibility relation <math>\sim_{\mathcal{B}}</math> is defined as follows:
| |
| | |
| :<math>\sim_{\mathcal{B}} = \{(x,y)\in O \times O : \,\parallel \boldsymbol{\phi}_{\mathcal{B}}(x) - \boldsymbol{\phi}_{\mathcal{B}}(y)\parallel_{_2} = 0\},</math>
| |
| | |
| where <math>\parallel\cdot\parallel</math> represents the [[Norm (mathematics)|<math>L^2</math> norm]]. This is a refinement of the original indiscernibility relation given by [[Zdzislaw Pawlak|Pawlak]] in 1981. Using the perceptual indiscernibility relation, objects with matching descriptions can be grouped to form classes called elementary sets (also called an [[equivalence class]]) defined by
| |
| | |
| :<math>\mathbb{C}_{/\sim_{\mathcal{B}}} = \{o\in O\mid o\sim_{\mathcal{B}}c\,\forall\,c\in\mathbb{C}_{/\sim_{\mathcal{B}}}\}.</math>
| |
| | |
| Similarly, a [[equivalence class|quotient set]] is the set of all elementary sets defined as
| |
| | |
| :<math>O_{/\sim_{\mathcal{B}}} = \bigcup\{\mathbb{C}_{/\sim_{\mathcal{B}}}\}.</math>
| |
| | |
| '''Definition 6: Perceptual Tolerance Relation'''
| |
| | |
| When dealing with perceptual objects (especially, components in images), it is sometimes necessary to relax the equivalence condition of Defn. 5 to facilitate observation of associations in a perceptual system. This variation is called a perceptual tolerance relation. Let <math>\langle O, \mathbb{F} \rangle</math> be a perceptual system and let <math>\varepsilon\in\mathbb{R}</math>. For every<math>\mathcal{B}\subseteq\mathbb{F}</math> the tolerance relation <math>\cong_{\mathcal{B}}</math> is defined as follows:
| |
| | |
| :<math>\cong_{\mathcal{B},\epsilon} = \{(x,y)\in O \times O : \parallel\boldsymbol{\phi}_{\mathcal{B}}(x) - \boldsymbol{\phi}_{\mathcal{B}}(y)\parallel_{_2} \leq \varepsilon\}.</math>
| |
| | |
| For notational convenience, this relation can be written <math>\cong_{\mathcal{B}}</math> instead of<math>\cong_{\mathcal{B},\varepsilon}</math> with the understanding that <math>\epsilon</math> is inherent to the definition of the tolerance.<ref>Peters, J.F., Tolerance near sets and image correspondence. International Journal of Bio-Inspired Computation, 1, 4, 2009 [http://inderscience.metapress.com/app/home/contribution.asp?referrer=parent&backto=issue,2,6;journal,1,3;linkingpublicationresults,1:121374,1 (available here)].</ref>
| |
| | |
| Tolerance classes are defined in terms of preclasses. Let <math>A_{\mathcal{B},\varepsilon}</math> denote that <math>A\subset O</math> is a perception-based preclass. Given<math>A_{\mathcal{B},\varepsilon}</math>, then [[existential quantification|for all]] <math>x,y\in A, x\cong_{\mathcal{B},\epsilon} y</math>, ''i.e.'',
| |
| | |
| :<math> A_{\mathcal{B},\varepsilon}\ \mbox{is a preclass} \iff \forall x,y\in A, \parallel \boldsymbol{\phi}_{\mathcal{B}}(x) - \boldsymbol{\phi}_{\mathcal{B}}(y)\parallel_{_2} \leq \varepsilon.</math>
| |
| | |
| Let <math>\mathbb{C}_{\mathcal{B},\varepsilon}</math> denote a tolerance class, which, by definition, is a maximal preclass. For <math>x\in O</math>, we also use the notation<math>x_{/_{\cong_{\mathcal{B},\epsilon}}}</math> to denote a tolerance class containing <math>x</math>. Note, <math>\cong_{\mathcal{B},\epsilon}</math> [[Cover (topology)|covers]] <math>O</math> instead of [[Partition of a set|partitioning]] <math>O</math> because an object can belong to more than one class. In addition, each pair of objects <math>x, y</math> in <math>\mathbb{C}_{\mathcal{B},\epsilon}</math> must satisfy the condition <math>\parallel\boldsymbol{\phi}_{\mathcal{B}}(x) -\boldsymbol{\phi}_{\mathcal{B}}(y)\parallel_{_2}\leq\varepsilon</math>. Next, a [[Cover (topology)|covering]] of <math>O</math> defined by<math>\cong_{\mathcal{B},\epsilon}</math> is the union of all tolerance classes in the covering.
| |
| | |
| Notice that the tolerance relation <math>\cong_{\mathcal{B},\epsilon}</math> is a generalization of the indiscernibility relation given in Defn. 5 (obtained by setting <math>\varepsilon = 0</math>).
| |
| | |
| '''Definition 7: Weak Nearness Relation'''
| |
| | |
| Let <math>\langle O, \mathbb{F}\rangle</math> be a perceptual system and let <math>X,Y\subseteq O</math>. A set <math>X</math> ''is weakly near to'' a set <math>Y</math> (denoted <math>X \underline{\bowtie}_{\mathbb{F}} Y</math>) ''within'' the perceptual system <math>\langle O, \mathbb{F}\rangle</math> [[If and only if|iff]] there are <math>x \in X</math> and <math>y \in Y</math> and there is<math>\mathcal{B}\subseteq \mathbb{F}</math> such that <math>x \cong_{\mathcal{B}} y</math>. Notice that the image given in the [[Wikipedia:Lead section|lead section]] is actually an example of sets that are weakly near each other (with <math>\varepsilon = 0</math>).
| |
| | |
| '''Definition 8: Nearness Relation'''
| |
| | |
| Let <math>\langle O, \mathbb{F}\rangle</math> be perceptual system and let <math>X,Y \subseteq O</math>. A set <math>X</math> ''is near to'' a set <math>Y</math> (denoted <math>X\ \bowtie_{\mathbb{F}}\ Y</math>)''within'' the perceptual system <math>\langle O, \mathbb{F}\rangle</math> [[If and only if|iff]] there are <math>\mathbb{F}_1, \mathbb{F}_2 \subseteq \mathbb{F}</math> and <math>f\in \mathbb{F}</math> and there are <math>A \in O_{/\sim_{\mathbb{F}_1}}, B\in O_{/\sim_{\mathbb{F}_2}}, C\in O_{/\sim_{f}}</math> such that <math>A \subseteq X</math>, <math>B \subseteq Y</math> and <math>A,B \subseteq C</math>.
| |
| | |
| [[File:CoveringSVG.svg|thumb|500px|Examples of Defn.'s 7 & 8: (a) Example of Defn. 7, (b) example of <math>O_{/\sim_{\mathbb{F}_1}}</math>, (c) example of <math>O_{/\sim_{\mathbb{F}_2}}</math>, and (d) example of<math>O_{/\sim_f}</math> showing (together with (b) and (c)) that sets <math>X</math> and <math>Y</math> are near to each other according to Defn. 8.]]
| |
| | |
| == Examples ==
| |
| '''Simple Example'''
| |
| | |
| The following simple example highlights the need for a tolerance relation as well as demonstrates the construction of tolerance classes from real data. Consider the 20 objects in the table below with<math>|\phi(x_i)| = 1</math>.
| |
| | |
| :{| class="wikitable" style="text-align:center; width:30%" border="1"
| |
| |+ Sample Perceptual System
| |
| !<math>x_i</math> !! <math>\phi(x)</math> !! <math>x_i</math> !! <math>\phi(x)</math> !! <math>x_i</math> !! <math>\phi(x)</math> !!<math>x_i</math> !! <math>\phi(x)</math>
| |
| |-
| |
| |<math>x_1</math> || .4518 || <math>x_6</math> || .6943 || <math>x_{11}</math> || .4002 || <math>x_{16}</math> || .6079
| |
| |-
| |
| |<math>x_2</math> || .9166 || <math>x_7</math> || .9246 || <math>x_{12}</math> || .1910 || <math>x_{17}</math> || .1869
| |
| |-
| |
| |<math>x_3</math> || .1398 || <math>x_8</math> || .3537 || <math>x_{13}</math> || .7476 || <math>x_{18}</math> || .8489
| |
| |-
| |
| |<math>x_4</math> || .7972 || <math>x_9</math> || .4722 || <math>x_{14}</math> || .4990 || <math>x_{19}</math> || .9170
| |
| |-
| |
| |<math>x_5</math> || .6281 || <math>x_{10}</math> || .4523 || <math>x_{15}</math> || .6289 || <math>x_{20}</math> || .7143
| |
| |}
| |
| | |
| Letting <math>\varepsilon = 0.1</math> gives the following tolerance classes:
| |
| | |
| :<math>
| |
| \begin{align}
| |
| O = & \{ \{x_1, x_8, x_{10}, x_{11}\},\{x_1, x_9, x_{10}, x_{11}, x_{14}\},\\
| |
| & \{x_2, x_7, x_{18}, x_{19}\},\\
| |
| & \{x_3, x_{12}, x_{17}\},\\
| |
| & \{x_4, x_{13}, x_{20}\},\{x_4, x_{18}\},\\
| |
| & \{x_5, x_6, x_{15}, x_{16}\},\{x_5, x_6, x_{15}, x_{20}\},\\
| |
| & \{x_6, x_{13}, x_{20}\}\}.
| |
| \end{align}
| |
| </math>
| |
| | |
| Observe that each object in a tolerance class satisfies the condition <math>\parallel\boldsymbol{\phi}_{\mathcal{B}}(x) -\boldsymbol{\phi}_{\mathcal{B}}(y)\parallel_2\leq\varepsilon</math>, and that almost all of the objects appear in more than one class. Moreover, there would be twenty classes if the indiscernibility relation was used since there are no two objects with matching descriptions. Finally, using these objects, the sets
| |
| | |
| :<math> X = \{x_1, x_9\}</math> and <math> Y = \{x_{11}, x_{14}\},</math>
| |
| | |
| are weakly near each other. | |
| | |
| '''Image Processing Example'''
| |
| | |
| [[File:NearImages.svg|thumb|500px| Example of images that are near each other. (a) and (b) Images from the freely available LeavesDataset (see, ''e.g.'', www.vision.caltech.edu/archive.html).]]
| |
| | |
| The following example provides a more useful application of near set theory. Let a subimage be defined as a small subset of [[pixel]]s belonging to a digital image such that the pixels contained in the subimage form a square. Then, let the sets <math> X</math> and <math>Y</math> respectively represent the subimages obtained from two different images, and let <math>O = \{X \cup Y\}</math>. Finally, let the description of an object be given by the Green component in the [[RGB color model]]. The next step is to find all the tolerance classes using the tolerance relation. Using this information, tolerance classes can be formed containing objects that have similar (within some small <math>\varepsilon</math>) values for the Green component in the RGB colour model. Furthermore, images that are near (similar) to each other should have tolerance classes divided among both images (instead of a tolerance classes contained solely in one of the images). For example, the figure accompanying this example shows a subset of the tolerance classes obtained from two leaf images. In this figure, each tolerance class is assigned a separate colour. As can be seen, the two leaves share similar tolerance classes. This example is a first step toward the application of near sets to the image correspondence problem. However, it also highlights a need to measure the degree of nearness of two sets.
| |
| | |
| == Nearness measure ==
| |
| | |
| For some applications it is not sufficient to simply state that two sets are near each other. The practical application of near set theory sometimes requires a method for quantifying the nearness of sets. As a result, a <math>L_2</math> norm-based nearness measure is was developed. Specifically, it was based on the idea that sets can be considered near each other when they have "things" in common. In the context of near sets, the "things" can be quantified by granules of a perceptual system, ''i.e.'', the tolerance classes. The simplest example of nearness between sets sharing "things" in common is the case when two sets have similar elements. Defn. 7 can be used to define a Nearness Measure (NM) between two sets <math>X</math> and <math>Y</math>. Let <math>Z = X\cup Y</math> and let the notation
| |
| | |
| :<math>[z_{/\cong_{\mathcal{B}}}]_X = \{z\in z_{/\cong_{\mathcal{B}}}\mid z\in X\},</math>
| |
| | |
| denote the portion of the tolerance class <math>z_{/\cong_{\mathcal{B}}}</math> that belongs to <math>X</math>, and similarly, use the notation
| |
| | |
| :<math>[z_{/\cong_{\mathcal{B}}}]_Y = \{z\in z_{/\cong_{\mathcal{B}}}\mid z\in Y\},</math> | |
| | |
| to denote the portion that belongs to <math>Y</math>. Further, let the sets <math>X</math> and <math>Y</math> be weakly near each other using Defn. 6. Also, let <math>Z_{/\cong_{\mathcal{B}}}</math> denote a covering of <math>Z</math> defined by <math>\cong_{\mathcal{B}}</math>. Then, a <math>NM_{\cong_{\mathcal{B}}}(X,Y)</math> between <math>X</math> and <math>Y</math> is given by
| |
| | |
| :<math> NM_{\cong_{\mathcal{B}}}(X,Y) = \Biggl ( \sum_{z_{/\cong_{\mathcal{B}}}\in Z_{/\cong_{\mathcal{B}}}} |z_{/\cong_{\mathcal{B}}}| \Biggr)^{-1} \sum_{z_{/\cong_{\mathcal{B}}}\in Z_{/\cong_{\mathcal{B}}}}|z_{/\cong_{\mathcal{B}}}| \frac{ \min (|[z_{/\cong_{\mathcal{B}}}]_X|,|[z_{/\cong_{\mathcal{B}}}]_Y|)}{\max (|[z_{/\cong_{\mathcal{B}}}]_X|,|[z_{/\cong_{\mathcal{B}}}]_Y|)}. </math>
| |
| | |
| The idea behind the NM is that sets that are similar should have a similar number of objects in each tolerance class. Thus, for each tolerance class obtained from the covering of <math>Z=X\cup Y</math>, the NM counts the number of objects that belong to <math>X</math> and <math>Y</math> and takes the ratio (as a proper fraction) of their cardinalities. Furthermore, each ratio is weighted by the total size of the tolerance class (thus giving importance to the larger classes) and the final result is normalized by dividing by the sum of all the cardinalities. The range of the NM is in the interval [0,1], where a value of 1 is obtained if the sets are equivalent and a value of 0 is obtained if they have no elements in common.
| |
| | |
| As an example of the degree of nearness between two sets, consider figure below in which each image consists of two sets of objects, <math>X</math> and <math>Y</math>. Each colour in the figures corresponds to an elementary set where all the objects in the class share the same description. The idea behind the NM is that the nearness of sets in a perceptual system is based on the cardinality of tolerance classes that they share. Thus, the sets in left side of the figure are closer (more near) to each other in terms of their descriptions than the sets in right side of the figure.
| |
| | |
| [[File:Visulization of nearness measure.jpg|thumb|500px|Examples of degree of nearness between two sets: (a) High degree of nearness, and (b) Low degree of nearness.]]
| |
| | |
| == Near set evaluation and recognition (NEAR) system ==
| |
| | |
| The Near set Evaluation and Recognition (NEAR) system, is a system developed to demonstrate practical applications of near set theory to the problems of image segmentation evaluation and image correspondence. It was motivated by a need for a freely available software tool that can provide results for research and to generate interest in near set theory. The system implements a Multiple Document Interface (MDI) where each separate processing task is performed in its own child frame. The objects (in the near set sense) in this system are subimages of the images being processed and the probe functions (features) are image processing functions defined on the subimages. The system was written in C++ and was designed to facilitate the addition of new processing tasks and probe functions. Currently, the system performs five major tasks, namely, displaying equivalence and tolerance classes for an image, performing segmentation evaluation, measuring the nearness of two images, and displaying the output of processing an image using an individual probe functions.
| |
| | |
| [[File:Near gui.jpg|thumb|500px|NEAR system GUI.]]
| |
| | |
| == See also ==
| |
| <div style="-moz-column-count:4; column-count:4;">
| |
| | |
| * [[Alternative set theory]]
| |
| * [[Cover (topology)]]
| |
| * [[Features (pattern recognition)]]
| |
| * [[Image analysis]]
| |
| * [[Maurice Merleau-Ponty]]
| |
| * [[Perception]]
| |
| * [[Proximity space]]
| |
| * [[Psychophysics]]
| |
| * [[Rough set| Rough set theory]]
| |
| * [[Satoshi Watanabe (physicist)|Satoshi Watanabe]]
| |
| * [[Soft computing]]
| |
| </div>
| |
| | |
| == Notes ==
| |
| | |
| <references/>
| |
| | |
| ==Further reading==
| |
| * Henry, C., Peters, J.F. [http://wren.ece.umanitoba.ca/index.php?option=com_content&view=article&id=119&Itemid=93 Near set evaluation and recognition (NEAR) system]. Tech. rep., Computational Intelligence Laboratory, University of Manitoba, UM CI Laboratory Technical Report No. TR-2009-015, 2009.
| |
| *Peters, J.F., Wasilewski, P. [http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6V0C-4W8TW7K-1&_user=10&_rdoc=1&_fmt=&_orig=search&_sort=d&_docanchor=&view=c&_searchStrId=1034064435&_rerunOrigin=google&_acct=C000050221&_version=1&_urlVersion=0&_userid=10&md5=5dddb73027f11d718f7ceb7a1118c796 Foundations of near sets]. Information Sciences 179 (18), 2009, 3091-3109.
| |
| * Pavel, M. [http://portal.acm.org/citation.cfm?id=155290 Fundamentals of Pattern Recognition], 2nd ed. Pure and Applied Mathematics, vol. 174, Marcel Dekker, Inc., 1993.
| |
| | |
| ==External links==
| |
| * Pal, S.K., Peters, J.F., Eds. [http://www.routledge.com/books/Rough-Fuzzy-Image-Analysis-ISBN 978-1-4398-0329-5 Rough Fuzzy Image Analysis]. Foundations and Methodologies. Routledge, 2010, ISBN 978-1-4398-0329-5. To appear in September 2010. Many chapters present the theory and application of near sets in image analysis, including several system implementations.
| |
| *Hassanien, E., Abraham, A., Peters, J.F., Schaefer, G., Henry, C. [http://ieeexplore.ieee.org/xpl/tocpreprint.jsp?isnumber=4358869&punumber=4233 Rough sets and near sets in medical imaging: A review]. IEEE Trans. on Information Technology in Biomedicine 13 (5), 2009, {{doi|10.1109/TITB.2009.2017017}}.
| |
| | |
| [[Category:Set theory]]
| |