Register now to access 7 million high quality study materials (What's Course Hero?) Course Hero is the premier provider of high quality online educational resources. With millions of study documents, online tutors, digital flashcards and free courseware, Course Hero is helping students learn more efficiently and effectively. Whether you're interested in exploring new subjects or mastering key topics for your next exam, Course Hero has the tools you need to achieve your goals.

3 Pages

HW1

Course: COSC 6380, Fall 2008
School: U. Houston
Rating:

Word Count: 400

Document Preview

4393/6380 COSC Digital Image Processing Department of Computer Science University of Houston Assignment #1 Due: 10/14/08 1. Write a program to binarize a gray-level image based on the assumption that the image has a bimodal histogram. You are to implement a method that assumes that both the foreground and background regions of the image represent a Gaussian distribution and the optimal threshold to binarize the...

Register Now

Unformatted Document Excerpt

Coursehero >> Texas >> U. Houston >> COSC 6380

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
4393/6380 COSC Digital Image Processing Department of Computer Science University of Houston Assignment #1 Due: 10/14/08 1. Write a program to binarize a gray-level image based on the assumption that the image has a bimodal histogram. You are to implement a method that assumes that both the foreground and background regions of the image represent a Gaussian distribution and the optimal threshold to binarize the image is the average of the means of the two Gaussians. Your code should report both the binarized image and the optimal threshold value. Assume that foreground takes a value of 1 and the background a value of 0 in the binary image. Also assume that foreground objects are darker than background objects in the input gray-level image. 2. Write to program to perform morphological smoothing of the resultant binarized image. Include both Open-Close and Close-Open smoothing operations using a windowing function that is a 3 x 3 window and a 5 x 5 window. The input to your code would be a binary image and the output would be a smoothed version that eliminates small regions and fills holes of larger regions. 3. Write a program to perform blobcoloring based on both a 4-connected and a 8connected neighborhood x (3 3 window). The input to your code should be a binary image from the previous step and the output should be a count of total objects in the image as well as the labeled image where each object is color coded starting with the value of 1 and the background taking a value of 0. Assume that objects in the binary image take a value of 1 while the background takes a value of 0. In addition, your code should also report the area and centroid of each object in the binary image. 4. Write a main program to read in the supplied gray-level image (cells.png) and threshold the image to generate a binary image using the function developed in part 1. Next, use morphological operations to eliminate small regions and fill holes in...

Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

U. Houston - COSC - 4352
Visual Numerics Company ConfidentialComputational Benchmarking of the IMSL LibraryIntroduction: Benchmarking is not a fixed project based exercise in which a set of tests are run, data gathered and the project is complete. Performance behavior var
U. Houston - COSC - 2008
COSC6343 PatternRecognition DepartmentofComputerScience UniversityofHouston Assignment1:ProbabilisticImageSegmentation Due:3/3/08The goal of this assignment is to apply statistical decision theory for the purpose of segmenting an image into two comp
U. Houston - COSC - 6343
COSC6343 PatternRecognition DepartmentofComputerScience UniversityofHouston Assignment1:ProbabilisticImageSegmentation Due:3/3/08The goal of this assignment is to apply statistical decision theory for the purpose of segmenting an image into two comp
U. Houston - COSC - 4352
Geographical Information System (GIS) Mapping and Selection Utilities Project Description BackgroundGeographical Information Systems (GIS) have become very important in recent years in industry, government and academia. Furthermore, the interest of
U. Houston - COSC - 4352
PlanetTeach.comisasocialnetworkingsiteinwhichpeoplecanTeachtheirPassionand LearntheirDream.PlanetTeachhascompleteditsBetaandisreadyfordevelopmentof version 1.5. The goal of version 1.5 is to simplify the UI and to improve the strategic capabilities
U. Houston - COSC - 4352
International Cancer Congress &amp; The University of Houston .NET Team ProjectThe International Cancer Congress (ICC), a foundation sponsored by Extensions, Inc., will be a Houston-based organization established to further the progress of cancer resear
U. Houston - COSC - 4352
Software Development Practices Course Pre-requisite Certification Form Name: _ Student#:_ Pre-requisite: Must have completed either COSC 6318 or COSC 4351 Must have completed COSC 1320 or equivalent Must have completed COSC 2320 or equivalent I ce
U. Houston - COSC - 6380
COSC4393/6380 DigitalImageProcessing DepartmentofComputerScience UniversityofHouston Assignment#2 Due:11/12/08 1) Write a function to read input images provided with this assignment. Compute the histogram of the original image and perform histogram e
U. Houston - COSC - 4352
Software Tales: Storyboards for DevelopersMission (should you choose to accept it) Design and write an extraordinary application for creating and viewing storyboards. General Description There are many tools for documenting requirements and UI desig
U. Houston - COSC - 2008
COSC 6343 Pattern Recognition Spring 2008 MATLAB Introduction Exercise In the following, let A = [1 5 4; 2 7 8; 3 2 5] and B = [1 0 0; 0 4 2; 0 2 9] be matrices, C = [1 3 3] be a vector and D = [4 7 9 3 12 11 2 8 8] be data. 1. Compute the mean of da
U. Houston - COSC - 6343
COSC 6343 Pattern Recognition Spring 2008 MATLAB Introduction Exercise In the following, let A = [1 5 4; 2 7 8; 3 2 5] and B = [1 0 0; 0 4 2; 0 2 9] be matrices, C = [1 3 3] be a vector and D = [4 7 9 3 12 11 2 8 8] be data. 1. Compute the mean of da
U. Houston - COSC - 4352
Deloitte Data Analysis and Sharing Tool Deloitte professionals are servicing engagements for different industries all over the world. The common theme critical to the success of each of these engagements is the reliability of the source data and coll
U. Houston - COSC - 4352
Agile Software Development An IntroductionTypical Software Project LifecycleSlow start as everyone attempts to make sense of what problem is being solved Struggle to interpret users requirements and translate into specification language Developmen
U. Houston - COSC - 2008
U. Houston - COSC - 6343
U. Houston - COSC - 6380
COSC4393/6380 DigitalImageProcessing DepartmentofComputerScience UniversityofHouston Assignment#3 Due:12/07/081. Write a program to detect lines in an image using the Hough Transform. Use the polar parameterization of a line for your implementation.
U. Houston - COSC - 6380
COSC 4393/6380 DIGITAL IMAGE PROCESSING Image Filtering - IINotes by Prof. A. C. Bovik1Nonlinear Image Filtering Median and Morphological Filters Digital Noise Probability Models Order Statistic Filters Homomorphic FilteringReading: Ch. 4.
U. Houston - COSC - 4352
Women Professionals in Government Webpage www.wpghouston.org Background: Women Professionals in Government is a non-profit organization whose members include city, county, state, and federal professional women, who work in or with government. Members
U. Houston - COSC - 4352
U. Houston - COSC - 6385
COSC 6385 Computer Architecture - HomeworkEdgar Gabriel Fall 2006COSC 6385 Computer Architecture Edgar GabrielHomework Rules Each student should deliver Source code (.c files) Documentation and Results (.pdf, .doc, .tex or .txt file) expla
U. Houston - COSC - 6397
COSC 4397/6397 Network Systems Labs (Spring 2008) Project 1 Installing Debian on the Compaq Armada 110 Objective This assignment is designed to teach you to install Linux, configure and manage the network Description In this assignment, you will inst
U. Houston - COSC - 6397
More on Gaussian Distribution( x )2 f ( x) = exp( ) 2 2 2 2 1X ~ (x,2x, Y ~ (y, 2y), X &amp; Y are independent, then X+Y ~ (x+y, 2x+2y) X ~ (x,2x), then aX ~ (ax,a22x) Error function erferf ( z ) = 2e0zt 2dt2 x 1 e t / 2 dt = [1 + erf
U. Houston - COSC - 6397
Wireless Application Protocol (WAP)Characteristics of mobile devices and mobile networksSmall screens Limited device memory Less powerful CPUs Limited bandwidth availability Unreliable connections High latencyOpen standard providing mobile users
U. Houston - COSC - 6397
Medium Access Control LogicStartPacket arrivalMedium idleMedium busydeferexpiredRandom BackoffMedium busyTransmitFreezeCollision detectedCW = min(2(CW+1) 1, CWmax)Interframe Space (IFS)Short IFS (SIFS)Shortest IFS (used for A
U. Houston - COSC - 6397
Lecture 2: Wireless Channel Propagation &amp; Modulation Techniques13Police Radar14Basics IRandom variable XIf a probability distribution has density f(x), then intuitively the infinitesimal interval [x, x + dx] has probability f(x) dx. x Cumul
U. Houston - COSC - 6397
What is a computer program?&quot;A combination of computer instructions and data definitions that enable computer hardware to perform computational or control functions&quot;Instructions Data What is missing here?User Interface!inputInstructionsoutput
U. Houston - COSC - 6397
Location &amp; Context Awareness117Potential Killer Apps for Wireless Data NetworksExploit location specific informationFind the nearest {caf, movie theater, } Wireless dating match-maker gameMobiCom 2002 Talk by Ed. Knightly118What is Contex
U. Houston - COSC - 6397
Emerging Wireless Networks178OutlineScopeWireless sensor network Lower Power Personal area networks Wireless mesh networksFocusTechnology overview Representative projects/solutions179Adopted from D. Estrin's Mobicom'02 tutorialEmbedded
U. Houston - COSC - 6397
U. Houston - COSC - 6397
Process MigrationMovement of a currently executing process to a new processor Process migration mechanism how the system migrates a process from source to destinationHomogenous Heterogeneous Distributed shared memoryRemote execution process exe
U. Houston - COSC - 6397
1COSC6397 Homework Assignment 1 (Larger-scale Fading)Solution Problem 1. Suppose a transmitter produces 50W of power. a. Express the transmit power in units of dBm and dBW. b. If the transmitters power is applied to a unity gain antenna with a 900
U. Houston - COSC - 6397
COSC6397 Homework Assignment 3September 22, 20041Part 1: Routing1. Find the shortest path tree from every node to node 1 for the graph of Fig.1 using the Bellman-ford and Dijkstra algorithms.10 2 4 6 3 4 5 3 9 6 3 2 3 4 3 2 6 5 2147Fig
U. Houston - COSC - 7397
Robust Rate Adaptation for 802.11 Wireless NetworksStarsky H.Y. Wong1 , Hao Yang2 , Songwu Lu1 and Vaduvur Bharghavan3Dept. of Computer Science, UCLA, 4732 Boelter Hall, Los Angeles, CA 90025 1 IBM T.J. Watson Research, 19 Skyline Drive, Hawthorne,
U. Houston - COSC - 6397
Destination Sequenced Distance Vector (DSDV)Based on Bellman-ford algorithm with the following changes:Each routing table entry keeps (destination, next-hop, hop-count, seq, install time), seq is assigned by a destination nodeDestination A B C D N
U. Houston - COSC - 6397
I/O Multiplexing and Posix ThreadsCOSC 6397Rong Zheng1Possible Mechanisms for Creating Concurrent Service1. ProcessesKernel automatically interleaves multiple logical flows. Each flow has its own private address space.2. I/O multip
U. Houston - COSC - 6377
Fall 2007 COSC 6377 Computer Networks Instructor: Rong Zheng Email: rzheng@cs.uh.edu Lecture time: 4:00pm 5:30pm, MW Location: 205 sec Office Hours: 2:00pm 4pm M; 5:30 6:30 W Class web: Go to www.uh.edu/webct, click on WebCTVista button Lab: PGH 5
U. Houston - COSC - 6397
GPSR: Greedy Perimeter Stateless Routing for Wireless NetworksProposed by Brad Karp and H.T. Kung Uses Position Information to make routing decisionsRouting based on destinations geographical location Only need to maintain neighbors location inform
U. Houston - COSC - 6397
COSC6397 Homework Assignment 3September 15, 20041Part 1: Routing1. Find the shortest path tree from every node to node 1 for the graph of Fig.1 using the Bellman-ford and Dijkstra algorithms.10 2 4 6 3 4 5 3 9 6 3 2 3 4 3 2 6 5 2Due date: Se
U. Houston - COSC - 6377
Fall 2005 COSC 6377 Computer Networks Instructor: Rong Zheng Email: rzheng@cs.uh.edu Lecture time: 4:00pm 5:30pm, MW Location: 138-SR Office Hours: 2:30pm 4pm, MW TA: Mohammad A Muqsith (muqsith1530@yahoo.com) TA Office Hours: 2:00pm 4pm, TTh Clas
U. Houston - COSC - 6397
COSC 6397 Wireless Networking and Mobile ComputingDr. Rong Zheng rzheng@cs.uh.edu1Mobile computing Wireless networkingMobile computing computing on the move, can be wired Wireless networking facilitates mobile computing with flexibility of mo
U. Houston - COSC - 6375
COSC 6375: Computer System Performance EvaluationSpring 2009 Instructors: Email: Lectures Office Hours: Class web site: Textbook: Hisashi Kobayashi and Brian L. Mark, System Modeling and Analysis: Foundations of System Performance Evaluation. Prent
U. Houston - COSC - 7397
Exploring Complex Networks S. H. Strogatz, Exploring complex networks, Nature, 1998Faloutsos3, On power-law relationship on the Internet topology, SIGCOMM, 1999 A. Lakhina et al, Sampling biases in IP topology measurement, INFOCOM, 200342Out
U. Houston - COSC - 6397
COSC 6397 Computer network system laboratory Instructor: Rong Zheng (PGH 565) TA: Song Wei (PGH 311) Time: Wed 4 7pm Location: SEC 205 Objectives: The main objective of the network system labs is to further the understanding of the network protocol
U. Houston - COSC - 7397
Simulating the Power Consumption of LargeScale Sensor Network ApplicationsVictor Shnayder, Mark Hempstead, Bor-rong Chen, Geoff Werner Allen and Matt Walsh-Divya RaoDept of Electrical and Computer Engineering University of HoustonWhat is PowerT
U. Houston - COSC - 6397
L i nux Basi csReadi ng:Chap 1-2 [WFR05] L i nux Command M anualAbout L i nux L i nux i s the name of the ker nel L i nux i s Open Sour ce Softwar e (OSS) L i nux i s l i censed thr ough the Gener al Publ i cL i cense (ver si on 2, aka GP
U. Houston - COSC - 6397
Network Programming with SocketsReading:Stevens 3rd ed., Ch. 3-6, or 2nd ed.Beej's Guide to Network Programming http:/beej.us/guide/bgnet/1OutlineBasic socket programming Concurrent communication Libnet and libcap library2Sockets process
U. Houston - COSC - 6377
C C OS 6377: C pute Ne om r tworksRong Zhe ng rzhe cs.uh.e ng@ duC pute Ne om r tworking: A Top Down Approach Fe aturing the I nte t, rne 3rd e dition. JimKurose Ke Ross , ith Addison-We y, July 2004. sleI ntroduction1-1I ntroduction Ove w o
U. Houston - COSC - 7397
Opportunistic Multi-Hop Routing for Wireless Networks Sanjit Biswas and Robert Morris M.I.T. Computer Science and Artificial Intelligence LabIntroduction Motivation Background Basic Idea of how ExOR works Why ExOR works ? Design Challenges Re
U. Houston - COSC - 7397
Song WeiEnabling Distributed Throughput Maximization in Wireless Mesh Networks A Partitioning Approach ProblemChannel Scheduling- -Centralized Distributed ModelGraph theory- -Conflict graph Graph coloringThroughput Con
U. Houston - COSC - 7397
Paper CritiqueJoseph Jefferson COSC7397 January 30, 2007&quot;Routing in Multi-Radio, Multi-Hop Wireless Mesh Networks&quot;, Draves, R.,Padhye, J., Zill, B The authors of this paper attempt to address the problem of lost capacity in wireless mesh networks.
U. Houston - COSC - 6397
Libpcap and Libnet1Why Libnet &amp; Libpcap?Allow manipulation/interception of link layer packetsUsing socket programming, kernel will fill in the source IP address, checksum etc.Raw socket is one way to write IP packets directly but not everythin
U. Houston - COSC - 6397
Lecture 4: Wireless LAN &amp; IEEE 802.11 Wireless LAN Standard54Wireless LANsApplicationsLAN Extension Cross-building interconnect (e.g., Seattle Wireless) Nomadic Access Ad hoc networkingExample technologiesInfrared (IR) LANs Spread spectrum L
U. Houston - COSC - 7388
1/20/2009COSC7388 Advanced Distributed Computing- How to build reliable wireless healthcare systems?Rong ZhengOutlineCourse overview Ten commandments on technical presentation How to write critiques? Paper sign-up211/20/2009Technical
U. Houston - COSC - 6374
COSC 6374 Parallel ComputationDebugging MPI applicationsEdgar Gabriel Spring 2008Edgar GabrielHow to use a cluster A cluster usually consists of a front-end node and compute nodes Name of the front-end node: shark.cs.uh.edu You can login to
U. Houston - COSC - 6374
COSC 6374 Parallel Computation 1st Project AssignmentEdgar Gabriel Spring 2008Edgar GabrielAbout the Project A sequential code performing typical image analysis tasks Code provided by Shishir Shah Input file: a flat image ( no compression ) 1
U. Houston - CS - 6360
COSC 6360: Operating Systems MATERIALS ON THE SECOND SPRING 2009 MIDTERMYou are responsible for the materials discussed in class as they are summarized in the handouts and/or mentioned in the PowerPoint presentations. I expect you to understand thes
U. Houston - CS - 4330
COSC 4330 Fundamentals of Operating Systems Assignment #1: Process SchedulingNow due on Wednesday, October 22 at 11:59:59 PMObjective This assignment will introduce you to process scheduling. Specifications You are to simulate the execution of a s
U. Houston - CS - 6360
COSC 6360: Operating Systems PAPERS ON THE FALL 2008 FINAL You are only responsible for the materials discussed in class as they are summarized in the handouts and discussed in the PowerPoint slides. I expect you to understand these summaries and to
U. Houston - CS - 6360
COSC 6360: Operating Systems MATERIALS ON THE FIRST FALL 2008 MIDTERMYou are only responsible for the materials discussed in class as they are summarized in the handouts and discussed in the PowerPoint presentations. I expect you to understand these
U. Houston - CS - 4330
CHAPTER V INTERPROCESS SYNCHRONIZATION5.1 THE CRITICAL SECTION PROBLEM Whenever two or more processes share common data (which can be stored in a file, a magnetic tape or a shared memory segment), unpredictable results are likely to happen if two
U. Houston - CS - 4330
CHAPTER IV INTERPROCESS COMMUNICATION4.1 INTRODUCTION Multiprogramming provides us with the illusion that each process runs on its own CPU (pseudo-multitasking). We can utilize it in one of the following two ways: (a) (b) completely insulate proces