8.a) Image Synthesis Is The Process of Creating New Images From Some Form of Image Description

You might also like

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 3

8.a)Image synthesis is the process of creating new images from some form of image description.

The kinds of images that are typically synthesized include:


Test Patterns, Scenes with simple two dimensional geometric shapes. Image Noise, Images containing random pixel values, usually generated from specific parametrized distributions. Computer Graphics, Scenes or images based on geometric shape descriptions. Often the models are three-dimensional, but may also be two-dimensional.

Synthetic images are often used to verify the correctness of operators by applying them to known images. They are also often used for teaching purposes, as the operator output on such images is generally `clean', whereas noise and uncontrollable pixel distributions in real images make it harder to demonstrate unambiguous results. The images could be binary, gray level or color.
c) Multimedia means using many different forms of media to advertise something such as

television, radio, newspapers, magazines and the internet all at the same time.Communication is when people exchange thoughts, messages, and information. It can be exchange by speech, gestures, and by the use of writing. Multimedia an interactive presentation of speech, audio,video, graphics, and text, has become a major theme in todaysinformation technology that merges the practices of communications, computing, and information processing intoan interdisciplinary field. In recent years, there has been atremendous amount of activity in the area of multimediacommunications: applications, middleware, and networking. Avariety of techniques from various disciplines such as imageand video processing, computer vision, audio and speechprocessing, statistical pattern recognition. Components of Multimedia communication system:

Multimedia Communication System Interactive Multimedia Design Interlacing Interleaved Linear Multimedia Non-Interactive Multimedia

Nonlinear Multimedia Presentation Multimedia Latency and Bandwidth Multimedia Communication System Architecture The ability to manage dynamically the achieved QoS of each service component The possibility for users to select some resources that best meet their needs. The possibility to interact with another user whose equipment has differing characteristics. The communications network must allow any user to select the service components he/she wants: The possibility for users to join in or withdraw from a communication session according to certain policies, such as agreement of all interacting partners before admitting a new user. The possibility to set such quality of service parameters as the synchronization tolerance between the service components, the echo sensitivity, the burst sensitivity, and so on. 4.The JPEG compression algorithm is designed to compress image files created using the Joint Photographic Experts Group (JPEG) standard. JPEG files are inherently difficult to compress because of their built-in compression based on a combination of run-length and entropy coding techniques. The JPEG compression algorithm works by first unwinding this preexisting compression and then recompressing the file using an improved method that typically results in a 20-25% savings in space.The algorithm is lossless and reversible so that when the file is decompressed, the original entropy coding can be reapplied resulting in a bit for bit match with the original. JPEG have the following modes of operations : (a) Lossless mode: The image is encoded to guarantee exact recovery of every pixel of original image even though the compression ratio is lower than the lossy modes. (b) Sequential mode: It compresses the image in a single left-to-right, top-to-bottom scan. (c) Progressive mode: It compresses the image in multiple scans. When transmission time is long, the image will display from indistinct to clear appearance. (d) Hierarchical mode: Compress the image at multiple resolutions so that the lower resolution of the image can be accessed first without decompressing the whole resolution of the image.

Huffman Table

AC
Color components (Y, Cb, or Cr) 88 DCT

Zig-zag reordering

Huffman coding JPEG bit-stream

Quantizer

DC
Quantization Table

Difference Encoding

Huffman coding Huffman Table

Fig. 1 Baseline JPEG encoder

How JPEG works


The JPEG algorithms performs its compression in four phases: 1. First, the JPEG algorithms first cuts up an image in separate blocks of 88 pixels. The compression algorithm is calculated for each separate block, which explains why these blocks or groups of blocks become visible when too much compression is applied. Humans are more sensitive to changes in hue (chrominance) than changes in brightness (luminance). The JPEG algorithm is based on this difference in perception. It does not analyse RGB or CMYK color values but instead the image data are first converted to a luminance/chrominance color space, such as YUV. This allows for separate compression of these two factors. Since luminance is more important than chrominance for our visual system, the algorithm retains more of the luminance in the compressed file. 2. The next step in the compression process is to apply a Discrete Cosine Transform (DCT) for the entire block. DCT is a complex process that is let loose on each individual pixel. It replaces actual color data for each pixel for values that are relative to the average of the entire matrix that is being analysed. This operation does not compress the file, it simply replaces 88 pixel values by an 88 matrix of DCT coefficients. 3. Once this is done, the actual compression can start. First the compression software looks at the JPEG image quality the user requested (e.g. Photoshop settings like low quality, medium quality,) and calculates two tables of quantization constants, one for luminance and one for chrominance. Once these tables have been constructed, the constants from the two tables are used to quantize the DCT coefficients. Each DCT coefficient is divided by its corresponding constant in the quantization table and rounded off to the nearest integer. The result of quantizing the DCT coefficients is that smaller, unimportant coefficients will be replaced by zeros and larger coefficients will lose precision. It is this rounding-off that causes a loss in image quality. 4. The resulting data are a list of streamlined DCT coefficients. The last step in the process is to compress these coefficients using either a Huffman or arithmetic encoding scheme. Usually Huffman encoding is used. This is a second (lossless) compression that is applied.

You might also like