<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>A Structured Learning Approach for Medical Image Indexing and Retrieval</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Joo-Hwee Lim</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jean-Pierre Chevallet</string-name>
          <email>Jean-Pierre.Chevallet@imag.fr</email>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Heng Mui Keng Terrace</institution>
          ,
          <country country="SG">Singapore</country>
          <addr-line>119613</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p />
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Medical images are critical assets for medical diagnosis, research, and teaching. To
facilitate automatic indexing and retrieval of large medical image databases, we propose
a structured framework for designing and learning vocabularies of meaningful medical
terms with associated visual appearance from image samples. These VisMed terms
span a new feature space to represent medical image contents. After a multi-scale
detection process, a medical image is indexed as compact spatial distributions of VisMed
terms.</p>
      <p>When queries are in the form of example images, both a query image and a database
image can be matched based on their distributions of VisMed terms, much like the
matching of feature-based histograms though the bins refer to semantic medical terms.
In addition, a flexible tiling (FlexiTile) matching scheme has been proposed to compare
the similarity between two medical images of arbitrary aspect ratios. This matching
scheme supports similarity-based retrieval with visual queries. The ranked list of such
retrieval is denoted as “i2r-vk-sim.txt” in our submission to ImageCLEF 2005.</p>
      <p>When a query is expressed as a text description that involves modality, anatomy,
and pathology etc, it can be translated into a visual query representation that chains
the presences of VisMed terms with spatial significance via logical operators (AND,
OR, NOT) and spatial quantifiers for automatic query processing based on the VisMed
image indexes. This query formulation and processing scheme allows semantics-based
retrieval with text queries. The ranked list of such retrieval is denoted as
“i2r-vksem.txt” in our submission to ImageCLEF 2005.</p>
      <p>By fusing the ranked lists from both the similarity-based and semantics-based
retrievals, we can leverage on the information expressed in both visual and text queries
respectively. The ranked list of such retrieval is denoted as “i2r-vk-avg.txt” in our
submission to ImageCLEF 2005.</p>
      <p>We apply the VisMed approach on the Medical Image Retrieval task of the
ImageCLEF track under CLEF 2005. Based on 0.3% (i.e. 158 images) of the 50, 026 images
from 4 collections plus 96 images obtained from the web, we cropped 1460 image regions
to train and validate 39 VisMed terms using support vector machines. The Mean
Average Precisions (MAP) over 25 query topics for the submissions “i2r-vk-sim.txt”,
“i2rvk-sem.txt”, and “i2r-vk-avg.txt” are 0.0721, 0.06, and 0.0921 respectively, according
to the evaluation results released by the ImageCLEF 2005 organizers. The
submission “i2r-vk-avg.txt” is also combined with text-only submissions “IPALI2R Tn” and
“IPALI2R T” to form submissions for mixed retrieval. The best MAP among these
submissions for mixed retrieval is 0.2821 from submission “IPALI2R TIan”.</p>
    </sec>
    <sec id="sec-2">
      <title>Categories and Subject Descriptors</title>
      <p>H.3 [Information Storage and Retrieval]: H.3.1 Content Analysis and Indexing; H.3.3
Information Search and Retrieval; H.3.4 Systems and Software; H.3.7 Digital Libraries; H.2 [Database
Managment]: H.2.3 Languages—Query Languages; I.4 [Image Processing and Computer
Vision]: I.4.10 Image Representation—Statistical ; J.3 [Life and Medical Sciences]: Medical
Information Systems</p>
    </sec>
    <sec id="sec-3">
      <title>General Terms</title>
      <p>Algorithms, Design, Experimentation, Languages, Performance
1</p>
      <sec id="sec-3-1">
        <title>Introduction</title>
        <p>Medical Images, Visual Ontology, Similarity-Based Retrieval, Semantics-Based Retrieval
Medical images are an integral part in medical diagnosis, research, and teaching. Medical image
analysis research has focused on image registration, measurement, and visualization. Although
large amounts of medical images are produced in hospitals every day, there is relatively less research
in medical content-based image retrieval (CBIR) [16]. Besides being valuable for medical research
and training, medical CBIR systems also have a role to play in clinical diagnosis [13]. For instance,
for less experienced radiologists, a common practice is to use a reference text to find images that
are similar to the query image [3]. Hence, medical CBIR systems can assist doctors in diagnosis
by retrieving images with known pathologies that are similar to a patient’s image(s).</p>
        <p>Among the limited research efforts of medical CBIR, classification or clustering driven feature
selection and weighting has received much attention as general visual cues often fail to be
discriminative enough to deal with more subtle, domain-specific differences and more objective ground
truth in the form of disease categories is usually available [3, 11].</p>
        <p>In reality, pathology bearing regions tend to be highly localized [3]. Hence, local features such
as those extracted from segmented dominant image regions approximated by best fitting ellipses
have been proposed [6]. A hierarchical graph-based representation and matching scheme has been
suggested to deal with multi-scale image decomposition and their spatial relationships [6].
However, it has been recognized that pathology bearing regions cannot be segmented out automatically
for many medical domains [16]. As an alternative, a comprehensive set of 15 perceptual categories
related to pathology bearing regions and their discriminative features are carefully designed and
tuned for high-resolution CT lung images to achieve superior precision rates over a brute-force
feature selection approach [16].</p>
        <p>Hence, it is desirable to have a medical CBIR system that represents images in terms of
semantic local features, that can be learned from examples (rather than handcrafted with a lot
of expert input) and do not rely on robust region segmentation. In order to manage large and
complex set of visual entities (i.e. high content diversity) in the medical domain, we propose
a structured learning framework to facilitate modular design and extraction of medical visual
semantics, VisMed terms, in building content-based medical image retrieval systems (Section 2).
VisMed terms are image regions that exhibit semantic meanings to medical practitioners and that
can be learned statistically to span a new indexing space (Section 2.1). During image indexing,
they are detected in image content, reconciled across multiple resolutions, and aggregated spatially
to form local semantic histograms (Section 2.2).</p>
        <p>The resulting compact and abstract VisMed image indexes can support both similarity-based
query and semantics-based query efficiently, as we will describe how they are applied to
ImageCLEF 2005 datasets in Section 3. When queries are in the form of example images, both a query
image and a database image can be matched based on their distributions of VisMed terms, much
like the matching of feature-based histograms though the bins refer to semantic medical terms. In
addition, a flexible tiling (FlexiTile) matching scheme has been proposed to compare the similarity
between two medical images of arbitrary aspect ratios (Section 3.1).</p>
        <p>When a query is expressed as a text description that involves modality, anatomy, and pathology
etc, they can be translated into a visual query representation that chains the presences of VisMed
terms with spatial significance via logical operators (AND, OR, NOT) and spatial quantifiers for
automatic query processing based on the VisMed image indexes. This query formulation and
processing scheme allows semantics-based retrieval with text queries (Section 3.2). By fusing the
ranked lists from both the similarity-based and semantics-based retrievals, we can leverage on the
information expressed in both visual and text queries respectively (Section 3.3). The relevant
ImageCLEF 2005 evaluation results will be discussed (Section 3.4) before conclusion.</p>
      </sec>
      <sec id="sec-3-2">
        <title>Learning VisMed Terms for Image Indexing</title>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Learning of VisMed Terms</title>
      <p>VisMed terms are typical semantic tokens with visual appearance in medical images (e.g.
Xraybone-fracture, CT-abdomen-liver, MRI-head-brain, photo-skin). They are defined using image
region instances cropped from sample images and modeled and built based on statistical learning.
In this paper, we have adopted color and texture features as well as support vector machines
(SVMs) [18] for VisMed term representation and learning respectively though the framework is
not dependent on a particular feature and classifier. The notion of using a visual vocabulary to
represent and index image contents for more effective (i.e. semantic) query and retrieval has been
proposed and applied to consumer images [7, 10].</p>
      <p>
        To compute VisMed terms from training instances, we use SVMs on color and texture features
for an image region and denote this feature vector as z. A SVM Sk is a detector for VisMed term
k on z. The classification vector T for region z is computed via the softmax function [1] as
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
Tk(z) =
expSk(z)
j expSj(z) .
i.e. Tk(z) corresponds to a VisMed entry in the 39-dimensional vector T adopted in this paper.
      </p>
      <p>In our experiments, we use the YIQ color space over other color spaces (e.g. RGB, HSV,
LUV) as it performed better in our experiments. For the texture feature, we adopted the Gabor
coefficients which have been shown to provide excellent pattern retrieval results [12].</p>
      <p>A feature vector z has two parts, namely, a color feature vector zc and a texture feature vector
zt. We compute the mean and standard deviation of each YIQ color channel and the Gabor
coefficients (5 scales, 6 orientations) respectively [10]. Hence the color feature vector zc has 6
dimensions and the texture feature vector zt has 60 dimensions. Zero-mean normalization [15]
was applied to both the color and texture features. In our evaluation described below, we adopted
RBF kernels with modified city-block distance between feature vectors y and z,
|y − z| = 21 ( |ycN−czc| + |ytN−t zt| )
where Nc and Nt are the numbers of dimensions of the color and texture feature vectors (i.e. 6
and 60) respectively. This just-in-time feature fusion within the kernel combines the contribution
of color and texture features equally. It is simpler and more effective than other feature fusion
methods that we have attempted.
2.2</p>
    </sec>
    <sec id="sec-5">
      <title>Image Indexing based on VisMed Terms</title>
      <p>After learning, the VisMed terms are detected during image indexing from multi-scale block-based
image patches without region segmentation to form semantic local histograms as described below.</p>
      <p>
        Conceptually, the indexing is realized in a three-layer visual information processing architecture
(Figure 1). The bottom layer denotes the pixel-feature maps computed for feature extraction. In
our experiments, there are 3 color maps (i.e. YIQ channels) and 30 texture maps (i.e. Gabor
coefficients of 5 scales and 6 orientations). From these maps, feature vectors zc and zt compatible
with those adopted for VisMed term learning (Equation (
        <xref ref-type="bibr" rid="ref2">2</xref>
        )) are extracted.
      </p>
      <p>Spatial Aggregration Map</p>
      <p>Reconciled Detection Map sx
pixel-feature layer
sy</p>
      <p>N
rx</p>
      <p>Q
dy</p>
      <p>B</p>
      <p>A</p>
      <p>P
ry
dx</p>
      <p>M</p>
      <p>
        To detect VisMed terms with translation and scale invariance in an image to be indexed, the
image is scanned with windows of different scales, similar to the strategy in view-based object
detection [17, 14]. More precisely, given an image I with resolution M × N , the middle layer,
Reconciled Detection Map (RDM), has a lower resolution of P × Q, P ≤ M, Q ≤ N . Each pixel
(p, q) in RDM corresponds to a two-dimensional region of size rx × ry in I. We further allow
tessellation displacements dx, dy &gt; 0 in X, Y directions respectively such that adjacent pixels in
RDM along X direction (along Y direction) have receptive fields in I which are displaced by dx
pixels along X direction (dy pixels along Y direction) in I. At the end of scanning an image, each
pixel (p, q) that covers a region z in the pixel-feature layer will consolidate the classification vector
Tk(z) (Equation (
        <xref ref-type="bibr" rid="ref1">1</xref>
        )).
      </p>
      <p>
        In our experiments, we progressively increase the window size rx × ry from 20 × 20 to 60 × 60
at a displacement (dx, dy) of (
        <xref ref-type="bibr" rid="ref10 ref10">10, 10</xref>
        ) pixels, on an image whose longer side is fixed at 360 pixels
after a size normalization step that preserves the aspect ratio. After the detection step, we have
5 maps of detection of dimensions 23 × 35 to 19 × 31, which are reconciled into a common RDM
as explained below.
      </p>
      <p>To reconcile the detection maps across different resolutions onto a common basis, we adopt the
following principle: If the most confident classification of a region at resolution r is less than that
of a larger region (at resolution r + 1) that subsumes the region, then the classification output
of the region should be replaced by those of the larger region at resolution r + 1. For instance,
if the detection of a face is more confident than that of a building at the nose region (assuming
that both face and building (but not nose) are in the visual vocabulary designed for a particular
application), then the entire region covered by the face, which subsumes the nose region, should
be labeled as face.</p>
      <p>Using this principle, we compare detection maps of two consecutive resolutions at a time, in
descending window sizes (i.e. from windows of 60 × 60 and 50 × 50 to windows of 30 × 30 and
20 × 20). After 4 cycles of reconciliation, the detection map that is based on the smallest scan
window (20 × 20) would have consolidated the detection decisions obtained at other resolutions
for further spatial aggregation.</p>
      <p>The purpose of spatial aggregation is to summarize the reconciled detection outcome in a
larger spatial region. Suppose a region Z comprises of n small equal regions with feature vectors
z1, z2, · · · , zn respectively. To account for the size of detected VisMed terms in the spatial area Z,
the classification vectors of the reconciled detection map are aggregated as</p>
      <p>Tk(Z) =
1
n
i</p>
      <p>Tk(zi).</p>
      <p>
        (
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
      </p>
      <p>This is the top layer in our three-layer visual information processing architecture where a
Spatial Aggregation Map (SAM) further tessellates over RDM with A × B, A ≤ P, B ≤ Q pixels.
This form of spatial aggregation does not encode spatial relation explicity. But the design flexibility
of sx, sy in SAM on RDM (the equivalent of rx, ry in RDM on I) allows us to specify the location
and extent in the content to be focused and indexed. We can choose to ignore unimportant
areas (e.g. margins) and emphasize certain areas with overlapping tessellation. We can even have
different weights attached to the areas during similarity matching.</p>
      <p>
        To facilitate spatial aggregation and matching of image with different aspect ratios ρ, we design
5 tiling templates for Eq. (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ), namely 3 × 1, 3 × 2, 3 × 3, 2 × 3, and 1 × 3 grids resulting in 3, 6, 9, 6,
and 3 Tk(Z) vectors per image respectively. Since the tiling templates have aspect ratios of 3, 1.5,
and 1, the decision thresholds to assign a template for an image are set to their mid-points (2.25
and 1.25) as ρ &gt; 2.25, 1.25 &lt; ρ ≤ 2.25, and ρ ≤ 1.25 respectively based on ρ = SL where L and S
refer to the longer and shorter sides of an image respectively. For more details on detection-based
indexing, readers are referred to [10].
3
      </p>
      <sec id="sec-5-1">
        <title>Medical Image Retrieval using VisMed Terms</title>
        <p>As part of the Cross Language Evaluation Forum (CLEF), the ImageCLEF 2005 track [2] that
promotes cross language image retrieval has a Medical Image Retrieval (MedIR) task in 2005,
organized by Henning Mueller and William Hersh. The test collection contains images from the
Casimage, MIR, PEIR, and PathoPIC datasets with a total of 50, 026 images. The collection
contains annotations in XML format. The majority of the annotations are in English but a
significant number is also in French and German, with a few cases that do not contain any annotation
at all. The 25 queries for the MedIR task have been formulated with example images and short
textual descriptions. The organizers evaluate retrieval performance in terms of uninterpolated
Mean Average Precision (MAP) computed across all topics using trec eval.</p>
        <p>
          We have applied the VisMed approach on the MedIR task. We set out to designed VisMed
terms that correspond to typical semantic regions in the medical images. However due to time
constraints, we only designed 39 VisMed terms relevant to the query topics. Table 1 lists the
39 VisMed terms (
          <xref ref-type="bibr" rid="ref1 ref10 ref11 ref12 ref13 ref14 ref15 ref16 ref17 ref18 ref2 ref3 ref4 ref5 ref6 ref7 ref8 ref9">00-38</xref>
          ) and Figure 2 illustrates one visual example each for the VisMed terms
from top-left (00) to bottom-right (38) in row-wise order. The last two VisMed terms in Table
1, “image-region-bright” and “image-region-dark”, refer to bright and dark patches in an image
respectively. With a uniform VisMed framework, dark background in the scan images (e.g. CT,
MRI) and bright (i.e. empty) areas in drawing etc are simply modeled as dummy terms instead
of using image preprocessing to detect them separately.
        </p>
        <p>Based on 0.3% (i.e. 158 images) of the 50, 026 images from the 4 collections plus 96 images
obtained from the web, we cropped 1460 image regions to train and validate 39 VisMed terms
using SVMs. As we would like to minimize the number of images selected from the test collection
for VisMed term learning, we include relevant images available from the web. For a given VisMed
term, the negative samples are the union of the positive samples of all the other 38 VisMed terms.
We ensure that they do not contain any of the positive and negative query images given by the
25 query topics.</p>
        <p>
          The odd and even entries of the cropped regions are used as training and validation sets
respectively (i.e. 730 each) to optimize the RBF kernel parameter of support vector machines.
The best generalization performance with mean error 1.01% on the validation set was obtained
with C = 100, α = 1.0 [4]. Both the training and validation sets are then combined to form
a larger training set to retrain the 39 VisMed detectors. Both query and database images are
indexed using the framework as described in the previous section (Eq. (
          <xref ref-type="bibr" rid="ref1">1</xref>
          ) to (
          <xref ref-type="bibr" rid="ref3">3</xref>
          )).
3.1
        </p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Similarity-Based Retrieval with Visual Query</title>
      <p>Given two images represented as different grid patterns, we propose a flexible tiling (FlexiTile)
matching scheme to cover all possible matches. For instance, given a query image Q of 3 × 1 grid
and an image Z of 3 × 3 grid, intuitively Q should be compared to each of the 3 columns in Z and
the highest similarity will be treated as the final matching score. As another example, consider
matching a 3 × 2 grid with 2 × 3 grid. The 4 possible tiling and matching choices are shown in
Figure 3.</p>
      <p>
        The FlexiTile matching scheme is formalized as follows. Suppose a query image Q and a
database image Z are represented as M1 × N1 and M2 × N2 grids respectively. The overlaping
grid M × N where M = min(M1, M2) and N = min(N1, N2) is the maximal matching area. The
similarity λ between Q and Z is the maximum matching among all possible M × N tilings,
λ(Q, Z) = m1=mu1a,nx1=v1 m2=mu2a,nx2=v2 λ(Qm1,n1 , Zm2,n2 ),
m1=1,n1=1 m2=1,n2=1
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
where u1 = M1 − M + 1, v1 = N1 − N + 1, u2 = M2 − M + 1, v2 = N2 − N + 1 and the similarity
for each tiling λ(Qm1,n1, Zm2,n2) is defined as the average similarity over M × N blocks as
and finally the similarity λij(Qm1,n1, Zm2,n2) between two image blocks is computed based on L1
distance measure (city block distance) as,
where p1 = m1 + i, q1 = n1 + j, p2 = m2 + i, q2 = n2 + j and it is equivalent to color histogram
intersection except that the bins have semantic interpretation as VisMed terms.
      </p>
      <p>However, to avoid spurious matching between very different grids (e.g. 3 × 1 and 1 × 3), we set
the similarity to zero if the difference in a grid dimension between two image indexes is more than
one. That is, two images are considered dissimilar if they exhibit very different aspect ratios.</p>
      <p>There is a trade-off between content symmetry and spatial specificity. If we want images of
similar semantics with different spatial arrangement (e.g. mirror images) to be treated as similar,
we can have larger tessellated block in SAM (i.e. the extreme case is a global histogram). However
in applications such as medical images where there is usually very small variance in views and
spatial locations are considered differentiating across images, local histograms will provide good
sensitivity to spatial specificity. Furthermore, we can attach different weights to the blocks to
emphasize the focus of attention (e.g. center) if necessary. In this paper, we report experimental
results based on even weights as grid tessellation is used.</p>
      <p>Now we extend the similarity matching for multiple query images. Let us denote Q+ =
{Q1+, Q2+, · · · , Qp+} and Q− = {Q1−, Q2−, · · · , Qn−} as the sets of positive and negative query images
respectively and Q = Q+ ∪ Q−. We define the similarity between a set of query images and a
database image Z as the maximum similarity among similarities between each query image and
Z i.e.</p>
      <p>λ(Q+, Z) =
λ(Q−, Z) =
max λ(Qi+, Z),</p>
      <p>i
max λ(Qi−, Z).</p>
      <p>i
If Q− = ∅, then λ(Q, Z) = λ(Q+, Z). Conversely, if Q+ = ∅, then λ(Q, Z) = 1 − λ(Q−, Z). If Z
is exactly one of the positive query images or negative query images, then λ(Q, Z) should be 1 or
0 respectively i.e. λ(Q+, Z) = 1 or λ(Q−, Z) = 1 respectively. Otherwise,</p>
    </sec>
    <sec id="sec-7">
      <title>Semantics-Based Retrieval with Text Query</title>
      <p>
        A new visual query language, Query by Spatial Icons (QBSI), has been proposed to combine
pattern matching and logical inference [10]. A QBSI query is composed as a spatial arrangement
of visual semantics. A Visual Query Term (VQT) P specifies a region R where a VisMed i should
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
(
        <xref ref-type="bibr" rid="ref6">6</xref>
        )
(
        <xref ref-type="bibr" rid="ref7">7</xref>
        )
(
        <xref ref-type="bibr" rid="ref8">8</xref>
        )
(
        <xref ref-type="bibr" rid="ref9">9</xref>
        )
appear and a query formulus chains these terms up via logical operators. The truth value µ(P, Z)
of a VQT P for any image Z is simply defined as
(
        <xref ref-type="bibr" rid="ref10">10</xref>
        )
(
        <xref ref-type="bibr" rid="ref11">11</xref>
        )
(
        <xref ref-type="bibr" rid="ref12">12</xref>
        )
(
        <xref ref-type="bibr" rid="ref13">13</xref>
        )
(
        <xref ref-type="bibr" rid="ref14">14</xref>
        )
(
        <xref ref-type="bibr" rid="ref15">15</xref>
        )
(
        <xref ref-type="bibr" rid="ref16">16</xref>
        )
µ(P, Z) =
      </p>
      <p>Zj∈R Ti(Zj )
|R|
where Zj are the blocks in a grid that cover R and |R| denotes the number of such blocks. This
corresponds to a spatial universal quantifier (∀).</p>
      <p>
        On the other hand, if a query only requires the presence of a VisMed term within a region
regardless of the area of the presence (e.g. presence of a bone fracture, presence of micro nodules),
then the semantics is equivalent to the spatial existential quantifier (∃) and Equation (
        <xref ref-type="bibr" rid="ref10">10</xref>
        ) will be
computed as
      </p>
      <p>µ(P, Z) = Zmj∈axR Ti(Zj )</p>
      <p>A QBSI query P can be specified as a disjunctive normal form of VQT (with or without
negation),</p>
      <p>P = (P11 ∧ P12 ∧ · · ·) ∨ · · · ∨ (Pc1 ∧ Pc2 ∧ · · ·)
Then the query processing of query P for any image Z is to compute the truth value µ(P, Z) using
appropriate logical operators. As uncertainty values are involved in VisMed term detection and
indexing, we adopt fuzzy operations [5] as follows:</p>
      <p>
        µ(P, Z) = Ti(R)
where Ti(R) is defined in Equation (
        <xref ref-type="bibr" rid="ref3">3</xref>
        ).
      </p>
      <p>
        As described in Section 2.2, the medical images are indexed as 3 ×1, 3 ×2, 3 ×3, 2 ×3, and 1 ×3
grids, depending on their aspect ratios. When a query involves the presence of a VisMed term in
a region larger than a single block in a grid and its semantics prefers a larger area of presence of
the VisMed term to have a good match (e.g. entire kidney, skin lesion, chest x-ray images with
tuberculosis), Equation (
        <xref ref-type="bibr" rid="ref10">10</xref>
        ) will become
      </p>
      <p>µ(P¯, Z) = 1 − µ(P, Z),
µ(Pi ∧ Pj, Z) =
µ(Pi ∨ Pj, Z) =
min(µ(Pi, Z), µ(Pj, Z)),
max(µ(Pi, Z), µ(Pj, Z)).</p>
      <p>For the query processing of the query topics in ImageCLEF 2005, a query text description
is manually translated into a QBSI query with the help of a visual query interface [10] which
outputs an XML format to state the VisMed terms, the spatial regions, the Boolean operators,
and the spatial quantifiers. As an illustration, query 02 “Show me x-ray images with fractures of
the femur” is translated as “∀ xray-bone ∈ whole ∧ ∀ xray-pelvis ∈ upper ∧ ∃ xray-bone-fracture
∈ whole
” where “whole” and “upper” refer to the whole image and upper part of an image respectively.</p>
      <p>In fact, the VisMed terms can be further structured into an abstraction hierarchy, namely, IS-A
hierarchy and Part-Whole hierarchy, to support more complex queries. Some possible examples
of IS-A hierarchies are: a skin lesion can be either benign or malignant; different specific types of
bone fracture belong to a common “bone fracture”. A Part-Whole hierarchy allows us to detect
(and query) a complex object in terms of its constituent parts. This is especially useful when a
3D object has no consistent shape representation in a 2D image. For more details about QBSI,
please refer to [10].
3.3</p>
    </sec>
    <sec id="sec-8">
      <title>Combining Similarity- and Semantics-Based Retrieval</title>
      <p>
        If a query topic is represented with both query images and text description, we can combine the
similarities resulting from query processing using Equations (
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) to (
        <xref ref-type="bibr" rid="ref9">9</xref>
        ) and (
        <xref ref-type="bibr" rid="ref10">10</xref>
        ) to (
        <xref ref-type="bibr" rid="ref16">16</xref>
        ) respectively.
A simple scheme would be a linear combination of λ(Q, Z) and µ(P, Z) with ω ∈ [0, 1]
ρ(Q, P, Z) = ω · λ(Q, Z) + (1 − ω) · µ(P, Z)
(
        <xref ref-type="bibr" rid="ref17">17</xref>
        )
where ρ is the overall similarity and the optimal ω can be determined empirically using even
sampling at 0.1 intervals.
      </p>
    </sec>
    <sec id="sec-9">
      <title>Evaluation from ImageCLEF 2005 Organizers</title>
      <p>According to the ImageCLEF 2005 organizers, the MAP over 25 query topics for the submissions on
similarity-based retrieval (Section 3.1, labeled as “i2r-vk-sim.txt”), semantics-based retrieval
(Section 3.2, labeled as “i2r-vk-sem.txt”), and their fusion (Section 3.3, denoted as “i2r-vk-avg.txt”) are
0.0721, 0.06, and 0.0921 respectively. The submission “i2r-vk-avg.txt” is also combined with
textonly submissions “IPALI2R Tn” and “IPALI2R T” to form submissions for mixed retrieval. The
best MAP among these submissions for mixed retrieval is 0.2821 by submission “IPALI2R TIan”.
More details can be found at the website http://trec.ohsu.edu/image/.</p>
      <p>The performance of the current VisMed implementation can be further improved. First of
all, only two features, one each for color and texture, have been used to train the VisMed term
detectors. More domain-specific features can be incorporated to enhance detection accuracies.</p>
      <p>Secondly, some VisMed terms have high variations in visual appearances, it may be necessary
to divide them into subclasses to ease the learning task. For example, 09-path-kidney may appear
in different colors, 21-photo-stomach-ulcer has to cover both endoscopic and pathological images,
etc.</p>
      <p>
        Lastly, more relevant training samples for the VisMed terms should be collected based on
proper domain understanding to have better detection generalization. As we wanted to minimize
the number of images from the test collection used for learning VisMed terms, we tried to look
for additional images from the web. However, towards the end of the experiments of the VisMed
approach, we realized that the web images, which were supposed to complement the very small
training set selected from the test collection, consist of visual samples that are atypical (or even
rather different) from those found in the medical test collection (i.e. over-generalization). For
instance, as shown in Figure 4, the visual samples used to train VisMed terms related to face
(1113), hand osteoarthritis (
        <xref ref-type="bibr" rid="ref15">15</xref>
        ), skin and lesion (
        <xref ref-type="bibr" rid="ref18">18-20</xref>
        ), kidney pathologies (
        <xref ref-type="bibr" rid="ref17">17</xref>
        ), and sketch (26-27),
are not easily found (if not irrelevant) in the given test collection.
4
      </p>
      <sec id="sec-9-1">
        <title>Conclusion</title>
        <p>Medical CBIR is an emerging and challenging research area. We have proposed a structured
framework for designing image semantics from statistical learning. Our adaptive framework is
scalable to different image domains [10, 8] and embraces other design choices such as better visual
features, learning algorithms, object detectors, spatial aggregation and matching schemes when
they become available.</p>
        <p>We reckon that a limitation of the current VisMed approach is the need to design the VisMed
terms manually with labeled image patches as training samples. We have begun some work in a
semi-supervised approach to discover meaningful visual vocabularies from minimally labeled image
samples [9]. In the near future, we would also explore the integration with inter-class semantics
[8]. Last but not least, we would also work with medical experts to design a more comprehensive
set of VisMed terms to cover all the essential semantics in medical images.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>C.M.</given-names>
            <surname>Bishop</surname>
          </string-name>
          .
          <article-title>Neural Networks for Pattern Recognition</article-title>
          . Clarendon Press, Oxford,
          <year>1995</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>P.</given-names>
            <surname>Clough</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Muller</surname>
          </string-name>
          .
          <article-title>The clef cross language image retrieval track (imageclef) 2005</article-title>
          . http://ir.shef.ac.uk/imageclef2005/,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J.G.</given-names>
            <surname>Dy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.E.</given-names>
            <surname>Brodley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.C.</given-names>
            <surname>Kak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.S.</given-names>
            <surname>Broderick</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.M.</given-names>
            <surname>Aisen</surname>
          </string-name>
          .
          <article-title>Unsupervised feature selection applied to content-based retrieval of lung images</article-title>
          .
          <source>IEEE Trans. on PAMI</source>
          ,
          <volume>25</volume>
          (
          <issue>3</issue>
          ):
          <fpage>373</fpage>
          -
          <lpage>378</lpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>T.</given-names>
            <surname>Joachims</surname>
          </string-name>
          .
          <article-title>Making large-scale svm learning practical</article-title>
          . In B.
          <string-name>
            <surname>Scholkopf</surname>
            ,
            <given-names>C.J.C.</given-names>
          </string-name>
          <string-name>
            <surname>Burges</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <surname>A</surname>
          </string-name>
          . Smola, editors,
          <source>Advances in Kernel Methods - Support Vector Learning</source>
          , pages
          <fpage>169</fpage>
          -
          <lpage>184</lpage>
          . MIT-Press,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>G.J.</given-names>
            <surname>Klir</surname>
          </string-name>
          and
          <string-name>
            <given-names>T.A.</given-names>
            <surname>Folger</surname>
          </string-name>
          . Fuzzy Sets, Uncertainty, and Information. Prentice Hall,
          <year>1992</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>T.M.</given-names>
            <surname>Lehmann</surname>
          </string-name>
          et al.
          <article-title>Content-based image retrieval in medical applications</article-title>
          .
          <source>Methods Inf Med</source>
          ,
          <volume>43</volume>
          :
          <fpage>354</fpage>
          -
          <lpage>361</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>J.H.</given-names>
            <surname>Lim</surname>
          </string-name>
          .
          <article-title>Building visual vocabulary for image indexation and query formulation</article-title>
          .
          <source>Pattern Analysis and Applications</source>
          ,
          <volume>4</volume>
          (
          <issue>2</issue>
          ):
          <fpage>125</fpage>
          -
          <lpage>139</lpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.H.</given-names>
            <surname>Lim</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.S.</given-names>
            <surname>Jin</surname>
          </string-name>
          .
          <article-title>Combining intra-image and inter-class semantics for consumer image retrieval</article-title>
          .
          <source>Pattern Recognition</source>
          ,
          <volume>38</volume>
          (
          <issue>6</issue>
          ):
          <fpage>847</fpage>
          -
          <lpage>864</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.H.</given-names>
            <surname>Lim</surname>
          </string-name>
          and
          <string-name>
            <surname>J.S. Jin.</surname>
          </string-name>
          <article-title>Discovering recurrent image semantics from class discrimination</article-title>
          .
          <source>EURASIP Journal of Applied Signal Processing</source>
          ,
          <year>2005</year>
          . to appear.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>J.H.</given-names>
            <surname>Lim</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.S.</given-names>
            <surname>Jin</surname>
          </string-name>
          .
          <article-title>A structured learning framework for content-based image indexing and visual query</article-title>
          .
          <source>Multimedia Systems Journal</source>
          ,
          <volume>10</volume>
          (
          <issue>4</issue>
          ):
          <fpage>317</fpage>
          -
          <lpage>331</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          et al.
          <article-title>Semantic based biomedical image indexing and retrieval</article-title>
          . In L. Shapiro,
          <string-name>
            <given-names>H.P.</given-names>
            <surname>Kriegel</surname>
          </string-name>
          , and R. Veltkamp, editors,
          <source>Trends and Advances in Content-Based Image and Video Retrieval</source>
          . Springer,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>B.S.</given-names>
            <surname>Manjunath</surname>
          </string-name>
          and
          <string-name>
            <given-names>W.Y.</given-names>
            <surname>Ma</surname>
          </string-name>
          .
          <article-title>Texture features for browsing and retrieval of image data</article-title>
          .
          <source>IEEE Trans. on PAMI</source>
          ,
          <volume>18</volume>
          (
          <issue>8</issue>
          ):
          <fpage>837</fpage>
          -
          <lpage>842</lpage>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>H.</given-names>
            <surname>Muller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Michoux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Bandon</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Geissbuhler</surname>
          </string-name>
          .
          <article-title>A review of content-based image retrieval systems in medical applications - clinical benefits and future directions</article-title>
          .
          <source>Intl. J. of Medical Informatics</source>
          ,
          <volume>73</volume>
          (
          <issue>1</issue>
          ):
          <fpage>1</fpage>
          -
          <lpage>23</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>P.C.</given-names>
            <surname>Papageorgiou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Oren</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Poggio</surname>
          </string-name>
          .
          <article-title>A general framework for object detection</article-title>
          .
          <source>In Proc. of ICCV</source>
          , pages
          <fpage>555</fpage>
          -
          <lpage>562</lpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Rui</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.S.</given-names>
            <surname>Huang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Mehrotra</surname>
          </string-name>
          .
          <article-title>Content-based image retrieval with relevance feedback in mars</article-title>
          .
          <source>In Proc. of IEEE ICIP</source>
          , pages
          <fpage>815</fpage>
          -
          <lpage>818</lpage>
          ,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>C.R.</given-names>
            <surname>Shyu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Pavlopoulou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.C.</given-names>
            <surname>Kak</surname>
          </string-name>
          , and
          <string-name>
            <given-names>C.E.</given-names>
            <surname>Brodley</surname>
          </string-name>
          .
          <article-title>Using human perceptual categories for content-based retrieval from a medical image database</article-title>
          .
          <source>Computer Vision</source>
          and Image Understanding,
          <volume>88</volume>
          :
          <fpage>119</fpage>
          -
          <lpage>151</lpage>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <surname>K.K. Sung</surname>
            and
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Poggio</surname>
          </string-name>
          .
          <article-title>Example-based learning for view-based human face detection</article-title>
          .
          <source>IEEE Trans. on PAMI</source>
          ,
          <volume>20</volume>
          (
          <issue>1</issue>
          ):
          <fpage>39</fpage>
          -
          <lpage>51</lpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>V.N.</given-names>
            <surname>Vapnik</surname>
          </string-name>
          .
          <article-title>Statistical Learning Theory</article-title>
          . Wiley, New York,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>