基于内容的图像检索

通过特征向量表示我们为您提供的数据库中的每个图像。 (预处理)设计可以比较图像对的图像距离度量。 对于每个测试图像,以与查询的距离的升序检索数据库图像。查询本身应该具有距离0并且是第一个。使用提供的界面进行检索。首先将颜色聚类应用于图像以获得多个不同聚类标签的标记图像:1,2,3,... K. 然后将连接的组件(提供)应用于标记的图像以产生第二标记图像,其标记簇标签的每个连接组件:1,2,... N.单个颜色簇可以分成多个组件。 可能会进行一些噪音清洁以去除小区域。不要改变图像之间的参数。您可以从任何地方获得噪音清洁想法或代码。
展开查看详情

1.Assignment 3 Content-Based Image Retrieval 1

2.Steps Represent each image in the database we give you by a feature vector. (Preprocess) Design an image distance measure that can compare pairs of image. Retrieve , for each test image, the database images in ascending order of distance to the query. The query itself should have distance 0 and be first. Use the interface provided for retrieval. 2

3.Initial Processing First apply color clustering to the image to get a labeled image of multiple different cluster labels: 1, 2, 3, ...K. Then apply connected components (provided) to the labeled image to produce a second labeled image that labels each connected component of cluster labels: 1, 2, ... N. A single color cluster may break into more than one component. Possibly perform some noise cleaning to remove small regions. Don’t vary parameters between images. You can get noise cleaning ideas or code from anywhere. 3

4.Features For each major region (use a size threshold), compute at least the following features: size (number of pixels) given mean color , in RGB, or whatever space you like given a t least the following co-occurrence texture features using spatial relationship d=(1,1): energy, entropy, contrast. centroid (row, column) bounding box (or if you prefer, could be an ellipse) Store the features in the feature vector defined in the code. 4

5.Extra Credit Features Other region features you want to add RAG (region adjacency graph) including for each pair of adjacent regions: above adjacency below adjacency left adjacency right adjacency other A fancier distance function to handle RAGs. 5

6.Distance Measure Dist (I 1 ,I 2 ) determines the distance from image I 1 to image I 2 . Compute Dist from a correspondence you find from the regions of I 1 to those of I 2 . Start with a greedy method: for each region of I 1 , find the most similar region of I 2 Do not ask me HOW to do this. That’s for you. 6

7.More on Distance Measure You should try at least two difference distance measures. They can differ in: attributes used, weights on attributes the actual distance, ie . Euclidean vs. others If you do the graph structure, you need some kind of graph distance. See S&S Section 11.6 or make up your own. 7

8.Report Turn in a brief report in Word or PDF that describes: the attributes you implemented the distance measures you tried the results of your tests including both the 16 screenshots (1 for each of the 2 distance measures for each of the 8 query images) and your comments. 8

9.9