Amit Presentation Finalv1.1

Information Searching using Image-Query
By Amit Marwah B.Tech (IT) 2008-311-006
May 20, 2012
Jamia Hamdard, New Delhi
Contents

Introduction Image Processing - Various Methods Overview of - Google Overview of Xampp Overview of Drupal
May 20, 2012
Introduction
Image-Query" means that the information search will analyze the actual contents of the query image rather than the metadata such as keywords, tags, and/or descriptions associated with the image. Here 'content refers to colors, shapes, textures, or any other information that can be derived from the image May itself. 20, 2012 Jamia Hamdard, New Delhi
Overview
Shape
Q u er y I m a g e
Feature extractio n Texture Feature extractio n Color Feature extractio n
Feature vector Combinati on
Similarity Computati on
R e t r i e v e d I m a g e
Feature DB
Feature extractio n
Image DB
May 20, 2012
Content Based Image Retrieval
May 20, 2012
Content Based Image Retrieval
Content-based image retrieval (CBIR) a query by image content (QBIC) Content-based visual information retrieval (CBVIR) is an application of computer vision techniques to the image retrieval problem, that is, the problem of searching for digital images in large databases.
May 20, 2012
Why CBIR ?
CBIR is desirable because:
Most web based image search engines rely purely on metadata and this produces a lot of garbage in the results. Humans manually entering keywords for images in a large database is inefficient, expensive and may not capture every keyword that describes the image. CBIR is a System that would filter images based on their content and provide better indexing and return more accurate results.
May 20, 2012
Content Based Image Retrieval Techniques
Query by example:
is a query technique that involves providing the CBIR system with an example image that it will then base its search upon. The underlying search algorithms may vary depending on the application, but result images should all share common elements with the provided example.
Ways for providing example images to the system:

Pre-existing image supplied by the user or chosen from a random set. The user draws a rough approximation of the image as a query.
Semantic retrieval
User makes a request like "find pictures of Lion" or even "find pictures of Nehru".
Challenge:
May 20, 2012
Problem of retrieving images on the basis of their pixel content remains largely unsolved as of now.
CBIR Content comparison
An Image Distance Measure compares the similarity of two images in various dimensions Color, texture, shape A distance of 0 signifies an exact match with the query, with respect to the dimensions. A value greater than 0 indicates various degrees of similarities between the images. Search results then can be sorted based on their distance to the queried image.
May 20, 2012
CBIR A sample search query
User wants to search for, say, many rose images He submits an existing rose picture as query. He submits his own sketch of rose as query. The system will extract image features for this query. It will compare these features with that of other images in a database. Relevant results will be displayed to the user.
May 20, 2012
10
Sample CBIR architecture
May 20, 2012
11
May 20, 2012
12
Edge-based Techniques
Edge detection Segmentation by boundary detection Classification and analysis
May 20, 2012
13
13
Segmentation Image Processing
In computer vision, Segmentation is the process of partitioning a digital image into multiple segments (sets of pixels, also known as superpixels). The goal of segmentation is to simplify and/or change the representation of an image into something that is more meaningful and easier to analyze. Image segmentation is typically used to locate objects and boundaries (lines, curves, etc.) in images. The result of image segmentation is a set of segments that collectively cover the entire image, or a set of contours extracted from the image Each of the pixels in a region are similar with respect to some characteristic or computed property, such as color, intensity, or texture. Adjacent regions are significantly different with respect to the same characteristic(s). May 20, 2012 Jamia Hamdard, New Delhi
14
Segmentation Image Processing Method - Edge detection
. Edge detection techniques have been used as the base of another segmentation technique. Region boundaries and edges are closely related, since there is often a sharp adjustment in intensity at the region boundaries. The edges identified by edge detection are often disconnected. To segment an object from an image however, one needs closed region boundaries. The desired edges are the boundaries between such objects. Segmentation methods can also be applied to edges obtained from edge detectors.
Jamia Hamdard, New Delhi 15
May 20, 2012
Segmentation Image Processing Method- Clustering Methods

Algorithm: An iterative technique that is used to partition an image into K clusters. 1. The basic algorithm is: 2. Pick K cluster centres, either randomly or based on some heuristic 3. Assign each pixel in the image to the cluster that minimizes the distance between the pixel and the cluster centre 4. Re-compute the cluster centres by averaging all of the pixels in the cluster 5. Repeat steps 2 and 3 until convergence is attained (e.g. no pixels change clusters) 6. In this case, distance is the squared or absolute difference between a pixel and a cluster center. The difference is typically based on pixel color, intensity, texture, and location, or a weighted combination of these factors. K can be selected manually, randomly or May 20, 2012 a heuristic. Jamia Hamdard, New Delhi 16 by 7. This algorithm is guaranteed to converge, but it may not
Segmentation Image Processing Methods Region-Filling
May 20, 2012
17
17
Segmentation Image Processing Methods- Split-and-merge methods
Split-and-merge segmentation is based on a quadtree partition of an image. It is sometimes called quadtree segmentation. This method starts at the root of the tree that represents the whole image. If it is found non-uniform (not homogeneous), then it is split into four son-squares (the splitting process), and so on so forth. Conversely, if four son-squares are homogeneous, they can be merged as several connected components (the merging process). The node in the tree is a segmented node. This process continues recursively until no further splits or merges are possible. When a special data structure is involved in the implementation of the algorithm of the method, its time complexity can reach , an optimal algorithm of the method
May 20, 2012
Segmentation Image Processing Methods-Graph partitioning methods
Graph partitioning methods can effectively be used for image segmentation. In these methods, the image is modelled as a weighted, undirected graph. Usually a pixel or a group of pixels are associated with nodes and edge weights define the (dis)similarity between the neighbourhood pixels. The graph (image) is then partitioned according to a criterion designed to model "good" clusters. Each partition of the nodes (pixels) output from these algorithms are considered an object segment in the image. Some popular algorithms of this category are normalized cuts, random walker minimum cut, isoperimetric partitioning and minimum spanning tree-based segmentation.
May 20, 2012
19
Segmentation Image Processing Methods-Watershed transformation
The watershed transformation considers the gradient magnitude of an image as a topographic surface. Pixels having the highest gradient magnitude intensities (GMIs) correspond to watershed lines, which represent the region boundaries. Water placed on any pixel enclosed by a common watershed line flows downhill to a common local intensity minimum (LIM). Pixels draining to a common minimum form a catch basin, which represents a segment.
May 20, 2012
20
Segmentation Image Processing Methods-Model based segmentation
The central assumption of such an approach is that structures of interest/organs have a repetitive form of geometry. Therefore, one can seek for a probabilistic model towards explaining the variation of the shape of the organ and then when segmenting an image impose constraints using this model as prior. Such a task involves (i) registration of the training examples to a common pose, (ii) probabilistic representation of the variation of the registered samples, and (iii) statistical inference between the model and the image. State of the art methods in the literature for knowledge-based segmentation involve active shape and appearance models, active contours and deformable templates and level-set based methods.
May 20, 2012
21
Segmentation Image Processing Methods- Compression-based methods
Compression based methods postulate that the optimal segmentation is the one that minimizes, over all possible segmentations, the coding length of the data. The connection between these two concepts is that segmentation tries to find patterns in an image and any regularity in the image can be used to compress it. The method describes each segment by its texture and boundary shape. Each of these components is modeled by a probability distribution function and its coding length is computed as follows:
May 20, 2012
The boundary encoding leverages the fact that regions in natural images tend to have a smooth contour. This prior is used by huffman coding to encode the difference chain code of the contours in an image. Thus, the smoother a boundary is, the shorter coding length it attains. Texture is encoded by lossy compression in a way similar to minimum description length (MDL) principle, but here the length of the data given the model is approximated by the number of samples times the entropy of the model. The texture in each region is modeled by a multivariate normal distribution whose entropy has closed form expression. An interesting property of this model is that the estimated entropy bounds the true entropy of the data from above. This is because among all distributions with a given mean and covariance, normal distribution has the largest entropy. Thus, the true coding length cannot be more than what the algorithm tries to minimize. For any given segmentation of an image, this scheme yields the number of bits required to encode that image based on the given segmentation. Thus, among all possible segmentations of an image, the goal is to find the segmentation which produces the shortest coding length. This can be achieved by a simple agglomerative clustering method. The distortion in the lossy compression determines the coarseness of the segmentation and its optimal value may differ for each image. This parameter can be estimated heuristically from the contrast of textures in an image.
22
Segmentation Image Processing Methods - Region-growing methods

The first region-growing method was the seeded region growing method. This method takes a set of seeds as input along with the image. The seeds mark each of the objects to be segmented. The regions are iteratively grown by comparing all unallocated neighbouring pixels to the regions. The difference between a pixel's intensity value and the region's mean, is used as a measure of similarity. The pixel with the smallest difference measured this way is allocated to the respective region. This process continues until all pixels are allocated to a region. Seeded region growing requires seeds as additional input. The segmentation results are dependent on the choice of seeds. Noise in the image can cause the seeds to be poorly placed. Unseeded region growing is a modified algorithm that doesn't require explicit seeds. It starts off with a single region the pixel chosen here does not significantly influence final segmentation. At each iteration it considers the neighbouring pixels in the same way as seeded region growing. It differs from seeded region growing in that if the minimum is less than a predefined threshold then it is added to the respective region . If not, then the pixel is considered significantly different from all current regions and a new region is created with this pixel. May 20, 2012 Jamia Hamdard, New Delhi 23
Segmentation Image Processing Methods- Histogram-based methods
Histogram-based methods are very efficient when compared to other image segmentation methods because they typically require only one pass through the pixels. In this technique, a histogram is computed from all of the pixels in the image, and the peaks and valleys in the histogram are used to locate the clusters in the image.Color or intensity can be used as the measure. A refinement of this technique is to recursively apply the histogram-seeking method to clusters in the image in order to divide them into smaller clusters. This is repeated with smaller and smaller clusters until no more clusters are formed. One disadvantage of the histogram-seeking method is that it may be difficult to identify significant peaks and valleys in the image. In this technique of image classification distance metric and integrated region matching are familiar. Histogram-based approaches can also be quickly adapted to occur over multiple frames, while maintaining their single pass efficiency. The histogram can be done in multiple fashions when multiple frames are considered. The same approach that is taken with one frame can be applied to multiple, and after the results are merged, peaks and valleys that were previously difficult to identify are more likely to be distinguishable. The histogram can also be applied on a per pixel basis where the information result are used to determine the most frequent color for the pixel location. This approach segments based on active objects and a static environment, resulting in a different type of segmentation useful in Video tracking
May 20, 2012
24
Segmentation Image Processing Methods- Histogram-based methods
An image histogram is a type of histogram that acts as a graphical representation of the tonal distribution in a digital image. It plots the number of pixels for each tonal value. By looking at the histogram for a specific image a viewer will be able to judge the entire tonal distribution at a glance. Image histograms are present on many modern digital cameras. Photographers can use them as an aid to show the distribution of tones captured, and whether image detail has been lost to blownout highlights or blacked-out shadows. The horizontal axis of the graph represents the tonal variations, while the vertical axis represents the number of pixels in that particular tone. The left side of the horizontal axis represents the black and dark areas, the middle represents medium grey and the right hand side represents light and pure white areas. The vertical axis represents the size of the area that is captured in each one of these zones. Thus, the histogram for a very dark image will have the majority of its data points on the left side and center of the graph. Conversely, the histogram for a very bright image with few dark areas and/or shadows will have most of its data points on the right side and center of the graph.
May 20, 2012 Jamia Hamdard, New Delhi 25
Image Histogram contd
Image editors typically have provisions to create a histogram of the image being edited. The histogram plots the number of pixels in the image (vertical axis) with a particular brightness value (horizontal axis). Algorithms in the digital editor allow the user to visually adjust the brightness value of each pixel and to dynamically display the results as adjustments are made. Improvements in picture brightness and contrast can thus be obtained. In the field of computer vision, image histograms can be useful tools for thresholding. Because the information contained in the graph is a representation of pixel distribution as a function of tonal variation, image histograms can be analyzed for peaks and/or valleys which can then be used to determine a threshold value. This threshold value can then be used for edge detection, image segmentation, and co-occurrence matrices.
May 20, 2012
26
May 20, 2012
27
May 20, 2012
28
Overview of - Google
Name- Google, because it is a common spelling of googol, or 10100 and fits well with our goal of building very largescale search
May 20, 2012
30
1. Google is a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. 2. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. 3. Large-scale search engine which addresses many of the problems of existing systems. It makes especially heavy use of the additional structure present in hypertext to provide much higher quality search results
How Google Works

Google consists of three distinct parts, each of which is run on a distributed network of thousands of low-cost computers and can therefore when we enter a query. 1.Carry out fast parallel processing - Parallel processing is a method of computation in which many calculations can be performed simultaneously, significantly speeding up data processing. 2.Googlebot- a web crawler that finds and fetches web pages. The indexer that sorts every word on every page and stores the resulting index of words in a huge database. 3.The query processor, which compares your search query to the index and recommends the documents that it considers most relevant. May 20, 2012 Jamia Hamdard, New Delhi 32
1. The web server sends the query 3. The search results are returned to to the index servers. The content inside the user in a fraction of a second. the index servers is similar to the index 2. The query travels to the in the back of a book--it tells which doc pages contain the words that match servers, which actually any retrieve the particular query term stored documents. Snippets are generated to describe each search result. May 20, 2012 Jamia Hamdard, New Delhi 33 Copyright
Crawling
technology is needed to gather the web documents and keep them up to date. Storage space must be used efficiently to store indices and, optionally, the documents themselves.
Indexing
The indexing system must process hundreds of gigabytes of data efficiently. Queries must be handled quickly, at a rate of hundreds to thousands per second. Google is designed to scale well to extremely large data sets. It makes efficient use of storage space to store the index. Its data structures are optimized for fast and efficient access Further, we expect that the cost to index and store text or HTML will eventually decline relative to the amount that will be available .This will result in favourable scaling properties for centralized systems2012 Google. May 20, like Jamia Hamdard, New Delhi 34
The Google search engine has two important features that help it produce high precision results. First it makes use of the link structure of the Web to calculate a quality ranking for each web page. This ranking is called PageRank. Second Google utilizes link to improve search results.
May 20, 2012
35
PageRank: Bringing Order to the Web The citation (link) graph of the web is an important resource that has largely gone unused in existing web search engines. They have created maps containing as many as 518 million of these hyperlinks These maps allow rapid calculation of a web pages "PageRank", an objective measure of its citation importance that corresponds well with peoples subjective idea of importance Because of this correspondence, PageRank is an excellent way to prioritize the results of web keyword searches For most popular subjects, a simple text matching search that is restricted to web page titles performs admirably when PageRank prioritizes the results For the type of full text searches in the main Google system, PageRank also helps a great deal.
Anchor Text
The text of links is treated in a special way in our search engine. Most search engines associate the text of a link with the page that the link is on. In addition, we associate it with the page the link points to. Advantages: First, anchors often provide more accurate descriptions of web pages than the pages themselves. Second, anchors may exist for documents which cannot be indexed by a text-based search engine, such as images, programs, and databases. This makes it possible to return web pages which have not actually been crawled. Note that pages that have not been crawled can cause problems, since they are never checked for validity before being returned to the user. In this case, the May 20, 2012 search engine can evenJamia Hamdard, New Delhi return a page that never actually existed, but had hyperlinks pointing to it. However, it is possible to sort the
37
Aside from PageRank and the use of anchor text, Google has several other features. First- it has location information for all hits and so it makes extensive use of proximity in search. Second- Google keeps track of some visual presentation details such as font size of words. Words in a larger or bolder font are weighted higher than other words. Third- full raw HTML of pages is available in a repository.
May 20, 2012
38
May 20, 2012
39
The Google Advanced Search is of course applicable to texts, terms, files and so on. In that way is possible to do an advanced search in texts with following terms: Idioms Format file Domains Books Codes
May 20, 2012
40
What is a query? It's a request for information from a search engine. A query consists of one or more words, numbers, or phrases that you hope to find in the search results listings.
May 20, 2012
41
1. Parse the query 2. Convert words into wordIDs 3. Seek to the start of the doclist in the short barrel for every word 4. Scan through the doclists until there is a document that matches all the search terms. 5. Compute the rank of that document for the query. 6. If we are in the short barrels and at the end of any doclist, seek to the start of the doclist in the full barrel for every word and go to step 4. 7. If we are not at the end of any doclist go to step 4. Sort the documents that have matched by rank and return the top k.
May 20, 2012
42
Search within results You can get the same results in one step fewer by simply specifying additional terms to your previous query. On Internet Explorer and on some other browsers, you can double click on a term to highlight it. Then type a new term or hit the DELETE key to remove the term. Triple click in the search box to highlight your entire query. Enter a new query or hit the DELETE key to remove the old query. l Instead of searching for related topics with a single query, divide the query into several parts. Looking for a job? By searching for tips on each aspect, you'll find more sites than by searching for sites that describe all the aspects of a job search
Google Earth is very famous interactive application mapping program powered by satellite and aerial imagery that covers the vast majority of the planet. Google Earth is generally considered to be remarkably accurate and extremely detailed. Many major cities in the planet have such detailed images that one can zoom in close enough to see vehicles and pedestrians clearly. Consequently there have been some concerns about national security implications in despite of the images has been not updated constantly. Google has many others products through the Google Labs not released yet due it are still being tested for use by general public. One good differential on Google Search is regarding to logic engine based on Boolean Logic created by mathematician Britain George Boole. Therefore the Google engine allows finding words, texts and so on using logic values conditioned to: May 20, 2012 Jamia or false 44 The value must be true Hamdard, New Delhi The value must not be true and false at same time
Google Desktop (2) is desktop search software made by Google for Mac OS X, Linux, and Microsoft Windows. The program allows text searches of a user's e-mails, computer files, music, photos, chats, Web pages viewed, and other "Google Gadgets. Google Desktop have the following features:
File indexing: After initially installing Google Desktop, the

software completes an indexing of all the files in the computer And after the initial indexing is completed, the software continues to index files as needed. Users can start searching for files immediately after installing the program. After performing searches, results can also be returned in an Internet browser on the Google Desktop Home Page much like the results for Google Web searches.
May 20, 2012
45
May 20, 2012
46
Sidebar: Screenshot of gadgets. Google Desktop running on Microsoft Windows Vista. A prominent feature of Google Desktop is the Sidebar, which holds several common Gadgets and resides off to one side of the desktop. The Sidebar is available with the Microsoft Windows version of Google Desktop only. The Sidebar comes preinstalled with the following gadgets: Email - a panel which lets one view one's Gmail messages. Scratch Pad - here one can store random notes; they are saved automatically Photos - displays a slideshow of photos from the "My Pictures" folder . News - shows the latest headlines from Google News, and how long ago they were written. The News panel is personalized depending on the type of news you read. Weather - shows the current weather for a location specified by the
Quick Find:
When searching in the sidebar, deskbar or floating deskbar, Google Desktop displays a "Quick Find" window. This window is filled with 6 (by default) of the most relevant results from one's computer. These results update as one types so that one can get to what one wants on one's computer without having to open another browser window.
May 20, 2012
48
Deskbars: Deskbars are boxes which enable one to type in a search query directly from one's desktop. Web results will open in a browser window and selected computer results will be displayed in the "Quick Find" box (see above). A Deskbar can either be a fixed deskbar, which sits in one's Windows Taskbar, or a Floating Deskbar, which one may position anywhere one wants on one's desktop.
May 20, 2012
49
May 20, 2012
50
Overview of - XAMPP
XAMPP Whats the tool?

XAMPP (pronounced as ZAMP) is a small and light Apache distribution containing the most common web development technologies in a single package. Acronym for: X- Read as "cross", meaning cross-platform) A-Apache HTTP Server M-MySQL P-PHP P-Perl
May 20, 2012
52
Features of XAMPP:

Ideal tool for developing and testing applications in PHP & MySQL. Takes less time than installing each of its components separately. Multiple instances of XAMPP can exist on a single computer. Allow website designers and programmers to test their work on their own computers without any access to the Internet XAMPP also provides support for creating and manipulating databases in MySQL and SQLite among others.
May 20, 2012
53
May 20, 2012
54
XAMPP v/s XAMPP Lite
May 20, 2012
55
Demo:

Create a Simple Database using phpMyAdmin. PHP program that connects to a database and retrieves data.
May 20, 2012
56
Android:Connecting to MySQL using PHP in XAMPP
May 20, 2012
57
Overview of Drupal
May 20, 2012
58
What is Drupal?
Open Source software written in php. A CMS or content-management system. A sophisticated web application building tool.
May 20, 2012
What is a CMS?
Simply put, a CMS is a website you build using the website itself.
Wikipedia definition: A content management system (CMS) such as a document management system (DMS) is a computer application used to manage work flow needed to collaboratively create, edit, review, index, search, publish and archive various kinds of digital media and electronic text.[1]
May 20, 2012
What can Drupal be?

blog Forum Online newspaper, Portal / Directory Brocure site, portfolio, flickr like photo drop Social community site, job post board Video site like youtube Project management site CRM, ERP, SCM, Wiki Shopping cart system E-learning, training site Dating site Anything you can think of
May 20, 2012
Why use a CMS?
It helps manage complexity. It provides a user interface (UI) for adding, editing and publishing content.
It provides a means for collaboration among many to perform the above tasks. May 20, 2012 Jamia Hamdard, New Delhi 62
Why use Drupal over Wordpress?
Wordpress was designed only to be a blog with some easy add-ons. Drupal was designed to be more of a generalist: its for making anything and is far more robust. Wordpress could be the better choice for blogs since it is better at being a blog than Drupal. This is something of debate. Wordpress is still a sound choice of CMS for SEO and security; so if wordpress satisfies a simpler projects requirements then by all means use it- it is easier and faster to set up than Drupal. Wordpress is not designed to be highly scalable to many simultaneous users, nor does it have flexible roles, permissions, extensible content types, nor does it have plentiful well-tested, quality add-ons. It has a few and a lot of really poor plugins. Caveat: Trying to force Wordpress to do something it cannot do easily with very popular plug-ins can be worse than suffering the learning curve of Drupal.
May 20, 2012
63
Downsides to the Druup
Drupal has a steeper learning curve than wordpress or Joomla. Drupal and its developers make no excuse for this fact- it is a robust, flexible tool
That said, the drupal community is constantly addressing usability and userexperience issues because they want Maythe industry market share. 20, 2012 Jamia Hamdard, New Delhi 64
What is a UI?
UI is a user-interface, which is a general term for the layout of options, widgets and settings used to configure the system or manage content.
Site-building activities refer to configuring settings or managing content through the UI, such as May 20, 2012 Jamia Hamdard, building navigation New Delhi menus.
65
Drupal Structure
Drupal is a database-driven (dynamic) application. It requires a database. Drupal has a core filesystem whose functionality can be extended using the UI itself, modules and themes. The UI settingsHamdard, New Delhi in the are stored Jamia database.
May 20, 2012
66
Drupal Structure
May 20, 2012
67
Modules
Packages of files in a directory that you upload into drupals module space (/sites/all/modules) Add functionality to drupal Core Modules come shipped with drupal
Contributed Modules are downloads May 20, 2012 Jamia Hamdard, New Delhi from drupal.org
68
Themes
Packages of files in a directory that you upload into drupals theme space (/sites/all/themes) Themes adjust the site layout and style. Like skinning your media player. Themes canJamia Hamdard, New Delhi be easily changed in the69 UI.
May 20, 2012
Drupal Database
Drupals database tracks things like :

Site and Module settings, Users information, Access information, Logging information, Permissions and User Roles, System Paths Content and content metadata
May 20, 2012
Layout and Regions
A Region is an area in a layout, such as a header, footer, content, left/right sidebar into which blocks can be placed and arranged. A block is a box containing some information A node resides only in the content area of the layout (except in special circumstances). Think of the content region as a big node block that allows other blocks in it but the node itself cant move.
May 20, 2012
Blocks
Blocks are added by modules. Blocks can contain views, widgets, menus, nodes (in special circumstances), and panels. Blocks can be moved around through the UI
Jamia Hamdard, New Delhi Blocks can be styled individually. 72
May 20, 2012
Admin Menu
The administrative menu is a part of the UI that allows one to configure Drupals settings. The settings available depend on which modules are installed and enabled. Permissions Jamia Hamdard, New Delhi to have allow users administrative access to module
May 20, 2012
73
Users
All CMSes (wordpress, Joomla, Drupal) have a user login system; users have a username/pw. Drupal also supports the concepts of 1) Roles and 2) Permissions.
Roles are user designations to groups having the same set of permissions. 74 May 20, 2012 Jamia Hamdard, New Delhi
Anonymous User
A (not-logged-in) site visitor is called a guest, visitor or anonymous user. Has a user-id (uid) of 0 (zero).
All anonymous users belong to the anonymous user role (a role ID of 1) and have a setHamdard, New Delhi of permissions May 20, 2012 Jamia 75 assigned to them.
Authenticated User
A user in drupal may belong to one or more roles. Every registered user in Drupal belongs to at least the authenticated user role. Authenticated user role has a role ID of 2
May 20, 2012
Root Admin User
The root user or root admin has the ability to do anything on the site and is a special user. The root user has a user-id (uid) of 1.
The root user does NOT have rolepermissions Jamia Hamdard,because they are to set New Delhi May 20, 2012 effectively gods within Drupal.
77
Thanks
May 20, 2012
78

Amit Presentation Finalv1.1

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Amit Presentation Finalv1.1

Uploaded by

Copyright:

Available Formats

Information Searching using Image-Query

By Amit Marwah B.Tech (IT) 2008-311-006

May 20, 2012

Jamia Hamdard, New Delhi

May 20, 2012

Jamia Hamdard, New Delhi

Feature extractio n Texture Feature extractio n Color Feature extractio n

Feature vector Combinati on

May 20, 2012

Jamia Hamdard, New Delhi

Content Based Image Retrieval

May 20, 2012

Jamia Hamdard, New Delhi

Content Based Image Retrieval

May 20, 2012

Jamia Hamdard, New Delhi

CBIR is desirable because:

May 20, 2012

Jamia Hamdard, New Delhi

Content Based Image Retrieval Techniques

Ways for providing example images to the system:

May 20, 2012

CBIR Content comparison

May 20, 2012

Jamia Hamdard, New Delhi

CBIR A sample search query

May 20, 2012

Jamia Hamdard, New Delhi

Sample CBIR architecture

May 20, 2012

Jamia Hamdard, New Delhi

May 20, 2012

Jamia Hamdard, New Delhi

May 20, 2012

Jamia Hamdard, New Delhi

Segmentation Image Processing

Segmentation Image Processing Method - Edge detection

May 20, 2012

Segmentation Image Processing Method- Clustering Methods

Segmentation Image Processing Methods Region-Filling

May 20, 2012

Jamia Hamdard, New Delhi

Segmentation Image Processing Methods- Split-and-merge methods

May 20, 2012

Segmentation Image Processing Methods-Graph partitioning methods

May 20, 2012

Jamia Hamdard, New Delhi

Segmentation Image Processing Methods-Watershed transformation

May 20, 2012

Jamia Hamdard, New Delhi

Segmentation Image Processing Methods-Model based segmentation

May 20, 2012

Jamia Hamdard, New Delhi

Segmentation Image Processing Methods- Compression-based methods

May 20, 2012

Jamia Hamdard, New Delhi

Segmentation Image Processing Methods - Region-growing methods

Segmentation Image Processing Methods- Histogram-based methods

May 20, 2012

Jamia Hamdard, New Delhi

Segmentation Image Processing Methods- Histogram-based methods

Image Histogram contd

May 20, 2012