Analysis and Implementation of Automatic Reassembly of File Fragmented Images Using Greedy Algorithms. By Lucas Shinkovich and Nate Jones
|
|
- Ruby Perry
- 6 years ago
- Views:
Transcription
1 Analysis and Implementation of Automatic Reassembly of File Fragmented Images Using Greedy Algorithms By Lucas Shinkovich and Nate Jones
2 Outline Introduction & Problem Method Algorithms Problems & Limitations Experimental implementation Future work
3 Introduction & Problem Files tend to get fragmented (stored in discontinuous blocks) on a regular basis. This is usually caused by files that are too large for one block or a block is deleted and reused by a larger/smaller file. Problem: Reassemble the fragmented blocks (image data only) without any prior knowledge of their original ordering. Assume: No missing or corrupted blocks.
4 Method Put fragments together based on a candidate weight value. Generalize to a graph problem of finding k vertex disjoint paths in a complete graph (NP-complete). Problem is a lot simpler because we know the first fragment (header) and the first fragment contains valuable information such as image Resolution, which we can use to obtain how many fragments it contains. Assume: Each fragment is at least width size, so we only need to compare from top and bottom. Find concatenation of fragments that minimizes or maximizes the candidate weight values to obtain the original image. Three types of candidate weight values: Pixel Matching (PM), Sum of Differences (SoD), and Median Edge Detection (MED).
5 Algorithms Eight different reconstruction algorithms based on vertex/non-vertex disjoint paths, done in parallel or serial and according to the heuristic (greedy or enhanced greedy). Greedy Heuristic: Start with header fragment hi, reconstruct the image by choosing the best available fragment t (based on candidate weight value). Add t to the reconstructed image path and repeat the process until the image is reconstructed. Time: O(nlogn)
6 Algorithms (cont.) 1) Greedy sequential unique path (SUP): Uses the greedy heuristic to assemble fragments and creates vertex disjoint paths (i.e. a fragment can only be used once). Problems: Dependent on the order of images being processed. 2) Greedy non-unique path (NUP): Uses the greedy heuristic to assemble fragments and creates non-vertex paths (i.e. a fragment may be used an infinite number of times).
7 Algorithms (cont.)
8 Algorithms (cont.) 3) Greedy parallel unique path (PUP): Start with all of the image headers and choose the best match for each header. We then pick the best header-fragment pair out of all the header-fragment best matches. 4) Greedy shortest path first (SPF UP): Attempts to gain the benefits of the NUP algorithms while being an UP algorithm. Assumes that the best reconstructed image is the one with the lowest average path cost. Runs the greedy NUP across all of the images and computes their total cost (sum of candidate weight values). The total cost divided by the number of fragments is the average path cost. We remove the image with the lowest average path cost and then run the algorithm again until we have obtained all of the images.
9 Algorithms (cont.) All of the algorithms mentioned (1-4) have a total running time of O(n2logn). Enhanced Greedy Heuristic: Same as greedy heuristic except before we choose the best fragment match hi and t we first check to see if t is a better match for another fragment. Algorithms 5-8 are the same as the previous ones discussed except they used the enhanced greedy algorithm.
10 Problems & Limitations Assumptions are not realistic. Assumption: Each fragment is at least width size This is not always the case. Example: Take a 512x512 image, this is 512X512X bytes = 786,486 bytes. We now divide that into 4096 bytes (cluster size) and get We have a fragment left over that is of size 54 bytes and the width of the image is 512X3 = 1536 bytes. How do we calculate candidate weights with different width sizes? A similar type of problem arises when the image width is larger then the cluster size. In this case, we can no longer compare fragments by just the top and bottom.
11 Problems & Limitations (cont.) Assumption: No fragments are corrupt or missing. Not realistic, if you have lost the file allocation table then you have most likely lost some data along with it. Missing regular fragments will only cause minor problems in some algorithms, but missing a header fragment will make that image s reconstruction impossible. This is because we will be missing vital header information such as the width of the image (we need this to calculate candidate weight values). Partial Solution: Major problem is finding out what fragment(s) are missing for what image(s). If we can solve this problem, we might be able to do some type of interpolation for the missing fragment especially if its at the end of the image.
12 Problems & Limitations (cont.) Assumption: Access to raw pixel data. (not clearly stated in paper) Need access to raw pixel data to get correct candidate weight values. Compressed image formats such as JPEG need to be decoded before we have access to the pixel data. Due to the fact that we might not have access to all of the 8x8 blocks in one fragment we will not be able to successfully do inverse DCT to access the pixel data. New ideas in research, such as image encryption will also have the same problem.
13 Problems & Limitations (cont.) Problems with the algorithm itself: Greedy algorithm without proof of greedy property or optimal substructure. Greedy choice does not always find shortest path (Dijkstra s algorithm). Not very efficient, lot of sorting and tree allocation (linear sort?). What do we do with two fragments with the same candidate weight values?
14 E x p er i m en tal I m p l em en tati o n
15 E x p er i m en tal I m p l em en tati o n (C o n t'd ) W ri tten i n C # D el egat es al l o w ed u s t o easi l y p l u g i n d i f f er en t w ei gh t f u n c t i o n s, c o m p ar at o r s, et c. W e w er e b o t h f am i l i ar w i t h C #. T h e G U I w as i m p o rtan t b ecau se i t al l o w s u s to q u i ck l y an d easi l y p u t to geth er n ew ex p eri m en ts w i th n ew i m age sets an d n ew p aram eters. W e set u p o u r E x p eri m en tal i m p l em en tati o n o f th ei r ex p eri m en t to b e a p l ace to easi l y test f u tu re w o rk o n th e su b j ect.
16 F r ag m en t.c s
17 R eassem b l ee x p er i m en t.c s
18 R ep o r ti n g R esu l ts G rap h o f A v erage C o l o r I n ten si ty S i n ce C o l o r I n ten si ty i s a M aj o r F acto r i n F ragm en t W ei gh ts S h o w h o w si m i l ar an I m age i s D o esn 't w o rk as w el l f o r sm al l i m ages R ed O ri gi n al I m age B l u e R eco n stru cti o n G reen D i f f eren ce
19 R esu l ts 51 2x 266
20 R esu l ts R ec o n str u c ti o n S O D
21 R esu l ts R ec o n str u c ti o n P M A
22 R esu l ts R ec o n str u c ti o n M ED
23 R esu l ts B i g I m ag e
24 R esu l ts B i g I m ag e S O D
25 Jer u sal em T o w er C o l o r S h i f ti n g
26 Jer u sal em T o w er P M A
27 Jer u sal em T o w er - M E D
28 F u tu r e W o r k G rap h th e can d i d ate w ei gh t v al u es S ee i f sp i k es i n t h e gr ap h c o r r esp o n d t o p r o b l em s i n t h e r esu l t an t i m age. C an t h i s h el p u s t o f i n d w h er e t h e al go r i t h m f al l s ap ar t? A ttem p t a m i x ed ap p ro ach to E n h an ced G reed y an d G reed y H eu ri sti c. M i gh t i m p r o v e t i m e b o u n d f o r av er age c ase E n h an c ed G r eed y H eu r i st i c. D o u b t f u l t h at i t w i l l h av e a p o si t i v e af f ec t o n t h e R ec o n st r u c t ed I m age. A ttem p t R eco n stru cti o n o f I m ages w i th m i ssi n g d ata. H o w m u c h m i ssi n g d at a m ak es t h e i m age i r r et r i ev ab l e?
29 Questions? Any questions?
30 References N.Memon and A.Pal, Automated reassembly of file fragmented images using greedy algorithms, IEEE Trans. Image Processing, vol.15, no.2, pp , 2006.
CS 558 Project Presentation. Automated Reassembly of File Fragmented Images Using Greedy Algorithms[N.Memon, A.Pal]
CS 558 Project Presentation Automated Reassembly of File Fragmented Images Using Greedy Algorithms[N.Memon, A.Pal] Alberto E. Santiago Bob Meadows Overview Problem statement Fragmentation Limitations of
More informationOptimization II: Dynamic programming
Optimization II: Dynamic programming Ricardo Fukasawa rfukasawa@uwaterloo.ca Department of Combinatorics and Optimization Faculty of Mathematics University of Waterloo Nov 2, 2016 R. Fukasawa (C&O) Optimization
More informationProject is due on March 11, 2003 Final Examination March 18, pm to 10.30pm
Announcements Please remember to send a mail to Deepa to register for a timeslot for your project demo by March 6, 2003 See Project Guidelines on class web page for more details Project is due on March
More informationDepartment of Computer Science and Engineering Analysis and Design of Algorithm (CS-4004) Subject Notes
Page no: Department of Computer Science and Engineering Analysis and Design of Algorithm (CS-00) Subject Notes Unit- Greedy Technique. Introduction: Greedy is the most straight forward design technique.
More informationSPARE CONNECTORS KTM 2014
SPAREPARTSCATALOG: // ENGINE ART.-NR.: 3208201EN CONTENT CONNECTORS FOR WIRING HARNESS AA-AN CONNECTORS FOR WIRING HARNESS AO-BC CONNECTORS FOR WIRING HARNESS BD-BQ CONNECTORS FOR WIRING HARNESS BR-CD
More informationCIS-331 Spring 2016 Exam 1 Name: Total of 109 Points Version 1
Version 1 Instructions Write your name on the exam paper. Write your name and version number on the top of the yellow paper. Answer Question 1 on the exam paper. Answer Questions 2-4 on the yellow paper.
More informationSPAREPARTSCATALOG: CONNECTORS SPARE CONNECTORS KTM ART.-NR.: 3CM EN
SPAREPARTSCATALOG: CONNECTORS ART.-NR.: 3CM3208201EN CONTENT SPARE CONNECTORS AA-AN SPARE CONNECTORS AO-BC SPARE CONNECTORS BD-BQ SPARE CONNECTORS BR-CD 3 4 5 6 SPARE CONNECTORS CE-CR SPARE CONNECTORS
More informationCIS-331 Fall 2013 Exam 1 Name: Total of 120 Points Version 1
Version 1 1. (24 Points) Show the routing tables for routers A, B, C, and D. Make sure you account for traffic to the Internet. NOTE: Router E should only be used for Internet traffic. Router A Router
More informationEE 122: Inter-domain routing Border Gateway Protocol (BGP)
EE 122: Inter-domain routing Border Gateway Protocol (BGP) Ion Stoica October 2, 2002 (* this presentation is based on Lakshmi Subramanian s slides) Big Picture Large ISP Large ISP St u b D i al - U p
More informationMultimedia Networking ECE 599
Multimedia Networking ECE 599 Prof. Thinh Nguyen School of Electrical Engineering and Computer Science Based on B. Lee s lecture notes. 1 Outline Compression basics Entropy and information theory basics
More informationChapter 16. Greedy Algorithms
Chapter 16. Greedy Algorithms Algorithms for optimization problems (minimization or maximization problems) typically go through a sequence of steps, with a set of choices at each step. A greedy algorithm
More informationDelhi Technological University (Formerly Delhi College of Engineering) Result Notification
THE RESULT OF THE CANDIDATES WHO APPEARED IN THE FOLLOWING EXAMINATIONS HELD IN MAY-2017 IS DECLARED AS UNDER : - No.DTU/Results/BTECH/MAY/2017/ MAY/2017 Branch : Engineering Physics EP-211:CLASSICAL AND
More informationSource-Destination Connection in Brain Network
Source-Destination Connection in Brain Network May 7, 018 Li Kaijian, 515030910566 Contents 1 Introduction 3 1.1 What is Brain Network...................... 3 1. Different Kinds of Brain Network................
More informationConnectivity-aware Virtual Network Embedding
Connectivity-aware Virtual Network Embedding Nashid Shahriar, Reaz Ahmed, Shihabur R. Chowdhury, Md Mashrur Alam Khan, Raouf Boutaba Jeebak Mitra, Feng Zeng Outline Survivability in Virtual Network Embedding
More informationLECTURE NOTES OF ALGORITHMS: DESIGN TECHNIQUES AND ANALYSIS
Department of Computer Science University of Babylon LECTURE NOTES OF ALGORITHMS: DESIGN TECHNIQUES AND ANALYSIS By Faculty of Science for Women( SCIW), University of Babylon, Iraq Samaher@uobabylon.edu.iq
More informationCIS-331 Exam 2 Spring 2016 Total of 110 Points Version 1
Version 1 1. (20 Points) Given the class A network address 121.0.0.0 will be divided into multiple subnets. a. (5 Points) How many bits will be necessary to address 8,100 subnets? b. (5 Points) What is
More information3D Modeling from Range Images
1 3D Modeling from Range Images A Comprehensive System for 3D Modeling from Range Images Acquired from a 3D ToF Sensor Dipl.-Inf. March 22th, 2007 Sensor and Motivation 2 3D sensor PMD 1k-S time-of-flight
More informationSpatial Domain Digital Watermarking of Multimedia Objects for Buyer Authentication. By:
Spatial Domain Digital Watermarking of Multimedia Objects for Buyer Authentication By: Ravi Andem Todd Yarrington (randem@mix.wvu.edu) (tyarring@mix.wvu.edu) Motivation Encryption of valuable images Keep
More informationOutline. 1 The matching problem. 2 The Chinese Postman Problem
Outline The matching problem Maximum-cardinality matchings in bipartite graphs Maximum-cardinality matchings in bipartite graphs: The augmenting path algorithm 2 Let G = (V, E) be an undirected graph.
More informationBit Error Recovery in MMR Coded Bitstreams Using Error Detection Points
Bit Error Recovery in MMR Coded Bitstreams Using Error Detection Points Hyunju Kim and Abdou Youssef Department of Computer Science The George Washington University Washington, DC, USA Email: {hkim, ayoussef}@gwu.edu
More informationG205 Fundamentals of Computer Engineering. CLASS 21, Mon. Nov Stefano Basagni Fall 2004 M-W, 1:30pm-3:10pm
G205 Fundamentals of Computer Engineering CLASS 21, Mon. Nov. 22 2004 Stefano Basagni Fall 2004 M-W, 1:30pm-3:10pm Greedy Algorithms, 1 Algorithms for Optimization Problems Sequence of steps Choices at
More informationToday s s lecture. Lecture 3: Search - 2. Problem Solving by Search. Agent vs. Conventional AI View. Victor R. Lesser. CMPSCI 683 Fall 2004
Today s s lecture Search and Agents Material at the end of last lecture Lecture 3: Search - 2 Victor R. Lesser CMPSCI 683 Fall 2004 Continuation of Simple Search The use of background knowledge to accelerate
More informationBit error recovery in Internet facsimile without retransmission
Bit error recovery in Internet facsimile without retransmission Hyunju Kim and Abdou Youssef Department of Computer Science The George Washington University Washington, DC 20052 Email: {hkim, youssef}@seas.gwu.edu
More informationCS141: Intermediate Data Structures and Algorithms Greedy Algorithms
CS141: Intermediate Data Structures and Algorithms Greedy Algorithms Amr Magdy Activity Selection Problem Given a set of activities S = {a 1, a 2,, a n } where each activity i has a start time s i and
More informationRooted Cycle Bases. David Eppstein, J. Michael McCarthy, and Brian E. Parrish
Rooted Cycle Bases David Eppstein, J. Michael McCarthy, and Brian E. Parrish 14th Algorithms and Data Structures Symp. (WADS 2015) Victoria, BC, August 2015 Linkages Systems of rigid bodies connected by
More informationChapter 4: Application Protocols 4.1: Layer : Internet Phonebook : DNS 4.3: The WWW and s
Chapter 4: Application Protocols 4.1: Layer 5-7 4.2: Internet Phonebook : DNS 4.3: The WWW and E-Mails OSI Reference Model Application Layer Presentation Layer Session Layer Application Protocols Chapter
More informationProcessing and Others. Xiaojun Qi -- REU Site Program in CVMA
Advanced Digital Image Processing and Others Xiaojun Qi -- REU Site Program in CVMA (0 Summer) Segmentation Outline Strategies and Data Structures Overview of Algorithms Region Splitting Region Merging
More informationPick up artist guide
Pick up artist guide. Originally posted by Mugwump InProcServer32 Default C Program Files Real RealPlayer rpshell. Pick up artist guide Manages the purchasing of all software, hardware and other IT supplies
More informationCompiler Architecture
Code Generation 1 Compiler Architecture Source language Scanner (lexical analysis) Tokens Parser (syntax analysis) Syntactic structure Semantic Analysis (IC generator) Intermediate Language Code Optimizer
More informationSM15K - Interface modules
DELTA ELEKTRONIKA B.V. DC POWER SUPPLIES Vissersdijk 4, 4301 ND Zierikzee, the Netherlands www.deltapowersupplies.com Tel. +31 111 413656 SM15K - Interface modules Mod els Description INT MOD M/S-2 Master/Slave
More informationToward the joint design of electronic and optical layer protection
Toward the joint design of electronic and optical layer protection Massachusetts Institute of Technology Slide 1 Slide 2 CHALLENGES: - SEAMLESS CONNECTIVITY - MULTI-MEDIA (FIBER,SATCOM,WIRELESS) - HETEROGENEOUS
More informationTutorial: Working with layout
Welcome to CorelDRAW, a comprehensive vector-based drawing program for the graphics professional. This tutorial introduces the layout and organization tools in CorelDRAW. These tools are essential for
More informationCSC 421: Algorithm Design & Analysis. Spring 2015
CSC 421: Algorithm Design & Analysis Spring 2015 Greedy algorithms greedy algorithms examples: optimal change, job scheduling Prim's algorithm (minimal spanning tree) Dijkstra's algorithm (shortest path)
More informationCSC 505, Spring 2005 Week 6 Lectures page 1 of 9
CSC 505, Spring 2005 Week 6 Lectures page 1 of 9 Objectives: learn general strategies for problems about order statistics learn how to find the median (or k-th largest) in linear average-case number of
More informationUNIT 3. Greedy Method. Design and Analysis of Algorithms GENERAL METHOD
UNIT 3 Greedy Method GENERAL METHOD Greedy is the most straight forward design technique. Most of the problems have n inputs and require us to obtain a subset that satisfies some constraints. Any subset
More informationCIS-331 Fall 2014 Exam 1 Name: Total of 109 Points Version 1
Version 1 1. (24 Points) Show the routing tables for routers A, B, C, and D. Make sure you account for traffic to the Internet. Router A Router B Router C Router D Network Next Hop Next Hop Next Hop Next
More informationThuraya XT-PRO Universally professional
Thuraya XT-PRO Universally professional www.thuraya.com Follow us on /thurayatelecom Designed for professional users, Thuraya XT-PRO is the world s most advanced satellite phone which is ruggedized and
More informationMain approach: always make the choice that looks best at the moment.
Greedy algorithms Main approach: always make the choice that looks best at the moment. - More efficient than dynamic programming - Always make the choice that looks best at the moment (just one choice;
More informationAlgorithms. Ch.15 Dynamic Programming
Algorithms Ch.15 Dynamic Programming Dynamic Programming Not a specific algorithm, but a technique (like divide-and-conquer). Developed back in the day when programming meant tabular method (like linear
More informationSection 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected
Section 3.1: Nonseparable Graphs Cut vertex of a connected graph G: A vertex x G such that G x is not connected. Theorem 3.1, p. 57: Every connected graph G with at least 2 vertices contains at least 2
More informationNP Completeness. Andreas Klappenecker [partially based on slides by Jennifer Welch]
NP Completeness Andreas Klappenecker [partially based on slides by Jennifer Welch] Dealing with NP-Complete Problems Dealing with NP-Completeness Suppose the problem you need to solve is NP-complete. What
More informationGreedy Algorithms CHAPTER 16
CHAPTER 16 Greedy Algorithms In dynamic programming, the optimal solution is described in a recursive manner, and then is computed ``bottom up''. Dynamic programming is a powerful technique, but it often
More informationCMPT 365 Multimedia Systems. Media Compression - Video
CMPT 365 Multimedia Systems Media Compression - Video Spring 2017 Edited from slides by Dr. Jiangchuan Liu CMPT365 Multimedia Systems 1 Introduction What s video? a time-ordered sequence of frames, i.e.,
More informationCountry
Total EU-12 31,2 26,6 21,1 22,5 25,9 29,2 29,6 29,7 30,5 29,9 25,3 25,1 EU-15 28,1 28,6 28,6 29,4 28,8 24,3 24,2 EU-25 25,0 25,0 A 15,0 13,4 14,3 15,6 14,9 16,6 13,6 5,3 10,9 10,8 B 41,9 44,7 51,6 53,5
More informationCIS-331 Final Exam Spring 2018 Total of 120 Points. Version 1
Version 1 Instructions 1. Write your name and version number on the top of the yellow paper and the routing tables sheet. 2. Answer Question 2 on the routing tables sheet. 3. Answer Questions 1, 3, 4,
More informationThe Shortest Path Problem
The Shortest Path Problem 1 Shortest-Path Algorithms Find the shortest path from point A to point B Shortest in time, distance, cost, Numerous applications Map navigation Flight itineraries Circuit wiring
More informationTHE EFFECT OF JOIN SELECTIVITIES ON OPTIMAL NESTING ORDER
THE EFFECT OF JOIN SELECTIVITIES ON OPTIMAL NESTING ORDER Akhil Kumar and Michael Stonebraker EECS Department University of California Berkeley, Ca., 94720 Abstract A heuristic query optimizer must choose
More informationRegister Allocation (via graph coloring) Lecture 25. CS 536 Spring
Register Allocation (via graph coloring) Lecture 25 CS 536 Spring 2001 1 Lecture Outline Memory Hierarchy Management Register Allocation Register interference graph Graph coloring heuristics Spilling Cache
More informationProblem Strategies. 320 Greedy Strategies 6
Problem Strategies Weighted interval scheduling: 2 subproblems (include the interval or don t) Have to check out all the possibilities in either case, so lots of subproblem overlap dynamic programming:
More informationPartitioning. Course contents: Readings. Kernighang-Lin partitioning heuristic Fiduccia-Mattheyses heuristic. Chapter 7.5.
Course contents: Partitioning Kernighang-Lin partitioning heuristic Fiduccia-Mattheyses heuristic Readings Chapter 7.5 Partitioning 1 Basic Definitions Cell: a logic block used to build larger circuits.
More informationPACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed
More informationEE512 Graphical Models Fall 2009
EE512 Graphical Models Fall 2009 Prof. Jeff Bilmes University of Washington, Seattle Department of Electrical Engineering Fall Quarter, 2009 http://ssli.ee.washington.edu/~bilmes/ee512fa09 Lecture 11 -
More informationRF119. w w w. r m s p l. c o m. a u R F 119 B 4 08/ 01/
Relay Adaptor System Based on the flexible Siemens Reyrolle 7SR11 Non-Directional Overcurrent Relay, the Adapter Modules allows the replacement of obsolete draw-out protection relay modules without disturbing
More informationLecture 8 JPEG Compression (Part 3)
CS 414 Multimedia Systems Design Lecture 8 JPEG Compression (Part 3) Klara Nahrstedt Spring 2011 Administrative MP1 is posted Extended Deadline of MP1 is February 18 Friday midnight submit via compass
More informationC E R T I F I C A T E O F C O M P L I A N C E
Issued to: SIEMENS AG LOW VOLTAGE SIEMENSSTRASSE 10 93055 REGENSBURG, GERMANY This is to certify that representative samples of Motor Controllers, Manual See following pages for list of models Have been
More informationMain approach: always make the choice that looks best at the moment. - Doesn t always result in globally optimal solution, but for many problems does
Greedy algorithms Main approach: always make the choice that looks best at the moment. - More efficient than dynamic programming - Doesn t always result in globally optimal solution, but for many problems
More informationGeometry Final Review
Name: ate: 1. In the accompanying diagram, lines a and b are parallel, and lines c and d are transversals. Which angle is congruent to angle 8? 2. Which geometric principle is used to justify the construction
More informationA-LEVEL MATHEMATICS. Decision 1 MD01 Mark scheme June Version/Stage: 1.0 Final
A-LEVEL MATHEMATICS Decision 1 MD01 Mark scheme 6360 June 2014 Version/Stage: 1.0 Final Mark schemes are prepared by the Lead Assessment Writer and considered, together with the relevant questions, by
More informationPractice Problems for the Final
ECE-250 Algorithms and Data Structures (Winter 2012) Practice Problems for the Final Disclaimer: Please do keep in mind that this problem set does not reflect the exact topics or the fractions of each
More informationAnalysis of Algorithms Prof. Karen Daniels
UMass Lowell Computer Science 91.503 Analysis of Algorithms Prof. Karen Daniels Spring, 2010 Lecture 2 Tuesday, 2/2/10 Design Patterns for Optimization Problems Greedy Algorithms Algorithmic Paradigm Context
More informationA Video CoDec Based on the TMS320C6X DSP José Brito, Leonel Sousa EST IPCB / INESC Av. Do Empresário Castelo Branco Portugal
A Video CoDec Based on the TMS320C6X DSP José Brito, Leonel Sousa EST IPCB / INESC Av. Do Empresário Castelo Branco Portugal jbrito@est.ipcb.pt IST / INESC Rua Alves Redol, Nº 9 1000 029 Lisboa Portugal
More informationDesign and Analysis of Algorithms
CSE 101, Winter 018 D/Q Greed SP s DP LP, Flow B&B, Backtrack Metaheuristics P, NP Design and Analysis of Algorithms Lecture 8: Greed Class URL: http://vlsicad.ucsd.edu/courses/cse101-w18/ Optimization
More informationCMSC 313 Lecture 03 Multiple-byte data big-endian vs little-endian sign extension Multiplication and division Floating point formats Character Codes
Multiple-byte data CMSC 313 Lecture 03 big-endian vs little-endian sign extension Multiplication and division Floating point formats Character Codes UMBC, CMSC313, Richard Chang 4-5 Chapter
More informationChapter 9 Graph Algorithms
Chapter 9 Graph Algorithms 2 Introduction graph theory useful in practice represent many real-life problems can be slow if not careful with data structures 3 Definitions an undirected graph G = (V, E)
More informationGlobal Register Allocation
Global Register Allocation Lecture Outline Memory Hierarchy Management Register Allocation via Graph Coloring Register interference graph Graph coloring heuristics Spilling Cache Management 2 The Memory
More informationLID Assignment In InfiniBand Networks
LID Assignment In InfiniBand Networks Wickus Nienaber, Xin Yuan, Member, IEEE and Zhenhai Duan, Member, IEEE Abstract To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID)
More informationVer Install Guide. Ver. 4.3 Install Guide
En Ver. 4.3 Install Guide Ver. 4.3 Install Guide En Table of Contents Introduction: About This Manual...1 Overview...2 Windows...3 Installing Nikon Capture 4 Under Windows...4 Easy Install...7 Custom Install...14
More informationECE 533 Digital Image Processing- Fall Group Project Embedded Image coding using zero-trees of Wavelet Transform
ECE 533 Digital Image Processing- Fall 2003 Group Project Embedded Image coding using zero-trees of Wavelet Transform Harish Rajagopal Brett Buehl 12/11/03 Contributions Tasks Harish Rajagopal (%) Brett
More informationRegister Allocation 1
Register Allocation 1 Lecture Outline Memory Hierarchy Management Register Allocation Register interference graph Graph coloring heuristics Spilling Cache Management The Memory Hierarchy Registers < 1
More informationChapter 16: Greedy Algorithm
Chapter 16: Greedy Algorithm 1 About this lecture Introduce Greedy Algorithm Look at some problems solvable by Greedy Algorithm 2 Coin Changing Suppose that in a certain country, the coin dominations consist
More information11/22/2016. Chapter 9 Graph Algorithms. Introduction. Definitions. Definitions. Definitions. Definitions
Introduction Chapter 9 Graph Algorithms graph theory useful in practice represent many real-life problems can be slow if not careful with data structures 2 Definitions an undirected graph G = (V, E) is
More informationChapter 5. Relationships Within Triangles
Chapter 5 Relationships Within Triangles 5.1 Midsegment Theorem and Coordinate Proof Objective: Use properties of midsegments. Essential Question: How do you find the midsegment of a triangle? Midsegment
More informationCIS-331 Final Exam Fall 2015 Total of 120 Points. Version 1
Version 1 1. (25 Points) Given that a frame is formatted as follows: And given that a datagram is formatted as follows: And given that a TCP segment is formatted as follows: Assuming no options are present
More informationmmm Internal Report #13 -^ /y ELAINE LITMAN
QUIET2QiE imwfmmge MiLXSIS mmm Internal Report #13 -^ /y ELAINE LITMAN QUIETZON is a program to compute the power density expected at Green Bank from any proposed transmitter site in the Radio Quiet Zone.
More informationFile Carving Using Sequential Hypothesis Testing
File Carving Using Sequential Hypothesis Testing Anandabrata (Pasha) Pal, Taha Sencar and Nasir Memon Introduction File Carving: recovery without file system meta-data. Recovery based on file structure/content
More informationOptimal Partition with Block-Level Parallelization in C-to-RTL Synthesis for Streaming Applications
Optimal Partition with Block-Level Parallelization in C-to-RTL Synthesis for Streaming Applications Authors: Shuangchen Li, Yongpan Liu, X.Sharon Hu, Xinyu He, Pei Zhang, and Huazhong Yang 2013/01/23 Outline
More informationOutline. CS38 Introduction to Algorithms. Approximation Algorithms. Optimization Problems. Set Cover. Set cover 5/29/2014. coping with intractibility
Outline CS38 Introduction to Algorithms Lecture 18 May 29, 2014 coping with intractibility approximation algorithms set cover TSP center selection randomness in algorithms May 29, 2014 CS38 Lecture 18
More informationCSE 2320 Notes 6: Greedy Algorithms
SE Notes 6: Greedy Algorithms (Last updated 9/9/6 :6 PM) LRS 6.-6. 6.A. ONEPTS ommitments are based on local decisions: NO backtracking (will see in stack rat-in-a-maze - Notes ) NO exhaustive search (will
More informationAlgorithms for Minimum Spanning Trees
Algorithms & Models of Computation CS/ECE, Fall Algorithms for Minimum Spanning Trees Lecture Thursday, November, Part I Algorithms for Minimum Spanning Tree Sariel Har-Peled (UIUC) CS Fall / 6 Sariel
More informationCIS-331 Exam 2 Fall 2014 Total of 105 Points. Version 1
Version 1 1. (20 Points) Given the class A network address 119.0.0.0 will be divided into a maximum of 15,900 subnets. a. (5 Points) How many bits will be necessary to address the 15,900 subnets? b. (5
More informationAnnotations: Enriching a Digital Library
UNIVERSITY OF PADUA Department of Information Engineering Maristella Agosti maristella.agosti@unipd.it Nicola Ferro nicola.ferro@unipd.it Information Management Systems Research Group Contents of Presentation
More informationProblem set 2. Problem 1. Problem 2. Problem 3. CS261, Winter Instructor: Ashish Goel.
CS261, Winter 2017. Instructor: Ashish Goel. Problem set 2 Electronic submission to Gradescope due 11:59pm Thursday 2/16. Form a group of 2-3 students that is, submit one homework with all of your names.
More informationGreedy Algorithms. Algorithms
Greedy Algorithms Algorithms Greedy Algorithms Many algorithms run from stage to stage At each stage, they make a decision based on the information available A Greedy algorithm makes decisions At each
More informationLecture 8 JPEG Compression (Part 3)
CS 414 Multimedia Systems Design Lecture 8 JPEG Compression (Part 3) Klara Nahrstedt Spring 2012 Administrative MP1 is posted Today Covered Topics Hybrid Coding: JPEG Coding Reading: Section 7.5 out of
More informationAlgorithms Dr. Haim Levkowitz
91.503 Algorithms Dr. Haim Levkowitz Fall 2007 Lecture 4 Tuesday, 25 Sep 2007 Design Patterns for Optimization Problems Greedy Algorithms 1 Greedy Algorithms 2 What is Greedy Algorithm? Similar to dynamic
More informationCommunication Networks I December 4, 2001 Agenda Graph theory notation Trees Shortest path algorithms Distributed, asynchronous algorithms Page 1
Communication Networks I December, Agenda Graph theory notation Trees Shortest path algorithms Distributed, asynchronous algorithms Page Communication Networks I December, Notation G = (V,E) denotes a
More informationWorkshop In Advanced Data Structures Push-Relabel Heuristics. Maya Orshizer Sagi Hed
Workshop In Advanced Data Structures Push-Relabel Heuristics Maya Orshizer Sagi Hed 1 Contents 1 Overview And Goals 3 2 Our Implementation Of Push Relabel 3 2.1 Definitions...............................
More informationCIS-331 Final Exam Spring 2015 Total of 115 Points. Version 1
Version 1 1. (25 Points) Given that a frame is formatted as follows: And given that a datagram is formatted as follows: And given that a TCP segment is formatted as follows: Assuming no options are present
More informationNikon Firmware Update for Coolpix 990 Version 1.1
Nikon Firmware Update for Coolpix 990 Version 1.1 Notes: 1. It is most important that you follow the supplied directions; failure to follow all of the steps may result in your camera being disabled. 2.
More informationECE 417 Guest Lecture Video Compression in MPEG-1/2/4. Min-Hsuan Tsai Apr 02, 2013
ECE 417 Guest Lecture Video Compression in MPEG-1/2/4 Min-Hsuan Tsai Apr 2, 213 What is MPEG and its standards MPEG stands for Moving Picture Expert Group Develop standards for video/audio compression
More informationUnit 5A: Circuit Partitioning
Course contents: Unit 5A: Circuit Partitioning Kernighang-Lin partitioning heuristic Fiduccia-Mattheyses heuristic Simulated annealing based partitioning algorithm Readings Chapter 7.5 Unit 5A 1 Course
More informationRequest for Comments: 5109 December 2007 Obsoletes: 2733, 3009 Category: Standards Track. RTP Payload Format for Generic Forward Error Correction
Network Working Group A. Li, Ed. Request for Comments: 5109 December 2007 Obsoletes: 2733, 3009 Category: Standards Track RTP Payload Format for Generic Forward Error Correction Status of This Memo This
More informationFall Compiler Principles Lecture 12: Register Allocation. Roman Manevich Ben-Gurion University
Fall 2014-2015 Compiler Principles Lecture 12: Register Allocation Roman Manevich Ben-Gurion University Syllabus Front End Intermediate Representation Optimizations Code Generation Scanning Lowering Local
More information2-Type Series Pressurized Closures
2-Type Series Pressurized Closures A complete pressure tight reenterable closure system for enclosing spliced connections of communications cables in a wide variety of applications. The 2-type Closure
More informationPATH FINDING AND GRAPH TRAVERSAL
GRAPH TRAVERSAL PATH FINDING AND GRAPH TRAVERSAL Path finding refers to determining the shortest path between two vertices in a graph. We discussed the Floyd Warshall algorithm previously, but you may
More informationCIS-331 Exam 2 Fall 2015 Total of 105 Points Version 1
Version 1 1. (20 Points) Given the class A network address 117.0.0.0 will be divided into multiple subnets. a. (5 Points) How many bits will be necessary to address 4,000 subnets? b. (5 Points) What is
More information. ).-... I s 0 4 i o s ) ( i. Name CA K44-14". Block 3-4B: Linear Programming Homework
Name CA K44-14". Block 3-4B: Linear Programming Homework 1. An electronics company makes two kinds of TV's: LCD and plasma. Let x be the number of LCD TV's and y be the number of plasma TV's made in a
More informationSMF Transient Voltage Suppressor Diode Series
SMF Transient Voltage Suppressor Diode Series General Information The SMF series is designed specifically to protect sensitive electronic equipment from voltage transients induced by lightning and other
More informationArchitectural Design
Architectural Design Establishing the overall structure of a software system Ian Sommerville - Software Engineering 1 Software architecture The design process for identifying the sub-systems making up
More informationIterative deepening multiobjective A*
Iterative deepening multiobjective A* S. Harikumar, Shashi Kumar * Depurtment of Computer Science and Engineering, Indiun Institute of Technology, Delhi, New Delhi, India Received 19 January 1995; revised
More information