Documents Found!
As seen in
Less Work, Better Grades
Join
Course Hero
Access
best resources
Ace
your classes
Ace your courses with Course Hero!

Submit your homework question or assignment here:
352 Tutors are online
 
We are so confident that you will love our service, we will answer your first homework question for FREE!
*  Attach Assignment (optional):
 
Study Smarter, Score Higher
 
Document Content (unformatted)
Course Hero has millions of student submitted documents similar to the one below including study guides, homework solutions, papers, exam answer keys and textbook solutions.
REGIONS FINDING OF INTEREST IN HOME VIDEOS BASED ON CAMERA MOTION Golnaz Abdollahian and Edward J. Delp Video and Image Processing Lab School of Electrical and Computer Engineering Purdue University, West Lafayette, IN 47907, USA ABSTRACT In this paper, we propose an algorithm for identifying regions of interest (ROIs) in video, particularly for the keyframes extracted from a home video. The camera motion is introduced as a new factor that can in uence the visual saliency. The global motion parameters are used to generate location-based importance maps. These maps can be combined with other saliency maps calculated using other visual and high-level features. Here, we employed the contrast-based saliency as an important low level factor along with face detection as a high level feature in our approach. Index Terms video content analysis, regions of interest identi cation, visual saliency map, keyframes 1. INTRODUCTION Searching and browsing through stored video volumes is a time consuming task unless we have more ef cient ways of representing a video in an abstract form so that it preserves the important contents while removing the redundancy. There are several types of video summarization among which are representative frames, keyframes, and key objects. In our previous work [1], we proposed an approach to employ the intentional camera motion for temporally segmenting the home video clips and extracting the most signi cant frames, keyframes, from each subsegment. We considered the importance from the camera person s point of view while shooting the video, i.e. what a person considered important while shooting a video. From this viewpoint, camera motion is a good indicator of visual interest. In this paper, we extend the approach to the frame level in order to extract the regions of interest in the keyframes. Higher-level information can be obtained from the extracted keyframes e.g., regions of interest (ROIs) and key objects. In this paper, we propose an approach to identify the ROIs from the selected keyframes i.e. regions that capture the attention of the viewers while watching the video. Detection of these regions can be used for applications such as video adaptation to small-size screens. One of the challenges in This work was sponsored by a grant from Motorola. Address all correspondence to E. J. Delp, ace@ecn.purdue.edu dealing with video contents on mobile devices is how to represent the video or its summary on a small size display. Summarization methods which are based on displaying the video hierarchical trees and storyboards may not be suitable for limited display sizes. Therefore, being able to browse within a frame or zoom into video frames and watch a cropped version of video without loss of important features is an attractive task in mobile video management. Identifying the regions of interest helps to model the information structure within the frames and generate the browsing paths [2]. There has been a great deal of research on identifying the regions of interest in still images [3, 4]. Several factors such as contrast, size, shape, faces, foreground/background and location can in uence visual attention [5]. Moreover, there have been some approaches that combine the spatial factors with motion vector elds data to determine the objects with high motion activities and use this information to identify ROIs in video [5, 6]. In this paper, we consider camera motion as another important factor that can be helpful in nding ROIs in video sequences. Based on our preliminary experiments conducted on a group of 15 people using a collection of home video clips, we observed that the direction of the camera motion has a major effect on the regions where the viewers notice the most in the sequence. For home video sequences, in which there is not much object activity, usually the intentional motion of the camera determines the story by moving around the scene or zooming in/out. Viewers have the tendency to follow this motion and particularly look for the new objects that are about to enter the camera view. We describe how to make use of this factor to generate location-based saliency maps for the extracted frames based on the global motion information of video at those frames. These maps are overlaid with contrastbased importance maps obtained by an algorithm similar to [3]. Finally, particular objects such as human faces are highlighted in the nal saliency map. The paper is organized as follows. Section 2 describes the method used to identify the saliency map based on contrast. We propose the location-based saliency calculation in Section 3. These maps are combined in Section 4. In Section 5, faces are detected and highlighted in the nal importance map. The results for some previously extracted keyframes are illustrated 1-4244-1437-7/07/$20.00 2007 IEEE IV - 545 ICIP 2007 in Section 6. Finally, concluding remarks and the ideas for our future work are discussed in 7. 2. CONTRAST-BASED SALIENCY MAP A saliency map or importance map(IM) of an image indicates how much the viewers eyes are visually attracted to different regions in that image. Studies based on eye movements and visual search have identi ed several factors that can in uence visual attention such as motion activity, contrast, size, shape, faces, foreground/background and location [5, 3]. One of the important factors that causes a region to stand out and be more noticeable is the contrast of that region compared to its neighborhood. This includes contrast in luminance and color. Ma et al. [3] use the color components in LUV space as the stimulus on perceive eld. We used a similar technique to the one described in [3] however, we employed the RGB color space to generate the contrast-based IM. Our experiments showed better results in this space compared to using UV components since it combines the luminance and color contrasts. The contrast-based saliency map is constructed as follows. First, the three-dimensional pixel vectors in RGB space are clustered into a small number of color vectors ( 32 in our experiments ) using peer group ltering method in [7]. This method suppresses color clusters in detailed regions where the human perception is less sensitive to the differences. This method can be considered as a weighted version of generalized Lloyd algorithm (GLA) for vector quantization [8] where the expressions for updating the location of cluster centroid and distortion measure are modi ed to: ci = Di = v(n)x(n) , x(n) Ci v(n) v(n) x(n) ci , x(n) Ci 2 borhood was used. Figures 1 and 2 show examples of the contrast-based saliency map for some extracted keyframes. (a) Original Keyframe (b) Quantized Image (c) Downsampled Image (d) Contrast Map Fig. 1. Example of contrast-based saliency map for an extracted keyframe. (a) Original keyframe, (b) Quantized frame,(c) Downsampled frame and (d) Saliency map. 3. LOCATION SALIENCY MAP BASED ON CAMERA MOTION Our preliminary study on a group of 15 people using a collection of home video clips showed that in addition to object motions, the direction of the camera motion has a major effect on the regions where the viewers notice the most in the sequence. Most approaches that have considered location saliency are based on the experiments on still images which have resulted in central saliency i.e. the center of the image is considered to be visually more important [5, 4, 6]. For home video sequences, in which there is not much object activity, usually the intentional motion of the camera determines the story by moving around the scene or zooming in/out. Human visual system have the tendency to follow this motion and particularly look for the new objects that are about to enter the camera view. For example, if the camera is panning towards right, the the viewers are more attracted to the right side of the scene or when the camera starts to zoom out, the attention to the borders increases. In the case of zoom-in or still camera, the location saliency is similar to the one for still pictures and the attention is more concentrated on the center of the frames. Since our strategy for selecting keyframes [1] were based on camera motion patterns, we can use the available motion information to generate the location maps for the extracted keyframe. The 3-parameter motion model was used, in which H, V and R represent horizontal, vertical and radial motion respectively and are estimated using Integral Template (1) (2) In which, ci and Di are the centroid and distortion of cluster i respectively. x(n) represents the RGB vector of each pixel and v(n) is the corresponding pixel weight which is computed in such a way that pixels in noisy regions have smaller weights than the ones in the smooth regions [7]. At each iteration, the cluster with maximum distortion value is split into two new clusters until the predetermined number of clusters is obtained. The color-quantized frame is then downsampled by a factor of n in each dimension in order to reduce the computation complexity. Here, the value of n is 10. The contrast-based saliency value for each pixel (i, j) in the downsampled image (block (i, j) in the original frame) is obtained by d(pij , q) (3) S(i, j) = q Where pij and q are the RGB pixel values and is the neighborhood of pixel (i,j). In our experiment, a 5 5 neigh- IV - 546 (a) Original Keyframe (b) Quantized Image (a) (b) (c) Downsampled Image (d) Contrast Map (c) (d) Fig. 2. Example of contrast-based saliency map for an extracted keyframe. (a) Original keyframe, (b) Quantized frame, (c) Downsampled frame and (d) Saliency map. Matching technique [9]. Three individual maps for H, V and R directions are generated (4), (5), (6) and combined to form the location saliency map (8). |j width kH 2 width 2 Fig. 3. Examples of motion-based location masks for: (a) Zoom-in or camera hold , (b) Large panning toward left, (c) Zoom-out w/ panning left and (d) Tilting down. 4. COMBINING THE SALIENCY MAPS The overall IM is generated by multiplying the corresponding pixel values of the normalized contrast-based IM (S) and location-based IM (M ap). IM = S . M ap (8) M apH (i, j) = max(0, 1 H| ) (4) M apV (i, j) = max(0, 1 |i height kV 2 height 2 V| ) (5) The values of IM are normalized to [0,1]. Examples of the generated saliency maps for several keyframes are illustrated in Section 6. 5. HIGHLIGHTING FACES IN THE SALIENCY MAP M apR (i, j) = r 1 rmax r kr rmax R 0 R < 0. (6) M ap = M apH + M apV + M apR (7) Where (i, j) is the pixel location, kH , kV and kr are constants, whose values were experimentally found to be optimum at 10, 5 and 0.5, respectively. r represents the distance of pixel from the center of the frame and rmax is its maximum value in the frame. After combining H and V maps, the peak of the map function is at (kH H, kV V ). If there is no translational motion, the map function will have peak at the center of the frame. For the radial map, M apR , the function is either decreasing or increasing as we move from the center to the borders, depending on whether the camera has a zoom-in/no-zoom or zoom-out operation. Some examples of the generated masks for various operations are shown in Figure 3. In addition to low-level visual features mentioned above, speci c objects such as faces, hands and texts can draw the viewers attention. In our system, faces are detected using the online face detection in [10]. The detected faces are highlighted in the saliency map by assigning the saliency value S = 1 to pixels inside the face regions (Figure 4) since these regions are of high semantic importance and may have been overlooked in the low-level saliency maps. (a) (b) Fig. 4. Highlighting face areas in the saliency map.(a) Original frame and (b) nal saliency map. IV - 547 6. EXPERIMENTAL RESULTS We analyzed the extracted frames from various home video sequences, in particular, keyframes obtained in [1], using our algorithm. Some examples are illustrated in Figure 5. In the rst row, the camera is panning towards the right and the motion parameters are H = 10, V = 0, R = 0. The nal saliency map is brighter at the right side of the frame, which indicates more importance. The second keyframe (second row in Figure 5) is extracted after a large zoom-out (H = 0, V = 0, R = 4) so the map shows an emphasis on borders of the frames. The last example is a selected frame after a zoom-in (H = 0, V = 0, R = 3) so the attention is concentrated at the center of the frame. Our preliminary experiments were done in a way that when we played the video clips for the viewers, they indicated what captures their attention the most in every view. The selected videos did not contain a great amount of object activities. We observed high correlation between the generated saliency and the user indicated areas. contrast-based saliency map is attained. Then, the global motion parameters are used to generate the location-based masks for each extracted frame. These masks are correlated with the initially obtained contrast images. Finally, the faces are detected and highlighted in the nal maps. The results based on our experiments are promising. As future work, we will conduct more user studies for objective evaluation of our approach. Moreover, we would like to examine other important factors in attracting human visual attention in video. 8. REFERENCES [1] G. Abdollahian and E. J. Delp, Analysis of unstructured video based on camera motion, Proceedings of SPIE International Conference on Multimedia Content Access: Algorithms and Systems, San Jose, California, January 2007. [2] X. Xie, H. Liu, W. Ma, and H. Zhang, Browsing large pictures under limited display sizes, IEEE Transactions on Multimedia, vol. 8, no. 4, pp. 707 715, August 2006. [3] Y.-F. Ma and H.-J. Zhang, Contrast-based image attention analysis by using fuzzy growing, Proceedings of the eleventh ACM international conference on Multimedia, 2003, pp. 374 381. (a) (b) [4] F. Liu and M. Gleicher, Automatic image retargeting with sheye-view warping, Proceedings of ACM UIST, October 2005, pp. 153 162. [5] W. Osberger and A. Rohaly, Automatic detection of regions of interest in complex video sequences, Proceeding of SPIE, Human Vision and Electronic Imaging VI, vol. 4299, Bellingham, USA, 2001, pp. 361 372. (a) (b) [6] Y. Hu, L.-T. Chia, and D. Rajan, Region-of-interest based image resolution adaptation for mpeg-21 digital item, Proceedings of ACM Multimedia, New York, USA, October 2004. [7] Y. Deng, M. M. C. Kenney, and B. Manjunath, Peer group ltering and perceptual color image quantization, IEEE International Symposium on Circuits and Systems, vol. 4, pp. 21 24, 1999. [8] R. M. Gray, Vector quantization, IEEE ASSP Magazine, vol. 1, no. 2, pp. 4 29, April 1984. [9] D. Lan, Y. Ma, and H. Zhang, A novel motion-based representation for video mining, Proceedings of IEEE International Conference on Multimedia and Expo, Baltimore,Maryland, July 2003. [10] Pittsburgh pattern recognition, demonstration: Face detection in photographs. [Online]. Available: http://demo.pittpatt.com/ (a) (b) Fig. 5. Examples of saliency maps for extracted keyframes: (a) Original frames and (b) Saliency maps. 7. CONCLUSION AND FUTURE WORK In this paper, we proposed a method for generating saliency maps for frames extracted from a video sequence. The camera motion has been used as an important factor that can affect the location of regions of interest in a video. First, a IV - 548
Textbooks related to the document above:
Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more. Course Hero has millions of course related materials that will enable you to learn better, faster and get an A in all your courses.
Below is a small sample set of documents:

Berkeley >> ICIP >> 2007 (Fall, 2009)
DETECTION OF WIPES AND DIGITAL VIDEO EFFECTS BASED ON A PATTERN-INDEPENDENT MODEL OF IMAGE BOUNDARY LINE CHARACTERISTICS Kota Iwamoto and Kyoji Hirata Common Platform Software Research Laboratories, NEC Corporation ABSTRACT This paper proposes detect...
Berkeley >> ICIP >> 2007 (Fall, 2009)
DISTANCECUT: INTERACTIVE SEGMENTATION AND MATTING OF IMAGES AND VIDEOS Xue Bai and Guillermo Sapiro Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN 55455 baixx015@umn.edu , guille@umn.edu ABSTRACT An interactive algorith...
Berkeley >> ICIP >> 2007 (Fall, 2009)
MICROCALCIFICATION CLASSIFICATION ASSISTED BY CONTENT-BASED IMAGE RETRIEVAL FOR BREAST CANCER DIAGNOSIS Yongyi Yanga , Liyang Weib , and Roberts M. Nishikawac Dept. of Electrical and Computer Engineering, b Dept. of Biomedical Engineering, Illinois I...
Berkeley >> ICIP >> 2007 (Fall, 2009)
COLOR DEMOSAICKING USING DIRECTION CATEGORIZATION Carman K. M. Yuk, Oscar C. Au, Richard Y.M. Li, Sui-Yuk Lam Department of Electronic and Computer Engineering The Hong Kong University of Science and Technology E-mail: {yukkaman, eeau, ymli, sylace@u...
Berkeley >> ICIP >> 2007 (Fall, 2009)
IMAGE RECOGNITION FOR MOBILE APPLICATIONS Jimmy Addison Lee and Kin Choong Yow Nanyang Technological University, Singapore School of Computer Engineering Block N4, Nanyang Avenue, Singapore 639798 ABSTRACT Our paper presents a system for efcient reco...
Berkeley >> ICIP >> 2007 (Fall, 2009)
POLARIMETRIC AZIMUTHAL SPECTRAL HISTOGRAM EXPOSES TYPES OF MIXED SCATTERERS AND THE CAUSE FOR UNEXPECTED POLARIMETRIC AVERAGES Svetlana Bachmann 1, 2, 3, Dusan Zrnic 1, Victor DeBrunner 4 2 National Severe Storm Laboratory, Norman, OK Cooperative ...
Berkeley >> ICIP >> 2007 (Fall, 2009)
IMAGE-BASED COLOR SCHEMES Bryan S. Morse1 , Daniel Thornton1 , Qing Xia1 , and John Uibel2 1 Department Brigham Young University of Computer Science 2 Center for Instructional Design Provo, UT 84602 ABSTRACT This paper presents a novel method for g...
Berkeley >> ICIP >> 2007 (Fall, 2009)
GRAPH THEORETICAL OPTIMIZATION OF PREDICTION STRUCTURE IN MULTIVIEW VIDEO CODING Je-Won Kang , Suk-Hee Cho , Nam-Ho Hur , Chang-Su Kim , Sang-Uk Lee Signal Processing Lab., School of Electrical Engineering and INMC, Seoul National University, Korea ...
Berkeley >> ICIP >> 2007 (Fall, 2009)
ON THE RESOLUTION LIMITS OF SUPERIMPOSED PROJECTION Niranjan Damera-Venkata and Nelson L. Chang Imaging Technology Department, Hewlett-Packard Labs, Palo Alto CA 94304 USA {niranjan.damera-venkata | nelson.chang} @ hp.com ABSTRACT Multi-projector sup...
Berkeley >> EE >> 122 (Spring, 2006)
Example Questions for Final (EE122, Fall 2003) 1. Question 1 (a) What is the goal of Fair Queueing? (b) Assume a link of capacity 10 Mbps that is traversed by four flows with arrival rates of 6, 4, 2, and 1 Mbps, respectively. Compute the fair rate ...
Berkeley >> EE >> 122 (Spring, 2006)
Introduction tcpdump Tutorial EE122 Fall 2006 Dilip Antony Joseph, Vern Paxson, Sukun Kim Popular network debugging tool Used to intercept and display packets transmitted/received on a network Filters used to restrict analysis to packets of inter...
Berkeley >> EE >> 122 (Spring, 2006)
Announcements No lecture this Weds, Nov 22 My office hours Weds Nov 22 are by request: i.e., send email in advance (dont be shy!) Securing Communication: Cryptography EE 122: Intro to Communication Networks Fall 2006 (MW 4-5:30 in Donner 155) Ne...
Berkeley >> EE >> 122 (Spring, 2006)
Announcements EECS 122: Introduction to Computer Networks Multicast and Overlay Networks Ion Stoica (and Brighten Godfrey) TAs: Lucian Popa, David Zats and Ganesh Ananthanarayanan http:/inst.eecs.berkeley.edu/~ee122/ Materials with thanks to Vern Pax...
Berkeley >> EE >> 122 (Spring, 2006)
Announcements Be sure to look over & comprehend the TCP congestion control pseudo-code sent to the mailing list Including small fix sent subsequently TCP Performance EE 122: Intro to Communication Networks Fall 2007 (WF 4-5:30 in Cory 277) Remin...
Berkeley >> EE >> 122 (Spring, 2006)
Example Questions for Midterm (EE122, Fall 2003) 1. Question 1 Layering is a key design principle in computer networks. Name two advantages, and one disadvantage of layering. Explain. Use no more than three sentences to describe each advantage or dis...
Berkeley >> EE >> 128 (Fall, 2008)
Discussion4:RootLocusExample Figure1:Initialpoleandzerolocations Rule1: Givenpoles@s=1,3,4+j,4jandzeros@s=2+j,2j So 1and 3. Rule2: Realaxisonrootlocusonlybetweenpolesat Rule3: 4 2 2,so 90 4 4 90 ): 135 Rule4: Angleofdeparturefortoppole( ...
Berkeley >> EE >> 128 (Fall, 2008)
LinearizationExample: Inthefollowingdiagram,wehaveaballofmass swingingonamassless,perfectlyrigidrod oflength .Theballisattachedbyaspringtoamasslessandfrictionlesscart,whoseonly purposeistokeepthespringhorizontalwiththeball.Thereisatorqueinput applied...
Berkeley >> EE >> 128 (Fall, 2008)
EE128 - FALL 2005 MIDTERM REVIEW NOTES ANIL ASWANI 1. Introduction These notes cover some important topics for the midterm. It is not meant to be a substitute for doing the readings from the textbook, nor is it meant to be an exhaustive list of all ...
Berkeley >> EE >> 128 (Fall, 2008)
EE128 Fall 2008 University of California, Berkeley MagLev Rev. 1.1 Lab4:MagneticLevitation I.Objective Thegoalofthisprojectistodesignananalogcontrollerforthesystemshowninfigure1.We wanttodesignananalogcompensatorsuchthattheDCgainis1A/1mmandthephas...
Berkeley >> EE >> 128 (Fall, 2008)
7-0 IEEC.S J2f5 LECTURE NOTES f I GOALS: . C-CTvv1fQ.VL T!CJ T~ vUl~ SS eAt in J-,o dvu CL \\.ftv. m a. J, ; X -tKf O\'YIUl\'h ~ . haw fa crrwlpvlL eAt? 7-f Ve-j r!: of (i) A set oj va.via.bles /1IIAdu-L (\'j ) iYl a moNL a.?~:; J\'...
Berkeley >> EE >> 128 (Fall, 2008)
Lab 7: Introduction to Microcontrollers 1 Microcontroller Advantages Microcontrollers are widely used in todays control systems for the following reasons: Design and Simulation Because you are programming with software, detailed simulations may ...
Berkeley >> CS >> 164 (Fall, 2008)
Lecture 3: Finite Automata Administrivia Classical Pattern-Matching Implementation For compilers, can generally make do with classical regular expressions. Log into your class account ASAP (I still have account forms). Start forming teams: Choo...
Berkeley >> CS >> 164 (Fall, 2008)
Lecture 6: Top-Down Parsing Administrivia Beating Grammars into Programs A grammar looks like a recursive program. Sometimes it works to treat it that way. Need teams! Project #1 will be posted (late) tomorrow (homework, too). Due 27 Feb. Assu...
Berkeley >> CS >> 164 (Fall, 2008)
Lecture Outline Memory Hierarchy Management Register Allocation Lecture 21 Register Allocation Register interference graph Graph coloring heuristics Spilling Cache Management Prof. Necula CS 164 1 Prof. Necula CS 164 2 The Memory Hierarch...
Berkeley >> CS >> 164 (Fall, 2008)
Lecture 1: Course Introduction CS164: Programming Languages and Compilers P. N. Hilfinger, 787 Soda Spring 2009 Administrivia All course information, readings, and documentation is online from the course web page (constantly under construction). R...
Berkeley >> CS >> 164 (Fall, 2008)
Introduction to Parsing Lecture 5 Prof. Necula CS 164 1 Outline Limitations of regular languages Parser overview Context-free grammars (CFGs) Derivations Prof. Necula CS 164 2 1 Languages and Automata Formal languages are very important i...
Berkeley >> CS >> 164 (Fall, 2008)
Functional MiniJava, Calling variations Lecture 18 Prof. Fateman CS 164 Lecture 18 1 When to do assignments DID YOU START ON ASSIGNMENT 6 YET? Prof. Fateman CS 164 Lecture 18 2 Why have a functional language Silly examples from Scheme (defin...
Berkeley >> CS >> 164 (Fall, 2008)
Language definition by interpreter Lecture 14 Prof. Fateman CS 164 Lecture 14 1 Routes to defining a language Formal mathematics Context free grammar for syntax Mathematical semantics (axioms, theorems, proofs) Rarely used alone (the downfal...
Berkeley >> CS >> 61 (Fall, 2004)
CS61B Lecture #24 Administrative: largest. Priority Queues, Heaps Priority queue: defined by operations add, find largest, remove Examples: scheduling long streams of actions to occur at various future times. Midterm graded: Intended average: 2...
Berkeley >> CS >> 61 (Fall, 2004)
CS61B Lecture #27 Today: Sorting, continued Idea: Quicksort: Speed through Probability Quicksort Selection Distribution counting Radix sorts Repeat recursively on the high and low pieces. on the whole thing. Partition data into pieces: ever...
Berkeley >> CS >> 61 (Fall, 2004)
CS61B Lecture #5: Arrays and Objects For faster response, please send urgent problems (like the lab files dont compile) as mail to cs61b, rather than using class messages. Arrays An array is structured container whose components are length, a fix...
Berkeley >> CS >> 61 (Fall, 2004)
CS61B Lecture #11 Please report problems (missing files, malfunctions of submit, etc.) by email, not by the newsgroup, for faster service. Midterm is 9 March at 6:30PM in 10 Evans. Example: Comparable Java library provides an interface to describ...
Berkeley >> CS >> 61 (Fall, 2004)
CS61B Lecture #16 Announcements: What Are the Questions? Cost is a principal concern throughout engineering: Homework #4 was extended to tonight. not until after deadline. Auto-grader for project will run early Tuesday morning, and then Please...
Berkeley >> CS >> 61 (Fall, 2004)
CS61B Lecture #1 Labs and discussions sections start(ed) this week. Get an account (if needed) and register electronically this week Go to any sections, labs where you fit. Class web page and newsgroup set up: read them regularly! Concurrent enro...
Berkeley >> CS >> 61 (Fall, 2004)
CS61B Lecture #11: Examples: Comparable & Reader Java library provides an interface to describe Objects that have a natural order on them, such as String, Integer, BigInteger and BigDecimal: public interface Comparable { / For now, the Java 1.4 vers...
Berkeley >> CS >> 61 (Fall, 2004)
CS61B Lecture #8 Midterm tentatively scheduled for the evening of 19 October (Tuesday). Format: 2 hour, open-book. We will accommodate students with conflicts as needed; please arrange an alternative time with us the week before the exam (1115 Oct.)...
Berkeley >> CS >> 61 (Fall, 2004)
CS61B Lecture #11: Some Loose Ends and Tricks Readings: Chapters 4 and 5 of the Blue Reader for next week. Today: Wrapping up some loose ends and leaving explicit material on Java for now. Question: Have you started Project #1 yet? Loose End #1: Imp...
Berkeley >> CS >> 61 (Fall, 2004)
Lecture #39 Initial grading run Wednesday. GUI files up soon. Today: Dynamic programming and memoization. Last modified: Fri Dec 10 12:19:27 2004 CS61B: Lecture #39 1 Dynamic Programming A puzzle (D. Garcia): Start with a list with an even n...
Berkeley >> CS >> 61 (Fall, 2004)
CS61B Lecture #25 Today: Priority queues (Data Structures 6.4, 6.5) Range queries (6.2) Java utilities: SortedSet, Map, etc. Next topic: Hashing (Data Structures Chapter 7). Last modified: Mon Oct 27 15:26:35 2008 CS61B: Lecture #25 1 Priorit...
Berkeley >> CS >> 61 (Fall, 2004)
CS61B, Spring 2006 Project #1: Puzzle Solver (Full Version) P. N. Hilnger Due: 1 March 2006 at midnight (beginning of 2 March) 1 Background Youve probably seen those puzzles in which you are given clues such as The plumber lives in the green ho...
Berkeley >> CS >> 61 (Fall, 2004)
Boxes and Arrows There are two kinds of variables in Java: those that store primitive values and those that store references. Primitive values are values of type long, int, short, char, byte, boolean, double, and oat. References are used to access ob...
Berkeley >> CS >> 61 (Fall, 2004)
CS61B Lecture #23 Today: Java support for generic programming Readings for today: on Java chapter 5. Head First Java chapter 16, Assorted Readings Next topic: Data Structures into Java 6.2, 6.4, 6.5. Last modified: Mon Mar 13 13:51:44 2006 CS61B...
Berkeley >> CS >> 61 (Fall, 2004)
CS61B Lecture #19 Administrative: Simple Banking I: Accounts Problem: Want a simple banking system. Can look up accounts by name or number, deposit or withdraw, print. Account Structure class Account { Account (String name, String number, int init) ...
Berkeley >> CS >> 61 (Fall, 2004)
CS61B Lecture #23 Today: Ranges So far, have looked for specific items But for BSTs, need an ordering anyway, and can also support looking for ranges of values. Example: perform some action on all values in a BST that are within some range (in na...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 11 October 2 Lecturer: Anant Sahai Scribe: Kristen Woyach This lecture covers the layered deterministic model of relays, specically a proof that in such networks it is possible to approach the...
Berkeley >> EE >> 290 (Spring, 2004)
Fall 2008 EECS 290S: Network Information Flow Instructors: Anant Sahai, 267 Cory (oce hours in 258 Cory), sahai@eecs. Oce hours: Mon 4-5pm and Tue 2:30-3:30pm David Tse, 257 Cory (enter through 253 Cory), dtse@eecs. Oce hours: Tue 10-11, and Wed 9:30...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 19 November 4 Lecturer: Anant Sahai and David Tse Scribe: Sudeep Kamath 19.1 Overview of the lecture This lecture shall cover The Converse for the Gaussian Broadcast Channel Cutset bound f...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 26 December 2 Lecturer: Anant Sahai and David Tse Scribe: I-Hsiang Wang The symmetric Gaussian interference channel is depicted in Figure ? (a), and the corresponding linear deterministic dete...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 5 September 16 Lecturer: Anant Sahai Scribe: Nebojsa Milosavljevic 5.1 Cyclic graphs Figure 5.1. Cyclic graph. Figure 5.1 represents a cyclic graph. Note that R = min mincut = 3 because the...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 27 December 4 Lecturer: Anant Sahai and David Tse Scribe: I-Hsiang Wang Recap: For deterministic interference channel, sum capacity Csum = min{max(2m, 2(n m), 2n m} z1 x1 b b x2 a + z2 (a) ...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 15 Nov 6, 2008 Lecturer: Anant Sahai and David Tse Scribe: Pulkit Grover 15.1 The relay channel The relay channel is a communication channel with a sender and a receiver aided in communicati...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 6 September 18 Lecturer: Anant Sahai Scribe: Barlas Ouz g 6.1 Cyclic Networks with LTI codes In Figure 7.1, we see a model of a node in a graph. We want to look at each outgoing edge. Each e...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Anant Sahai David Tse Logistics Anant Sahai: 267 Cory (office hours in 258 Cory), sahai@eecs. Office hours: Mon 4-5pm and Tue 2:30-3:30pm. David Tse, 257 Cory (enter through 253 Cory), dtse@eecs. Office hours: T...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 2 September 2 Lecturer: Anant Sahai and David Tse Scribe: Naveen Goela 2.1 Single Source Single Destination Network Main Topic: Graph theory establishes a max-ow min-cut bound for single-sou...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 7 September 23 Lecturer: David Tse Scribe: Vinayak Nagpal 7.1 Motivation Previously covered: Max Flow = Min Cut for single source single destination acyclic network. Max Flow= Min Cut for ...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 3 September 4 Lecturer: Anant Sahai and David Tse Scribe: Alistair N. Boettiger Recap max ow = min cut. Proved last time. Showed a greedy algorithm that achieves this through path augmentati...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 25 November 25 Lecturer: David Tse Scribe: Alistair N. Boettiger 25.1 Interference Relay Channel: superposition but no interference. The destination is interested in all information sources....
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 14 October 14 Lecturer: David Tse Scribe: Igor Ganichev Before we consentrated on the case of single source multiple destinations. We rst looked at the wireline model then at linear determinis...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 24 November 20 Lecturer: Anant Sahai and David Tse Scribe: Amin Aminzadeh Gohari 24.1 Review Recall that in the previous lecture, we considered a layered Gaussian relay network (such as the ...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 10 October 7 Lecturer: Anant Sahai Scribe: Mohammad A. Maddah-Ali 10.1 Outline The linear deterministic network models are simplied abstractions that try to capture the essential broadcast a...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 4 September 11 Lecturer: Anant Sahai Scribe: Sameer Pawar 4.1 Jaggi et.al algorithm for Direct Acyclic Graphs (DAGs) In this lecture we will show how Jaggis algorithm works by rst executing ...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 9 September 30 Lecturer: David Tse Scribe: I-Hsiang Wang 9.1 Recap: Binary Expansion Model See prior lecture notes. 9.1.1 Deterministic Relay Channel (a) (b) (c) Figure 9.1. Channel Mo...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 12 October 9 Lecturer: Anant Sahai Scribe: Gireeja Ranade 12.1 12.1.1 Linear Deterministic Models of Relays Recap Weve looked at linear deterministic models of relays with one source and on...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 21 Nov 6, 2008 Lecturer: Anant Sahai and David Tse Scribe: Pulkit Grover 21.1 Gaussian relay channels Rdecf wd = max min{I(X; Yr |Xr ), I(X, Xr ; Y )}, p(x)p(Xr ) In the last lecture we saw ...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 0 October Lecturer: Anant Sahai and David Tse Scribe: For you to do 0.1 Homework 1 Theorem 0.1. If g(1 , 2 , . . . , k ) is a polynomial in s with coecients not all zero from a eld F , then ...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 15 October 16 Lecturer: David Tse Scribe: Igor Ganichev Before we consentrated on the case of single source multiple destinations. We rst looked at the wireline model then at linear determinis...
Berkeley >> EE >> 290 (Spring, 2004)
EECS 290S: Network Information Flow Fall 2008 Lecture 4 September 9 Lecturer: Anant Sahai and David Tse Scribe: Jorge Ortiz 4.1 Existence of Network Codes Figure 4.1. Standard buttery graph. Shows a network code as a function of . In this sect...
Berkeley >> EE >> 290 (Spring, 2004)
...
Berkeley >> EE >> 42 (Fall, 2009)
Lecture 16 Today we will Learn how to solve diode circuits Become proficient in the application of the different diode I-V models Gain experience guessing the correct diode mode for faster analysis Notes on Use of Models Most of the diode models are...
Berkeley >> EE >> 42 (Fall, 2009)
EECS 42 Intro. electronics for CS Spring 2003 Lecture 9: 02/26/03 A.R. Neureuther Version Date 02/23/03 EECS 42 Intro. electronics for CS Spring 2003 Lecture 9: 02/26/03 A.R. Neureuther Version Date 02/23/03 EECS 42 Introduction to Electronics fo...
What are you waiting for?