Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 189 views

    DIP Unit 3 MCQ

    Uploaded by

    sumit singh
    The document contains a unit on image compression with multiple choice questions. It covers topics like image compression techniques including encoding, decoding, data redundancy, lossy and lossless compression formats like JPEG, PNG, and GIF. Specific compression algorithms discussed include Huffman coding and wavelets. Key concepts covered are compression ratios, resolution, quantization, and reducing file size through techniques like downsampling and run length encoding.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    DIP Unit 3 MCQ

    Uploaded by

    sumit singh
    189 views5 pages
    The document contains a unit on image compression with multiple choice questions. It covers topics like image compression techniques including encoding, decoding, data redundancy, lossy and lossless compression formats like JPEG, PNG, and GIF. Specific compression algorithms discussed include Huffman coding and wavelets. Key concepts covered are compression ratios, resolution, quantization, and reducing file size through techniques like downsampling and run length encoding.

    Original Title

    DIP unit 3 mcq

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains a unit on image compression with multiple choice questions. It covers topics like image compression techniques including encoding, decoding, data redundancy, lossy and lossless compression formats like JPEG, PNG, and GIF. Specific compression algorithms discussed include Huffman coding and wavelets. Key concepts covered are compression ratios, resolution, quantization, and reducing file size through techniques like downsampling and run length encoding.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    189 views5 pages

    DIP Unit 3 MCQ

    Uploaded by

    sumit singh
    The document contains a unit on image compression with multiple choice questions. It covers topics like image compression techniques including encoding, decoding, data redundancy, lossy and lossless compression formats like JPEG, PNG, and GIF. Specific compression algorithms discussed include Huffman coding and wavelets. Key concepts covered are compression ratios, resolution, quantization, and reducing file size through techniques like downsampling and run length encoding.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 5

    UNIT 3: IMAGE COMPRESSION

    MULTIPLE CHOICE QUESTIONS


    1. Compressed image can be recovered backby
    A. imageenhancement
    B. image decompression
    C. imagecontrast
    D. imageequalization

    2. Image compression comprised of


    A. encoder
    B. decoder
    C. frames
    D. Both A andB

    3. Information is the
    A. data
    B. Meaningfuldata
    C. rawdata
    D. Both A andB

    4. Coding redundancy works on


    A. pixels
    B. matrix
    C. Intensity
    D. coordinates

    5. Every run length pair introducenew


    A. pixels
    B. matrix
    C. frames
    D. intensity

    6. If the pixels are reconstructed without error mapping is said to be


    A. reversible
    B. irreversible
    C. temporal
    D. facsimile

    7. In the coding redundancy technique weuse


    A. fixed lengthcode
    B. variable lengthcode
    C. byte
    D. Both A andB

    8. Types of data redundancyare


    A. 1
    B. 2
    C. 3
    5|7
    D. 4

    9. Information per source iscalled


    A. sampling
    B. quantization
    C. entropy
    D. normalization

    10. Compression is done for saving


    A. storage
    B. bandwidth
    C. money
    D. Both A andB

    11. System of symbols to represent event iscalled


    A. storage
    B. word
    C. code
    D. nibble

    12. If the pixels cannot be reconstructed without error mapping is said to be


    A. reversible
    B. irreversible
    C. temporal
    D. facsimile

    13. Decoder is used for


    A. imageenhancement
    B. imagecompression
    C. image decompression
    D. imageequalization

    14. Replication of the pixels is called


    A. Coding redundancy
    B. Spatial redundancy
    C. Temporal redundancy
    D. both b andc

    15. Information ignored the human eye is the


    A. codingredundancy
    B. spatialredundancy
    C. temporalredundancy
    D. irrelevant info

    16. Information lost when expressed mathematically iscalled


    A. markov
    B. finite memorysource
    C. fidelitycriteria
    D. noiseless theorem
    5|7
    17. Error of the image is referred toas
    A. pixels
    B. matrix
    C. frames
    D. noise

    18. Formula pr = n/MN representsthe


    A. codingredundancy
    B. spatialredundancy
    C. temporalredundancy
    D. irrelevantinfo

    19. In the formula 1-(1/c), C isthe


    A. complexratio
    B. compression ratio
    C. constant
    D. condition

    20. Irrelevant data is said tobe


    A. redundantdata
    B. meaningfuldata
    C. rawdata
    D. Both A andB

    21. Reducing the data required referredto


    A. imageenhancement
    B. imagecompression
    C. imagecontrast
    D. imageequalization

    22. One that is not a type of data redundancyis


    A. coding
    B. spatial
    C. temporal
    D. facsimile

    23. Redundancy of the data can be found usingformula


    A. 1-(1/c)
    B. 1+(1/c)
    C. 1-(-1/c)
    D. (1/c)
    24. Transforming the difference between adjacent pixels is called
    A. mapping
    B. imagecompression
    C. imagewatermarking
    D. imageequalization

    25. Shannon’s theorem is alsocalled


    A. noiseless codingtheorem
    B. noisy codingtheorem
    5|7
    C. codingtheorem
    D. noiseless theorem

    26. A codec is capableof


    A. encoding
    B. decoding
    C. framing
    D. Both A andB

    27. Encoder is usedfor


    A. imageenhancement
    B. imagecompression
    C. imagedecompression
    D. imageequalization

    28. 1024 x 1024 image has resolution of


    A. 1048576
    B. 1148576
    C. 1248576
    D. 1348576

    29. No of bits to store image is denoted by theformula


    A. b =NxK
    B. b =MxN
    C. b =MxNxK
    D. b =MxK

    30. Which of the following file formats is an example of lossless compression only?
    (A) JPEG
    (B) PNG
    (C) TIFF
    (D) MNG
    Ans: B PNG

    31. Which of the following file formats is an example of lossy compression only?
    (A) GIF
    (B) PNG
    (C) JPEG
    (D) TIFF
    Ans : CJPEG

    32. Which of the following are not in a compressed format?


    JPEG
    MPEG
    Bitmap
    MP3

    5|7
    33. The basic idea behind Huffman coding is to
    A. expand data by using fewer bits to encode more frequently occuring characters
    B. compress data by using fewer bits to encode more frequently occuring characters
    C. compress data by using fewer bits to encode fewer frequently occuring characters
    D. compress data by using more bits to encode more frequently occuring characters

    34.Huffman coding is an encoding algorithm used for


    A. broadband systems
    B. lossy data compression
    C. lossless data compression
    D. files greater than 1 Mbit

    35. A Huffman encoder takes a set of characters with fixed length and produces a set of
    characters of
    A. random length
    B. variable length
    C. constant length
    D. fixed length

    36. The idea with wavelets is to represent a complicated function by


    A. lines
    B. simple basic functions
    C. square functions
    D. sinus functions

    37. Down sampling is to make a digital image file smaller by


    A. adding pixels
    B. removing noise
    C. adding noise
    D. removing pixels

    38.What is the full form of RLE ?


    (A) Run line encoder
    (B) Run length electrode
    (C) Run length encoding
    (D) None of the above
    Answer
    Correct option is C

    5|7

    You might also like