How similarity search is done in multimedia data? Explain.

 Similarity Search in Multimedia Data

Since similarities can be searched either on the data description or the data content of multimedia data. For similarity searching in multimedia data, two main families of multimedia indexing and retrieval systems are considered: 

1. Description-based retrieval systems: The system which builds indices and performs object retrieval based on image descriptions, such as keywords, captions, size, and time of creation; description-based retrieval is labor-intensive if performed manually. If automated, the results are typical of poor quality. For example, the assignment of keywords to images can be a tricky and arbitrary task. The recent development of Web-based image clustering and classification methods has improved the quality of description-based Web image retrieval, because image surrounded text information, as well as Web linkage information, can be used to extract proper description and group images describing a similar theme together. 

2. Content-based retrieval systems: The system which supports retrieval based on the image content, such as color histogram, texture, pattern, image topology, and the shape of objects and their layouts and locations within the image. Content-based retrieval uses visual features to index images and promotes object retrieval based on feature similarity, which is highly desirable in many applications. 

Comments

Popular posts from this blog

What are different steps used in JDBC? Write down a small program showing all steps.

Suppose that a data warehouse for Big-University consists of the following four dimensions: student, course, semester, and instructor, and two measures count and avg_grade. When at the lowest conceptual level (e.g., for a given student, course, semester, and instructor combination), the avg_grade measure stores the actual course grade of the student. At higher conceptual levels, avg_grade stores the average grade for the given combination. a) Draw a snowflake schema diagram for the data warehouse. b) Starting with the base cuboid [student, course, semester, instructor], what specific OLAP operations (e.g., roll-up from semester to year) should one perform in order to list the average grade of CS courses for each BigUniversity student. c) If each dimension has five levels (including all), such as “student < major < status < university < all”, how many cuboids will this cube contain (including the base and apex cuboids)?

Discuss classification or taxonomy of virtualization at different levels.