Distributed Framework for Automatic Facial Mark Detection Graduate Operating Systems-CSE60641 Nisha Srinivas and Tao Xu Department of Computer Science.

Slides:



Advertisements
Similar presentations
Patient information extraction in digitized X-ray imagery Hsien-Huang P. Wu Department of Electrical Engineering, National Yunlin University of Science.
Advertisements

Preliminary Assessment of Discrimination of Twins in Photographs based on Facial Blemishes Nisha Srinivas 1, Matthew Pruitt 1, Gaurav Aggarwal 1, Patrick.
BXGrid: A Data Repository and Computing Grid for Biometrics Research Hoang Bui University of Notre Dame 1.
Natasha Pavlovikj, Kevin Begcy, Sairam Behera, Malachy Campbell, Harkamal Walia, Jitender S.Deogun University of Nebraska-Lincoln Evaluating Distributed.
Scaling Distributed Machine Learning with the BASED ON THE PAPER AND PRESENTATION: SCALING DISTRIBUTED MACHINE LEARNING WITH THE PARAMETER SERVER – GOOGLE,
Cooperative Computing for Data Intensive Science Douglas Thain University of Notre Dame NSF Bridges to Engineering 2020 Conference 12 March 2008.
An Introduction to Grid Computing Research at Notre Dame Prof. Douglas Thain University of Notre Dame
Introduction to Makeflow Li Yu University of Notre Dame 1.
Smart Traveller with Visual Translator for OCR and Face Recognition LYU0203 FYP.
High Throughput Computing with Condor at Notre Dame Douglas Thain 30 April 2009.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
Building Scalable Scientific Applications using Makeflow Dinesh Rajan and Peter Sempolinski University of Notre Dame.
Introduction to Makeflow and Work Queue CSE – Cloud Computing – Fall 2014 Prof. Douglas Thain.
Wang, Z., et al. Presented by: Kayla Henneman October 27, 2014 WHO IS HERE: LOCATION AWARE FACE RECOGNITION.
Face Alignment Using Cascaded Boosted Regression Active Shape Models
Authors: Weiwei Chen, Ewa Deelman 9th International Conference on Parallel Processing and Applied Mathmatics 1.
Introduction to Parallel Programming MapReduce Except where otherwise noted all portions of this work are Copyright (c) 2007 Google and are licensed under.
Performance Evaluation of Hybrid MPI/OpenMP Implementation of a Lattice Boltzmann Application on Multicore Systems Department of Computer Science and Engineering,
Track 1: Cluster and Grid Computing NBCR Summer Institute Session 2.2: Cluster and Grid Computing: Case studies Condor introduction August 9, 2006 Nadya.
Lecture 3 – Parallel Performance Theory - 1 Parallel Performance Theory - 1 Parallel Computing CIS 410/510 Department of Computer and Information Science.
Work Stealing and Persistence-based Load Balancers for Iterative Overdecomposed Applications Jonathan Lifflander, UIUC Sriram Krishnamoorthy, PNNL* Laxmikant.
Department of Computer Science, Graduate School of Information Science and Technology, Osaka University DCCFinder: A Very- Large Scale Code Clone Analysis.
Zois Vasileios Α. Μ :4183 University of Patras Department of Computer Engineering & Informatics Diploma Thesis.
A Metadata Based Approach For Supporting Subsetting Queries Over Parallel HDF5 Datasets Vignesh Santhanagopalan Graduate Student Department Of CSE.
Cluster-based SNP Calling on Large Scale Genome Sequencing Data Mucahid KutluGagan Agrawal Department of Computer Science and Engineering The Ohio State.
Ohio State University Department of Computer Science and Engineering 1 Cyberinfrastructure for Coastal Forecasting and Change Analysis Gagan Agrawal Hakan.
High Throughput Computing on P2P Networks Carlos Pérez Miguel
Storage and Retrieval of Large RDF Graph Using Hadoop and MapReduce Mohammad Farhan Husain, Pankil Doshi, Latifur Khan, Bhavani Thuraisingham University.
Independent Component Analysis (ICA) A parallel approach.
1 A Framework for Data-Intensive Computing with Cloud Bursting Tekin Bicer David ChiuGagan Agrawal Department of Compute Science and Engineering The Ohio.
A Framework for Elastic Execution of Existing MPI Programs Aarthi Raveendran Graduate Student Department Of CSE 1.
Building Scalable Scientific Applications using Makeflow Dinesh Rajan and Douglas Thain University of Notre Dame.
The Owner Share scheduler for a distributed system 2009 International Conference on Parallel Processing Workshops Reporter: 李長霖.
NGS Innovation Forum, Manchester4 th November 2008 Condor and the NGS John Kewley NGS Support Centre Manager.
VIPIN VIJAYAN 11/11/03 A Performance Analysis of Two Distributed Computing Abstractions.
Job scheduling algorithm based on Berger model in cloud environment Advances in Engineering Software (2011) Baomin Xu,Chunyan Zhao,Enzhao Hua,Bin Hu 2013/1/251.
FATCOP: A Mixed Integer Program Solver Michael FerrisQun Chen Department of Computer Sciences University of Wisconsin-Madison Jeff Linderoth, Argonne.
DynamicMR: A Dynamic Slot Allocation Optimization Framework for MapReduce Clusters Nanyang Technological University Shanjiang Tang, Bu-Sung Lee, Bingsheng.
LogTree: A Framework for Generating System Events from Raw Textual Logs Liang Tang and Tao Li School of Computing and Information Sciences Florida International.
Dzmitry Kliazovich University of Luxembourg, Luxembourg
Scalable and Coordinated Scheduling for Cloud-Scale computing
Computation Time Analysis - Climate Reanalysis Data Dipanwita Dasgupta University of Notre Dame Graduate Operating Systems.
Computer Systems Lab TJHSST Senior Research Project Browser Based Distributed Computing Siggi Simonarson.
Learning Photographic Global Tonal Adjustment with a Database of Input / Output Image Pairs.
June 12, 2016CITALA'121 Cloud Computing Technology For Large Scale and Efficient Arabic Handwriting Recognition System HAMDI Hassen, KHEMAKHEM Maher
Department of Computer Science, Johns Hopkins University Pregel: BSP and Message Passing for Graph Computations EN Randal Burns 14 November 2013.
Introduction to Makeflow and Work Queue Nicholas Hazekamp and Ben Tovar University of Notre Dame XSEDE 15.
1 Munther Abualkibash University of Bridgeport, CT.
Accelerating K-Means Clustering with Parallel Implementations and GPU Computing Janki Bhimani Miriam Leeser Ningfang Mi
EpiC: an Extensible and Scalable System for Processing Big Data Dawei Jiang, Gang Chen, Beng Chin Ooi, Kian Lee Tan, Sai Wu School of Computing, National.
Experience Report: System Log Analysis for Anomaly Detection
Fundamental Operations Scalability and Speedup
Condor DAGMan: Managing Job Dependencies with Condor
Distributed Network Traffic Feature Extraction for a Real-time IDS
Condor – A Hunter of Idle Workstation
Scaling Up Scientific Workflows with Makeflow
Submitted by: Ala Berawi Sujod Makhlof Samah Hanani Supervisor:
Supporting Fault-Tolerance in Streaming Grid Applications
Dieudo Mulamba November 2017
Introduction to Makeflow and Work Queue
Cheng-Ming Huang, Wen-Hung Liao Department of Computer Science
Weaving Abstractions into Workflows
Introduction to Makeflow and Work Queue
Ch 4. The Evolution of Analytic Scalability
Basic Grid Projects – Condor (Part I)
BXGrid: A Data Repository and Computing Grid for Biometrics Research
What’s New in Work Queue
Resource Allocation for Distributed Streaming Applications
FREERIDE: A Framework for Rapid Implementation of Datamining Engines
2019/9/14 The Deep Learning Vision for Heterogeneous Network Traffic Control Proposal, Challenges, and Future Perspective Author: Nei Kato, Zubair Md.
Presentation transcript:

Distributed Framework for Automatic Facial Mark Detection Graduate Operating Systems-CSE60641 Nisha Srinivas and Tao Xu Department of Computer Science and Engineering nsriniva, 1

Introduction What is Biometrics? – Face, iris, fingerprint etc. – Face is a popular biometric Non-invasive – Identical twins have a high degree of facial similarity. Fine details on the face like facial marks are used to distinguish between identical twins. – Automatic facial mark detector: detects facial marks and extracts facial mark features. Different type of Biometric. 2

Automatic Facial Mark Detector Convert Images Face Contour Points Crop face Images Detect facial marks Independent of results from other images 3

Objective Drawbacks of the Automatic Facial Mark Detector – Slow Size of the dataset Size of each image in the dataset Run time of algorithms is long Executing it sequentially Objective: – To design a distributed framework for the automatic facial mark detector. To improve computation time To obtain scalability 4

Sequential Execution Execution Time: T e =Nt p t p = time to execute facial mark detector for a single image N= Number of Images 5 Conversion Contour Points Cropping FM Detections Input Image

Proposed Approach : Distributed Framework Conversion Contour Points Cropping FM Detections Machine 1 Machine n Machine 2 Execution Time: T e = t p t p = time to execute facial mark detector for a single image 6

Implementation – Combination of Makeflow, Worker Queue, Condor Condor is a distributed environment which makes use of idle resources on remote computers. Work Queue is a fault tolerant framework. – Master/Worker framework. – Manages Condor Makeflow – Distributed computing abstraction – Runs computations on WQ – The computations have dependencies that are represented by directed acyclic graph (DAG). 7

Flow Diagram 8

Performance Metrics We evaluate the performance of the distributed framework by computing the following metrics – Total execution time – Node Efficiency – Scalability Weak scaling: Number of jobs proportional to number of images in dataset. Strong scaling: Number of jobs is varied by keeping the number of images in the dataset a constant. 9

Dataset and System Specifications Twin face images were collected at the Twins Days Festival in Twinsburg, Ohio in August High Resolution Images: 4310 rows x 2868 columns Total Number of Images: 800 – Dataset size based on attributes: [ ] Notre Dame Condor Pool: ~(700 cores) 10

Notre Dame Condor Pool MachineArchOpSysMachineOwnerMachineGroupStateLoadAvgMemory ccl00.cse.nd.eduINTELLINUXdthaincclUnclaimed ccl00.cse.nd.eduINTELLINUXdthaincclUnclaimed ccl01.cse.nd.eduINTELLINUXdthaincclUnclaimed ccl01.cse.nd.eduINTELLINUXdthaincclUnclaimed ccl 8x1 cclsun 16x2 loco 32x2 sc0 32x2 netscale 16x2 cvrl 32x2 iss 44x2 compbio 1x8 netscale 1x32 Fitzpatrick 130 CSE 170 CHEG 25 EE 10 Nieu 20 DeBart 10 MPI HadoopBiometrics Storage Research Network Research Network Research Timeshared Collaboration Personal Workstations Storage Research Batch Capacity green house Makeflow was executed on cvrl.cse.nd.edu Intel(R) Xeon(R) CPU 2.66GHz

Experiments 12 Experiment 1 – Comparison of total execution time between the distributed framework and sequential framework. – Submit N jobs to Condor by keeping the dataset constant. – Number of jobs workers for distributed framework= {10,50, 100, 150, 200} – Dataset Size= 206 – Executed on the Notre Dame Condor Pool.

Experiment 2 – To evaluate node efficiency – Analyze the time taken for a single job to complete on a machine in the Notre Dame Condor Pool. Experiment 3 – To evaluate scalability of the AFMD Weak scaling: Number of jobs proportional to number of images in dataset. Strong scaling: Number of jobs is varied by keeping the number of images in the dataset a constant. 13

Experiment 1: Results 14 Number of Workers Time (secs)

15 Experiment 2: Results Machine Names Number of Workers Time (secs) Number of jobs executed per machine

Experiment 3:Weak Scaling 16 Time (secs) Number of Workers

Conclusion Designed and implemented a distributed framework for a Automatic facial mark detector. It was implemented using Makeflow, Work Queue and Condor. Performance of the distributed framework is significantly better. 17