Fuzzy Hamming Distance in a Content-Based Image Retrieval System
|
|
- Basil Randolf Lang
- 6 years ago
- Views:
Transcription
1 Fuzzy Hamming Distance in a Content-Based Image Retrieval System Mircea Ionescu Department of ECECS, University of Cincinnati, Cincinnati, OH 51-3, USA ionescmm@ececs.uc.edu Anca Ralescu Department of ECECS, University of Cincinnati, Cincinnati, OH 51-3, USA aralescu@ececs.uc.edu Abstract The performance of Content-Based Image Retrieval (CBIR) systems is mainly depending on the image similarity measure it use. The Fuzzy Hamming Distance ( À ) is an extension of Hamming Distance for real-valued vectors. Because the feature space of each image is real-valued the Fuzzy Hamming Distance can be successfully used as image similarity measure. The current study reports on the results of applying À as a similarity measure between the color histograms of two images. The Fuzzy Hamming Distance is suitable for this application because it can take into account not only the number of different colors but also the magnitude of this difference. I. INTRODUCTION Large collections of images are accumulated every day. Finding a relevant set of images close to an example image is a major issue of Content-Based Image Retrieval (CBIR) systems. CBIR are the next evolution step of keyword-based systems in which images are retrieved based on the information of their contents. A survey of the functionality of current CBIR systems can be found in []. A. Current CBIR systems CBIR systems are designed to allow users to query the image database in a natural way, by the image content. To achieve this goal, various features such as sketches, layout or structural description, texture, colors, are extracted from each image. A query might be: Find all images with a pattern similar to this one (the query pattern), and then the system finds a subset of images similar to the query image. Ä Ô measures or weighted combination of ÄÔ measures, are mostly used to measure the similarity between two images. More precisely, for two images with n features each, Ü ½ Ü Ò µ Ý ½ Ý Ò µ the Ä Ô measure is defined as: Ä Ô µ Ü Ý ¾ µ Ô (1) One of the earliest content-based systems is QBIC, Query By Image Content, from IBM [?]. For each image a set of features are extracted. These include: color, texture, sketch and optionally, objects defined inside the image. Each object is determined manually by a contour and is described by its color, shape and texture. The color similarity is assessed computing the distance between the color histograms using [5]: ¾ µ µ Ø µ () where in matrix A, is a similarity between colors i and j. It can be noticed that µ is the Euclidean distance when A is the identity matrix. For shapes, a weighted Euclidean distance between shapes attributes (area, circularity, eccentricity), as described in [], is used. The main limitation of current CBIR systems is that they cannot deal with semantic-level image queries effectively. An image always contains some semantic information (for example, an image containing a seascape ). Such semantic features can only be represented by some primitive features in present CBIR systems. This paper proposes to use a fuzzy similarity measure based on a generalization of the Hamming distance(fhd) introduced in [?], as a basis for content based image retrieval, and to show how this measure can be used to capture implicitly some semantic contents of the image in addition to other image features (here color histograms). B. The Fuzzy Hamming Distance 1) Degree of difference: Given the real values Ü and Ý, the degree of the difference between Ü and Ý, modulated by «¼, denoted by «Ü ݵ, is defined as [?]: «Ü ݵ ½ «Ü ݵ¾ (3) The parameter «¼ modulates the degree of difference in the sense that for the same value of Ü Ý different values of «will result in different values of «Ü ݵ. The (membership) function «defined in (3) has the following properties: 1) ¼ «Ü ݵ ½ with equality Ü Ý; ) «Ü ݵ «Ý ܵ 3) for Ü, «Ü µ ¾ ; ) «Ü ݵ «¼ Ü Ý µ. Figure 1 illustrates «Üµ when Ü ¾ ¾ for various values of «. ) Difference fuzzy set for two vectors: Using the notion of degree of difference defined above, the difference fuzzy set Ü Ýµ for two vectors x and y, is defined as follows [?]: Let Ü and Ý be two Ò dimensional real vectors let Ü, Ý denote their corresponding th component. The degree of difference between Ü and Ý along the component, modulated by the parameter «, is «Ü Ý µ.
2 alpha=1 alpha=. alpha=.1 alpha= Fig. 1. The membership function «Üµ with Ü ¾ and «varying from.1 to (some graphs for intermediate values of «are removed for clarity). [?] The difference fuzzy set corresponding to «Ü Ý µ is «Ü ݵ with membership function «Ü ݵ ½ Ò ¼ ½ given by: «Ü ݵ µ «Ü Ý µ () In words, «Ü ݵ µ is the degree to which the vectors Ü and Ý are different along their th component. The properties of «Ü ݵ are determined from the properties of «Ü Ý µ. 3) The fuzzy Hamming distance as cardinality of a fuzzy set: Since the Hamming distance is the number of components along which two bit vectors are different (which is also in fact, the square of the Euclidean distance between two bit vectors) a fuzzy extension of this concept must necessarily be based on the concept of cardinality of a (discrete) fuzzy set. This concept has been studied by several authors including [?], [?], [?], [?], etc. Here the definition put forward in [?] and further developed in [?] is used. Accordingly, the cardinality of the fuzzy set is the fuzzy set where Ö Ò ½ Ò ¼ Ü Ö µ Ö µ µ ½ ½µ µ (5) In (5) µ denotes the th largest value of ; the values ¼µ ½ and Ò ½µ ¼ are introduced for convenience, and denotes the Ñ Ò operation. By analogy with the definition of the classical Hamming distance, and using the cardinality of a fuzzy set [?], [?], [?], the Fuzzy Hamming Distance ( À ) is defined as follows [?]: Definition 1: Given two real Ò dimensional vectors, Ü and Ý, for which the difference fuzzy set «Ü ݵ, with membership function «Ü ݵ defined in (), the fuzzy Hamming distance between Ü and Ý, denoted by À «Ü ݵ is the fuzzy cardinality of the difference fuzzy set, «Ü ݵ. À Ü Ýµ «µ ¼ Ò ¼ ½ denotes the membership function for À «Ü ݵ corresponding to the parameter «. More precisely, À Ü Ýµ «µ Ö «Ü ݵ µ () for ¾ ¼ Ò where Ò ËÙÔÔÓÖØ «Ü ݵ. In words, () means that for a given value, À Ü Ýµ «µ is the degree to which the vectors Ü and Ý are different on exactly components (with the modulation constant «). Example 1: Considering two vectors Ü and Ý with Ü Ý ¾ ½ µ, their À is the same as that between the vector, ¼ and Ü Ý ¾ ½ µ (by property () of «Ü ݵ). Therefore, their À is the cardinality of the fuzzy set Ü Ý ¼µ ½ ¼ ½ ¾ ¼ ¾½ ½ ¼ ½ obtained according to (5). For «½ this is obtained to be À ¼ ¼ ½ ¼ ¾ ¼ ¼¼¼½ ¼ ¼½ ¼ ¼ ¾½ In words, the meaning of À is as follows: the degree to which Ü and Ý differ along exactly ¼ components (that is, do not differ) is ¼, along exactly one component is ¼, along exactly two components is ¼ ¼¼¼½, along exactly three components is ¼ ¼½, and so on. ) Defuzzification of the Fuzzy Hamming Distance: As it is often the case with many fuzzy concepts, a non-fuzzy (crisp) approximation for them is useful. The non-fuzzy cardinality Ò Ö µ, of a fuzzy set is defined in [?] where it is also shown that this approximation of the fuzzy cardinality is equal to the cardinality (in classical sense) of ¼ the -level set of with ¼. More precisely, Ò Ö µ Ü Üµ ¼ (7) where for a set Ë, Ë denotes the closure of Ë. Since the fuzzy Hamming distance is the (fuzzy) cardinality of the difference fuzzy set «Ü ݵ, its defuzzification leads to a non fuzzy approximation for it. It can be easily verified [?], that with «½ the defuzzification of À by taking its.5 level set is the standard Hamming distance. In other words the defuzzification of À, Ò À is the number of elements of Ü Ýµ with membership greater or equal to.5. In the remainder of the paper Ò À will denote the crisp quantity obtained according to (7) when is the fuzzy set À defined in (). That is, for the real vectors Ü and Ý, Ò À «Ü ݵ Ò Ö «Ü ݵµ () II. ADAPTING THE FUZZY HAMMING DISTANCE In this section a closer look is devoted to the modulator parameter «. In particular, it is shown that «can be tuned, to include a scaling factor which controls the À sensitivity to the extent of variation. Tuning of the parameter «can be done
3 so as to include context (other components of the two vectors) or to capture only local (current component) information. One way to set the value for «is to impose a lower bound on the membership function subject to constraints on the difference between vector components, such as described in (9) and (). 1.. membership function «Ü ݵ µ «Ü Ý µ ½ (9). subject to. Ü Ý Å () for Ü Ý µ a generic component pair, ½ a desired lower bound on the membership value to À (as defined in ()), and Å some positive constant. In particular, Å can be set as Å Å where ¾ ¼ ½ and Å denotes the maximum value in the column domain, which leads to Fig.. Membership function for the distance. 1 membership function 1 from which it follows that ½ «Ü Ý µ¾ ½ ½ «ÐÒ Ü Ý µ ¾ ½ (11) This leads to the the following formula for defining a global value for the parameter «: membership degree.... «ÐÒ ½ ½ (1) Å ¾ ¾ where Å and have the meaning stated above. can be viewed as the percentage from Å that is considered as a change for that column. For example, for ¼ ½ (%), Å ¾ and ¼, if the difference between compared components of the vectors is greater or equal to 5 then the degree of change will be greater than ½ ¼, and therefore it will be counted in defuzzification of À. Since can be different for each column, À sensitivity can be controlled differently for each column (feature). Figures, 3, and 5 show the membership function of distance from the point (5,5) and the point Ü Ýµ ¾ ¼ ½¼ ¼ ½¼, when Ü =.1 and Ý =.3, for all possibles values of the actual distance:, 1 or. Figure 5 shows the distance distribution over the D space Ü Ýµ. It can be seen from these figures that À measures how many components are changed with a certain degree. In the middle, for points close to the center, µ, the distance is zero with high degree, while for points close to the margins (determined by the values for Ü and Ý ) the degree for zero decreases and the degree of 1 is increases (passing ½ level). Beyond this margin, along both Ü and Ý, the degree for the distance to be equal to is increasing passing ½ and the degrees for ¼ and ½ are again low. The distance distribution is represented in D space by rectangles and in ÒD by ÒCubes. Y X Fig. 3. Membership function for the distance 1. Using different for each feature means, in effect, weighing each feature thereby allowing a larger or smaller variation between feature values to be considered as a change. III. FHD FOR CBIR: SYSTEM DESIGN The proposed CBIR system consists of the three modules as shown in Figure??. As it can be seen, the approach consists of three simple steps: 1) The preprocessing module extracts the information of interest (in this study the color histograms) from each of the images in the data base and the query image. The output of this module is a collection of color histograms. ) The similarity assessment module takes as input the information from the preprocessing module and computes the similarity (actually the FHD), between the query image and each image in the database. The output of this module is a collection of fuzzy sets (FHD). 3) The ranking module returns the outcome of similarity assessment ranked in decreasing order. A detailed description of these modules follows.
4 Membership degree membership function Y X Fig.. Membership function for the distance. B. The Similarity Assessment Module The collection of histograms corresponding to the image data base, and the color histogram of the query image, are the input to this module. Each image is represented as a matrix of histograms, more precisely, image is represented as À еµ Ð ½ Ñ. The query image Õ is represented as Õ À Õ Ðµµ Ð ½ Ñ. The similarity function, Ë ÑÁÑ, maps two images into a matrix whose entries are the FHD between corresponding regions of the argument images. More precisely, for two images, and Õ, Ë ÑÁÑ Õµ À À е À Õ Ðµµµ Ð ½ Ñ (13) where the À denotes the Fuzzy Hamming Distance parameterized by (introduced in equation (1)), the percentage of difference in two colors (relative to the possible range) needed in order to consider these colors different. For the current experiments, the value ¼ ½, that is ½¼± of the maximum range, is used. It is important to note here, that segmentation of the image into regions and evaluation of the similarity between two images as a function of the similarities of their corresponding regions, assures that position information is also considered, along with color information. This way two images which have the same color histogram but different semantic content (e.g. an image and the one obtained by rotation) will not necessarily be identical. Fig. 5. Distance distribution over Ü Ýµ ¾ ¼ ½¼ ¼ ½¼ A. The Preprocessing Module The images of interest (data based and query image) are preprocessed according to the following steps: 1) Segmentation: Each image is segmented in a Ñ Ñ matrix of regions. For the experiments reported here two values, Ñ and Ñ are used; ) Compute color histograms: The color histogram for each region is computed. Because the RGB color space can have 1M colors, quantization to 9 colors, giving a color histogram of 9 bins, is used. The number of pixels from each region that have the color corresponding to each of these bins is computed. The output of the preprocessing module is the collection of Ñ Ñ color histograms. C. The Ranking Module This module computes a score from the output of the similarity module and ranks images in order of the values of this score. To achieve this, in the current implementation ranking is done in two steps: 1) Defuzzification: The fuzzy sets returned by the similarity module are defuzzified. For comparison purpose three defuzzification methods were used: the center of gravity(cog), extracting the crisp version of the Fuzzy Hamming Distance, nfhd (defined in section I-B), and the area under the curve (AUC). ) Aggregation and Ranking: The results of the defuzzification step are aggregated into a final score using a weighted aggregation. Scores are ranked in nondecreasing order (images closest to the query have smallest number of different different colors). The first Ò images, where Ò is a user-defined value, are returned as relevant to the query image. IV. RESULTS The approach described in the preceding sections is applied to 5 images in JPEG format from the Washington database [?] (which contains images, the remaining 15 are in GIF). Images are represented as Ñ Ñ regions for both Ñ. For comparison purpose, a non-fuzzy similarity measure, based on the Euclidean distance, is also used.
5 For the similarity method using FHD, each of the three defuzzification methods are applied for each query. In the ranking module two weighting schemes are used for aggregation: (1) equal weights, and () regions in the top portion of an image were assigned higher weights. The latter is important to enforce additional positional requirements (such as make sure the retrieved image has a sky like the one in the query image ) for the retrieval procedure. Figure shows the top five results returned for a query. The first three columns represent, in order, the results obtained using FHD, COG, nfhd, AUC, for similarity assessment, with equal aggregation weights. The last column represents the top five results returned by the Euclidean distance. The query image appears in the first row. To better analyze the results returned by the four methods, it is helpful to notice that the (semantic) category for the query image could be described as seascape (the sea in the bottom part of the image, an island across the middle of the image, and the sky in the top part of the image). Above each image is its score. Because of the different defuzzification methods these scores appear in different units. Only the score for the second column (nfhd) has a direct meaning, namely, the number of colors by which the image and the query image differ. As it can be seen from figure each of the four methods retrieves the query image as the best candidate and indeed, their results also coincide for the second and third image returned as well. From the fourth image on, results differ somewhat. Among the FHD based methods, COG gives the best result (this is quite reasonable since the fuzzy set for which it is applied is convex), followed by nfhd and by AUC. Relative difference between scores decreases when moving down each column. The last image in second column, which also appears as the fourth image in the third column is interesting. This image has a building with glass walls behind what appears to be flowering trees. The walls appear blue due to the reflection of the sky (unseen in the image), therefore, from color point of view and, in fact, from the spatial distribution of the color, this image is similar to the query image. However, this image is in a totally different semantic category than the query image. It appears that the Euclidean distance does essentially as well as the COG as it preserves to almost the same extent the semantic category of the query image. A difference emerges in row four: the image returned as the third candidate (which is the same as the fourth candidate returned by COG) contains some artifacts in the lower part of the image which puts it in a slightly different semantic category (e.g. seascape with a small bridge or pier ). Therefore, one can conclude that COG preserves the best the image content both as color and semantic category. Indeed this can be even better seen when the next five candidates for the same query are considered as shown in figure 7. All the images retrieved by the COG method preserve the semantic category. This method is followed in order by the Euclidean Distance, nfhd and AUC. Fig Top five query result-set using equal weights for each image region. Images have been divided into regions. First three columns correspond to COG, nfhd, AUC respectively; the last column uses Euclidean distance. Fig Next five query result-set using equal weight for each image region. Images have been divided into regions. First three columns correspond to COG, nfhd, AUC respectively; the last column uses Euclidean distance. V. CONCLUSIONS AND FUTURE WORK The relevance of the result-set of an CBIR system is hard to assess. It is based on what is relevant for a user, given the query image in a particular context. That is, relevance is both subjective and for the same user, it may be context dependent. This study presented initial results on a new approach to measure similarity between images using the notion of Fuzzy Hamming Distance and its use to content based image retrieval. Even with the remark at the beginning of this section, results seem promising: The main advantage of the FHD is that the extent to which two different images are considered indeed different can be tuned to become more context dependent and to capture (implicit) semantic image information.
6 Several mechanisms can be used to rank and aggregate the similarity measures in addition to the simple point-valued mechanisms illustrated here. These would include mechanisms that rank and aggregate directly fuzzy numbers without a (too early) defuzzification. Developing such mechanisms, experiments with other image features (HSV histograms, textures), and further experiments with the proposed methods belong to the future work in this direction. ACKNOWLEDGMENT Mircea Ionescu s work for this study was supported by a Graduate Fellowship from the Ohio Board of Regents. Anca Ralescu s work for this study was partially supported by a JSPS Senior Research Fellowship at the Brain Science Institute, RIKEN, Japan, and grant N137 from the Department of the Navy. REFERENCES [1] A. G. Barto, R. S. Sutton, and C. W. Anderson, Neuronlike adaptive elements that can solve difficult learning control problems, IEEE Trans. Systems, Man, and Cybernetics, vol. SMC-13, pp. 3, Sept./Oct [] A. N. Michel and R. K. Miller, Qualitative Analysis of Large Scale Dynamical Systems, New York: Academic Press, [3] P. J. Werbos, Neural networks & the human mind: New mathematics fits humanistic insight, Proceedings of the 199 IEEE Trans. Systems, Man, and Cybernetics, where, 199, vol. 1, pp. 7 3.
Image Clustering for a Fuzzy Hamming Distance Based CBIR System
Image Clustering for a Fuzzy Hamming Distance Based CBIR System Mircea M. Ionescu ECECS Department ML 0030 University of Cincinnati Cincinnati, OH 45221, USA ionescmm@ececs.uc.edu Anca L. Ralescu ECECS
More informationConstructive floorplanning with a yield objective
Constructive floorplanning with a yield objective Rajnish Prasad and Israel Koren Department of Electrical and Computer Engineering University of Massachusetts, Amherst, MA 13 E-mail: rprasad,koren@ecs.umass.edu
More informationDatabase Languages and their Compilers
Database Languages and their Compilers Prof. Dr. Torsten Grust Database Systems Research Group U Tübingen Winter 2010 2010 T. Grust Database Languages and their Compilers 4 Query Normalization Finally,
More informationRSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È.
RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È. Let Ò Ô Õ. Pick ¾ ½ ³ Òµ ½ so, that ³ Òµµ ½. Let ½ ÑÓ ³ Òµµ. Public key: Ò µ. Secret key Ò µ.
More informationEfficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms
Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms Roni Khardon Tufts University Medford, MA 02155 roni@eecs.tufts.edu Dan Roth University of Illinois Urbana, IL 61801 danr@cs.uiuc.edu
More informationTexture Mapping using Surface Flattening via Multi-Dimensional Scaling
Texture Mapping using Surface Flattening via Multi-Dimensional Scaling Gil Zigelman Ron Kimmel Department of Computer Science, Technion, Haifa 32000, Israel and Nahum Kiryati Department of Electrical Engineering
More informationCHAPTER 4 FUZZY LOGIC, K-MEANS, FUZZY C-MEANS AND BAYESIAN METHODS
CHAPTER 4 FUZZY LOGIC, K-MEANS, FUZZY C-MEANS AND BAYESIAN METHODS 4.1. INTRODUCTION This chapter includes implementation and testing of the student s academic performance evaluation to achieve the objective(s)
More informationScan Scheduling Specification and Analysis
Scan Scheduling Specification and Analysis Bruno Dutertre System Design Laboratory SRI International Menlo Park, CA 94025 May 24, 2000 This work was partially funded by DARPA/AFRL under BAE System subcontract
More informationExtraction of Color and Texture Features of an Image
International Journal of Engineering Research ISSN: 2348-4039 & Management Technology July-2015 Volume 2, Issue-4 Email: editor@ijermt.org www.ijermt.org Extraction of Color and Texture Features of an
More informationFUZZY INFERENCE SYSTEMS
CHAPTER-IV FUZZY INFERENCE SYSTEMS Fuzzy inference is the process of formulating the mapping from a given input to an output using fuzzy logic. The mapping then provides a basis from which decisions can
More informationA General Greedy Approximation Algorithm with Applications
A General Greedy Approximation Algorithm with Applications Tong Zhang IBM T.J. Watson Research Center Yorktown Heights, NY 10598 tzhang@watson.ibm.com Abstract Greedy approximation algorithms have been
More informationRSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È.
RSA (Rivest Shamir Adleman) public key cryptosystem: Key generation: Pick two large prime Ô Õ ¾ numbers È. Let Ò Ô Õ. Pick ¾ ½ ³ Òµ ½ so, that ³ Òµµ ½. Let ½ ÑÓ ³ Òµµ. Public key: Ò µ. Secret key Ò µ.
More informationKey Grids: A Protocol Family for Assigning Symmetric Keys
Key Grids: A Protocol Family for Assigning Symmetric Keys Amitanand S. Aiyer University of Texas at Austin anand@cs.utexas.edu Lorenzo Alvisi University of Texas at Austin lorenzo@cs.utexas.edu Mohamed
More informationAn Introduction to Content Based Image Retrieval
CHAPTER -1 An Introduction to Content Based Image Retrieval 1.1 Introduction With the advancement in internet and multimedia technologies, a huge amount of multimedia data in the form of audio, video and
More informationNotes on Fuzzy Set Ordination
Notes on Fuzzy Set Ordination Umer Zeeshan Ijaz School of Engineering, University of Glasgow, UK Umer.Ijaz@glasgow.ac.uk http://userweb.eng.gla.ac.uk/umer.ijaz May 3, 014 1 Introduction The membership
More informationChapter 4 - Image. Digital Libraries and Content Management
Prof. Dr.-Ing. Stefan Deßloch AG Heterogene Informationssysteme Geb. 36, Raum 329 Tel. 0631/205 3275 dessloch@informatik.uni-kl.de Chapter 4 - Image Vector Graphics Raw data: set (!) of lines and polygons
More informationRough Feature Selection for CBIR. Outline
Rough Feature Selection for CBIR Instructor:Dr. Wojciech Ziarko presenter :Aifen Ye 19th Nov., 2008 Outline Motivation Rough Feature Selection Image Retrieval Image Retrieval with Rough Feature Selection
More informationContent Based Image Retrieval Using Combined Color & Texture Features
IOSR Journal of Electrical and Electronics Engineering (IOSR-JEEE) e-issn: 2278-1676,p-ISSN: 2320-3331, Volume 11, Issue 6 Ver. III (Nov. Dec. 2016), PP 01-05 www.iosrjournals.org Content Based Image Retrieval
More informationApproximation by NURBS curves with free knots
Approximation by NURBS curves with free knots M Randrianarivony G Brunnett Technical University of Chemnitz, Faculty of Computer Science Computer Graphics and Visualization Straße der Nationen 6, 97 Chemnitz,
More informationCOSC 6397 Big Data Analytics. Fuzzy Clustering. Some slides based on a lecture by Prof. Shishir Shah. Edgar Gabriel Spring 2015.
COSC 6397 Big Data Analytics Fuzzy Clustering Some slides based on a lecture by Prof. Shishir Shah Edgar Gabriel Spring 215 Clustering Clustering is a technique for finding similarity groups in data, called
More informationUnit V. Neural Fuzzy System
Unit V Neural Fuzzy System 1 Fuzzy Set In the classical set, its characteristic function assigns a value of either 1 or 0 to each individual in the universal set, There by discriminating between members
More information2. LITERATURE REVIEW
2. LITERATURE REVIEW CBIR has come long way before 1990 and very little papers have been published at that time, however the number of papers published since 1997 is increasing. There are many CBIR algorithms
More informationResponse Time Analysis of Asynchronous Real-Time Systems
Response Time Analysis of Asynchronous Real-Time Systems Guillem Bernat Real-Time Systems Research Group Department of Computer Science University of York York, YO10 5DD, UK Technical Report: YCS-2002-340
More informationCHAPTER 4 SEMANTIC REGION-BASED IMAGE RETRIEVAL (SRBIR)
63 CHAPTER 4 SEMANTIC REGION-BASED IMAGE RETRIEVAL (SRBIR) 4.1 INTRODUCTION The Semantic Region Based Image Retrieval (SRBIR) system automatically segments the dominant foreground region and retrieves
More informationThe Detection of Faces in Color Images: EE368 Project Report
The Detection of Faces in Color Images: EE368 Project Report Angela Chau, Ezinne Oji, Jeff Walters Dept. of Electrical Engineering Stanford University Stanford, CA 9435 angichau,ezinne,jwalt@stanford.edu
More informationCOSC 6339 Big Data Analytics. Fuzzy Clustering. Some slides based on a lecture by Prof. Shishir Shah. Edgar Gabriel Spring 2017.
COSC 6339 Big Data Analytics Fuzzy Clustering Some slides based on a lecture by Prof. Shishir Shah Edgar Gabriel Spring 217 Clustering Clustering is a technique for finding similarity groups in data, called
More informationEVALUATION FUZZY NUMBERS BASED ON RMS
EVALUATION FUZZY NUMBERS BASED ON RMS *Adel Asgari Safdar Young Researchers and Elite Club, Baft Branch, Islamic Azad University, Baft, Iran *Author for Correspondence ABSTRACT We suggest a new approach
More informationThis file contains an excerpt from the character code tables and list of character names for The Unicode Standard, Version 3.0.
Range: This file contains an excerpt from the character code tables and list of character names for The Unicode Standard, Version.. isclaimer The shapes of the reference glyphs used in these code charts
More informationA Content Based Image Retrieval System Based on Color Features
A Content Based Image Retrieval System Based on Features Irena Valova, University of Rousse Angel Kanchev, Department of Computer Systems and Technologies, Rousse, Bulgaria, Irena@ecs.ru.acad.bg Boris
More informationEvent List Management In Distributed Simulation
Event List Management In Distributed Simulation Jörgen Dahl ½, Malolan Chetlur ¾, and Philip A Wilsey ½ ½ Experimental Computing Laboratory, Dept of ECECS, PO Box 20030, Cincinnati, OH 522 0030, philipwilsey@ieeeorg
More informationContent-Based Image Retrieval of Web Surface Defects with PicSOM
Content-Based Image Retrieval of Web Surface Defects with PicSOM Rami Rautkorpi and Jukka Iivarinen Helsinki University of Technology Laboratory of Computer and Information Science P.O. Box 54, FIN-25
More informationEE368 Project Report CD Cover Recognition Using Modified SIFT Algorithm
EE368 Project Report CD Cover Recognition Using Modified SIFT Algorithm Group 1: Mina A. Makar Stanford University mamakar@stanford.edu Abstract In this report, we investigate the application of the Scale-Invariant
More informationA Fuzzy C-means Clustering Algorithm Based on Pseudo-nearest-neighbor Intervals for Incomplete Data
Journal of Computational Information Systems 11: 6 (2015) 2139 2146 Available at http://www.jofcis.com A Fuzzy C-means Clustering Algorithm Based on Pseudo-nearest-neighbor Intervals for Incomplete Data
More informationMultivariate Standard Normal Transformation
Multivariate Standard Normal Transformation Clayton V. Deutsch Transforming K regionalized variables with complex multivariate relationships to K independent multivariate standard normal variables is an
More informationContent Based Image Retrieval: Survey and Comparison between RGB and HSV model
Content Based Image Retrieval: Survey and Comparison between RGB and HSV model Simardeep Kaur 1 and Dr. Vijay Kumar Banga 2 AMRITSAR COLLEGE OF ENGG & TECHNOLOGY, Amritsar, India Abstract Content based
More informationAn ICA based Approach for Complex Color Scene Text Binarization
An ICA based Approach for Complex Color Scene Text Binarization Siddharth Kherada IIIT-Hyderabad, India siddharth.kherada@research.iiit.ac.in Anoop M. Namboodiri IIIT-Hyderabad, India anoop@iiit.ac.in
More informationA Proposal for the Implementation of a Parallel Watershed Algorithm
A Proposal for the Implementation of a Parallel Watershed Algorithm A. Meijster and J.B.T.M. Roerdink University of Groningen, Institute for Mathematics and Computing Science P.O. Box 800, 9700 AV Groningen,
More informationWelcome Back to Fundamental of Multimedia (MR412) Fall, ZHU Yongxin, Winson
Welcome Back to Fundamental of Multimedia (MR412) Fall, 2012 ZHU Yongxin, Winson zhuyongxin@sjtu.edu.cn Content-Based Retrieval in Digital Libraries 18.1 How Should We Retrieve Images? 18.2 C-BIRD : A
More informationA Linear Dual-Space Approach to 3D Surface Reconstruction from Occluding Contours using Algebraic Surfaces
A Linear Dual-Space Approach to 3D Surface Reconstruction from Occluding Contours using Algebraic Surfaces Kongbin Kang Jean-Philippe Tarel Richard Fishman David Cooper Div. of Eng. LIVIC (INRETS-LCPC)
More informationEfficient Content Based Image Retrieval System with Metadata Processing
IJIRST International Journal for Innovative Research in Science & Technology Volume 1 Issue 10 March 2015 ISSN (online): 2349-6010 Efficient Content Based Image Retrieval System with Metadata Processing
More informationOptimal Time Bounds for Approximate Clustering
Optimal Time Bounds for Approximate Clustering Ramgopal R. Mettu C. Greg Plaxton Department of Computer Science University of Texas at Austin Austin, TX 78712, U.S.A. ramgopal, plaxton@cs.utexas.edu Abstract
More informationA MORPHOLOGY-BASED FILTER STRUCTURE FOR EDGE-ENHANCING SMOOTHING
Proceedings of the 1994 IEEE International Conference on Image Processing (ICIP-94), pp. 530-534. (Austin, Texas, 13-16 November 1994.) A MORPHOLOGY-BASED FILTER STRUCTURE FOR EDGE-ENHANCING SMOOTHING
More informationRobust Shape Retrieval Using Maximum Likelihood Theory
Robust Shape Retrieval Using Maximum Likelihood Theory Naif Alajlan 1, Paul Fieguth 2, and Mohamed Kamel 1 1 PAMI Lab, E & CE Dept., UW, Waterloo, ON, N2L 3G1, Canada. naif, mkamel@pami.uwaterloo.ca 2
More informationCofactoring-Based Upper Bound Computation for Covering Problems
TR-CSE-98-06, UNIVERSITY OF MASSACHUSETTS AMHERST Cofactoring-Based Upper Bound Computation for Covering Problems Congguang Yang Maciej Ciesielski May 998 TR-CSE-98-06 Department of Electrical and Computer
More informationPerimeter and Area Estimations of Digitized Objects with Fuzzy Borders
Perimeter and Area Estimations of Digitized Objects with Fuzzy Borders Nataša Sladoje,, Ingela Nyström, and Punam K. Saha 2 Centre for Image Analysis, Uppsala, Sweden {natasa,ingela}@cb.uu.se 2 MIPG, Dept.
More informationContent-based Image Retrieval (CBIR)
Content-based Image Retrieval (CBIR) Content-based Image Retrieval (CBIR) Searching a large database for images that match a query: What kinds of databases? What kinds of queries? What constitutes a match?
More informationContent Based Image Retrieval
Content Based Image Retrieval R. Venkatesh Babu Outline What is CBIR Approaches Features for content based image retrieval Global Local Hybrid Similarity measure Trtaditional Image Retrieval Traditional
More informationCombinatorial Optimization through Statistical Instance-Based Learning
Combinatorial Optimization through Statistical Instance-Based Learning Orestis Telelis Panagiotis Stamatopoulos Department of Informatics and Telecommunications University of Athens 157 84 Athens, Greece
More informationFEATURE EXTRACTION TECHNIQUES FOR IMAGE RETRIEVAL USING HAAR AND GLCM
FEATURE EXTRACTION TECHNIQUES FOR IMAGE RETRIEVAL USING HAAR AND GLCM Neha 1, Tanvi Jain 2 1,2 Senior Research Fellow (SRF), SAM-C, Defence R & D Organization, (India) ABSTRACT Content Based Image Retrieval
More informationBeyond Mere Pixels: How Can Computers Interpret and Compare Digital Images? Nicholas R. Howe Cornell University
Beyond Mere Pixels: How Can Computers Interpret and Compare Digital Images? Nicholas R. Howe Cornell University Why Image Retrieval? World Wide Web: Millions of hosts Billions of images Growth of video
More informationGeneralized Fuzzy Clustering Model with Fuzzy C-Means
Generalized Fuzzy Clustering Model with Fuzzy C-Means Hong Jiang 1 1 Computer Science and Engineering, University of South Carolina, Columbia, SC 29208, US jiangh@cse.sc.edu http://www.cse.sc.edu/~jiangh/
More informationImage retrieval based on region shape similarity
Image retrieval based on region shape similarity Cheng Chang Liu Wenyin Hongjiang Zhang Microsoft Research China, 49 Zhichun Road, Beijing 8, China {wyliu, hjzhang}@microsoft.com ABSTRACT This paper presents
More informationUsing a fuzzy inference system for the map overlay problem
Using a fuzzy inference system for the map overlay problem Abstract Dr. Verstraete Jörg 1 1 Systems esearch Institute, Polish Academy of Sciences ul. Newelska 6, Warsaw, 01-447, Warsaw jorg.verstraete@ibspan.waw.pl
More informationIdentifying Layout Classes for Mathematical Symbols Using Layout Context
Rochester Institute of Technology RIT Scholar Works Articles 2009 Identifying Layout Classes for Mathematical Symbols Using Layout Context Ling Ouyang Rochester Institute of Technology Richard Zanibbi
More informationA Triangular Fuzzy Model for Assessing Problem Solving Skills
Annals of Pure and Applied Mathematics Vol. 7, No., 04, 3-8 ISSN: 79-087X (P), 79-0888(online) Published on 9 September 04 www.researchmathsci.org Annals of A Triangular Fuzzy Model for Assessing Problem
More informationMODELING FOR RESIDUAL STRESS, SURFACE ROUGHNESS AND TOOL WEAR USING AN ADAPTIVE NEURO FUZZY INFERENCE SYSTEM
CHAPTER-7 MODELING FOR RESIDUAL STRESS, SURFACE ROUGHNESS AND TOOL WEAR USING AN ADAPTIVE NEURO FUZZY INFERENCE SYSTEM 7.1 Introduction To improve the overall efficiency of turning, it is necessary to
More informationTOPSIS Modification with Interval Type-2 Fuzzy Numbers
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 6, No 2 Sofia 26 Print ISSN: 3-972; Online ISSN: 34-48 DOI:.55/cait-26-2 TOPSIS Modification with Interval Type-2 Fuzzy Numbers
More informationA SIMPLE METHOD FOR SEARCHING FOR PRIME PAIRS IN THE GOLDBACH CONJECTURE WEI SHENG ZENG AND ZIQI SUN
A SIMPLE METHOD FOR SEARCHING FOR PRIME PAIRS IN THE GOLDBACH CONJECTURE WEI SHENG ZENG AND ZIQI SUN ABSTRACT. In this paper we introduce a simple method of searching for the prime pairs in the famous
More informationMAT 110 WORKSHOP. Updated Fall 2018
MAT 110 WORKSHOP Updated Fall 2018 UNIT 3: STATISTICS Introduction Choosing a Sample Simple Random Sample: a set of individuals from the population chosen in a way that every individual has an equal chance
More informationINTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY
INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY A PATH FOR HORIZING YOUR INNOVATIVE WORK REVIEW ON CONTENT BASED IMAGE RETRIEVAL BY USING VISUAL SEARCH RANKING MS. PRAGATI
More informationCHAPTER 3 FUZZY INFERENCE SYSTEM
CHAPTER 3 FUZZY INFERENCE SYSTEM Fuzzy inference is the process of formulating the mapping from a given input to an output using fuzzy logic. There are three types of fuzzy inference system that can be
More informationDiffusion Wavelets for Natural Image Analysis
Diffusion Wavelets for Natural Image Analysis Tyrus Berry December 16, 2011 Contents 1 Project Description 2 2 Introduction to Diffusion Wavelets 2 2.1 Diffusion Multiresolution............................
More informationImage Mining: frameworks and techniques
Image Mining: frameworks and techniques Madhumathi.k 1, Dr.Antony Selvadoss Thanamani 2 M.Phil, Department of computer science, NGM College, Pollachi, Coimbatore, India 1 HOD Department of Computer Science,
More informationProbabilistic analysis of algorithms: What s it good for?
Probabilistic analysis of algorithms: What s it good for? Conrado Martínez Univ. Politècnica de Catalunya, Spain February 2008 The goal Given some algorithm taking inputs from some set Á, we would like
More informationAgglomerative Information Bottleneck
Agglomerative Information Bottleneck Noam Slonim Naftali Tishby Institute of Computer Science and Center for Neural Computation The Hebrew University Jerusalem, 91904 Israel email: noamm,tishby@cs.huji.ac.il
More informationA Blind Source Separation Approach to Structure From Motion
A Blind Source Separation Approach to Structure From Motion Jeff Fortuna and Aleix M. Martinez Department of Electrical & Computer Engineering The Ohio State University Columbus, Ohio, 4321 Abstract We
More informationShort Run length Descriptor for Image Retrieval
CHAPTER -6 Short Run length Descriptor for Image Retrieval 6.1 Introduction In the recent years, growth of multimedia information from various sources has increased many folds. This has created the demand
More informationTypes of Edges. Why Edge Detection? Types of Edges. Edge Detection. Gradient. Edge Detection
Why Edge Detection? How can an algorithm extract relevant information from an image that is enables the algorithm to recognize objects? The most important information for the interpretation of an image
More informationMedical Image Processing using MATLAB
Medical Image Processing using MATLAB Emilia Dana SELEŢCHI University of Bucharest, Romania ABSTRACT 2. 3. 2. IMAGE PROCESSING TOOLBOX MATLAB and the Image Processing Toolbox provide a wide range of advanced
More informationfuzzylite a fuzzy logic control library in C++
fuzzylite a fuzzy logic control library in C++ Juan Rada-Vilela jcrada@fuzzylite.com Abstract Fuzzy Logic Controllers (FLCs) are software components found nowadays within well-known home appliances such
More informationCompetitive Analysis of On-line Algorithms for On-demand Data Broadcast Scheduling
Competitive Analysis of On-line Algorithms for On-demand Data Broadcast Scheduling Weizhen Mao Department of Computer Science The College of William and Mary Williamsburg, VA 23187-8795 USA wm@cs.wm.edu
More informationContent Based Image Retrieval Using Color and Texture Feature with Distance Matrices
International Journal of Scientific and Research Publications, Volume 7, Issue 8, August 2017 512 Content Based Image Retrieval Using Color and Texture Feature with Distance Matrices Manisha Rajput Department
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationSystem of Systems Architecture Generation and Evaluation using Evolutionary Algorithms
SysCon 2008 IEEE International Systems Conference Montreal, Canada, April 7 10, 2008 System of Systems Architecture Generation and Evaluation using Evolutionary Algorithms Joseph J. Simpson 1, Dr. Cihan
More informationChapter 7 Fuzzy Logic Controller
Chapter 7 Fuzzy Logic Controller 7.1 Objective The objective of this section is to present the output of the system considered with a fuzzy logic controller to tune the firing angle of the SCRs present
More informationAppART + Growing Neural Gas = high performance hybrid neural network for function approximation
1 AppART + Growing Neural Gas = high performance hybrid neural network for function approximation Luis Martí Ý Þ, Alberto Policriti Ý, Luciano García Þ and Raynel Lazo Þ Ý DIMI, Università degli Studi
More informationDesigning Networks Incrementally
Designing Networks Incrementally Adam Meyerson Kamesh Munagala Ý Serge Plotkin Þ Abstract We consider the problem of incrementally designing a network to route demand to a single sink on an underlying
More informationA Review: Content Base Image Mining Technique for Image Retrieval Using Hybrid Clustering
A Review: Content Base Image Mining Technique for Image Retrieval Using Hybrid Clustering Gurpreet Kaur M-Tech Student, Department of Computer Engineering, Yadawindra College of Engineering, Talwandi Sabo,
More informationFuzzy Set-Theoretical Approach for Comparing Objects with Fuzzy Attributes
Fuzzy Set-Theoretical Approach for Comparing Objects with Fuzzy Attributes Y. Bashon, D. Neagu, M.J. Ridley Department of Computing University of Bradford Bradford, BD7 DP, UK e-mail: {Y.Bashon, D.Neagu,
More informationQuery-Sensitive Similarity Measure for Content-Based Image Retrieval
Query-Sensitive Similarity Measure for Content-Based Image Retrieval Zhi-Hua Zhou Hong-Bin Dai National Laboratory for Novel Software Technology Nanjing University, Nanjing 2193, China {zhouzh, daihb}@lamda.nju.edu.cn
More informationAdaptive techniques for spline collocation
Adaptive techniques for spline collocation Christina C. Christara and Kit Sun Ng Department of Computer Science University of Toronto Toronto, Ontario M5S 3G4, Canada ccc,ngkit @cs.utoronto.ca July 18,
More informationMULTI ORIENTATION PERFORMANCE OF FEATURE EXTRACTION FOR HUMAN HEAD RECOGNITION
MULTI ORIENTATION PERFORMANCE OF FEATURE EXTRACTION FOR HUMAN HEAD RECOGNITION Panca Mudjirahardjo, Rahmadwati, Nanang Sulistiyanto and R. Arief Setyawan Department of Electrical Engineering, Faculty of
More informationAn Efficient Approach for Color Pattern Matching Using Image Mining
An Efficient Approach for Color Pattern Matching Using Image Mining * Manjot Kaur Navjot Kaur Master of Technology in Computer Science & Engineering, Sri Guru Granth Sahib World University, Fatehgarh Sahib,
More informationMultistage Content Based Image Retrieval
CHAPTER - 3 Multistage Content Based Image Retrieval 3.1. Introduction Content Based Image Retrieval (CBIR) is process of searching similar images from the database based on their visual content. A general
More informationChapter 3. Uncertainty and Vagueness. (c) 2008 Prof. Dr. Michael M. Richter, Universität Kaiserslautern
Chapter 3 Uncertainty and Vagueness Motivation In most images the objects are not precisely defined, e.g. Landscapes, Medical images etc. There are different aspects of uncertainty involved that need to
More informationFSRM Feedback Algorithm based on Learning Theory
Send Orders for Reprints to reprints@benthamscience.ae The Open Cybernetics & Systemics Journal, 2015, 9, 699-703 699 FSRM Feedback Algorithm based on Learning Theory Open Access Zhang Shui-Li *, Dong
More informationAPPLICATION OF THE FUZZY MIN-MAX NEURAL NETWORK CLASSIFIER TO PROBLEMS WITH CONTINUOUS AND DISCRETE ATTRIBUTES
APPLICATION OF THE FUZZY MIN-MAX NEURAL NETWORK CLASSIFIER TO PROBLEMS WITH CONTINUOUS AND DISCRETE ATTRIBUTES A. Likas, K. Blekas and A. Stafylopatis National Technical University of Athens Department
More informationCOLOR AND SHAPE BASED IMAGE RETRIEVAL
International Journal of Computer Science Engineering and Information Technology Research (IJCSEITR) ISSN 2249-6831 Vol.2, Issue 4, Dec 2012 39-44 TJPRC Pvt. Ltd. COLOR AND SHAPE BASED IMAGE RETRIEVAL
More informationAN EFFICIENT BATIK IMAGE RETRIEVAL SYSTEM BASED ON COLOR AND TEXTURE FEATURES
AN EFFICIENT BATIK IMAGE RETRIEVAL SYSTEM BASED ON COLOR AND TEXTURE FEATURES 1 RIMA TRI WAHYUNINGRUM, 2 INDAH AGUSTIEN SIRADJUDDIN 1, 2 Department of Informatics Engineering, University of Trunojoyo Madura,
More informationChapter 4. Clustering Core Atoms by Location
Chapter 4. Clustering Core Atoms by Location In this chapter, a process for sampling core atoms in space is developed, so that the analytic techniques in section 3C can be applied to local collections
More informationCITS 4402 Computer Vision
CITS 4402 Computer Vision A/Prof Ajmal Mian Adj/A/Prof Mehdi Ravanbakhsh, CEO at Mapizy (www.mapizy.com) and InFarm (www.infarm.io) Lecture 02 Binary Image Analysis Objectives Revision of image formation
More informationAutomatic Linguistic Indexing of Pictures by a Statistical Modeling Approach
Automatic Linguistic Indexing of Pictures by a Statistical Modeling Approach Abstract Automatic linguistic indexing of pictures is an important but highly challenging problem for researchers in content-based
More informationMaintaining Mutual Consistency for Cached Web Objects
Maintaining Mutual Consistency for Cached Web Objects Bhuvan Urgaonkar, Anoop George Ninan, Mohammad Salimullah Raunak Prashant Shenoy and Krithi Ramamritham Department of Computer Science, University
More informationEdge Histogram Descriptor, Geometric Moment and Sobel Edge Detector Combined Features Based Object Recognition and Retrieval System
Edge Histogram Descriptor, Geometric Moment and Sobel Edge Detector Combined Features Based Object Recognition and Retrieval System Neetesh Prajapati M. Tech Scholar VNS college,bhopal Amit Kumar Nandanwar
More informationLECTURE 4: FEATURE EXTRACTION DR. OUIEM BCHIR
LECTURE 4: FEATURE EXTRACTION DR. OUIEM BCHIR RGB COLOR HISTOGRAM HSV COLOR MOMENTS hsv_image = rgb2hsv(rgb_image) converts the RGB image to the equivalent HSV image. RGB is an m-by-n-by-3 image array
More informationANALYSIS AND REASONING OF DATA IN THE DATABASE USING FUZZY SYSTEM MODELLING
ANALYSIS AND REASONING OF DATA IN THE DATABASE USING FUZZY SYSTEM MODELLING Dr.E.N.Ganesh Dean, School of Engineering, VISTAS Chennai - 600117 Abstract In this paper a new fuzzy system modeling algorithm
More informationMRI Brain Image Segmentation Using an AM-FM Model
MRI Brain Image Segmentation Using an AM-FM Model Marios S. Pattichis', Helen Petropoulos2, and William M. Brooks2 1 Department of Electrical and Computer Engineering, The University of New Mexico, Albuquerque,
More informationGraphs (MTAT , 4 AP / 6 ECTS) Lectures: Fri 12-14, hall 405 Exercises: Mon 14-16, hall 315 või N 12-14, aud. 405
Graphs (MTAT.05.080, 4 AP / 6 ECTS) Lectures: Fri 12-14, hall 405 Exercises: Mon 14-16, hall 315 või N 12-14, aud. 405 homepage: http://www.ut.ee/~peeter_l/teaching/graafid08s (contains slides) For grade:
More informationApplication of fuzzy set theory in image analysis. Nataša Sladoje Centre for Image Analysis
Application of fuzzy set theory in image analysis Nataša Sladoje Centre for Image Analysis Our topics for today Crisp vs fuzzy Fuzzy sets and fuzzy membership functions Fuzzy set operators Approximate
More informationAn explicit feature control approach in structural topology optimization
th World Congress on Structural and Multidisciplinary Optimisation 07 th -2 th, June 205, Sydney Australia An explicit feature control approach in structural topology optimization Weisheng Zhang, Xu Guo
More information