# Representing Images' Meanings by Associative Values with Given Lexicons Considering the Semantic Tolerance Relation

Authors: Ying Dai
Journal: Advances in Multimedia
 (2011)

---

## Abstract

An approach of representing meanings of images based on associative values with lexicons is proposed. For this, the semantic tolerance relation model (STRM) that reflects the tolerance degree between defined lexicons is generated, and two factors of semantic relevance (SR) and visual similarity (VS) are involved in generating associative values. Furthermore, the algorithm of calculating associative values using pixel-based bidirectional associative memories (BAMs) in combination with the STRM, which is easy in implementation, is depicted. The experiment results of multilexicons-based retrieval by individuals show the effectiveness and efficiency of our proposed method in finding the expected images and the improvement in retrieving accuracy because of incorporating SR with VS in representing meanings of images.


---

## Body

## 1. Introduction

With the technological advances in digital imaging, networking, and data storage, more and more people communicate with one another and express themselves by sharing images, videos, and other forms of media on line. However, it is difficult to fully utilize the semantic messages that the image/video carries, because the nature of the concepts regarding images in many domains are imprecise, and the interpretation of finding similar images/videos is also ambiguous and subjective on the level of human perception. Accordingly, there are some techniques that focus on annotating the images by folksonomy (Flickr, del.icio.us). But the deliberately idiosyncratic annotation induced by folksonomies has a risk to decrease the systems’ performance in formation retrieval utility. In Xie et al. [1], by examining the effects of different choices of lexicons and input detectors, such a conclusion is reached that more concepts than necessary can hurt performance.Thus, much research aims to the image/video automatic annotation or presentation based on the semantic messages that the images carry. In order to avoid the expense and limitations of text annotations on images, there is considerable interest in efficient database access by perceptual and other automatically extractable attributes of images. However, most current retrieval systems only rely on low-level image features such as color and texture, whereas human users think in terms of concepts [2–5]. Usually relevance feedback is the only attempt to close the semantic gap between user and system.Recently, there is much research to reduce the semantic gap between users and retrieval systems with the different levels of abstraction employed by human and machine. In Rogowitz [6], how human observers judge image similarity was analyzed to reach a conclusion that the human observers are very systematic to judge image similarity, following semantics, color, and structural characteristics. Following this conclusion, in Mojsilović et al. [7], the extraction of color features and the interpretation of these features based on five image similarity criteria were proposed. However, it was shown that color could not be used as a single measure to capture the semantics of images. In Vogel and Schiele [8], a concept called “vocabulary-supported image retrieval” was proposed, which allowed the system to translate the user query into an internal query. However, the user query as “find images with 10–30% of sky” is not a natural way to present the semantics of the images. In Mojsilovic et al.  [9], a semantic-friendly query language for searching diverse collections of images was proposed. However, same as Vogel and Schiele [8], the query language such as (nature <10 and contrast >800) is not easy to utilize for modeling the categories. In [10], the proposed system was aimed to place an image into a category to help user to navigate retrieval results more efficiently. However, the definition of categories was a mixture of semantic, syntactic, and statistical approaches, which seemed not to be the genuine semantic categories. In Dai and Cai [11], a scheme of image retrieval system, which followed the human perceptual similarity criteria described in Rogowitz [6], was proposed. However, the semantic categorization of images was made manually. In [12–14], the automatic semantic-based image categorization methods using the probabilistic approach or the subspace discovery were proposed. However, only the binary classes (indoor-outdoor, manmade-natural, sunset-nonsunset) were handled. In Shen et al.  [15], a framework to handle the classification problem of overlapped classes was presented and was applied to the problem of multiscene classification. However, the extension to the other concepts’ classification was not described.  In Dai [16], a method of semantic tolerance relation-based image presentation and classification was proposed, and, as the demonstration, the semantics of each image regarding nature versus manmade domain was represented by assigning images to 7 categories based on the Bayesian classifier. Obviously, it is not enough for 7 classes to embody the whole semantics of images. In Carneiro et al.  [17], 350 visual concepts were learned under the minimum probability of error retrieval framework, and each image was annotated with the concepts of largest probability. However, with the retrieval precision of about 30%, the proposed method cannot truly resolve the problem of semantic gap between the human and machine, because in fact, it is merely equated with the classification based on the low level visional features. On the other hand, for  [17] and [16], the selection of training images set for generating the probability models of new concepts and the regeneration of the probability models for the new concepts are not so easy in practice, if they are required to add. In Xie [1], the statistical test results showed that the concept detection performance is better than baseline if the number of defined lexicons is in the range of (40, 240). However, these defined lexicons are only visual lexicons, and the higher-order concept dependency is still not considered in multiconcept learning. In Li and Wang  [18], 2D MHMMs stochastic processes are utilized to implement the system of automatic linguistic indexing of pictures. For the future work, this paper indicates that besides assigning words to an image, weights can be given to the words in the meantime to show the believed extent of description appropriateness. However, how to generate the values of weights is still an open problem.Because most images/videos have multiple semantic interpretations and people judge similar images with different criterion, in this paper, an approach of representing meanings of images based on associative values with lexicons is proposed. As for this approach, the meanings of images or keyframes (images are called afterwards) are described by the associative values with defined lexicons regarding different domains, while the tolerance degree between these lexicons is embodied by the semantic tolerance relation model (STRM). Furthermore, based on the experiment result depicted in Rogowitz [6] that people judge image similarity by semantic relevance (SR), following visual similarity (VS), the  factor of SR is incorporated with the factor of VS in generating above associative values. Moreover, how to calculate associative values with defined lexicons by bidirectional associative memories (BAMs) is introduced. On the basis of generated associative values, a scheme of retrieving images according to multilexicons queries is proposed not only in the case of single domain but also in the case of cross domains. The influence of factors of SR and VS on the accuracy of retrieving images is analyzed, and the utility of the proposed approach in finding individual’s expected images is investigated. The results show that combining SR with VS in generating the associative values improves the accuracy of retrieving images. Moreover, with the 40 generally defined lexicons, 82% target images are retrieved by multilexicons queries with 1.4 lexicons and 2.2 query times on average requested by 5 subjects.


## 2. Semantic Tolerance Relation Model

“A picture is worth of thousands of words.” Indeed, the meanings of an image are diverse and ambiguous. In order to systematically describe the general meanings of images, we propose a semantic tolerance relation model (STRM) that reflects the tolerance degree between lexicons. The form of STRM is illustrated in Figure1.Figure 1
Form of STRM.The meanings of images are described by many domains. However, it seems better to define the core domains for describing images’ semantics. In views of the point that depicting news should include components of 5W1H (who, where, when, what, way, how), we define the following domains as the core domains. They are Nature versus manmade domain which represents concepts from nature to manmade regarding “what”; human versus nonhuman domain which represents the concepts from portrait, small face to nonface regarding “who”; temporal domain representing the time information regarding “when”; spatial domain representing the location information regarding “where”; action domain presenting the doing information regarding “way”; impression domain reflecting the impression information regarding “how.” Of course, other new domains can be added as supplement domains.For a certain domaindk, concepts are depicted by some lexicons. Lexicon i regardingdkis denoted ascki. The number of the lexicons in dkis denoted asMk. Similar to domains, we define general lexicons for a certain domain. It is taken into account that the words having the higher observed frequency counts within a very large text corpus are regarded as general lexicons. For example, these lexicons (landscape, tree, flower, beach, lake, mountain, sunset, building, building parts, clothing, furniture, kitchen items, tools, vegetables, vehicles) can be chosen as general lexicons regarding nature versus manmade domain. 3 lexicons (portrait, face, nonface) are selected as core lexicons regarding human versus nonhuman domain. However, it is obvious that the meanings of some defined lexicons are mutually tolerated, such as furniture and kitchen items. We define such overlapping of the meanings of two lexicons in the same domain as intratolerance, denoted as (cki,ckj), and overlapping of two lexicons in the different domain as intertolerance, denoted as (cki,clj)(k≠l). The rate of cki overlapped by  clj is defined as the tolerance degree of cki to clj, denoted astd(cki,clj). It is assumed that thetd(cki,clj) is represented by the co-occurrence count cu(cki,clj) of cki  with clj within the very large text corpus, while it is in accordance with the counts giving the number of times of  cki with clj as 2 grams  appeared in a large corpus containing over a trillion total tokens. In particular, we can use the text corpus data provided by Google Inc. [19] to acquire such cooccurrence count. Let cumax give the maximal value of all cooccurrence counts regarding all defined lexicons,  td(cki,clj) is calculated by (1), to make the  values of tolerance degree be within the range of (1, 0):(1)td(cki,clj)=cu(cki,clj)cumax⁡.Therefore, STRM regarding the lexicons is expressed in a matrixTRkl. When k=l,TRkk expresses the intratolerance relation model of the lexicons regarding domain k.Otherwise, TRkl expresses the intertolerance relation model of the lexicons regarding domains kand l. The entry at row i, column j in the matrix is the value of tolerance degree of lexicon ckito clj:(2)TRkl=(trijkl)=[td(cki,clj):i∈[1,Mk],j∈[1,Ml]].To add a new lexicontin domain k, it must be registered firstly. However, the re-alignment of entries in the matrix TRkl is accomplished by determining values of (td(cki,clt):i∈[1,Mk+1];t=Mk+1;k,l∈[1,K]), and(td(ckt,cli):i∈[1,Mk+1];t=Mk+1;k,l∈[1,K]). It means that all old entries are not needed to recompute in the realignment process, and only the new entries of tth row and tth column of domain k, which are the values of tolerance degree of the new lexicon t regarding the old lexicons, are required to determine. Accordingly, the realignment of entries in the matrix TRklcaused by adding the new lexicon will not result in the expensive computation.


## 3. Representing Images’ Meanings

### 3.1. Associative Values with Given Lexicons

Because most images have the multiple and ambiguous semantic interpretations and the human’s criteria of judging images with the similar meanings are multiple, the meanings of each image is represented by a vectorimgn=[A1n,…,Akn,…,AKn] of associative values with given lexicons, while Akn=[ak1n,…,akin,…,ak,Mkn], which is a subvector of associative values with the lexicons regarding domain k. Mkdenotes the number of given lexicons regarding domain k, and akinmeans the associative degree of the image nwith the lexicon cki.Based on the experiment described in [6], we see that people judge image similarity by semantic relevance (SR), following visual similarity (VS). Particularly, besides the images which are either semantically or visually similar, there are images that are semantically tolerant, but not similar visually, such as building and building parts. Also, there are images that are similar in shape, but not semantically tolerant, such as melon and ball. Accordingly, the associative values of image with the lexicons are affected by two facts: SR and VS. Let the value of SR regarding an image n to lexicon ckiis denoted assrkin, and the value of VS is denoted asvskin. srkin embodies the degree of an image having the meaning ofcki, and  vskin reflects the degree of an image looking like  cki. Therefore, the value of akin is generated by the weighted sum of srkin and akin, which is expressed by (3)akin=wssrkin+wvvskin,
where ws is the weight of SR in generating akin, and wv is the weight of VS.Accordingly, if there areK domains, and Mk lexicons are given, the meanings of each image is represented by a vector(4)imgn=[A1n,…,Akn,…,AKn],whileAkn=[ak,1n,…,ak,in,…,ak,Mkn].


### 3.2. Calculating Associative Values

To fully specify the associative value within this computational modeling framework of (3), it is necessary to derive the values of srkin and the value ofvskin. For this, the sufficient features are needed to extract from the images, and the detector of lexicon cki is needed to design. In fact, different detectors based on the different features perform similarly in terms of mean infAP (inferred average precision) on average [1]. So, considering the easily implementation, the pixel-based bidirectional associative memories (BAMs) [20] are used as the detector of lexicons to generating the values of srkin and vskin in this paper, and the performance of these generated values  in representing the meanings of images is analyzed afterwards.BAM is a two-layer network structure that maps specific input representations to specific output representations, but the connections between two layers are bi directional. It is a system that “associates” two patterns(X,Y) such that when one is encountered, the other can be recalled. Typically, XandYare the vectors with the length of m and n, respectively. The structure of BAM utilized in our case is shown in Figure 2.Figure 2
Structure of BAM.The patternX is a vector, the entries of which correspond to values of pixels of a learned image; the pattern Y is a vector regarding a code of lexicon representing the learned pattern X. In general, for a domain k,the lexiconcki is encoded as Yi=[0⋯01i0⋯0]Mk. Pattern X and pattern Y combine a pattern pair which is associated by building the connection weight matrix. The weight matrix for simultaneously storing several associated pattern pairs is calculated by(5)W=α∑k=1KXkT.With continuously updating the outputs ofXlayer and Y layer for an input image n, the network will eventually converge to an energy local minimum. Then, the output values of units in the Ylayer embody the recalling degree of the input image n to the learned image patterns. Let the output units of Y layer, that is, the recalling values, are expressed as(6)yn=[r1n,…rin,…rMkn].Here, it assumes that the input imagen is fully belonged tocki, ifrin=max{rmn,m∈[1,Mk]}&rin>Tr(Tr is a threshold of recalling values). Accordingly, srkin is set as 1 in this case. However, it is obvious that  srkjn will not be 0, if cki is relevant to ckj. The value of srkjn is affected by the tolerance relation of cki with ckj. Therefore, the value of srkin is determined according to the following rules (i,j∈[1,Mk]):(7)ifimgn∈cki,srkin=1,ifimgn∈cki,srkjn=trijkk,ifimgn∉cki(∀i),srkin(∀i)=0.On the other hand, for the pixel-based BAM, the value ofrinparticularly reflects the visual similarity degree of the input image n to the learned pattern image i, which represents the concept of lexiconcki, andvskin is given by(8)vskin=rin.As a whole, (2) generating associative values of an image with given lexicons is converted as(9)akin={ws+wvrin,ifimgn∈cki,wstrjikk+wvrin,ifimgn∈ckj,j≠i,wvrin,ifimgn∉cki(∀i),Some learned pattern images which represent the meanings of given lexicons regarding the domain of nature versus manmade are shown in Figure3. The rule of selecting such images follows that visual features of the image representing one lexicon perfectly embody the general features of this lexicon. For some concepts, more than one pattern images which are obviously different in visual sensation are learned for one lexicon. For example, four pattern images are learned for lexicon tree. The resolution of them is set as 96×64.So, the relative capacity of BAM recalling pattern pairs is 96×64×0.1998=1227 pairs [20]. On the other hand, according to the statement in [1] that about 40 to 240 lexicons are needed to define for perfectly detecting the concepts carried by images, the capacity of the constructed pixel-based BAM capacity is pretty sufficient in calculating the recalling values rin, which are used to generate the associative values with given lexicons by (9), if the number of given lexicons for a domain is in the range of (40, 240).Some learned pattern images.
(a)
Landscape(b)
Building(c)
Restaurant(d)
Interior(e)
Tree(f)
Tree(g)
Tree(h)
Tree


### 3.3. Scheme of Retrieving Images

The scheme of image retrieval based on the vectors of associative values of images with given lexicons is considered as the following.


#### 3.3.1. Retrieval Regarding Single Domain

If the lexicons regarding the other domain are strongly associated with the current one, considering the association between these lexicons will improve the performance of retrieval. Therefore, the retrieving scheme based on the given lexicons is expressed as(10)iftrijkl>Tijkl(∀k,l∈[1,K],k≠l)IMGki={imgn∈cki}={imgn,akin≥σki&aljn≥σlj}elseIMGki={imgn∈cki}={imgn,akin≥σki},
where Tijkl is called the tolerance value that is  threshold  of tolerance degree between two lexicons i and j regarding domains kand l. σkiorσlj are called the retrieval values that are the threshold of extracting image belonging to the lexicon i regarding k,or lexiconjregarding l,respectively.Moreover, if a query cannot be depicted explicitly by the given lexicons, the user can specify the query to multiple related lexicons. Let the query be denoted asqm:
(11)ifqm∈cki,qm∈ckj,IMGqm=({imgn∈cki}⋂{imgn∈ckj}).


#### 3.3.2. Retrieval Regarding Cross-Domains

Obviously, the image retrieval regarding cross-domains is the intersection of extracted images regarding the different lexicons with the different domains. Therefore, the scheme of retrieving image that carries the meanings of lexiconi regarding domain kand lexicon jregarding domain l is given by(12)iftrijkl≠0,trjilk≠0,IMGki,lj={imgn,imgn∈cki}⋂{imgn,imgni∈clj}.
Some images retrieved by the query of furniture with face are shown in Figure 4.Images retrieved by furniture with face.
(a)(b)(c)


### 3.4. Implementation

For implementation, three domains together with corresponding 40 lexicons as general lexicons are defined. They are listed in Table1. These lexicons are selected according to the observation that the frequency counts of these lexicons appeared in the large text corpus [19] are higher. For each domain, pixel-based BAM is separately constructed with its given lexicons as Y patterns and the corresponding representative images as X pattern pairs. Using (9), associative values with these lexicons are calculated and stored as index for retrieval. The users select one or more lexicons representing the semantics which they want to express to retrieve their expected images or keyframes of videos.Table 1
Defined domains and lexicons.
DomainsLexiconsNature/manmadeGround, landscape, flower, tree, light, building, sunset, restaurant, texture_brick, texture_wood, texture_paper, texture_cloth, food_materials, food, mall, beach, snow_viewing, mountain_lake, flower_arrangement, interior, street, waterfall, mountain, pool, guard, ship, board, rocket, brriage, factoryFace/nonfacePortrait, face, non_faceImpressionActive, cool, calm, soft, hard, grayish, clearFigure5 is a screenshot of system interface. At the top, the pull-down menus are provided for the users to select related domains and lexicons embodying the meanings of images which are expected to search. The sliding is used to input the threshold of associative values regarding a given lexicon for retrieving. It would be operated easily because the user can set the sliding position optionally and adjust that to left or right if the number of retrieved images is too few or too many. The middle space shows the inputted queries which can be edited by the buttons of Add, Delete, and Reset. The thumbnails of retrieved images or keyframes are listed at the bottom, from which users can find their expected images or videos easily.Figure 5
System interface.


## 3.1. Associative Values with Given Lexicons

Because most images have the multiple and ambiguous semantic interpretations and the human’s criteria of judging images with the similar meanings are multiple, the meanings of each image is represented by a vectorimgn=[A1n,…,Akn,…,AKn] of associative values with given lexicons, while Akn=[ak1n,…,akin,…,ak,Mkn], which is a subvector of associative values with the lexicons regarding domain k. Mkdenotes the number of given lexicons regarding domain k, and akinmeans the associative degree of the image nwith the lexicon cki.Based on the experiment described in [6], we see that people judge image similarity by semantic relevance (SR), following visual similarity (VS). Particularly, besides the images which are either semantically or visually similar, there are images that are semantically tolerant, but not similar visually, such as building and building parts. Also, there are images that are similar in shape, but not semantically tolerant, such as melon and ball. Accordingly, the associative values of image with the lexicons are affected by two facts: SR and VS. Let the value of SR regarding an image n to lexicon ckiis denoted assrkin, and the value of VS is denoted asvskin. srkin embodies the degree of an image having the meaning ofcki, and  vskin reflects the degree of an image looking like  cki. Therefore, the value of akin is generated by the weighted sum of srkin and akin, which is expressed by (3)akin=wssrkin+wvvskin,
where ws is the weight of SR in generating akin, and wv is the weight of VS.Accordingly, if there areK domains, and Mk lexicons are given, the meanings of each image is represented by a vector(4)imgn=[A1n,…,Akn,…,AKn],whileAkn=[ak,1n,…,ak,in,…,ak,Mkn].


## 3.2. Calculating Associative Values

To fully specify the associative value within this computational modeling framework of (3), it is necessary to derive the values of srkin and the value ofvskin. For this, the sufficient features are needed to extract from the images, and the detector of lexicon cki is needed to design. In fact, different detectors based on the different features perform similarly in terms of mean infAP (inferred average precision) on average [1]. So, considering the easily implementation, the pixel-based bidirectional associative memories (BAMs) [20] are used as the detector of lexicons to generating the values of srkin and vskin in this paper, and the performance of these generated values  in representing the meanings of images is analyzed afterwards.BAM is a two-layer network structure that maps specific input representations to specific output representations, but the connections between two layers are bi directional. It is a system that “associates” two patterns(X,Y) such that when one is encountered, the other can be recalled. Typically, XandYare the vectors with the length of m and n, respectively. The structure of BAM utilized in our case is shown in Figure 2.Figure 2
Structure of BAM.The patternX is a vector, the entries of which correspond to values of pixels of a learned image; the pattern Y is a vector regarding a code of lexicon representing the learned pattern X. In general, for a domain k,the lexiconcki is encoded as Yi=[0⋯01i0⋯0]Mk. Pattern X and pattern Y combine a pattern pair which is associated by building the connection weight matrix. The weight matrix for simultaneously storing several associated pattern pairs is calculated by(5)W=α∑k=1KXkT.With continuously updating the outputs ofXlayer and Y layer for an input image n, the network will eventually converge to an energy local minimum. Then, the output values of units in the Ylayer embody the recalling degree of the input image n to the learned image patterns. Let the output units of Y layer, that is, the recalling values, are expressed as(6)yn=[r1n,…rin,…rMkn].Here, it assumes that the input imagen is fully belonged tocki, ifrin=max{rmn,m∈[1,Mk]}&rin>Tr(Tr is a threshold of recalling values). Accordingly, srkin is set as 1 in this case. However, it is obvious that  srkjn will not be 0, if cki is relevant to ckj. The value of srkjn is affected by the tolerance relation of cki with ckj. Therefore, the value of srkin is determined according to the following rules (i,j∈[1,Mk]):(7)ifimgn∈cki,srkin=1,ifimgn∈cki,srkjn=trijkk,ifimgn∉cki(∀i),srkin(∀i)=0.On the other hand, for the pixel-based BAM, the value ofrinparticularly reflects the visual similarity degree of the input image n to the learned pattern image i, which represents the concept of lexiconcki, andvskin is given by(8)vskin=rin.As a whole, (2) generating associative values of an image with given lexicons is converted as(9)akin={ws+wvrin,ifimgn∈cki,wstrjikk+wvrin,ifimgn∈ckj,j≠i,wvrin,ifimgn∉cki(∀i),Some learned pattern images which represent the meanings of given lexicons regarding the domain of nature versus manmade are shown in Figure3. The rule of selecting such images follows that visual features of the image representing one lexicon perfectly embody the general features of this lexicon. For some concepts, more than one pattern images which are obviously different in visual sensation are learned for one lexicon. For example, four pattern images are learned for lexicon tree. The resolution of them is set as 96×64.So, the relative capacity of BAM recalling pattern pairs is 96×64×0.1998=1227 pairs [20]. On the other hand, according to the statement in [1] that about 40 to 240 lexicons are needed to define for perfectly detecting the concepts carried by images, the capacity of the constructed pixel-based BAM capacity is pretty sufficient in calculating the recalling values rin, which are used to generate the associative values with given lexicons by (9), if the number of given lexicons for a domain is in the range of (40, 240).Some learned pattern images.
(a)
Landscape(b)
Building(c)
Restaurant(d)
Interior(e)
Tree(f)
Tree(g)
Tree(h)
Tree


## 3.3. Scheme of Retrieving Images

The scheme of image retrieval based on the vectors of associative values of images with given lexicons is considered as the following.


### 3.3.1. Retrieval Regarding Single Domain

If the lexicons regarding the other domain are strongly associated with the current one, considering the association between these lexicons will improve the performance of retrieval. Therefore, the retrieving scheme based on the given lexicons is expressed as(10)iftrijkl>Tijkl(∀k,l∈[1,K],k≠l)IMGki={imgn∈cki}={imgn,akin≥σki&aljn≥σlj}elseIMGki={imgn∈cki}={imgn,akin≥σki},
where Tijkl is called the tolerance value that is  threshold  of tolerance degree between two lexicons i and j regarding domains kand l. σkiorσlj are called the retrieval values that are the threshold of extracting image belonging to the lexicon i regarding k,or lexiconjregarding l,respectively.Moreover, if a query cannot be depicted explicitly by the given lexicons, the user can specify the query to multiple related lexicons. Let the query be denoted asqm:
(11)ifqm∈cki,qm∈ckj,IMGqm=({imgn∈cki}⋂{imgn∈ckj}).


### 3.3.2. Retrieval Regarding Cross-Domains

Obviously, the image retrieval regarding cross-domains is the intersection of extracted images regarding the different lexicons with the different domains. Therefore, the scheme of retrieving image that carries the meanings of lexiconi regarding domain kand lexicon jregarding domain l is given by(12)iftrijkl≠0,trjilk≠0,IMGki,lj={imgn,imgn∈cki}⋂{imgn,imgni∈clj}.
Some images retrieved by the query of furniture with face are shown in Figure 4.Images retrieved by furniture with face.
(a)(b)(c)


## 3.3.1. Retrieval Regarding Single Domain

If the lexicons regarding the other domain are strongly associated with the current one, considering the association between these lexicons will improve the performance of retrieval. Therefore, the retrieving scheme based on the given lexicons is expressed as(10)iftrijkl>Tijkl(∀k,l∈[1,K],k≠l)IMGki={imgn∈cki}={imgn,akin≥σki&aljn≥σlj}elseIMGki={imgn∈cki}={imgn,akin≥σki},
where Tijkl is called the tolerance value that is  threshold  of tolerance degree between two lexicons i and j regarding domains kand l. σkiorσlj are called the retrieval values that are the threshold of extracting image belonging to the lexicon i regarding k,or lexiconjregarding l,respectively.Moreover, if a query cannot be depicted explicitly by the given lexicons, the user can specify the query to multiple related lexicons. Let the query be denoted asqm:
(11)ifqm∈cki,qm∈ckj,IMGqm=({imgn∈cki}⋂{imgn∈ckj}).


## 3.3.2. Retrieval Regarding Cross-Domains

Obviously, the image retrieval regarding cross-domains is the intersection of extracted images regarding the different lexicons with the different domains. Therefore, the scheme of retrieving image that carries the meanings of lexiconi regarding domain kand lexicon jregarding domain l is given by(12)iftrijkl≠0,trjilk≠0,IMGki,lj={imgn,imgn∈cki}⋂{imgn,imgni∈clj}.
Some images retrieved by the query of furniture with face are shown in Figure 4.Images retrieved by furniture with face.
(a)(b)(c)


## 3.4. Implementation

For implementation, three domains together with corresponding 40 lexicons as general lexicons are defined. They are listed in Table1. These lexicons are selected according to the observation that the frequency counts of these lexicons appeared in the large text corpus [19] are higher. For each domain, pixel-based BAM is separately constructed with its given lexicons as Y patterns and the corresponding representative images as X pattern pairs. Using (9), associative values with these lexicons are calculated and stored as index for retrieval. The users select one or more lexicons representing the semantics which they want to express to retrieve their expected images or keyframes of videos.Table 1
Defined domains and lexicons.
DomainsLexiconsNature/manmadeGround, landscape, flower, tree, light, building, sunset, restaurant, texture_brick, texture_wood, texture_paper, texture_cloth, food_materials, food, mall, beach, snow_viewing, mountain_lake, flower_arrangement, interior, street, waterfall, mountain, pool, guard, ship, board, rocket, brriage, factoryFace/nonfacePortrait, face, non_faceImpressionActive, cool, calm, soft, hard, grayish, clearFigure5 is a screenshot of system interface. At the top, the pull-down menus are provided for the users to select related domains and lexicons embodying the meanings of images which are expected to search. The sliding is used to input the threshold of associative values regarding a given lexicon for retrieving. It would be operated easily because the user can set the sliding position optionally and adjust that to left or right if the number of retrieved images is too few or too many. The middle space shows the inputted queries which can be edited by the buttons of Add, Delete, and Reset. The thumbnails of retrieved images or keyframes are listed at the bottom, from which users can find their expected images or videos easily.Figure 5
System interface.


## 4. Experiments and Analysis

400 images randomly selected from the personal albums and Sozaijiten Image Book 1 [21] and 1220 keyframes extracted from Video Traxx 1 [22] are prepared for testing the system performance. However, the images relevant to the action, such as sports, football, and camping, are not included because the action domain relevant to these lexicons is not defined for implementation.


### 4.1. Per-Lexicon Retrieval Accuracy

The per-lexicon retrieval accuracy is defined as the following expression (# stands for “number of”)(13)accuracy=#truepositive#topranking,
where #top ranking denotes the number of top ranking images according to their associative values with a certain lexicon. # true positive denotes the number of images which are positive to the relevant lexicon among the top ranking images.Figures6(a), 6(b), and 6(c) show the influence on the accuracy regarding the lexicons building, furniture, and landscape with varying the weights of SR and VS, while the number of top ranking images is varied at the range of (12, 120).Accuracy with varying weights of SR and VS.
(a)
Building(b)
Furniture(c)
LandscapeThe case ofws=0,wv=1 indicates that the factor of VS is merely considered in generating the associative values of images with defined lexicons; the case of ws=1,wv=0 indicates that the factor of SR is only taken into account; the case of ws=0.25,wv=0.75 indicates that both of SR and VS are used in calculating associative values. From Figures 6(a), 6(b), and 6(c), it is observed that although the accuracy is different for the different lexicons the case ofws=0.25,wv=0.75, that is, the case of considering both of SR and VS in generating associated values with the lexicons, has the best retrieval performance as a whole. The accuracy of it is often highest among the above three cases, and the varying tendency of accuracy with changing the number of top ranking images is more gentle than those of the other cases. In the case ofws=0,wv=1, that is, the case of only VS being considered, the performance of retrieval accuracy drops a little as a whole. However, in the case of ws=1,wv=0, that is, the case of only SR being considered, the performance of retrieval accuracy becomes bad obviously (the reason for the number of top ranking does not getting to 120 is that the number of images having the nonzero associative values with the queried lexicon does not reach 120). From the results, we can see that the performance of retrieval accuracy is improved if both of factors SR and VS are taken into account in generating the associative values with defined lexicons. On the other hand, the case of only one factor VS is considered does not influence the retrieval accuracy so much. However, that only one factor SR is processed in generating the associative values with defined lexicons is not a good means for representing the meanings of images.On the other hand, Table2 shows the accuracy of the top 36 retrieved images regarding some implemented lexicons whilews=0,wv=1,ws=0.25,wv=0.75, or ws=1.0,wv=0.Table 2
Accuracy of retrieved images.
WsLandscapeBuildingFurnitureFlowerTreeSunsetRestaurantFoodSnowBeachMountainStreetFace00.860.90.660.640.720.530.720.580.780.830.810.660.810.250.950.90.750.780.830.660.860.660.830.920.890.720.891.00.880.530.580.580.610.50.640.560.720.750.750.690.78From Table2, we can see that although the accuracy to the different lexicons is varied, it is obvious that the accuracy is highest for all the lexicons whenws=0.25,wv=0.75. That is, the method of considering both of SR and VS in generating the associative values to represent the meanings of images is effective and improves the retrieving accuracy of images well.On the other hand, besides using BAM to generate the values of SR and VS of images, there are other methods to use in the literature for this purpose, especially, the statistical modeling approach proposed in [18]. However, the focus of this paper is to verify that considering the semantic tolerance relation in representing the meanings of images will improve the performance of image retrieval while that is not proposed in the literature yet and not to verify that using BAM is better than using other methods in image retrieval. So the BAM for which it is easy to implement is utilized, and the performance comparison to the other methods in the literature is not done in this paper.


### 4.2. Effectiveness of Multilexicons Queries for Retrieval

Five students as subjects attend the experiment, and each experimenter is asked to randomly target some images from the test sets for retrieving. For the experiments, the experimenters specify domains and lexicons according to meanings of a target image and investigate whether this image is retrieved by querying such domains/lexicons. The threshold of associative values for retrieving a lexicon (called retrieval values afterwards) can be adjusted in the query process. The whole testing process is showed in the following.QTi denotes the number of query times for retrieving the target imagei.(1)
For a target imagei, selecting a lexicon form the given domains/lexicons, which is mostly considered to represent the meanings of the image, and setting the retrieval value for this lexicon.(2)
Retrieving and investigating whether the target image or images which are similar to the target image in semantics and visual sensation are retrieved. If there are no corresponding images in the top 24 listed images,
(i)
picking up a new lexicon from the given domains/lexicons to add to the query condition, setting the retrieving value for this lexicon, and going to step (2), if the amount of listed images is larger than 24. Here, letQTi=QTi+1,(ii)
deleting the latest added lexicon, and going to step (2), if the amount of listed images is smaller than 24. Here, letQTi=QTi+1.(3)
Ending the retrieving process, if the target image is found on the top 24 listed images or theQTi reach 5. The experimenter records the status whether the target image is found (successful retrieval (SRL)), the number of queried lexicons for retrieving this target image (AQCi) andQTi.In this test, each experimenter is required to target 30 images for retrieving and investigate whether these images can be detected in the above retrieving process.Three measurements are gotten from the above process. They are the average value of utilized lexicons in the image retrieval process to each experimenter (CatUsage), average query times for retrieving target image to each experimenter (AvgQuery), and the detection rate of target images to each experimenter (Detection), which are expressed in the following:(14)CatUsage=∑i=1MAQCiamountofSRL,AvgQuery=∑i=1MQTiM,Detection=amountofSRLM,
where M denotes the number of target images. Here, M=30. If ith image is not detected, AQCi is assigned to 0.The CatUsage embodies the utilized frequency counts of lexicons in the query process. The lower value the CatUsage has, the more general the defined lexicons are. The AvgQuery embodies the average query times of finding target images in retrieving. The smaller value means that the images can be searched more easily. The Detection embodies the successful rate of finding target images. The higher value means that the retrieving performance is good.Figure7 shows the values of CatUsage regarding 5 experimenters. The average value is 1.41, and the standard deviation is 0.126. From the results, we observed that the average amount of utilized lexicons was less than 2 in the query process for finding the target images, while the deviation of the amount of utilized lexicons is small. It means that the above given lexicons are efficient and effective for retrieving images with general meanings.Figure 7
CatUsage of five experimenters.Figure8 shows the average query times of retrieving target images to five experimenters. The values vary in the range of (1.5, 3), and the average value is 2.23. These values show that almost target images can be found by querying lexicons twice or thrice. The query times are not so large that it can satisfy users’ retrieving request. It also shows that the defined lexicons are efficient and effective for retrieving images with general meanings.Figure 8
AvgQuery of five experimenters.Figure9 shows the detection rate of target images in the image retrieval experiments to 5 experimenters. The values vary from 63% to 97%, and its average value is 82%, which means that more than 80% of target images are successfully retrieved with less than 5 query times on average, although the subjective behaviors and criteria of individuals for retrieving somewhat effect the retrieval results.Figure 9
Detection of five experimenters.As a whole, the above experiment results show that the proposed method of representing the images’ meanings by the associative values with the given lexicons for retrieval is with generality and being able to absorb the effect of individuals’ criteria in annotating the meanings of images. The proposed method is efficient and effective for retrieving images with general meanings.


## 4.1. Per-Lexicon Retrieval Accuracy

The per-lexicon retrieval accuracy is defined as the following expression (# stands for “number of”)(13)accuracy=#truepositive#topranking,
where #top ranking denotes the number of top ranking images according to their associative values with a certain lexicon. # true positive denotes the number of images which are positive to the relevant lexicon among the top ranking images.Figures6(a), 6(b), and 6(c) show the influence on the accuracy regarding the lexicons building, furniture, and landscape with varying the weights of SR and VS, while the number of top ranking images is varied at the range of (12, 120).Accuracy with varying weights of SR and VS.
(a)
Building(b)
Furniture(c)
LandscapeThe case ofws=0,wv=1 indicates that the factor of VS is merely considered in generating the associative values of images with defined lexicons; the case of ws=1,wv=0 indicates that the factor of SR is only taken into account; the case of ws=0.25,wv=0.75 indicates that both of SR and VS are used in calculating associative values. From Figures 6(a), 6(b), and 6(c), it is observed that although the accuracy is different for the different lexicons the case ofws=0.25,wv=0.75, that is, the case of considering both of SR and VS in generating associated values with the lexicons, has the best retrieval performance as a whole. The accuracy of it is often highest among the above three cases, and the varying tendency of accuracy with changing the number of top ranking images is more gentle than those of the other cases. In the case ofws=0,wv=1, that is, the case of only VS being considered, the performance of retrieval accuracy drops a little as a whole. However, in the case of ws=1,wv=0, that is, the case of only SR being considered, the performance of retrieval accuracy becomes bad obviously (the reason for the number of top ranking does not getting to 120 is that the number of images having the nonzero associative values with the queried lexicon does not reach 120). From the results, we can see that the performance of retrieval accuracy is improved if both of factors SR and VS are taken into account in generating the associative values with defined lexicons. On the other hand, the case of only one factor VS is considered does not influence the retrieval accuracy so much. However, that only one factor SR is processed in generating the associative values with defined lexicons is not a good means for representing the meanings of images.On the other hand, Table2 shows the accuracy of the top 36 retrieved images regarding some implemented lexicons whilews=0,wv=1,ws=0.25,wv=0.75, or ws=1.0,wv=0.Table 2
Accuracy of retrieved images.
WsLandscapeBuildingFurnitureFlowerTreeSunsetRestaurantFoodSnowBeachMountainStreetFace00.860.90.660.640.720.530.720.580.780.830.810.660.810.250.950.90.750.780.830.660.860.660.830.920.890.720.891.00.880.530.580.580.610.50.640.560.720.750.750.690.78From Table2, we can see that although the accuracy to the different lexicons is varied, it is obvious that the accuracy is highest for all the lexicons whenws=0.25,wv=0.75. That is, the method of considering both of SR and VS in generating the associative values to represent the meanings of images is effective and improves the retrieving accuracy of images well.On the other hand, besides using BAM to generate the values of SR and VS of images, there are other methods to use in the literature for this purpose, especially, the statistical modeling approach proposed in [18]. However, the focus of this paper is to verify that considering the semantic tolerance relation in representing the meanings of images will improve the performance of image retrieval while that is not proposed in the literature yet and not to verify that using BAM is better than using other methods in image retrieval. So the BAM for which it is easy to implement is utilized, and the performance comparison to the other methods in the literature is not done in this paper.


## 4.2. Effectiveness of Multilexicons Queries for Retrieval

Five students as subjects attend the experiment, and each experimenter is asked to randomly target some images from the test sets for retrieving. For the experiments, the experimenters specify domains and lexicons according to meanings of a target image and investigate whether this image is retrieved by querying such domains/lexicons. The threshold of associative values for retrieving a lexicon (called retrieval values afterwards) can be adjusted in the query process. The whole testing process is showed in the following.QTi denotes the number of query times for retrieving the target imagei.(1)
For a target imagei, selecting a lexicon form the given domains/lexicons, which is mostly considered to represent the meanings of the image, and setting the retrieval value for this lexicon.(2)
Retrieving and investigating whether the target image or images which are similar to the target image in semantics and visual sensation are retrieved. If there are no corresponding images in the top 24 listed images,
(i)
picking up a new lexicon from the given domains/lexicons to add to the query condition, setting the retrieving value for this lexicon, and going to step (2), if the amount of listed images is larger than 24. Here, letQTi=QTi+1,(ii)
deleting the latest added lexicon, and going to step (2), if the amount of listed images is smaller than 24. Here, letQTi=QTi+1.(3)
Ending the retrieving process, if the target image is found on the top 24 listed images or theQTi reach 5. The experimenter records the status whether the target image is found (successful retrieval (SRL)), the number of queried lexicons for retrieving this target image (AQCi) andQTi.In this test, each experimenter is required to target 30 images for retrieving and investigate whether these images can be detected in the above retrieving process.Three measurements are gotten from the above process. They are the average value of utilized lexicons in the image retrieval process to each experimenter (CatUsage), average query times for retrieving target image to each experimenter (AvgQuery), and the detection rate of target images to each experimenter (Detection), which are expressed in the following:(14)CatUsage=∑i=1MAQCiamountofSRL,AvgQuery=∑i=1MQTiM,Detection=amountofSRLM,
where M denotes the number of target images. Here, M=30. If ith image is not detected, AQCi is assigned to 0.The CatUsage embodies the utilized frequency counts of lexicons in the query process. The lower value the CatUsage has, the more general the defined lexicons are. The AvgQuery embodies the average query times of finding target images in retrieving. The smaller value means that the images can be searched more easily. The Detection embodies the successful rate of finding target images. The higher value means that the retrieving performance is good.Figure7 shows the values of CatUsage regarding 5 experimenters. The average value is 1.41, and the standard deviation is 0.126. From the results, we observed that the average amount of utilized lexicons was less than 2 in the query process for finding the target images, while the deviation of the amount of utilized lexicons is small. It means that the above given lexicons are efficient and effective for retrieving images with general meanings.Figure 7
CatUsage of five experimenters.Figure8 shows the average query times of retrieving target images to five experimenters. The values vary in the range of (1.5, 3), and the average value is 2.23. These values show that almost target images can be found by querying lexicons twice or thrice. The query times are not so large that it can satisfy users’ retrieving request. It also shows that the defined lexicons are efficient and effective for retrieving images with general meanings.Figure 8
AvgQuery of five experimenters.Figure9 shows the detection rate of target images in the image retrieval experiments to 5 experimenters. The values vary from 63% to 97%, and its average value is 82%, which means that more than 80% of target images are successfully retrieved with less than 5 query times on average, although the subjective behaviors and criteria of individuals for retrieving somewhat effect the retrieval results.Figure 9
Detection of five experimenters.As a whole, the above experiment results show that the proposed method of representing the images’ meanings by the associative values with the given lexicons for retrieval is with generality and being able to absorb the effect of individuals’ criteria in annotating the meanings of images. The proposed method is efficient and effective for retrieving images with general meanings.


## 5. Conclusion

In this paper, in order to systematically describe the meanings of images, semantic tolerance relation model (STRM) that reflects the tolerance degree between lexicons regarding different domains is proposed and specified by using the observed frequency counts of 2 grams in the large text corpus. Considering the influence of semantic relevance (SR) and visual similarity (VS) on interpreting the meanings of images, the images are represented by the associative values with the given lexicons, while such associative values are affected by the factors of SR and VS. Moreover, the associative values are calculated by using pixel-based bidirectional associative memories (BAMs) and incorporating with STRM, which are easy in implementation compared with the methods such as [17] based on the Bayesian statistical model. Using the associative values, the scheme for retrieving images by lexicons was proposed. Finally, the influence of involving the factors of SR and VS in generating associative values was tested, and the effectiveness of proposed method is examined by retrieving target images queried by 5 subjects. The accuracy analysis of retrieving images showed that considering the factors of SR and VS in generating the associative values improves the accuracy of retrieving images. On the other hand, 82% target images are retrieved by multilexicons queries with 1.4 lexicons and 2.2 query times on average by 5 subjects.For the future work, the influence of learning pattern images’ selection for representing the meanings of given lexicons on retrieval performance is needed to be analyzed. On the other hand, how to regulate the number of given lexicons in constructing BAM according to the context of actual images set is required to be explored. Further, the pixel values of images were used as learned patterns inX layer of BAM in this paper. However, the influence of other types of learned patterns, such as the feature vector of color, shape, and texture, on the accuracy of retrieving images is needed to be analyzed.On the other hand, although the experiment results regarding users’ usability in Section4.2 somewhat show the efficiency and effectiveness of the proposed approach, the system interface of querying images may give rise to the inconvenience for the user to determine the concepts from the given lexicons when the number of them increases. Accordingly, how to design the more convenient interface for retrieving images based on the proposed mechanism in this paper is also required to consider in the future.



---

*Source: 786427-2011-07-28.xml*