The Future of Image Search
Description
There are billions of images on the Internet. Today, searching for a desired image is largely based on textual data such as filename or associated text on the web page; not much use is made of the image content. There are good reasons for this. The field of content-based image retrieval, which emerged during the 1990s, focused primarily on color and texture cues. These were easier to model than shape, but they turned out to be much less useful than originally hoped. I shall review some of the recent developments in the field of visual object recognition in the computer vision community that offer greater promise. Much better image features for characterizing shape, advances in machine learning techniques, and the availability of large amounts of training data lie at the heart of these approaches.
Categories
Top: Computer Science: Computer VisionTop: Computer Science: Search Engines
Top: Computer Science: Image Analysis
| Slides | |
| 0:00 | - Introduction |
| 3:39 | The Future of Image Search |
| 4:35 | The Motivation… |
| 4:54 | Google Image Search --monkey (1) |
| 5:11 | Google Image Search --monkey (2) |
| 5:20 | Google Image Search --monkey (3) |
| 5:54 | Google Image Search --monkey (4) |
| 6:06 | Flickr Search for tag monkey |
| 7:12 | Content based Image Retrieval circa 1990s |
| 8:10 | Color and Texture models |
| 9:16 | The Semantic Gap |
| 11:10 | The Research Program.. |
| 12:00 | From Pixels to Perception |
| 12:50 | Object Category Recognition |
| 13:31 | Modeling shape variation in a category |
| 14:51 | Attneave’s Cat (1954)Line drawings convey most of the information |
| 15:32 | Taxonomy and Partonomy |
| 17:33 | Matching with Exemplars (1) |
| 18:13 | Matching with Exemplars (2) |
| 18:52 | 3D objects using multiple 2D views |
| 18:55 | Matching with Exemplars (2) |
| 18:59 | 3D objects using multiple 2D views |
| 19:32 | Error vs. Number of Views |
| 20:27 | Three Big Ideas |
| 20:42 | Comparing Pointsets |
| 21:33 | Shape Context (1) |
| 22:13 | Shape Context (2) |
| 23:07 | Shape Context (1) |
| 23:45 | Shape Context (2) |
| 23:53 | Geometric Blur (Local Appearance Descriptor) |
| 24:57 | Three Big Ideas |
| 25:01 | Modeling shape variation in a category |
| 25:21 | Matching Example |
| 27:28 | Handwritten Digit Recognition (1) |
| 28:03 | Handwritten Digit Recognition (2) |
| 28:57 | EZ-Gimpy Results |
| 30:40 | Three Big Ideas |
| 31:02 | Discriminative learning (Frome, Singer, Malik, 2006) |
| 31:32 | triplets |
| 32:37 | focal image version |
| 33:57 | large-margin formulation |
| 34:30 | Caltech-101 [Fei-Fei et al. 04] |
| 36:14 | retrieval example |
| 36:30 | Caltech 101 classification results |
| 39:07 | 15 training/class, 63.2% |
| 39:10 | So, what is missing? |
| 40:00 | Face Detection Schneiderman & Kanade (CMU), 2000… |
| 41:34 | Detection: Is this an X? (1) |
| 41:59 | Detection: Is this an X? (2) |
| 44:13 | Detection: Is this an X? (3) |
| 46:29 | Detection: Is this an X? (4) |
| 46:35 | Detection: Is this an X? (5) |
| 46:41 | Support Vector Machines (1) |
| 46:48 | Support Vector Machines (2) |
| 46:51 | Support Vector Machines (3) |
| 46:54 | Support Vector Machines (4) |
| 46:57 | Kernel Support Vector Machines |
| 47:15 | Training Stage |
| 47:39 | Our Multiscale HOG-like feature |
| 47:50 | What is the Intersection Kernel? (1) |
| 49:28 | What is the Intersection Kernel? (2) |
| 50:24 | linear SVM, Kernelized SVM, IKSVM |
| 50:42 | Kernelized SVMs slow to evaluate |
| 50:58 | The Trick (1) |
| 51:34 | The Trick (2) |
| 51:45 | The Trick 2 (1) |
| 51:53 | The Trick 2 (2) |
| 52:15 | Timing Results |
| 52:19 | Distribution of support vector values and hi |
| 52:20 | Best Performance on Pedestrian Detection,Improve on Linear for Many Tasks |
| 52:41 | Classification Errors |
| 52:47 | Results –ETHZ Dataset (1) |
| 52:50 | Results –ETHZ Dataset (2) |
| 52:51 | Other kernels allow similar trick |
| 52:55 | So, what is the future of image search? |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !





