FACE DETECTION AND LOCALIZATION USING DATASET OF TINY IMAGES

Similar documents
Requesting changes to the grades, please write to me in an with descriptions. Move my office hours to the morning. 11am - 12:30pm Thursdays

Opportunities of Scale

Predictive Indexing for Fast Search

General Principal. Huge Dataset. Images. Info from Most Similar Images. Input Image. Associated Info

Latent Variable Models for Structured Prediction and Content-Based Retrieval

Previous Lecture - Coded aperture photography

A Novel q-parameter Automation in Tsallis Entropy for Image Segmentation

Using the Kolmogorov-Smirnov Test for Image Segmentation

Beyond bags of features: Adding spatial information. Many slides adapted from Fei-Fei Li, Rob Fergus, and Antonio Torralba

Beyond Bags of features Spatial information & Shape models

ECG782: Multidimensional Digital Signal Processing

SCALE INVARIANT TEMPLATE MATCHING

CLSH: Cluster-based Locality-Sensitive Hashing

By Suren Manvelyan,

A Keypoint Descriptor Inspired by Retinal Computation

Data Mining and Data Warehousing Classification-Lazy Learners

Storyline Reconstruction for Unordered Images

A Graph Theoretic Approach to Image Database Retrieval

Handwritten Script Recognition at Block Level

Can Similar Scenes help Surface Layout Estimation?

Olmo S. Zavala Romero. Clustering Hierarchical Distance Group Dist. K-means. Center of Atmospheric Sciences, UNAM.

Apparel Classifier and Recommender using Deep Learning

Fish species recognition from video using SVM classifier

CS5670: Computer Vision

Introduction to object recognition. Slides adapted from Fei-Fei Li, Rob Fergus, Antonio Torralba, and others

An Implementation on Histogram of Oriented Gradients for Human Detection

Large scale object/scene recognition

Evaluation of GIST descriptors for web scale image search

6.819 / 6.869: Advances in Computer Vision

GraphCEP Real-Time Data Analytics Using Parallel Complex Event and Graph Processing

University of Florida CISE department Gator Engineering. Clustering Part 4

Data Mining. 3.5 Lazy Learners (Instance-Based Learners) Fall Instructor: Dr. Masoud Yaghini. Lazy Learners

Label Distribution Learning. Wei Han

EE368 Project Report CD Cover Recognition Using Modified SIFT Algorithm

Clustering Part 4 DBSCAN

Perception IV: Place Recognition, Line Extraction

Learning independent, diverse binary hash functions: pruning and locality

TRIE BASED METHODS FOR STRING SIMILARTIY JOINS

Clustering Billions of Images with Large Scale Nearest Neighbor Search

Bus Detection and recognition for visually impaired people

Large Scale 3D Reconstruction by Structure from Motion

Part 11: Collaborative Filtering. Francesco Ricci

An Unsupervised Approach for Combining Scores of Outlier Detection Techniques, Based on Similarity Measures

Discriminative classifiers for image recognition

Edges and Lines Readings: Chapter 10: better edge detectors line finding circle finding

Detection III: Analyzing and Debugging Detection Methods

Classifying Images with Visual/Textual Cues. By Steven Kappes and Yan Cao

CS664 Lecture #21: SIFT, object recognition, dynamic programming

Object and Action Detection from a Single Example

Classification Algorithms in Data Mining

Improvements in Continuous Variable Simulation with Multiple Point Statistics

Structural and Syntactic Pattern Recognition

Patch-Based Image Classification Using Image Epitomes

Image Composition. COS 526 Princeton University

You are Who You Know and How You Behave: Attribute Inference Attacks via Users Social Friends and Behaviors

An advanced greedy square jigsaw puzzle solver

6. Applications - Text recognition in videos - Semantic video analysis

Ranking Algorithms For Digital Forensic String Search Hits

Document Clustering using Feature Selection Based on Multiviewpoint and Link Similarity Measure

A New Algorithm for Shape Detection

Retrieving images based on a specific place in a living room

COSC160: Detection and Classification. Jeremy Bolton, PhD Assistant Teaching Professor

Learning to Hash with Binary Reconstructive Embeddings

Clustering & Classification (chapter 15)

CAP 6412 Advanced Computer Vision

Object-Based Classification & ecognition. Zutao Ouyang 11/17/2015

Lecturer 2: Spatial Concepts and Data Models

A Systems View of Large- Scale 3D Reconstruction

Modeling and Analyzing 3D Shapes using Clues from 2D Images. Minglun Gong Dept. of CS, Memorial Univ.

Robust PDF Table Locator

Using Support Vector Machines to Eliminate False Minutiae Matches during Fingerprint Verification

Previously. Part-based and local feature models for generic object recognition. Bag-of-words model 4/20/2011

Modeling and Recognition of Landmark Image Collections Using Iconic Scene Graphs

Machine Learning. Nonparametric methods for Classification. Eric Xing , Fall Lecture 2, September 12, 2016

Lecture 12 Recognition

A Feature based on Encoding the Relative Position of a Point in the Character for Online Handwritten Character Recognition

Prototype Selection for Handwritten Connected Digits Classification

Contour-Based Large Scale Image Retrieval

Extra: B+ Trees. Motivations. Differences between BST and B+ 10/27/2017. CS1: Java Programming Colorado State University

Robot localization method based on visual features and their geometric relationship

3. Working Implementation of Search Engine 3.1 Working Of Search Engine:

Computer Vision. Recap: Smoothing with a Gaussian. Recap: Effect of σ on derivatives. Computer Science Tripos Part II. Dr Christopher Town

Supervised Hashing for Image Retrieval via Image Representation Learning

CHAPTER VII INDEXED K TWIN NEIGHBOUR CLUSTERING ALGORITHM 7.1 INTRODUCTION

Text-Tracking Wearable Camera System for the Blind

Does the Brain do Inverse Graphics?

A Comparison of Still-Image Compression Standards Using Different Image Quality Metrics and Proposed Methods for Improving Lossy Image Quality

A New Feature Local Binary Patterns (FLBP) Method

Learning to Recognize Faces in Realistic Conditions

An Efficient Approach for Color Pattern Matching Using Image Mining

Case-Based Reasoning. CS 188: Artificial Intelligence Fall Nearest-Neighbor Classification. Parametric / Non-parametric.

CS 188: Artificial Intelligence Fall 2008

COMBINING NEURAL NETWORKS FOR SKIN DETECTION

Background Subtraction in Video using Bayesian Learning with Motion Information Suman K. Mitra DA-IICT, Gandhinagar

Face Detection on Similar Color Photographs

CHAPTER 1 INTRODUCTION

Classification of Hand-Written Numeric Digits

Applying Supervised Learning

CS6670: Computer Vision

LOCAL AND GLOBAL DESCRIPTORS FOR PLACE RECOGNITION IN ROBOTICS

Transcription:

FACE DETECTION AND LOCALIZATION USING DATASET OF TINY IMAGES Swathi Polamraju and Sricharan Ramagiri Department of Electrical and Computer Engineering Clemson University ABSTRACT: Being motivated by the fact that there are billions of images available to represent the world visually, we took up this project starting off with a small subset of images. This project deals with the process of face detection and localization making use of the dataset with tiny images. There are many algorithms available for face detection, of which most of the algorithms focus on developing a parametric method of recognition. This project, in contrast to the above algorithms focuses on developing a non-parametric method of face recognition. The data itself helps in solving the problem of recognition. The technical methods used in this paper are very simple and at the same time perform an effective search for the process of detection and localizing the face. INTRODUCTION: All the methods in object recognition have two components: the model and the data. Vast majority of the current research has been into the modeling part where in parametric methods for recognition are being developed. The research by Torralba etc. moves in the opposite direction, exploring how data itself can help to solve the problem. The main aim of the project is to show that face detection and localization can be performed with the non-parametric measures in a much simple way, provided a large dataset of images is available. When many images are available, simple indexing techniques can be used to retrieve images with object arrangements to the query image. For this purpose, they have created a database of 79 million 32x32 color images. Each of these images has been labeled with one of the several nonabstract nouns in English. That means all the images come under some category or the other like face, person, tree etc., it becomes very easy to find images visually close to the query image, containing images with similar objects in similar spatial configurations. There are many applications for this large dataset: Object detection, object localization, image colorization of gray scale images and detecting image orientations:

METHODOLOGY: The main aim of this project is to implement face detection and localization using this database of tiny images. Face detection: The main goal here is to detect whether an image has a face or not. Since the database has images which contain people, we use it to detect the face. Even though the size and orientation may vary considerably, this algorithm can successfully detect the faces. For this purpose we collect votes from all the nearest neighbors. Since these are already labeled, we know the category of images which get maximum number of votes. Thus if these belong to face, we know that our query image also contains a face. We use a small subset of images from the 79 million dataset. When the person size is large, the performance is significantly better than when it is small as the picture becomes more constrained and detection becomes easier. Face localization: Once the face has been detected in the image, we now have to locate its position. For this the segmented image is used and the best scoring segments gives the location. Basic steps that were followed are: 1. Input the query image. 2. Segment the image using Split and Merge Segmentation. 3. Search for a best match for each of the segments in the query image with tiny images in database. 4. A match corresponds to the segment with least dissimilarity with the given image in dataset. 5. Increment the score for a particular dataset every time a match is found. 6. Detect the face by using dataset with highest score (one with the maximum number of matches). 7. Locate the position of face in input image based on the properties of selected segment. Detailed Algorithm is as follows: 1. Load the input image. 2. Apply Split and Merge segmentation to obtain all the segments present in the input image. 3. Compute region properties for all the obtained segments and thus obtain area for each segment. 4. Impose area constraint and eliminate all the insignificant segments from the segmented image. 5. Call CompareSegments function. 6. Load all the images present in the dataset. 7. Resample each of the segments to a fixed size (usually equal to the images in dataset 32x32). 8. Compare all the segments with each of the tiny images in the

dataset by computing the Sum Of Absolute differences. 9. Select the segments with minimum dissimilarity i.e., which gives the minimum SAD. EXPERIMENTAL RESULTS: Input Gray Image 10. Assign a score (to dataset) for each of the matches between the segments and the dataset. 11. Detect the face based on the highest score obtained corresponding to the tiny images present in the dataset. Segmented Image 12. Face localization: Once the face is detected, face is recognized using the region properties. 32x32 images in dataset Extracted Segment Extracted Binary Image

Final Image with face detected and localized MORE RESULTS CONCLUSION: We observe that the implemented method for face detection and localization is quite successful given a dataset of images. Actually we have taken a subset of the available database. If the number of images in the dataset increases, the

probability of getting better results increases. As we have observed from our experiments the threshold values chosen also affect the output considerably. Although initially 32x32 seemed to be very small size for detection, it gave decent results showing that, object and scene recognition can be reliably performed for images of size 32x32. Another advantage of this method is that simple dissimilarity measures can be used for effective detection and localization. Thus simple non-parametric methods combined with a dataset of images can be used for face detection and recognition purposes. Using better metrics may improve the performance. (IEEE Computer vision and pattern recognition June 2008) http://people.csail.mit.edu/torralba/publicat ions/nipsrecognitionbyscenealignment.p df 4. http://people.csail.mit.edu/torralba/publicat ions/cvpr2008.pdf One of the main limitations of this method is the large amount of training data needed. Better similarity metrics also might significantly improve the performance. REFERENCES: 1. Antonio Torralba, Rob Fergus, and William T. Freeman: 80 million tiny images: a large dataset for non-parametric object and scene recognition (IEEE transactions on pattern analysis and machine intelligence) Vol 30, No. 11, November 2008. 2. Database: http://people.csail.mit.edu/torralba/tinyima ges/ 3. A. Torralba, R. Fergus, Y. Weiss small codes and large databases for recognition