4.5.6 Representing images, sound and other data Flashcards

(47 cards)

1
Q

What is a Bitmap Image made up of?

A

Bitmap images are made up of pixels.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Define Pixel.

A

The smallest unit of an image, representing a single point with a specific colour and brightness.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is the equation for image file size?

A

image file size = colour depth x image height(px) x image width(px)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Define Analogue Data?

A

Data whose values can vary continuously and take on any value between two extremes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Define Digital Data?

A

Data whose values can vary discretely and can only take on one of a finite number of values between two extremes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Define Analogue Signals.

A

A transmission of a set of analogue data structures, that varies with time, between computational processes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Define Digital Signals.

A

A transmission of a set of digital data structures, that varies with time, between computational processes.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Define Analogue to Digital Converter (ADC).

A

An integrated circuit capable of converting continuous analogue data to discrete digital data for a computer.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Define Digital to Analogue Converter (DAC).

A

An integrated circuit capable of converting discrete digital data from a computer to continuous analogue data.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Define Bitmapped Graphics.

A

An image composed of an array of pixels each with an allocated number of bits, arranged to form an image. Also known as raster graphics.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What is the Bitmap storage requirements?

A

The amount of storage required for a bitmapped image is at least its image size x colour depth.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Define Colour Depth.

A

A measure of the amount of colour used in an image, expressed in terms of the number of bits per pixel, used to represent the colour of each pixel in an image.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is the number of colours that can be represented in a colour depth of 4? And how many bits are used?

A

2^4 = 16 colours
2^2 = 4, so 2 bits.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Define Image size.

A

The total number of pixels in an image expressed in terms of its dimensions: width in pixels x height in pixels.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Define Metadata.

A

Data related to the image file data itself. e.g width, height, colour depth

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Define Resolution.

A

A measure of the total number of pixels in an image, typically expressed in terms of the number of dots/pixels per inch.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

How do you add more colours to an image?

A

Add more bits per pixel.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Define Vector Graphics.

A

An image composed from mathematical coordinates and functions (lines and curves).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Define Sample Resolution.

A

The number of bits used to represent a single sample.

20
Q

Define Sampling Rate.

A

The numbers of samples taken per second/over a given period of time.
The frequency at which samples are taken.
On the x axis.

21
Q

Define Sound Sampling.

A

The process of converting analogue sound waves to a digital waveform, by storing a finite number of readings in binary.

22
Q

Define Audio Bit Depth.

A

The number of bits used to represent the amplitude of each audio sample, affecting the sound quality and dynamic range.
On the y axis.

23
Q

Define Amplitude.

A

The height of a sound wave, determining the loudness of the sound.

24
Q

Define Frequency.

A

The number of cycles of a sound wave per second, determining the pitch of the sound.

25
Define Event Messages.
Binary data transmitted between the MIDI device and computer processor that carries properties controlling when and how sounds are produced.
26
Define MIDI.
Musical Instrument Digital Interface is a protocol for ADC audio transmission to a digital interface used for the majority of electronic musical instruments and computers.
27
What is an Analogue to Digital Convertor used for?
Used to convert the sound waves to a digital format.
28
What does the quality of the sound conversion depend on?
- sample interval - sample resolution
29
How does the sample rate affect quality?
The sample rate allows the measurement of the frequency of a wave. The more samples the more accurate the tone is.
30
How does sample resolution affect quality?
The sample resolution allows the measurement of the amplitude of a wave. The higher the bit depth the more accurate it is.
31
Describe the process of analogue to digital conversion.
1. Microphone (sensor) detects/ measures the analogue wave. 2. The sound wave is sampled at regular intervals. 3. For each sample the amplitude is measured. 4. This is converted into discrete binary values. 5. The values are stored in a sound file.
32
Define Sampling Error.
When the sample of the amplitude is incorrect.
33
Define Lossy Compression.
A compression algorithm that removes non-essential data from a file leading to a noticeable decrease in accuracy of the data. Data lost is non-recoverable.
34
Define Lossless Compression.
A compression algorithm that retains all the data in the file by only storing the instructions needed to reconstruct the original file. No data is lost.
35
Define Dictionary - Based Coding.
A type of lossless compression where text is searched for entries that match the entries in a dictionary. Entries are substituted by a unique code which can then be translated.
36
Define Run-Length Encoding.
A type of lossless compression where repeated occurrences of the same data (like several pixels of the same colour in an image) are stored as single data values with their counts.
37
Define Encryption.
The process of converting the original data into a form which cannot be understood by unauthorised users using an encryption algorithm.
38
Define Decryption.
The process of reversing encryption. Converting the encrypted data back into the original data using the same encryption algorithm and key.
39
Define Caesar Cipher.
A substitution cipher where each letter of plain text is substituted for another that is a fixed number of letters ahead in the alphabet, which becomes the cipher text.
40
Define Vernam Cipher.
A cipher that uses a one-time pad (a secret random key) to convert each character to cipher text by modularly adding it with the corresponding character of the key. This is impossible to decrypt without a key.
41
Define Symmetric encryption scheme.
Where the same key is used to encrypt and decrypt so the key must be shared between the sender and the receiver.
42
Define Asymmetric encryption scheme.
Where different keys (that are mathematically linked) are used to encrypt and decrypt. This means that the keys do not need to be shared. Uses public/private key. One is to encrypt and one is to decrypt.
43
Give reasons as to why the Caesar Cipher is not secure.
- it is a shift cipher, so there are only 25 possible keys - can crack by listing all the keys and solutions to find plain text - the frequency at which each character occurs can provide a clue as to which letter has been replaced with which - once you discover just one character, a shift cipher can be completely cracked as the key is found
44
Give reasons as to why the Vernam Cipher is said to be perfectly secure.
- each character is encrypted using its own key - key is chosen at random, so cipher text is also random - if the key only contains letters (english letters), there are 26 options for each character of the plain text, where n = len(word), there can be 26 ^ n no.of possible representations - if a random bitstream is used for the key, it becomes 256 ^ n possible representations - mathematically proven to be completely secure.
45
What logic gate does the Vernam Cipher use?
XOR.
46
What are the requirement for a Vernam Cipher?
- characters in the key must be truly random - key must only be used once - there must only be 2 copies of the key (sender and receiver) and must be secret - key must be destroyed after use
47
What is meant by computational security?
Ciphers that are crackable in theory but not within reasonable timeframe and current computing power use this form of security.