Recognizing hand-drawn images using shape context Gyozo Gidofalvi Computer Science and Engineering Department University of California, San Diego

Slides:



Advertisements
Similar presentations
Shape Context and Chamfer Matching in Cluttered Scenes
Advertisements

Object Recognition Using Locality-Sensitive Hashing of Shape Contexts Andrea Frome, Jitendra Malik Presented by Ilias Apostolopoulos.
Distinctive Image Features from Scale-Invariant Keypoints David Lowe.
Object Recognition from Local Scale-Invariant Features David G. Lowe Presented by Ashley L. Kapron.
Relevance Feedback and User Interaction for CBIR Hai Le Supervisor: Dr. Sid Ray.
Image classification Given the bag-of-features representations of images from different classes, how do we learn a model for distinguishing them?
Three things everyone should know to improve object retrieval
Presented by Xinyu Chang
RGB-D object recognition and localization with clutter and occlusions Federico Tombari, Samuele Salti, Luigi Di Stefano Computer Vision Lab – University.
BRISK (Presented by Josh Gleason)
Computational Biology, Part 23 Biological Imaging II Robert F. Murphy Copyright  1996, 1999, All rights reserved.
Similarity Search on Bregman Divergence, Towards Non- Metric Indexing Zhenjie Zhang, Beng Chi Ooi, Srinivasan Parthasarathy, Anthony K. H. Tung.
Computer Vision Lecture 18: Object Recognition II
VisualRank: Applying PageRank to Large-Scale Image Search Yushi Jing, Member, IEEE, and Shumeet Baluja, Member, IEEE.
MIT CSAIL Vision interfaces Towards efficient matching with random hashing methods… Kristen Grauman Gregory Shakhnarovich Trevor Darrell.
Efficiently searching for similar images (Kristen Grauman)
Carolina Galleguillos, Brian McFee, Serge Belongie, Gert Lanckriet Computer Science and Engineering Department Electrical and Computer Engineering Department.
Mining Distance-Based Outliers in Near Linear Time with Randomization and a Simple Pruning Rule Stephen D. Bay 1 and Mark Schwabacher 2 1 Institute for.
Audio Meets Image Retrieval Techniques Dave Kauchak Department of Computer Science University of California, San Diego
A NOVEL LOCAL FEATURE DESCRIPTOR FOR IMAGE MATCHING Heng Yang, Qing Wang ICME 2008.
Person Re-Identification Application for Android
Activity Recognition Aneeq Zia. Agenda What is activity recognition Typical methods used for action recognition “Evaluation of local spatio-temporal features.
Indexing the imprecise positions of moving objects Xiaofeng Ding and Yansheng Lu Department of Computer Science Huazhong University of Science & Technology.
Computer Vision Group University of California Berkeley Shape Matching and Object Recognition using Shape Contexts Jitendra Malik U.C. Berkeley (joint.
Fast High-Dimensional Feature Matching for Object Recognition David Lowe Computer Science Department University of British Columbia.
Event prediction CS 590v. Applications Video search Surveillance – Detecting suspicious activities – Illegally parked cars – Abandoned bags Intelligent.
Small Codes and Large Image Databases for Recognition CVPR 2008 Antonio Torralba, MIT Rob Fergus, NYU Yair Weiss, Hebrew University.
A Study of Approaches for Object Recognition
Explorations in Image Partition Encoding Sameer Agarwal Department of Computer Science and Engineering University of California, San Diego.
CS335 Principles of Multimedia Systems Content Based Media Retrieval Hao Jiang Computer Science Department Boston College Dec. 4, 2007.
Robust Real-time Object Detection by Paul Viola and Michael Jones ICCV 2001 Workshop on Statistical and Computation Theories of Vision Presentation by.
1 Diffusion Distance for Histogram Comparison, CVPR06. Haibin Ling, Kazunori Okada Group Meeting Presented by Wyman 3/14/2006.
Computer Vision Group University of California Berkeley Recognizing Objects in Adversarial Clutter: Breaking a Visual CAPTCHA Greg Mori and Jitendra Malik.
J Cheng et al,. CVPR14 Hyunchul Yang( 양현철 )
Shape Classification Using the Inner-Distance Haibin Ling David W. Jacobs IEEE TRANSACTION ON PATTERN ANAYSIS AND MACHINE INTELLIGENCE FEBRUARY 2007.
A String Matching Approach for Visual Retrieval and Classification Mei-Chen Yeh* and Kwang-Ting Cheng Learning-Based Multimedia Lab Department of Electrical.
IIIT Hyderabad Atif Iqbal and Anoop Namboodiri Cascaded.
Large-Scale Content-Based Image Retrieval Project Presentation CMPT 880: Large Scale Multimedia Systems and Cloud Computing Under supervision of Dr. Mohamed.
Entropy and some applications in image processing Neucimar J. Leite Institute of Computing
Distinctive Image Features from Scale-Invariant Keypoints By David G. Lowe, University of British Columbia Presented by: Tim Havinga, Joël van Neerbos.
What Is the Most Efficient Way to Select Nearest Neighbor Candidates for Fast Approximate Nearest Neighbor Search? Masakazu Iwamura, Tomokazu Sato and.
Computer vision.
Efficient Editing of Aged Object Textures By: Olivier Clément Jocelyn Benoit Eric Paquette Multimedia Lab.
Shape Matching for Model Alignment 3D Scan Matching and Registration, Part I ICCV 2005 Short Course Michael Kazhdan Johns Hopkins University.
Chapter 9.  Mathematical morphology: ◦ A useful tool for extracting image components in the representation of region shape.  Boundaries, skeletons,
Copyright Protection of Images Based on Large-Scale Image Recognition Koichi Kise, Satoshi Yokota, Akira Shiozaki Osaka Prefecture University.
PMLAB Finding Similar Image Quickly Using Object Shapes Heng Tao Shen Dept. of Computer Science National University of Singapore Presented by Chin-Yi Tsai.
Nearest Neighbor Paul Hsiung March 16, Quick Review of NN Set of points P Query point q Distance metric d Find p in P such that d(p,q) < d(p’,q)
80 million tiny images: a large dataset for non-parametric object and scene recognition CS 4763 Multimedia Systems Spring 2008.
Beyond Sliding Windows: Object Localization by Efficient Subwindow Search The best paper prize at CVPR 2008.
Haibin Ling and David Jacobs, Deformation Invariant Image Matching, ICCV, Oct. 20, 2005 Deformation Invariant Image Matching Haibin Ling and David W. Jacobs.
Dengsheng Zhang and Melissa Chen Yi Lim
INTERACTIVELY BROWSING LARGE IMAGE DATABASES Ronald Richter, Mathias Eitz and Marc Alexa.
Paired Sampling in Density-Sensitive Active Learning Pinar Donmez joint work with Jaime G. Carbonell Language Technologies Institute School of Computer.
Project by: Cirill Aizenberg, Dima Altshuler Supervisor: Erez Berkovich.
By Pushpita Biswas Under the guidance of Prof. S.Mukhopadhyay and Prof. P.K.Biswas.
Geometry Synthesis Ares Lagae Olivier Dumont Philip Dutré Department of Computer Science Katholieke Universiteit Leuven 10 August, 2004.
Scale Invariant Feature Transform (SIFT)
Computer Vision Group Department of Computer Science University of Illinois at Urbana-Champaign.
Similarity Measurement and Detection of Video Sequences Chu-Hong HOI Supervisor: Prof. Michael R. LYU Marker: Prof. Yiu Sang MOON 25 April, 2003 Dept.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching.
Another Example: Circle Detection
Slope and Curvature Density Functions
Paper Presentation: Shape and Matching
Cheng-Ming Huang, Wen-Hung Liao Department of Computer Science
Rob Fergus Computer Vision
Scale-Space Representation of 3D Models and Topological Matching
Dennis Zhao,1 Dragomir Radev PhD1 LILY Lab
The Image The pixels in the image The mask The resulting image 255 X
Presented by Xu Miao April 20, 2005
Presentation transcript:

Recognizing hand-drawn images using shape context Gyozo Gidofalvi Computer Science and Engineering Department University of California, San Diego November 29, 2001

Shape Context by Mori et al. Key idea: represent an image in terms of descriptors at certain locations that describe the image relative to those locations Shape context of a point is the histogram of the relative positions of all other points in the image. Use bins that are uniform in log-polar space to emphasize close-by, local structure.

Representative shape context: efficient retrieval of similar shapes by Mori et al. Matching: Given two images, represented as n shape context descriptors, we want to find a one-to-one assignment of these descriptors, such that the X 2 distance for the assignment is minimized  O(n 3 ) algorithm. Fast Pruning: 1.Represent the query image by a small number of shape context descriptors 2.To calculate the cost of a match between the query image and an image in a DB perform nearest neighbors search 3.Return a short list of the fist K best matches

Hand drawn images Mori et al. tested the representative shape context method on the Snodgrass and Vanderwart line drawings. Queries were distorted versions the original images. We gathered 6 sets of samples for these line drawings and used them as queries. All images were cropped and scaled to 500 by 500 pixels.

Performance on on hand-drawn images Results of 300 queries for varying length of short list returned Pruning factor = ( number of images in DB ) / ( length of the short list )

Sampling shape context Can we improve performance? Shape context of which points should represent and image? Pixel-density based sampling: Promote points with higher or lower densities? spread outpromote higher densitypromote lower density

Density-based sampling results promoting points with higher pixel-densities promoting points with lower pixel-densities

Finding embedded objects Task: Given a query image that may contain some clutter around an hand-drawn object find objects from the DB that are most similar to it. How does the presence of clutter affect the recognition of the hand-drawn object? To obtain images for embedded objects we find the outline of the object, construct a binary mask for it, and using logical operations (AND  OR) we copy the clutter around the object. Finding the outline of objects is done using a method similar to flood-fill.

Embedding objects into some clutter

Acknowledgments Thanks to Mori at al. for providing me with source code for the shape context matching. Thanks to Serge for guidance, ideas. Special thanks to my Dad, my brother, and Hector for drawing me sample objects.