Search for question
Question

Intelligent Signal Processing Coursework for midterm Introduction The midterm coursework for Intelligent Signal Processing consists of a series of four individual exercises. These exercises cover the first five topics of the course: Digitising, representing, and storing audio signals - Editing and processing digital audio - - Frequency domain representations Extracting features from audio signals Speech recognition. The exercises are strongly based on the subjects covered during the course, but also invite the student for further investigation. It is recommended that the students carefully read all the sections of this document, both to ensure a good understanding of the coursework exercises, in addition to knowing what to submit. Exercise 1 Description The goal of this exercise is to create a web-based audio application using p5.js and its library p5.sound that processes a pre-recorded sound file, sending the processed audio signal to the computer's speakers or audio output. Optionally, the user could also record the processed audio signal as a digital audio file on the computer's drive. The application should include the following effects: low-pass filter, waveshaper distortion, dynamic compressor, reverb and master volume. skip skip pause play stop to start to end loop record low-pass filter dynamic compressor master volume cutoff frequency resonance attack knee release dry/wet output level ratio threshold reverb reverb duration decay rate dry/wet output level waveshaper distortion distortion amount oversample spectrum in reverse о dry/wet output level output dry/wet level 口 spectrum out Figure 1. Schema of the GUI of the application. Sound File Low Pass Filter Waveshaper Distortion Dynamic Compressor Reverb Master Volume Figure 2. Internal signal flow of the application. Regarding the pre-recorded sound file, you should record in Audacity these two lines from the poem If by Rudyard Kipling: If you can dream – and not make dreams your master; - If you can think - and not make thoughts your aim; The audio must be recorded at an optimal recording level without clipping. The recording must also be edited in Audacity, in order to remove possible silences at the beginning and end of the file. Finally, the recording must be normalised and saved as a WAV format, at 48 kHz and 24-bits. The functionality of the application should meet the following requirements: 1. The application should include the playback controls and effects controls shown in Image 1. 2. Internally, the effects must be connected in a chain, as shown in Image 2. 3. The application should include a Record button that allows the user to start/stop recording the processed signal as a WAV file. 4. The application must display both the spectrum of the original sound and the spectrum of the processed sound. Ideas for further development: 1. Enhance the filter effect by adding a type selector that allows the user to select between a low-pass, high-pass or band-pass filter. 2. Allow the user to select between the live microphone input and the pre-recorded audio file as the audio source for the application. 3. Configure a delay audio effect and add this to the audio chain before the dynamic compressor. List of deliverables For Exercise 1, you should submit in a ZIP file: • The source code of the application exercise 1. • • • • A link to the application running in a web page using the Coursera static web page function. A screencast recording demonstrating that the application meets all the requirements and shows implementation of the further developments (maximum length of two minutes). A link to the application running in a web page using the Coursera static web page function. A written report in PDF format, approximately 500 words. This report must include: A brief description of the processes of audio recording, editing, processing and saving in Audacity. This section must include at least two screenshots of Audacity showing both the original recorded voice, and the recorded voice after editing and normalising it. о о Marking criteria A brief description of the main characteristics of each effect and how they have been programmed. A brief analysis of the application discussing how the low-pass filter and the master volume effects affect the sound's spectrum. This should also be illustrated through screenshots. A brief description of the further development implemented. The screencast recording has a maximum length of two minutes, and it demonstrates that the application meets all the requirements and shows the further developments implemented. The sound file has been satisfactorily recorded, edited, processed and saved. Done? Marks 1 1 The application includes the requested playback controls, and these have been satisfactorily implemented. In particular, the Record button allows the user to record the processed audio signal in WAV format. 1 The effects have been connected in a chain. The chain is functioning properly, and the user can listen to the processed audio signal. 1 The filters have been correctly configured, and include the requested controls. 1 The written report includes a brief description of the processes of audio recording, editing, processing and saving in Audacity. 1 The written report includes a brief description of the main characteristics of each effect and how they have been programmed. 1 The written report includes a brief analysis of the application discussing how the low-pass filter and the master volume effects affect the sound's spectrum. The application includes further development. Total 1 2 10 Exercise 2 Description A famous DJ has contacted you to develop an interactive web-based application for visualising his music during its concerts. The application must be based on p5.js, p5.speech and the JavaScript audio feature extraction library Meyda. Task 1 First, to evaluate your skills, you are asked to perform the following task. The DJ sends you three sounds (Ex2_sound1.wav, Ex2_sound2.wav and Ex2_sound3.wav) and you have to select Meyda audio features that could help represent these sounds visually in an appropriate manner. For example, if the 'brightness' of one of the sounds radically changes over time, to select an audio feature that measures the brightness of this sound could be a good choice from a perspective of producing visual impact. To perform Task 1, you have to fill in the following table. You have to select three Meyda audio features for each sound and justify your selections. Sound 1 Sound 2 Meyda audio features Justification Sound 3 Task 2 The second task consists of creating the aforementioned web-based application for audio visualisation. The application (exercise 2) will use the song Kalte_Ohren_(_Remix_).mp3 (*) as an audio source. Figure 3. Idea for the audio visualisation application. You could use the image of Figure 3 as an inspiration. The visual variables could include: 1. Number of rectangles. 2. Rectangle size. 3. Rectangle fill colour. 4. Rectangle border size. 5. Rectangle border colour. 6. Rectangle fill colour opacity. 7. Rectangle border opacity. 8. Rectangle rotation. 9. Background colour. You have the full freedom to choose which audio features to use and how to map them to the visual variables.


Most Viewed Questions Of Java

Ques 6 Your goal is to navigate a robot out of a maze. The robot starts in the center of the maze facing north. You can turn the robot to face north, east, south, or west. You can direct the robot to move forward a certain distance although it will stop after hitting a wall. a) Formulate this problem. This means you will have to describe initial state, goal test,successor function. and cost function. Successor function is a description of the robots successive actions after the initial state. We’ll define the coordinate system so that the center of the maze is at (0, 0), and the maze itself is a square from (-1,–1) to (1, 1)


5. (P31,In modern packet-switched networks, including the Internet, the source host segments long, application layer messages (for example, an image or a music file) into smaller packets and sends the packets into the network. The receiver then reassembles the packets back into the original message. We refer to this process as message segmentation. The figure below illustrates the end-to-end transport of a message with and without message segmentation. Consider a message that is 8 * 106 bits long that is to be sent from source to destination in the figure. Suppose each link in the figure is 2 Mbps. Ignore propagation, queuing, and processing delays. (a) Consider sending the message from source to destination without message segmentation. How long does it take to move the message from the source host to the first packet switch? Keeping in mind that each switch uses store-and-forward packet switching, what is the total time to move the message from source host to destination host? Now suppose that the message is segmented into 800 packets, with each packet being 10,000 bits long. How long does it take to move the first packet from source host to the first switch? When the first packet is being sent from the first switch to the second switch, the second packet is being sent from the source host to the first switch. At what time will the second packet be fully received at the first switch? c) How long does it take to move the file from source host to destination host when message segmentation is used? Compare this result with your answer in part (a) and comment. ) In addition to reducing delay, what are reasons to use message segmentation? e) Discuss the drawbacks of message segmentation. In addition to reducing delay, what are reasons to use message segmentation? -Discuss the drawbacks of message segmentation.


. [10 points]Suppose a process in the Host C has a UDP socket with port number 6789. Suppose both Host A and Host B each send a UDP segment to Host C with destination port number 6789. Will both of these segments be directed to the same socket at Host C? If so, how will the process at Host C know that these two segments originated from two different hosts?


A particular system is controlled by an operator through commands entered from a keyboard.The average number of commands entered in an 8-hour interval is 60. Show your work toreceive full credit. a. Suppose the CPU scans the keyboard every 100ms. How many times will the keyboard bechecked in an 8-hour period? b. By what fraction would the number of CPU visits to the keyboard be reduced if interrupt-driven 1/0 were used?


22. Many CPU-scheduling algorithms are parameterized. For example, the RR algorithm requires a parameter to indicate the time slice. Multilevel feedback queues require parameters to define the number of queues, the scheduling algorithms for each queue, the criteria used to move processes between queues, and so on. These algorithms are thus really sets of algorithms (for example, the set of RR algorithms for all time slices, and so on). One set of algorithms may include another (for example, the FCFS algorithm is the RR algorithm with an infinite time quantum). What (if any) relation holds between the following pairs of algorithm sets? a. Priority and SJF b. Multilevel feedback queues and FCFS c. Priority and FCFS


23. Suppose that a CPU scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this algorithm favor I/O-bound programs and yet notpermanently starve CPU-bound programs?


1) In a computer instruction format, the instruction length is 11 bits and the size of an address field is 4 bits. Is it possible to have: 5 two-address instructions 45 one-address instructions 32 zero-address instructions using the specified format? Justify your answer. b) Assume that a computer architect has already designed 6 two-address and 24 zero address instructions using the instruction format above. What is the maximum number of one-address instructions that can be added to the instruction set?


(1) In a computer system, memory operations currently take up 30% of execution time. A new gadget called a cache (i.e. an L1 cache) speeds-up 80% of the memory operations by a factor of 4. What is the speed-up due to the cache? ) [5] A second new gadget called an L2 cache speeds-up half the remaining20% of the memory operations by a factor of 2. What is the total speed-up with the L1 and L2 cache together?


client, and there is no other traffic on this path. Assume each packet of size L bits, and both links have the samepropagation delay dprop- (a) What is the packet inter-arrival time at the destination? That is, how much time elapses from when the lastbit of the first packet arrives until the last bit of the second packet arrives? (b) Now assume that the second link is the bottleneck link (i.e., RcjRs). Is it possible that the second packetqueues at the input queue of the second link? Explain. Now suppose that the server sends the second packetT seconds after sending the first packet. How large must T be to ensure no queuing before the second link?Explain. Consider the figure (a) below. Assume that we know the bottleneck link along the path from the server to theclient is the first link with rate Rs bits/sec. Suppose we send a pair of packets back to back from the server to the


Let a denote the rate of packets arriving at a link in packets/sec, and let µ denote the links transmission rate in packets/sec. Based on the formula for the total delay (i.e., the queuing delay plus the transmission delay) derived in the previous problem, derive a formula for the total delay in terms of a and µ. Note that the link's transmission rate in packet/sec is R/L.