A survey on Content Based Image Retrieval using Color, Texture and Shape

Jasmine Shiny. D
Assistant Professor, Department of Information Technology, CMS College Of Engineering, Nama al, Tamilna!", In!ia e#mail$ neoshiny.!a%i!&gmail.com 'aisal E.( Pro)ect Engineer, *ipro Technologies, Cochin, (erala. e#mail$ faisal.e &gmail.com

Santhosh. M
Assistant Professor, Department of Information Technology, CMS College Of Engineering, Nama al, Tamilna!", In!ia e#mail$ santhoshm+ ,&gmail.com

Abstract Content Based Image Retrieval (CBIR) systems receive an image or an image description as input and retrieve images rom a data!ase that are similar to the "uery image# In this paper $e survey some technical aspects o current Content Based Image Retrieval systems %&', %(', %)', %&*', %&&', %&+'# The purpose o this survey ho$ever, is to provide an overvie$ o the unctionality o temporary image retrieval systems in terms o technical aspects, "uerying, relevance eed!ac-, eatures, matching measures, indexing data structures, and result presentation# .e are discussing a!out some Content Based Image Retrieval system that using the eatures such as color, texture and shape# Keywords- Content Based Image Retrieval, Gradient vector Flow (GVF), Gabor Filter, !clidian distance

image processing is the nee! to e4tract "sef"l information from the ra5 !ata /efore any in! of reasoning a/o"t the image:s contents is possi/le. Image !ata/ases th"s !iffer f"n!amentally from te4t !ata/ases, 5here the ra5 material has alrea!y /een logically str"ct"re!. The o/)ecti%e of the paper is to pro%i!e an o%er%ie5 of the f"nctionality of temporary image retrie%al systems in terms of technical aspects$ 3"erying, rele%ance fee!/ac , feat"res, matching meas"res, in!e4ing !ata str"ct"res, an! res"lt presentation. II. P-INCIP;E O' C1IContent#/ase! image retrie%al, also no5n as 3"ery /y image content an! content#/ase! %is"al information retrie%al is the application of comp"ter %ision to the image retrie%al pro/lem, that is, the pro/lem of searching for !igital images in large !ata/ases. Content#/ase! means that the search ma es "se of the contents of the images themsel%es, rather than relying on h"man#inp"t meta!ata s"ch as captions or ey5or!s. A content#/ase! image retrie%al system 0C1I-2 is a piece of soft5are that implements C1I-. In C1I- each image that is store! in the !ata/ase has its feat"res e4tracte! an! compare! to the feat"res of the 3"ery image. It in%ol%es t5o steps. Feature Extraction: The first step in this process is to e4tract the image feat"res to a !isting"isha/le e4tent. Matching: The secon! step in%ol%es matching these feat"res to yiel! a res"lt that is %is"ally similar. III. S<STEMS 1elo5 5e !escri/e a n"m/er of content#/ase! image retrie%al systems. A. Blobworld: Image Segmentation Using ExpectationMaximi ation and Its Application to Image !uer"ing #$% -etrie%ing images from large an! %arie! collections "sing image content as a ey is a challenging an! important pro/lem. In 1lo/5orl!, It present a ne5 frame5or for image retrie%al /ase! on segmentation into regions an! 3"erying "sing properties of these regions. The regions generally correspon! to o/)ects or parts of o/)ects. *hile 1lo/5orl! !oes not e4ist completely in the 7thing7 !omain, it recogni6es the nat"re of images as com/inations of o/)ects, an! 3"erying in 1lo/5orl! is more meaningf"l than it is 5ith

I.

INT-OD.CTION

Content /ase! image retrie%al 0C1I-2 a techni3"e for retrie%ing images on the /asis of a"tomatically !eri%e! feat"res s"ch as color, te4t"re an! shape. C1I- operates on a totally !ifferent principle from ey5or! in!e4ing. Primiti%e feat"res characteri6ing image content, s"ch as color, te4t"re, an! shape, is comp"te! for /oth store! an! 3"ery images, an! "se! to i!entify the store! images most closely matching the 3"ery. The most challenging aspect of C1I- is to /ri!ge the gap /et5een lo5#le%el feat"re layo"t an! high#le%el semantic concepts. 7Content#/ase!7 means that the search 5ill analy6e the act"al contents of the image rather than the meta!ata s"ch as ey5or!s, tags, an!8or !escriptions associate! 5ith the image. The term 9content9 in this conte4t might refer to colors, shapes, te4t"res, or any other information that can /e !eri%e! from the image itself. C1I- is !esira/le /eca"se most 5e/ /ase! image search engines rely p"rely on meta!ata an! this pro!"ces a lot of gar/age in the res"lts. Also ha%ing h"mans man"ally enter ey5or!s for images in a large !ata/ase can /e inefficient, e4pensi%e an! may not capt"re e%ery ey5or! that !escri/es the image. Th"s a system that can filter images /ase! on their content 5o"l! pro%i!e /etter in!e4ing an! ret"rn more acc"rate res"lts. C1I- !iffers from classical information retrie%al in that image !ata/ases are essentially "nstr"ct"re!, since !igiti6e! images consist p"rely of arrays of pi4el intensities, 5ith no inherent meaning. One of the ey iss"es 5ith any in! of

simple 7st"ff7 representations. It presents a ne5 image representation that pro%i!es a transformation from the ra5 pi4el !ata to a small set of image regions that are coherent in color an! te4t"re. 1lo/5orl! present a ne5 image representation that pro%i!es a transformation from the ra5 pi4el !ata to a small set of image regions that are coherent in color an! te4t"re. This 71lo/5orl!7 representation is create! /y cl"stering pi4els in a )oint color#te4t"re#position feat"re space. The segmentation algorithm is f"lly a"tomatic an! has /een r"n on a collection of =>,>>> nat"ral images. 1lo/5orl! !escri/e a system that "ses the 1lo/5orl! representation to retrie%e images from this collection. An important aspect of the system is that the "ser is allo5e! to %ie5 the internal representation of the s"/mitte! image an! the 3"ery res"lts. Similar systems !o not offer the "ser this %ie5 into the 5or ings of the system? conse3"ently, 3"ery res"lts from these systems can /e ine4plica/le, !espite the a%aila/ility of no/s for a!)"sting the similarity metrics. 1y fin!ing image regions that ro"ghly correspon! to o/)ects, 1lo/5orl! allo5 3"erying at the le%el of o/)ects rather than glo/al image properties. In or!er to segment each image a"tomatically, 1lo/5orl! mo!el the )oint !istri/"tion of color, te4t"re, an! position feat"res 5ith a mi4t"re of @a"ssians. 1lo/5orl! "se the E4pectation#Ma4imi6ation 0EM2 algorithm to estimate the parameters of this mo!el? the res"lting pi4el# cl"ster mem/erships pro%i!e a segmentation of the image. After the image is segmente! into regions, a !escription of each region9s color an! te4t"re characteristics is pro!"ce!. In a 3"erying tas , the "ser can access the regions !irectly, in or!er to see the segmentation of the 3"ery image an! specify 5hich aspects of the image are important to the 3"ery. *hen 3"ery res"lts are ret"rne!, the "ser also sees the 1lo/5orl! representation of each retrie%e! image? this information assists greatly in refining the 3"ery. &esult presentation: The retrie%e! images are ran e! in linear or!er, an! presente! together 5ith the segmente! %ersion sho5ing the regions. Ad'antages: A!%antages of this scheme are "ser is allo5e! to %ie5 the internal representation of s"/mitte! image an! 3"ery res"lts. It allo5s A"erying le%el of o/)ects rather than glo/al image properties. 1lo/5orl! pro!"ces higher precision than !oes 3"erying "sing color an! te4t"re histograms. (isad'antages: Disa!%antages of this scheme are, this segmentation algorithm 5ill sometimes o%ersegment the o/)ects. 'or e4ample, a 6e/ra may /e o%ersegmente! into tr"n , legs, an! hea!. C"rrent feat"res clearly !o not enco!e all the important information a/o"t the /lo/. B. A &egion-Based Fu " Feature Matching Approach to )ontent-Based Image &etrie'al #*% In this scheme, an image is represente! as set of segment regions. -egions are characteri6e! /y f"66y feat"res or f"66y set reflecting color, te4t"re, an! shape properties. An image is a family of f"66y feat"res correspon!ing to regions. '"66y feat"res nat"rally characteri6e the gra!"al transition /et5een regions 0/l"rry /o"n!aries2 5ithin an image an! incorporate

the segmentation#relate! "ncertainties into the retrie%al algorithm. The resem/lance of t5o images is then !efine! as the o%erall similarity /et5een t5o families of f"66y feat"res an! 3"antifie! /y a similarity meas"re, .'M meas"re, 5hich integrates properties of all the regions in the images. Compare! 5ith similarity meas"res /ase! on in!i%i!"al regions an! on all regions 5ith crisp#%al"e! feat"re representations, the .'M meas"re greatly re!"ces the infl"ence of inacc"rate segmentation an! pro%i!es a %ery int"iti%e 3"antification. The .'M has /een implemente! as a part of SIMP;Icity image retrie%al system. The performance of the system is ill"strate! "sing e4amples from an image !ata/ase of a/o"t B>,>>> general#p"rpose images. This system segments images /ase! on color an! spatial %ariation feat"res "sing a #means algorithm. It is a %ery fast statistical cl"stering metho!. To segment an image, the system first partitions the image into small /loc s. A feat"re %ector is then e4tracte! for each /loc . In the .'M scheme, an image is first segmente! into regions. Each region is then represente! /y a f"66y feat"re that is !etermine! /y center location an! 5i!th. A !irect conse3"ence of f"66y feat"re representation is the region#le%el similarity. Ad'antages$ A!%antages of this scheme incl"!e that it pro%i!es goo! acc"racy an! ro/"stness to image segmentation an! image alteration. A region is allo5e! to /e matche! 5ith se%eral regions in case of inacc"rate segmentation (isad'antages$ Disa!%antages of this scheme incl"!e that the o/)ects that totally !ifferent in semantic may /e cl"stere! into the same region. This system "tili6es the shape an! si6e information, /"t not f"lly e4ploite!. All f"66y feat"res 5ithin one image ha%e the same shape. ). Sna+es, Shapes, and -radient .ector Flow #/0% Sna es, or acti%e conto"rs, are "se! e4tensi%ely in comp"ter %ision an! image processing applications, partic"larly to locate o/)ect /o"n!aries. Acti%e conto"r mo!el is a frame5or for fin!ing an o/)ect o"tline from a possi/ly noisy +D image. This paper presents a ne5 class of e4ternal forces for acti%e conto"r mo!els. These fiel!s, 5hich 5e call gra!ient %ector flo5 0@C'2 fiel!s, are !ense %ector fiel!s !eri%e! from images /y minimi6ing certain energy f"nctional in a %ariational frame5or . The minimi6ation is achie%e! /y sol%ing a pair of !eco"ple! linear partial !ifferential e3"ations that !iff"ses the gra!ient %ectors of a gray#le%el or /inary e!ge map comp"te! from the image. *e call the acti%e conto"r that "ses the @C' fiel! as its e4ternal force a @C' sna e. The @C' sna e is !isting"ishe! from nearly all pre%io"s sna e form"lations in that its e4ternal forces cannot /e 5ritten as the negati%e gra!ient of a potential f"nction. 1eca"se of this, it cannot /e form"late! "sing the stan!ar! energy minimi6ation frame5or ? instea!, it is specifie! !irectly from a force /alance con!ition. Ad'antages: An a!%antage of this scheme is that it helpf"l to !etect the /o"n!aries of o/)ect "sing gra!ient %ector flo5 0@C'2 5hich is s"ita/le for image segmentation.

(isad'antages: Disa!%antages of this scheme are it only foc"se! on shape of an o/)ect an! it re3"ire! longer comp"tation time for higher acc"racy. (. 1ic2oSee+: )ombining )olor and Shape In'ariant Features 3or Image &etrie'al #//% PicToSee aim at com/ining color an! shape in%ariants for in!e4ing an! retrie%ing images. To this en!, color mo!els are propose! in!epen!ent of the o/)ect geometry, o/)ect pose, an! ill"mination. 'rom these color mo!els, color in%ariant e!ges are !eri%e! from 5hich shape in%ariant feat"res are comp"te!. Comp"tational metho!s are !escri/e! to com/ine the color an! shape in%ariants into a "nifie! high# !imensional in%ariant feat"re set for !iscriminatory o/)ect retrie%al. The /asic i!ea of image retrie%al /y image e4ample is to e4tract characteristic feat"res from target images 5hich are then matche! 5ith those of the 3"ery image. These feat"res are typically !eri%e! from shape, te4t"re, or color properties of 3"ery an! target images. After matching, images are or!ere! 5ith respect to the 3"ery image accor!ing to their similarity meas"re an! !isplaye! for %ie5ing. &esult presentation: The retrie%e! images are sho5n 5itho"t e4plicit or!er. Ad'antages: A!%antages of this scheme incl"!e that the image retrie%al scheme is highly ro/"st to partial occl"sion, o/)ect cl"tter an! a change in %ie5ing position. (isad'antages: A !isa!%antage of this scheme is that it !epen!s only on color an! shape. E. 2exture Features 3or Browsing and &etrie'al o3 Image (ata #/4% The foc"s of this paper is on the image processing aspects an! in partic"lar "sing te4t"re information for /ro5sing an! retrie%al of large image !ata. *e propose the "se of @a/or 5a%elet feat"res for te4t"re analysis an! pro%i!e a comprehensi%e e4perimental e%al"ation. Comparisons 5ith other m"ltiresol"tion te4t"re feat"res "sing the 1ro!at6 te4t"re !ata/ase in!icate that the @a/or feat"res pro%i!e the /est pattern retrie%al acc"racy. The o/)ecti%e of this paper is to st"!y the "se of te4t"re as an image feat"re for pattern retrie%al. An image can /e consi!ere! as a mosaic of !ifferent te4t"re regions, an! the image feat"res associate! 5ith these regions can /e "se! for search an! retrie%al. A typical 3"ery co"l! /e a region of interest pro%i!e! /y the "ser, s"ch as o"tlining a %egetation patch in a satellite image. The inp"t information in s"ch cases is an intensity pattern or te4t"re 5ithin a rectang"lar 5in!o5. Te4t"re analysis has a long history an! te4t"re analysis algorithms range from "sing ran!om fiel! mo!els to m"ltiresol"tion filtering techni3"es s"ch as the 5a%elet transform. Se%eral researchers ha%e consi!ere! the "se of s"ch te4t"re feat"res for pattern retrie%al. This paper foc"ses on a m"ltiresol"tion representation /ase! on @a/or filters. The "se of @a/or filters in e4tracting te4t"re! image feat"res is moti%ate! /y %ario"s factors.

Ad'antages: A!%antages of this scheme incl"!e that an a!apti%e filter selection algorithm is propose! 5hich can facilitate fast image /ro5sing. (isad'antage: Disa!%antages of this scheme is that it !epen! only on te4t"re feat"re F. )ontent Based Image &etrie'al using color, texture and shape #/% In this metho!, an image is partitione! into +D 0D 4 B or B 4 D2 non o%erlapping tiles as sho5n in 'ig=. These tiles 5ill ser%e as local color an! te4t"re !escriptors for the image. @a/or feat"res are "se! for te4t"re similarity. *ith the Corel !ataset "se! for e4perimentation 5ith B 4 D 0or D 4 B2 partitioning, the si6e of in!i%i!"al tile 5ill /e BD 4 BD. The choice of smaller si6e! tiles than BD 4 BD lea!s to !egra!ation in the performance. Most of the te4t"re analysis techni3"es ma e "se of BD 4 BD /loc s. This tiling str"ct"re is e4ten!e! to secon! le%el !ecomposition of the image.

'ig. =. System o%er%ie5.

The image is !ecompose! into si6e M8+ 4 N8+, 5here M an! N are n"m/er of ro5s an! col"mns in the original image respecti%ely. *ith a BD 4 BD tile si6e, the n"m/er of tiles res"lting at this resol"tion is B as sho5n in 'ig =. This allo5s "s to capt"re !ifferent image information across resol"tions. 'or ro/"stness, 5e ha%e also incl"!e! the tile feat"res res"lting from the same gri! str"ct"re 0i.e. +D tiles at resol"tion + an! B tiles at resol"tion =2 as sho5n in 'ig. =. @oing /eyon! secon! le%el of !ecomposition a!!e! no significant information. So, a t5o le%el str"ct"re is "se!. The matching of images at !ifferent resol"tions is !one in!epen!ently as sho5n in 'ig. =. Since at any gi%en le%el of !ecomposition the n"m/er of tiles remains the same for all the images 0i.e. either +D at first le%el of !ecomposition or B at secon! le%el of !ecomposition2, all the tiles 5ill ha%e e3"al significance. A tile from 3"ery image is allo5e! to /e matche! to any tile in the target image. Eo5e%er, a tile may participate in the matching process only once. A /ipartite graph of tiles for the 3"ery image an! the target image is /"ilt as sho5n in 'ig. +. The la/ele! e!ges of the /ipartite graph in!icate the !istances /et5een tiles. A minim"m cost matching is !one for this graph. Since, this process in%ol%es too many comparisons? the metho! has

to /e implemente! efficiently. To this effect, 5e ha%e !esigne! an algorithm for fin!ing the minim"m cost matching /ase! on most similar highest priority 0MSEP2 principle "sing the a!)acency matri4 of the /ipartite graph.

the e!ge image. @ra!ient %ector flo5 0@C'2 is a static e4ternal force "se! in acti%e conto"r metho!. @C' is comp"te! as a !iff"sion of the gra!ient %ectors of a gray# le%el or /inary e!ge map !eri%e! from the images. It !iffers f"n!amentally from tra!itional sna e e4ternal forces in that it cannot /e 5ritten as the negati%e gra!ient of a potential f"nction, an! the correspon!ing sna e is form"late! !irectly from a force /alance con!ition rather than a %ariational form"lation. The @C' "ses a force /alance con!ition gi%en /y, 0p2 'int H 'e4t I > 0G2 *here 'int is the internal force an! 'e4t is the e4ternal 0p2 I force. The e4ternal force fiel! 'e4t . 0x, "2 is referre! to as the @C' fiel!. The @C' fiel! C04, y2 is a %ector fiel! gi%en /y .0x, "2 IJu0x, "2,'0x, "2K that minimi6es the energy f"nctional 0D2 This %ariational form"lation follo5s a stan!ar! principle that of ma ing the res"lts smooth 5hen there is no !ata. In partic"lar, 5hen LfL is small, the energy is !ominate! /y the s"m of s3"ares of the partial !eri%ati%es of the %ector fiel!, yiel!ing a slo5ly %arying fiel!. On the other han!, 5hen LfL is large, the secon! term !ominates the integran!, an! is minimi6e! /y setting C I LfL. This pro!"ces the !esire! effect of eeping C nearly e3"al to the gra!ient of the e!ge map 5hen it is large, /"t forcing the fiel! to /e slo5ly %arying in homogeneo"s regions. The parameter M is a reg"lari6ation parameter go%erning the tra!eoff /et5een the first term an! the secon! term in the integran!. .sing this metho! comp"te the e!ge feat"res, color an! te4t"re of images an! retrie%e accor!ing to the feat"res of 3"ery images. IC. CONC;.SION *e ha%e !isc"sse! Content 1ase! Image -etrie%al systems that "sing color, te4t"re an! shape feat"res. Most systems are pro!"cts of research, an! therefore emphasi6e one aspect of content#/ase! retrie%al. Some systems pro%i!e a "ser interface that allo5s more po5erf"l 3"ery form"lation than is "sef"l in the !emo system. Most systems "se color an! te4t"re feat"res, fe5 systems "se shape feat"re, an! 5e ha%e !isc"sse! a/o"t a system that "sing color, te4t"re an! shape feat"res. . A com/ination of these color, te4t"re an! shape feat"res pro%i!es a ro/"st feat"re set for image retrie%al. -E'E-ENCES
J=K P. S. Eiremath N Jaga!eesh P")ari, OContent 1ase! Image -etrie%al "sing Color, Te4t"re an! Shape feat"res,P /5th IEEE International )on3erence on Ad'anced )omputing and )ommunications 6A()7M 40089, Pages$ Q,>#Q,D. A. Sme"l!ers, M.*orring, S. Santini, A. @"pta, an! -. Jain, OContent/ase! image retrie%al at the en! of the early years,P IEEE 2rans. 1attern Anal. Mach. Intell., %ol. ++, no. =+, pp. =GDFR=G,>, +>>>. John P. Ea ins an! Margaret E. @raham, Content#/ase! image retrie%al, a report to the JISC technology applications programme, Institute 3or image database research, Uni'ersit" o3 :orthumbria at :ewcastle, U.;, Jan"ary =FFF.
0p2

'ig. +. 1ipartite graph sho5ing D tiles of /oth the images.

In this, the !istance matri4 is comp"te! as an a!)acency matri4. The minim"m !istance !i) of this matri4 is fo"n! /et5een tiles i of 3"ery an! ) of target. The !istance is recor!e! an! the ro5 correspon!ing to tile i an! col"mn correspon!ing to tile ), are /loc e! 0replace! /y some high %al"e, say FFF2. This 5ill pre%ent tile i of 3"ery image an! tile ) of target image from f"rther participating in the matching process. The !istances, /et5een i an! other tiles of target image an!, the !istances /et5een ) an! other tiles of 3"ery image, are ignore! 0/eca"se e%ery tile is allo5e! to participate in the matching process only once2. This process is repeate! till e%ery tile fin!s a matching. The process is !emonstrate! in 'ig. G "sing an e4ample for D tiles.

/ 0 &#12 3 +#41 3 5#2( 3 +4#66 0 65#65

'ig. G. Image similarity comp"tation /ase! on MSEP principle, 0a2 first pair of matche! tiles iI+,)I= 0/2 secon! pair of matche! tiles iI=, )I+ 0c2 thir! pair of matche! tiles iIG, )ID 0!2 fo"rth pair of matche! tiles iID,)IG, yiel!ing the integrate! minim"m cost match !istance GD.GD.

The comple4ity of this matching proce!"re is re!"ce! + from O0n 2 to O0n2, 5here n is the n"m/er of tiles in%ol%e!. The integrate! minim"m cost match !istance /et5een images is no5 !efine! as$ 0+2 *here !i) is the /est#match !istance /et5een tile i of 3"ery image 3 an! tile ) of target image t an! D3t is the !istance /et5een images 3 an! t. Shape information is capt"re! in terms of the e!ge image of the gray scale e3"i%alent of e%ery image in the !ata/ase. *e ha%e "se! gra!ient %ector flo5 0@C'2 fiel!s to o/tain

J+K

JGK

JDK

Ei!ey" i Tam"ra an! Nao a6" <o oya. Image Data/ase Systems$ A S"r%ey, 1attern&ecognition, =Q0=2$+FRDF, =F,D. JSK 'ah"i ;ong,Eong)iang Thang an! Da%i! Dagan 'eng, '"n!amentals of content#/ase! image retrie%al$ Microso3t corporation research articles, +>>G. JBK To/ias *eyan! an! Thomas Deselaers, Com/ining Content#/ase! Image -etrie%al 5ith Te4t"al Information -etrie%al , (epartment o3 )omputer Science, &<2=, Aachen, Octo/er +>>S JQK -emco C. Celt amp, Mirela Tanase, Content#/ase! image retrie%al systems, a s"r%ey, Technical report, !epartment of comp"ter science, .trecht .ni%ersity, Octo/er +>>>. J,K C. Carson, S. 1elongie, E. @reenspan, an! J. Mali , O1lo/5orl!$ Image Segmentation .sing E4pectation#Ma4imi6ation an! Its Application to Image A"erying,P in IEEE 2rans. 7n 1AMI, %ol. +D, No.,, pp. =>+B#=>G,,+>>+ JFK <. Chen an! J. T. *ang, OA -egion#1ase! '"66y 'eat"re Matching Approach to Content#1ase! Image -etrie%al,P in IEEE 2rans. on 1AMI, %ol. +D, No.F, pp.=+S+#=+BQ, +>>+. J=>K Chenyang U", Jerry ; Prince, OSna es,Shapes, an! @ra!ient Cector 'lo5P, IEEE 2ransactions on Image 1rocessing, Col#Q, No G,PP GSF# GBF, March =FF,. J==K T. @e%ers an! A.*.M. Sme"i!ers., OPicToSee $ Com/ining Color an! Shape In%ariant 'eat"res for Image -etrie%alP, IEEE 2&A:SA)2I7:S 7: IMA-E 1&7)ESSI:-, %ol. F, No. =, Jan"ary +>>>

J=+K 1.S.Man)"nath an! *.<.Ma , OTe4t"re 'eat"res for 1ro5sing an! -etrie%al .of Image DataP, IEEE transactions on 1AAMI, %ol =,, No. ,, A"g"st =FFB. 'rontier Technologies, 'e/ +>>Q, Manipal, In!ia. J=GK S. Nan!agopalan, Dr. 1. S. A!iga, an! N. Deepa , 7A .ni%ersal Mo!el for Content#1ase! Image -etrie%al7, International Jo"rnal of Comp"ter Science D$D +>>F J=DK D.;o5e, ODistincti%e image feat"res from scale in%ariant eypointsP, International Jo"rnal of Comp"ter %ision, %ol. +0B2,pp.F=#==>,+>>D. J=SK (.Mi ola)e6y an! C.Schmi!, OScale an! affine in%ariant interest point !etectorsP, International Jo"rnal of Comp"ter Cision, %ol. =0B>2,pp. BG#,B, +>>D. J=BK Etinne ;o"pias an! Nie" Se/e, O*a%elet#/ase! salient points$ Applications to image retrie%al "sing color an! te4t"re feat"resP, in A!%ances in %is"al Information systems, Procee!ings of the Dth International Conference, CIS.A; +>>>, pp. ++G#+G+, +>>>. J=QK M.1aner)ee, M,(,("n!" an! P.(.Das, OImage -etrie%al 5ith Cis"ally Prominent 'eat"res "sing '"66y set theoretic E%al"ationP, ICC@IP +>>D, In!ia, Dec +>>D. J=,K <ong -"i, Thomas S. E"ang, Shih#'" Chang, 7Image -etrie%al$ C"rrent Techni3"es, Promising !irections an! open iss"es7, +>>G J=FK http$885ang.ist.ps".e!"8