Search (3 results, page 1 of 1)

0.009757902 = product of:
  0.019515803 = sum of:
    0.019515803 = product of:
      0.039031606 = sum of:
        0.039031606 = weight(_text_:r in 973) [ClassicSimilarity], result of:
          0.039031606 = score(doc=973,freq=4.0), product of:
            0.15092614 = queryWeight, product of:
              3.3102584 = idf(docFreq=4387, maxDocs=44218)
              0.045593463 = queryNorm
            0.25861394 = fieldWeight in 973, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.3102584 = idf(docFreq=4387, maxDocs=44218)
              0.0390625 = fieldNorm(doc=973)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

XMage is introduced in this paper as a method for partial similarity searching in image databases. Region-based image retrieval is a method of retrieving partially similar images. It has been proposed as a way to accurately process queries in an image database. In region-based image retrieval, region matching is indispensable for computing the partial similarity between two images because the query processing is based upon regions instead of the entire image. A naive method of region matching is a sequential comparison between regions, which causes severe overhead and deteriorates the performance of query processing. In this paper, a new image contents representation, called Condensed eXtended Histogram (CXHistogram), is presented in conjunction with a well-defined distance function CXSim() on the CX-Histogram. The CXSim() is a new image-to-image similarity measure to compute the partial similarity between two images. It achieves the effect of comparing regions of two images by simply comparing the two images. The CXSim() reduces query space by pruning irrelevant images, and it is used as a filtering function before sequential scanning. Extensive experiments were performed on real image data to evaluate XMage. It provides a significant pruning of irrelevant images with no false dismissals. As a consequence, it achieves up to 5.9-fold speed-up in search over the R*-tree search followed by sequential scanning.

0.006899878 = product of:
  0.013799756 = sum of:
    0.013799756 = product of:
      0.027599512 = sum of:
        0.027599512 = weight(_text_:r in 172) [ClassicSimilarity], result of:
          0.027599512 = score(doc=172,freq=2.0), product of:
            0.15092614 = queryWeight, product of:
              3.3102584 = idf(docFreq=4387, maxDocs=44218)
              0.045593463 = queryNorm
            0.18286766 = fieldWeight in 172, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.3102584 = idf(docFreq=4387, maxDocs=44218)
              0.0390625 = fieldNorm(doc=172)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

0.0046329633 = product of:
  0.009265927 = sum of:
    0.009265927 = product of:
      0.018531853 = sum of:
        0.018531853 = weight(_text_:22 in 4054) [ClassicSimilarity], result of:
          0.018531853 = score(doc=4054,freq=2.0), product of:
            0.15966053 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.045593463 = queryNorm
            0.116070345 = fieldWeight in 4054, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0234375 = fieldNorm(doc=4054)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

6. 1.2011 11:22:12