- Research
- Open Access
Automatic and online setting of similarity thresholds in content-based visual information retrieval problems
- Izaquiel L. Bessas^{1},
- Flávio L. C. Pádua^{1},
- Guilherme T. de Assis^{2},
- Rodrigo T. N. Cardoso^{3} and
- Anisio Lacerda^{1}Email author
https://doi.org/10.1186/s13634-016-0324-4
© Bessas et al. 2016
- Received: 22 September 2015
- Accepted: 16 February 2016
- Published: 8 March 2016
Abstract
Several information recovery systems use functions to determine similarity among objects in a collection. Such functions require a similarity threshold, from which it becomes possible to decide on the similarity between two given objects. Thus, depending on its value, the results returned by systems in a search may be satisfactory or not. However, the definition of similarity thresholds is difficult because it depends on several factors. Typically, specialists fix a threshold value for a given system, which is used in all searches. However, an expert-defined value is quite costly and not always possible. Therefore, this study proposes an approach for automatic and online estimation of the similarity threshold value, to be specifically used by content-based visual information retrieval system (image and video) search engines. The experimental results obtained with the proposed approach prove rather promising. For example, for one of the case studies, the performance of the proposed approach achieved 99.5 % efficiency in comparison with that obtained by a specialist using an empirical similarity threshold. Moreover, such automated approach becomes more scalable and less costly.
Keywords
- Information retrieval
- Content-based retrieval systems
- Similarity thresholds
1 Introduction
Nowadays, multimedia databases are applied in various fields, storing large amounts of data. Thereby, the development of image and video content-based retrieval systems (capable of efficiently managing such data) has increased as well the academic interest in the area [1, 2]. For the development of such systems, some inherent problems must be solved: the selection of appropriate descriptors to represent images [1, 3]; the selection of appropriate similarity function to measure the similarity of the images being compared [1, 4]; and the definition of a suitable similarity threshold to be used by the systems [5–9].
The scope of possible techniques to solve the problems involved in the retrieval of content-based visual information makes necessary to use metrics that can assess the quality of the results obtained by different techniques. Such systems recover not only equal but also images similar to the searched image, making it necessary to evaluate responses returned to users. In this regard, some evaluation metrics are commonly used to describe the results obtained on an information retrieval system, namely precision, recall and F1 [10], which are classical metrics commonly used in information retrieval tasks.
After pre-processing input images (consultation), information retrieval systems compare them to the collection system and categorize them as either similar or dissimilar. Such verification is done through a similarity function f, which measures similarity between images. After image comparison, the result of the similarity function is tested against a δ similarity threshold to determine image similarity (the similarity threshold’s minimum acceptable score [6–9]). Images compared with the input image whose similarity values are greater or equal to δ are considered similar, and the remaining are considered dissimilar. Typically, the values calculated by the similarity function f and defined for the value of δ similarity threshold are in a [0,1] range [5]; therefore, the closer the value returned by f is to 1, the more similar such images are.
Often, the solutions used to define δ are based on specialist-developed templates for specific searches, aimed at representing the entire collection. For each search, templates compute precision, recall and F1 values, considering different δ values. In this case, δ values maximizing F1 measurements for the highest number of searches are selected and fed to the information retrieval system. Setting the δ value in this fashion is laborious, making it unfeasible in most cases (mainly because of the need to know the entire collection).
Figure 1 a, b, c, d shows that to obtain the largest F1 value for a given search, a distinct δ value should also be considered for producing the best results. Therefore, automatic online setting of a δ value increases search effectiveness.
To automatically estimate δ in online applications, this study advocates the use of a metric based on internal criteria, possible to calculate without human intervention, as opposed to F1 calculation tied to external criteria and thus impossible to automate. Such metric is the silhouette coefficient [13] used to evaluate image clusters returning values within a [ −1…1] interval (better clusters presenting values closer to 1).
Our approach with automatic and online estimation of the objective similarity threshold through a dynamic similarity threshold value associated to individual searches enhances the efficiency of content-based visual information retrieval. More efficient automatic information retrieval (without human intervention) contributes to generate specific web page repositories, along with improved information retrieval system feedback to users.
The main contribution of the present work consists in to present and validate a new effective and efficient approach, named automatic setting similarity threshold (ASTS), to automatically estimate similarity thresholds in content-based visual information retrieval (CBVIR) problems. As far as we know, this is the first work in the literature to propose a simple and successful solution for such a problem, which is specially challenging in online applications. We claim that ASTS represents a promising alternative to the current solutions, which are commonly based on specialist-developed templates. Unfortunately, the threshold setting processes of those solutions are prone to human error and demand on significant time and financial costs. Moreover, even though the aforementioned templates are computed by considering only subsets of specific searches, their application is extended to searches involving the entire dataset, what frequently produces unsatisfactory results to end-users. Unlike those solutions, ASTS is capable to automatically and online estimate similarity thresholds associated to individual searches, enhancing the effectiveness and the efficiency of CBVIR processes.
This paper is organized as follows: Section 2 presents related work. Section 3 presents and discusses our proposed approach. Section 4 presents experimental results. Section 5 shows final considerations and future work.
2 Related work
Among studies aimed at improving content-based visual information retrieval systems, this one particularly addresses effectiveness improvement (i.e. system’s quality improvements through search, setting the automatic and online similarity threshold to be adopted).
Previous works outlined (aimed at improving such systems) address the development of techniques solving several related problems, namely the description mode of images contained in the system [2, 14–16], selection of the best similarity function [4, 17–19], creation of user profiles [20], machine learning, task clustering and indexing, stochastic algorithms [3, 20–26] and similarity threshold estimation [5–7, 9, 27, 28], the latter being the problem addressed in this paper.
For instance, in [3], the authors present a method that combines a k-means clustering algorithm with a B + tree structure to improve system results obtained through search, returning only images of the closest clusters. Another study [22] aims at improved search results. Here, we combine an evolutionary stochastic algorithm (particle swarm optimization) with feedback relevance to understand, by iterative learning, the most relevant features to users and then properly consider the image feature descriptors according to what was learned during the interaction with the user. In a previous study [21], a two-stepped recovery of multimedia information was developed, with content-based visual information retrieval being performed only in the second stage. The first step consists of searching the collection for a top-K cluster, and only after this, the cluster formation was compared by content-based visual information retrieval. Content-based visual information retrieval occurs on a reduced cluster of the collection, thus enhancing recovery efficiency.
Based on collection samples, a semi-automatic approach for the estimation of recall and precision values for various similarity thresholds minimizes efforts involved by static similarity threshold definitions [28, 29]. It requires expert input only where the number of distinct objects contained in each sample is concerned and uses two techniques to reduce human interaction, namely (i) sample use and (ii) similarity cluster process. Hence, the formed groups are used for automatic calculation of recall and precision then that resultant groups contain only objects that represent singular real objects. These clusters identify relevant objects so that when a particular object cluster is used for search, all its remaining objects are labeled relevant. Consequently, this approach generates a table of estimated recall and precision values from which it becomes possible to determine the appropriate similarity threshold for the application. Despite significantly reducing heavy expert reliance (usual in classical approaches), the proposed approach depends on specialist intervention to indicate the number of distinct objects contained in each sample. This limits the size of generated samples and reduces the number of distinct objects, making it possible for specialists to quantify them.
A new approach [5] combines two strategies to eliminate human intervention [28, 29], during the recall and precision values estimation process. They are (i) use of agglomerative hierarchical clustering algorithms and (ii) use of the silhouette coefficient for cluster evaluation. The first form clusters from different similarity thresholds without notifying the number of groups to be generated. Those are evaluated by the silhouette coefficient selecting the cluster with the highest silhouette coefficient value. Expert dependency is thus eliminated from the estimation process of the best similarity threshold and similarity function. This process is based on the premise that selected clusters (according to the validation of the clustering process) properly partition examined objects, meaning that each group represents only one real object. This premise, for example, was very important for the high linear correlation between the silhouette coefficient and F1 formally recorded in [5]. In expert-prepared templates used for recall and precision calculation, subjective external criteria may come into play. The absence of such information during the silhouette coefficient calculation potentially affects the linear correlation between this and F1 values.
In another study [5], the authors obtained relevant results by eliminating human intervention during the estimation of static similarity thresholds used by the system. However, the resultant information was used only as metadata for future similar applications, given the high computational cost of calculating silhouette coefficients, various different clusters and similarity functions for the entire collection (which excludes it from the dynamic definition of similarity thresholds). Despite being defined automatically, similarity threshold values remain used as a static similarity threshold, set and fixed for a given application. However, given that different searches may require different similarity threshold values, the definition of a single value for the latter ultimately compromises the efficiency of searches. Another relevant question regarding the use of a single similarity threshold value is that it may lose quality with the addition of new objects to the collection.
Unlike the previous methods, this work proposes an automatic and online approach, named automatic setting similarity threshold (ASTS), capable of estimating the most suitable similarity threshold value in accordance with the silhouette coefficient for individual searches, without any previous knowledge of the collection. The silhouette coefficient, originally proposed in [13] for interpretation and validation of consistency within general clusters of data, is used as a simple quality measure of the clustering step of ASTS, allowing the automatic estimation of similarity thresholds associated to individual searches. Note that the silhouette coefficient is an internal evaluation measure [30], which does not require an evaluated dataset, i.e. it does not require matching data instances to be known. As a result, our approach does not require human intervention.
3 Proposed approach
When using information retrieval systems, users expect to obtain a set of images somewhat connected with the searched object. Thus, provided answers should match the best image cluster present in the collection (collection images similar to the query). A previous study [13] indicates that a silhouette coefficient is a good cluster quality indicator, suggesting that this metric leads to a good F1 value if a good answer is obtained for any given search.
Importantly, the visual signatures of images are based on color, shape and texture information and are estimated by using the method proposed in [12]. In that work, the authors address the development of a unified approach to content-based indexing and retrieval of digital videos from television archives and estimate visual signatures to represent key frames of video recordings. More specifically, by using the method described in [12], we compute a visual signature for each image involved in our problem, containing 79 components (54 refer to color, 18 refer to texture and 7 refer to shape positions).
To ensure good recall, a low similarity threshold value (δ≈0) is initially considered. When obtaining the result of the search and comparison module (possibly with high recall), the cluster of returned images is refined to increase the response’s accuracy. Such refinement regroups the cluster of images initially returned by the search and comparison module into two clusters: (i) similar and (ii) dissimilar images to the query image. This step is executed by the similarity threshold automatic setting (module 3). The grouping is based on different similarity threshold values (δ _{0},…,δ _{ i−1},δ _{ i },δ _{ i+1},…,δ _{ n }), where the group of similar images contains objects with a degree of similarity greater than the δ _{ i } similarity threshold value and the dissimilar images contain the remaining ones. Each δ _{ i } is thus associated with a cluster evaluated by a silhouette coefficient (γ). The latter is associated with its corresponding δ _{ i }. Each δ _{ i } associated with a cluster is hereby also associated with a γ _{ i } (γ _{0},…,γ _{ i−1},γ _{ i },γ _{ i+1},…,γ _{ n }). Finally, users receive a group of similar images (module 4) tied to the largest γ _{ i } value and to a more appropriate similarity threshold. In other words, it is a cluster of similar images matching the group that obtained the best silhouette coefficient evaluation.
Algorithm 1 generically describes the proposed approach steps to such an extent that it encompasses implementations ranging from deterministic algorithms such as ASTS proposed in this study and presented in Section 3.2. The proposed approach does not previously establish a stop condition, in a way that such a condition is set according to the implementation and what is expected of the application being used.
This section is arranged as follows. In Section 3.1, we present the complexity analysis of the proposed approach. In Section 3.2, we present the ASTS algorithm, which is used to define the similarity threshold.
3.1 Complexity analysis
Once the silhouette coefficient is calculated for different pairs (δ, [ C _{ m },C _{ t }]), its computational cost is determined considering that the proposal tries to solve the problem online. The computational cost of the similarity threshold setting strategy uses a silhouette coefficient function to select the best answer. Algorithm 1 acts as the basis for this strategy cost calculation since it presents the proposed approach.
The operations related to distance calculation between vectors are used here as a metric to determine the computational cost of silhouette coefficients, adopting the formula used to calculate computational costs, as defined in [13]. The cohesion’s computational cost is given by O(n _{ m }−1), where n _{ m } is the amount of images in a C _{ m } cluster, and the computational cost of separation is \(O\left (\sum _{j=1}^{K} {n_{t}^{j}}\right)\), where K is the number of groups of dissimilar images (C _{ t }) and n _{ t } is the number of images in each group \({C_{t}^{j}}\). The amount of clusters for the proposed approach is always two (one of similar images and other of dissimilar images to the query image). The result (K=1) thus reduces the separation computational cost to O(n _{ t }). The silhouette coefficient calculation cost for a single object is O(n _{ m }−1+n _{ t }); the silhouette coefficient calculation cost for cluster equals \(O\left ({n_{m}^{2}} - n_{m} + n_{t}\right)\). The total computational cost is \(O\left ({n_{m}^{2}}\right)\) for each cluster silhouette coefficient calculation. The computational silhouette coefficient is therefore dictated by the quantity of images in C _{ m }: the more images in a group, the higher is the computational cost of its silhouette coefficient calculation.
The computational cost of the proposed approach is defined by the number of times the silhouette coefficient calculation is performed. If N equals the number of times a silhouette coefficient is calculated to define the similarity threshold, the proposed approach cost is \(O\left (N \times {n_{m}^{2}}\right)\). Thus, our proposed algorithm presents constant running time (apart from silhouette coefficient computation, which presents squared complexity).
Once the computational cost of the silhouette coefficient and the used similarity threshold setting strategy is known, adjustments can be made to achieve a better balance between runtime and effectiveness.
3.2 ASTS algorithm
The ASTS algorithm is a deterministic algorithm designed for automatic setting of similarity thresholds on the basis of a greedy paradigm. It consists of the heuristic used to estimate the best similarity threshold used in image searches (module 3 in Fig. 3). The ASTS is based on two steps: first, different similarity thresholds are explored to evaluate the quality of each one; second, the thresholds close to the best similarity threshold found by step 1 are exploited.
ASTS implementation requires establishing the following variables: l ^{′} and l ^{″} – are the lower and upper limits for δ, respectively; α is the increment value of l ^{′} to l ^{″}, which generates δ values having the initial exploration function (δ _{1},…,δ _{ i−1},δ _{ i },δ _{ i+1},…,δ _{ n }), and α<(l ^{″}−l ^{′}); β evaluates the answers closer to the best solution found until then (with β<α). The operation performed with the aid of β values is made through increases and decreases of the δ value associated with the best solution. Algorithm 2 details the ASTS operation.
According to Algorithm 2, once input variables (l ^{′}, l ^{″}, α, β) are defined and a set of answers (I) is obtained via an information retrieval system, Eq. 1 generates δ values contained within an l ^{′} to l ^{″} range (line 1). A cluster is made from each δ value (δ _{1},…,δ _{ i−1},δ _{ i },δ _{ i+1},…,δ _{ n }) generated by Eq. 1 so that for each δ _{ i }, there is a cluster (\(C_{m}^{\delta _{i}},C_{t}^{\delta _{i}}\)) (line 3). For each cluster (\(C_{m}^{\delta _{i}},C_{t}^{\delta _{i}}\)) generated by δ _{ i }, a silhouette coefficient (\(\gamma _{\delta _{i}}\)) associated with the cluster is calculated reflecting its quality (line 4). This cluster generator method and respective silhouette coefficient evaluation is repeated for all δ values generated in Eq. 1 (line 2).
Once all solutions generated for the initial operation are evaluated, the solution with the highest \(\gamma _{\delta _{i}}\) value is selected to ensure that it is the best one. The solution is then stored in two clusters with two variables \(\left ({\left (\delta _{\text {better}}^{+}, \gamma _{\text {better}}^{+}\right), \left (\delta _{\text {better}}^{-}, \gamma _{\text {better}}^{-}\right)}\right)\) upon which improvement is refined by increases and decreases (line 5). Thus, the refining process of \(\left (\delta _{\text {better}}^{+}, \gamma _{\text {better}}^{+}\right)\) is accomplished by increases and decreases in β values to the same β value in \(\left (\delta _{\text {better}}^{-}, \gamma _{\text {better}}^{-}\right)\).
With the best current solution selected, δ values are increased and decreased through β. These produce new δ _{ x } similarity thresholds, which in turn generate new clusters that are evaluated and related to \(\gamma _{\delta _{x}}\) values (lines 7, 8, 9, 12, 13, and 14). This procedure is repeated until a certain δ _{ x } similarity threshold produces a \(\gamma _{\delta _{x}}\) worse than that of the current best solution, i.e. \(\gamma _{\text {better}}^{+} > \gamma _{x}\) e \(\gamma _{\text {better}}^{-} > \gamma _{x}\) or until a limit value is reached: \(\left (\delta _{\text {better}}^{+}-\alpha \leq \delta _{x} \leq \delta _{\text {better}}^{+}+\alpha \right)\) e \(\left (\delta _{\text {better}}^{-}-\alpha \leq \delta _{x} \leq \delta _{\text {better}}^{-}+\alpha \right)\) or (l ^{′}≤δ _{ x }≤l ^{″}) (lines 6 and 11). When a better solution is found, it replaces the current best (rows 10 and 15). Identical in their logic, both second and third operations repeat Algorithm 2 blocks (lines 6 and 11, respectively); while the first explores solutions close to the best current solution by similarity threshold increases, the second does so with decreases in the same value.
After finishing exploring solutions close to the initially selected better similarity threshold, Algorithm 2 returns to users a cluster of similar images associated with the highest value of γ – in range \(\gamma _{\text {better}}^{+}\) and \(\gamma _{\text {better}}^{-}\).
4 Experimental results
To better present experimental results, this section is divided into four subsections. Section 4.1 describes experimental planning. Section 4.3 details the baselines used for performance comparison. Section 4.4 analyzes the linear correlation between F1 and silhouette coefficient metrics. Finally, Section 4.5 presents experimental results obtained by the proposed approach, comparing them against those of the defined baseline.
4.1 Experiment planning
The first experimental step was to select and organize the templates of three collections: “CAPTE” [11, 12], “Corel” [31] and “The INRIA Holidays dataset” [32].
The “CAPTE” collection consists of a set of 575 key frames extracted from 90 video blocks found on 11 TV shows aired on Rede Minas television channel [12]. The CAPTE collection is mainly composed of face images from the mentioned TV shows. The “Corel” collection consists of approximately 10,000 general purpose images, which are then reduced to 202 and distributed among 32 similar images classes manually labeled by researchers [31] (the template that was used in this study). “The INRIA Holidays dataset” collection [32] consists of 1491 general images separated into 316 semantically similar image classes.
With the collections and respective templates defined and ready to be used, its images were processed, generating a database of image signatures for each one of them. A previously described method [12] was used to estimate images signatures (module 3 in Fig. 3).
To calculate image similarity, five functions were analyzed to assess the similarity function with best F1 results, namely cosine of the θ angle, Manhattan distance, Euclidean distance, Pearson correlation coefficient and histogram intersection. These similarity functions were chosen because for their low computational cost and workability of the image signatures used.
4.2 Evaluation metric
4.3 Baselines
Following, we detail each baseline used for performance comparison.
4.3.1 Threshold impact on performance
With the collections, the image description and the similarity functions established for each pair [template of a collection/similarity function], we calculated the F1 values associated with different values of similarity threshold. This threshold was expanded from zero to one, by 0.01 increments.
where g _{ k } represents the template related to a particular collection search k, f is the similarity function used and δ _{ i }, for i=1,…,n represents the similarity threshold considered. The optimal delta represents the value of similarity threshold associated with the highest F1 in a given search k for a specific collection when using similarity functions f. It is expected that optimal δ values close to the automatically set similarity threshold proposed (δ _{ γ }) produce more effective results.
Fixed δ values defined for each pair [collection/similarity function]
f | CAPTE | INRIA | Corel |
---|---|---|---|
Cosine of the θ angle | 0.82 | 0.96 | 0.85 |
Pearson correlation coefficient | 0.88 | 0.97 | 0.91 |
Histogram intersection | 0.78 | 0.98 | 0.69 |
Euclidean distance | 0.40 | 0.72 | 0.45 |
Manhattan distance | 0.56 | 0.70 | 0.40 |
Cumulative F1 sum for each pair [collection/similarity function] for fixed δ values set (Table 1)
f | CAPTE | INRIA | Corel |
---|---|---|---|
Cosine of the θ angle | 31.73 | 211.96 | 20.68 |
Pearson correlation coefficient | 29.55 | 207.22 | 19.65 |
Histogram intersection | 39.18 | 134.87 | 21.97 |
Euclidean distance | 31.73 | 211.10 | 20.57 |
Manhattan distance | 39.18 | 216.90 | 21.92 |
From Table 2, we observe that the best F1 values for all collections is given by the similarity function based on the Manhattan’s distance, excepting “Corel benchmark” collection.
4.3.2 k-means analysis
Given that our proposed approach is based on clustering similar images, we investigate the performance of k-means algorithm [33] retrieving relevant images. The k-means algorithm is a classical method for clustering. Here, we represent images by their descriptors and vary the number of clusters (i.e. the k parameter) to evaluate the performance of k-means when compared to our proposed approach.
Specifically, we start by finding an initial set of images by conducting a query over the whole dataset. Hence, this set is used as input to k-means and a given number of expected clusters (i.e. k parameter). Finally, given the returned clusters found by k-means, we return to the user the cluster of images that have the highest average similarity value among the images within the cluster and the input image (i.e. the one used as query).
Cumulative F1 sum for k-means algorithm with distinct k values
k | CAPTE | INRIA | Corel |
---|---|---|---|
k = 2 | 3.9492 | 6.0073 | 9.2071 |
k = 4 | 5.6523 | 9.6352 | 14.1657 |
k = 8 | - | 13.6408 | 18.3246 |
Moreover, the experiments show that as we increase the values of k, the performance of the k-means algorithm also increases. We believe that this happens because as we increase the number of clusters, the precision also increases. Another possibility is that precision increases but recall decreases, which is a well known trade-off in information retrieval literature. We avoid this by limiting the number of generated clusters to avoid empty empty groups of images.
Cumulative F1 sum reached by ASTS and k-means for each k value
CAPTE | ||||
k value | F1 mean | Standard deviation | Cumulative F1 sum by k-means | Cumulative F1 sum k-means relative to δ _{ γ } |
2 | 0.0658 | 0.0669 | 3.9492 | 13.18 % |
4 | 0.0942 | 0.1014 | 5.6523 | 18.86 % |
The INRIA Holidays dataset | ||||
k value | F1 mean | Standard deviation | Cumulative F1 sum by k-means | Cumulative F1 sum k-means relative to δ _{ γ } |
2 | 0.0190 | 0.0429 | 6.0073 | 3.3 % |
4 | 0.0304 | 0.0728 | 9.6352 | 5.3 % |
8 | 0.0431 | 0.1125 | 13.5408 | 7.5 % |
Corel benchmark | ||||
k value | F1 mean | Standard deviation | Cumulative F1 sum by k-means | Cumulative F1 sum k-means relative to δ _{ γ } |
2 | 0.2877 | 0.2474 | 9.2071 | 86.92 % |
4 | 0.4426 | 0.3378 | 14.1657 | 133.73 % |
8 | 0.5726 | 0.3562 | 18.3246 | 172.99 % |
The results presented in Table 4 show that the performance of our ASTS algorithm is mostly higher than the performance of the k-means baseline. A different behavior is observed for the “Corel” dataset when considering k=4 and k=8. Note that the performance of the k-means algorithm is worst than the performance of our approach when using fixed δ. We observe that our approach presents a better performance than the tested baseline. Besides the lower performance of k-means, it has a disadvantage that the number of clusters needs to be specified beforehand. This can be difficult for large datasets and, as shown in experiments, has considerable impact on the method’s performance. Contrarily, the proposed ASTS algorithm avoids this problem, which represents an advantage for researchers and practitioners. Finally, we observe that even when keeping fixed values for δ the proposed ASTS algorithm has a higher performance than k-means algorithm for datasets “CAPTE” and “The INRIA Holidays dataset”.
4.4 Linear correlation
A high linear correlation between F1 and silhouette coefficients ensures quality in this approach’s estimations. Therefore, for each collection searched, linear correlation between these metrics was calculated. For all collections, observations revealed both high and low/almost non-linear correlation between the metrics. Only the “Corel” collection obtained results where the linear correlation was less than zero.
However, a good linear correlation between these metrics is not always guaranteed because F1 calculations consider external criteria absent during the silhouette coefficient calculation (which works with internal criteria). To calculate F1, specialists may include subjective criteria for deciding on similarity or dissimilarity of search-returned images: criteria missing on the characteristics described by the images signatures that directly affect cluster evaluation through silhouette coefficient calculation. Therefore, a higher or lower linear correlation between F1 and silhouette coefficient may be obtained for different templates of the same collection.
As previously stated, a satisfactory linear correlation between F1 and silhouette coefficients is not always possible. However, the linear correlation between these metrics may improve: the closer the decision criteria on the similarity between images is to that used by experts and by the system, the better the linear correlation between F1 and the silhouette coefficient is. Thus, according to the results obtained in this subsection, a lower efficacy is expected for the “Corel” collection when using the proposed approach.
4.5 Proposed approach evaluation
To evaluate the proposed approach, the ASTS algorithm was implemented and executed for the three collections and for five defined similarity functions. The evaluation of the retrieval process is the same for all datasets. The input query image is randomly chosen from a given cluster and the ground truth data are the other images that compose the given cluster. The aim is having as high as possible values for precision and recall, which leads to high F1 values.
In [5], the authors conducted a set of experiments to evaluate the correlation between F1 and silhouette coefficient metrics, using four similarity functions on six datasets. These experiments demonstrated that, when the silhouette coefficient is highly correlated with the F1, the similarity threshold value that maximizes the F1, on a pair dataset/similarity function, also maximizes the silhouette coefficient. Based on this result, we can say that a high linear correlation between F1 and silhouette coefficient metrics ensures efficiency in our proposed approach. Therefore, for each collection searched, linear correlation between these metrics was calculated. For all collections, observations revealed both high and low/almost non-linear correlation between the metrics. Only the “Corel” collection obtained results where the linear correlation was less than zero.
Figure 6 a, b shows that ASTS could estimate similarity thresholds (δ _{ γ }) close to δ optimal values. Such behavior often leads to high F1 values. Figure 6 c shows that most of ASTS searches estimated δ _{ γ } values distant from optimal δ (given the linear correlation observed in this collection; see Section 4.4).
Cumulative F1 sum reached by ASTS for each similarity function
CAPTE | ||||
f | Mean | Standard deviation | Cumulative F1 sum | δ _{ γ } compared to δ _{fixo} |
Cosine of the θ angle | 0.5263 | 0.3578 | 31.58 | 99.5 % |
Pearson correlation coefficient | 0.3591 | 0.3840 | 21.55 | 72.9 % |
Histogram intersection | 0.5244 | 0.3196 | 31.47 | 80.3 % |
Euclidean distance | 0.4995 | 0.3319 | 29.97 | 94.4 % |
Manhattan distance | 0.4913 | 0.3047 | 29.48 | 75.2 % |
The INRIA Holidays dataset | ||||
f | Mean | Standard deviation | Cumulative F1 sum | δ _{ γ } compared to δ _{fixo} |
Cosine of the θ angle | 0.5218 | 0.2330 | 164.90 | 77.8 % |
Pearson correlation coefficient | 0.4134 | 0.2923 | 130.64 | 63.0 % |
Histogram intersection | 0.2358 | 0.2262 | 74.54 | 55.2 % |
Euclidean distance | 0.5742 | 0.1498 | 181.47 | 86.0 % |
Manhattan distance | 0.5718 | 0.1467 | 180.70 | 83.3 % |
Corel benchmark | ||||
f | Mean | Standard deviation | Cumulative F1 sum | δ _{ γ } compared to δ _{fixo} |
Cosine of the θ angle | 0.3751 | 0.2078 | 12.00 | 58.0 % |
Pearson correlation coeficcient | 0.4520 | 0.2293 | 14.46 | 73.6 % |
Histogram intersection | 0.3318 | 0.1423 | 10.62 | 48.3 % |
Euclidean distance | 0.3310 | 0.1406 | 10.59 | 51.5 % |
Manhattan distance | 0.3310 | 0.1406 | 10.59 | 48.3 % |
Table 5 shows the collections where ASTS achieved the best results (“CAPTE” and “The INRIA Holidays” dataset). In the “CAPTE” collection, all ASTS-evaluated similarity functions achieved performances greater than 70 % when compared with a cumulative F1 sum for a fixed similarity threshold. In addition, in two other cases, the sums resemble those obtained with a fixed similarity threshold (99.5 and 94.4 %). “The INRIA Holidays dataset” collection also obtained good results, except for the similarity histogram intersection function, which achieved only 55.2 % of what was achieved with this same function when using a fixed similarity threshold. However, the remaining collection reveals performances superior to 60 %: two cases stood out with 86.0 % (for Euclidean distance) and 83.3 % (for Manhattan distance). Only one case of the “Corel” collection achieved a performance superior to 70 %.
The greatest contribution of this study is the achievement of automatic results, without specialist input, matching the best results attained by expert-defined similarity thresholds (baseline), for a given collection. Other advantages of the proposed approach are as follows: (i) scalability, (ii) resistance to changes in image content, (iii) change in the similarity function, (iv) insertion and removal of new images in the collection, and (v) no previous knowledge of the collection. Furthermore, the approach proposed hereby has the potential to achieve results superior to those obtained via fixed similarity thresholds (because the dynamic setting of a suitable value for this threshold increases result effectiveness). Improvement of the linear correlation between F1 and silhouette coefficients is required though. As described above, expert F1 calculation presupposes a template of desired queries, separating similar from dissimilar images. The criteria considered when determining image similarity or dissimilarity depends on experts. Silhouette coefficient calculation groups images according to certain thresholds and similarity functions with the similarity calculation performed on the image signature. Therefore, the closer the criterion used by specialists is to that used for similarity calculation by similarity functions f, the greater is the linear correlation between these measures and the better results become.
4.6 Parameter sensitivity
In this section, we investigate the impacts of different parameter settings on the overall performance of our method. First, we discuss the sensitivity of the α parameter, which refers to the number of initial solutions to be searched in the first step of our algorithm. Hence, we discuss the sensitivity of the β parameter, which refers to the number of answers closer to the best solution found at a given interaction.
5 Conclusions
The main challenge of this study is the dynamic and automatic setting of an appropriate similarity threshold value to be used in searches of content-based visual information retrieval systems. To accomplish this, we proposed an approach using a metric silhouette coefficient in which basic principles were implemented through an ASTS algorithm (also adopted here).
Performed tests revealed promising ASTS results. For example, the “CAPTE” and “The INRIA Holidays dataset” collections (with the greatest number of images) showed performance close to 100 %, obtained automatically (with cumulative F1 sums of the proposed approach compared with the baseline cumulative F1 sum). Notably, however, the templates of each collection contained semantically similar images (simple image signature techniques combined with similarity functions appropriate to this type of signature), thus producing good results. The techniques used on the “Corel” collection were not sufficient for the image descriptors to properly represent the characteristics that determine image resemblance, thus being irrelevant to the proposed approach.
In general, our approach achieved good results, often reaching high performances very close to those achieved by fixed specialist set similarity thresholds. Such results encourage the continuation of this work, to solve a question that significantly enhances the quality of content-based visual information retrieval systems.
We believe that pairing more robust image signatures with appropriate similarity functions to compare the first will lead to better results and a more efficient approach. The computational cost of signature calculation and comparison must be accounted for in proposals seeking to automatically determine similarity thresholds online. Image signatures used hereby are classic models. They work with global characteristic descriptors, describing images with a single vector (with low computational cost for both signature calculation and for its comparison through similarity functions). However, such signatures may not be so effective to describe image signatures working with local features. On the other hand, signature calculation on the basis of local characteristics and the calculation of its similarity (comparison of a set of vectors rather than a single vector) have high computational cost, particularly when compared to techniques working with global characteristics. It is therefore necessary to prevent silhouette coefficient computational cost increases, rendering the proposed approach unfeasible.
As future work, we plan to investigate better image representation as well as appropriate similarity functions to compare their signatures. Such way of representation and comparison directly impacts this proposal’s effectiveness and efficiency. A balance between these two characteristics (or the predominance of one over the other) depends on what is expected of the system to which the proposed approach is applied. The improvement of such techniques aims to produce high linear correlation between silhouette coefficients and F1s, which will help to generate good results in the information retrieval process.
6 Endnotes
^{1} Figures concerning the linear correlation for “CAPTE” and “The INRIA Holidays dataset” collection searches present only a data sample.
^{2} Since results for Corel and INRIA datasets are similar, we omit these results.
Declarations
Acknowledgements
The authors gratefully acknowledge the financial support of FAPEMIG-Brazil under Procs. APQ-01180-10 and APQ-02269-11; CEFET-MG under Procs. PROPESQ-088/12, PROPESQ-076/09 and PROPESQ-10314/14; CAPES-Brazil and CNPq-Brazil.
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Authors’ Affiliations
References
- R Datta, D Joshi, J Li, JZ Wang, Image retrieval: ideas, influences, and trends of the New Age. ACM Comput. Surv. 40(2), 5–1560 (2008). doi:http://dx.doi.org/10.1145/1348246.1348248.View ArticleGoogle Scholar
- MTF Tannús, Comparação de técnicas para a determinação de semelhança entre imagens digitais Master’s thesis, Universidade Federal de Uberlândia (2008).Google Scholar
- E Yildizer, AM Balci, TN Jarada, R Alhajj, Integrating wavelets with clustering and indexing for effective content-based image retrieval. Knowledge-Based Syst. 31:, 55–66 (2012).View ArticleGoogle Scholar
- G Chechik, V Sharma, U Shalit, S Bengio, Large scale online learning of image similarity through ranking. J. Mach. Learn. Res. 11:, 1109–1135 (2010).MathSciNetMATHGoogle Scholar
- JB dos Santos, CA Heuser, VP Moreira, LK Wives, Automatic threshold estimation for data matching applications. Inf. Sci. 181(13), 2685–2699 (2011). doi:http://dx.doi.org/10.1016/j.ins.2010.05.029.View ArticleGoogle Scholar
- E Schallehn, K-U Sattler, G Saake, Efficient similarity-based operations for data integration. Data & Knowledge Eng. 48(3), 361–387 (2004).View ArticleGoogle Scholar
- M Ortega-Binderberger, Integrating similarity based retrieval and query refinement in databases. PhD thesis, University of Illinois at Urbana-Champaign (2002).Google Scholar
- M Ortega-Binderberger, Integrating similarity based retrieval and query refinement in databases. Technical report, University of Illinois at Urbana-Champaign, Champaign, IL, USA (2002).Google Scholar
- A Motro, VAGUE: A user interface to relational databases that permits vague queries. ACM Trans. Inf. Syst. (TOIS). 6(3), 187–214 (1988).View ArticleGoogle Scholar
- RA Baeza-Yates, B Ribeiro-Neto, Modern information retrieval (Addison-Wesley Longman Publishing Co., Inc, Boston, MA, USA, 1999).Google Scholar
- MHR Pereira, CL de Souza, FLC Pádua, G Silva, GT de Assis, ACM Pereira, SAPTE: A multimedia information system to support the discourse analysis and information retrieval of television programs. Multimed Tools and Appl. 74:, 10923–10963 (2015).View ArticleGoogle Scholar
- CL de Souza, FLC Pádua, GT de Assis, GD Silva, CFG Nunes, A unified approach to content-based indexing and retrieval of digital videos from television archives. Artif. Intell. Res. 3:, 49–61 (2014).View ArticleGoogle Scholar
- P Rousseeuw, Silhouettes: A graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20(1), 53–65 (1987).View ArticleMATHGoogle Scholar
- RdS Torres, AX Falcão, Contour salience descriptors for effective image retrieval and analysis. Image and Vision Comput. 25:, 3–13 (2007).View ArticleGoogle Scholar
- A Vadivel, AK Majumdar, S Sural, in Proceedings of International Conference on Intelligent Sensing and Information Processing, 2004. Characteristics of weighted feature vector in content-based image retrieval applications, (2004), pp. 127–132. doi:http://dx.doi.org/10.1109/ICISIP.2004.1287638.
- T Gevers, AWM Smeulders, PicToSeek: combining color and shape invariant features for image retrieval. IEEE Trans. Image Process. 9(1), 102–119 (2000).View ArticleGoogle Scholar
- AD Doulamis, ND Doulamis, Generalized nonlinear relevance feedback for interactive content-based retrieval and organization. Circuits and Syst. Video Technology, IEEE Trans. 14(5), 656–671 (2004).View ArticleMATHGoogle Scholar
- S Aksoy, RM Haralick, Feature normalization and likelihood-based similarity measures for image retrieval. Pattern Recogn. Lett. 22(5), 563–582 (2001).View ArticleMATHGoogle Scholar
- G-D Guo, AK Jain, W-Y Ma, H-J Zhang, Learning similarity measure for natural image retrieval with relevance feedback. Neural Networks, IEEE Trans. 13(4), 811–820 (2002).View ArticleGoogle Scholar
- M Montebello, in Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Optimizing Recall/Precision Scores in IR over the WWW (ACMNew York, NY, USA, 1998), pp. 361–362. isbn: 1-58113-015-5.Google Scholar
- A Arampatzis, K Zagoris, SA Chatzichristofis, Dynamic two-stage image retrieval from large multimedia databases. Inf. Process. Manag. 49(1), 274–285 (2013). doi:http://dx.doi.org/10.1016/j.ipm.2012.03.005.View ArticleGoogle Scholar
- M Broilo, De Natale, FGB, A stochastic approach to image retrieval using relevance feedback and particle swarm optimization. Multimed. IEEE Trans. 12(4), 267–277 (2010). doi:http://dx.doi.org/10.1109/TMM.2010.2046269.View ArticleGoogle Scholar
- M Cord, PH Gosselin, S Philipp-Foliguet, Stochastic exploration and active learning for image retrieval. Image and Vision Comput. 25(1), 14–23 (2007).View ArticleGoogle Scholar
- N Doulamis, A Doulamis, Evaluation of relevance feedback schemes in content-based in retrieval systems. Signal Process. Image Commun. 21(4), 334–357 (2006).View ArticleMATHGoogle Scholar
- S Tong, E Chang, in Proceedings of the ninth ACM international conference on Multimedia. Support vector machine active learning for image retrieval (ACMNew York, NY, USA, 2001), pp. 107–118.View ArticleGoogle Scholar
- J-T Horng, C-C Yeh, Applying genetic algorithms to query optimization in document retrieval. Inf. Process. Manag. 36:, 737–759 (2000).View ArticleGoogle Scholar
- R da Silva, RK Stasiu, VM Orengo, CA Heuser, Measuring quality of similarity functions in approximate data matching. J. Informetrics. 1(1), 35–46 (2007).View ArticleGoogle Scholar
- RK Stasiu, CA Heuser, R da Silva, in Proceedings of the 17th International Conference on Advanced Information Systems Engineering. Estimating Recall and Precision for Vague Queries in Databases (Springer-VerlagBerlin, Heidelberg, 2005), pp. 187–200. isbn: 3-540-26095-1, 978-3-540-26095-0.View ArticleGoogle Scholar
- RK Stasiu, CA Heuser, Quality evaluation of similarity functions for range queries. PhD thesis, Universidade Federal do Rio Grande do Sul (2007).Google Scholar
- CD Manning, P Raghavan, H Schütze, et. al., Introduction to information retrieval, vol. 1 (Cambridge University Press, Cambridge, 2008).View ArticleMATHGoogle Scholar
- Q Lv, W Josephson, Z Wang, M Charikar, K Li, Ferret: a toolkit for content-based similarity search of feature-rich data. ACM SIGOPS Oper. Syst. Rev. Proc. 2006 EuroSys Conf. 40(4), 317–330 (2006).Google Scholar
- H Jégou, M Douze, C Schmid, Improving bag-of-features for large scale image search. Int. J. Comput. Vision. 87(3), 316–336 (2010).View ArticleGoogle Scholar
- CM Bishop, Pattern recognition and machine learning, 1st edn., vol. 1 (Springer, New York, 2006).MATHGoogle Scholar