Cover

IMCQ ON IMAGE ENHANCEMENT

DIGITAL IMAGE PROCESSING

MULTI CHOICE QUESTIONS

 

IMAGE ENHANCEMENT

1. Histogram is technique processed in

  1. intensity domain

  2. frequency domain

  3. spatial domain

  4. undefined domain

C

2. Sum of all components in normalized histogram is equal to

  1. 100

  2. 2

  3. 0

  4. 1

D

3. Pixel to pixel movement of center and to define neighborhood is

  1. local histogram processing

  2. equalized histogram processing

  3. normalized histogram processing

  4. global histogram processing

A

4. Local histogram processing deals with

  1. whole image

  2. slices of image

  3. center of image

  4. edges of image

B

5. Digital image with intensity levels in range [0,L-1] is called

  1. k-map

  2. histogram

  3. truth table

  4. graph

B

6. Method generating a processed image having specified histogram is called

  1. histogram enhancement

  2. histogram normalization

  3. histogram equalization

  4. histogram matching

D

7. In expression s = Tr, Tr, in range 0 = < r = < L-1 is the

  1. strictly monotonically increasing function

  2. monotonically increasing function

  3. monotonically decreasing function

  4. strictly monotonically decreasing function

A

8. PDF in histogram equalization stands for

  1. probability dual function

  2. partial density function

  3. parametric density function

  4. probability density function

D

9. Strictly monotonical function guarantee inverse mapping as

  1. dual valued

  2. single valued

  3. multi valued

  4. running sum

B

10. Probability density functions are always

  1. decreasing

  2. increasing

  3. positive

  4. negative

C

11. Image can be blurred using

  1. low pass filter

  2. contouring

  3. erosion

  4. high pass filter

A

12. Image can be sharpened using

  1. low pass filter

  2. contouring

  3. erosion

  4. high pass filter

D

13. High pass filters promotes

  1. low intensity components

  2. mid intensity components

  3. high intensity components

  4. all components

C

14. Low pass filters promotes

  1. low intensity components

  2. mid intensity components

  3. high intensity components

  4. all components

A

15. Smoothing filters are mostly used in

  1. blurring

  2. noise reduction

  3. contrast

  4. Both A and B

D

16. 1024 x 1024 image has resolution of

  1. 1048576

  2. 1148576

  3. 1248576

  4. 1348576

A

17. In MxN, M is no of

  1. intensity levels

  2. colors

  3. rows

  4. columns

C

18. Type of zooms are

  1. 8

  2. 6

  3. 4

  4. 2

D

19. DPI stands for

  1. dots per image

  2. dots per inches

  3. dots per intensity

  4. diameter per inches

B

20. In MxN, N is no of

  1. intensity levels

  2. colors

  3. rows

  4. columns

D

21. Process involved in linear spatial filtering is

  1. correlation

  2. convolution

  3. histogram equalization

  4. Both A and B

D

22. Fourier transform of unit impulse at origin is

  1. undefined

  2. infinity

  3. 1

  4. 0

C

23. Sum of cosines and sines coefficient multiplied is

  1. Fourier series

  2. Fourier transform

  3. fast Fourier series

  4. fast Fourier transform

A

24. Fourier transform's domain is

  1. frequency domain

  2. spatial domain

  3. Fourier domain

  4. time domain

A

25. Impulse has property called

  1. rotating property

  2. shifting property

  3. additive property

  4. additive inverse

B

26. A complex number is defined as

  1. c = jI

  2. c = R+jI

  3. c = R

  4. c = R+I

B

27. Name that does not relates to spatial filters

  1. spatial masks

  2. PDF

  3. kernels

  4. templates

B

28. Spatial filtering method uses

  1. low pass filter

  2. high pass filter

  3. bandpass filter

  4. spatial filter

D

29. Principle tools used in image processing for a broad spectrum of applications

  1. low pass filtering

  2. intensity filtering

  3. spatial filtering

  4. high pass filtering

C

30. Log transformation is given by formula

  1. s = clog(r)

  2. s = clog(1+r)

  3. s = clog(2+r)

  4. s = log(1+r)

B

31. In formula s = clog(1+r), r ranges

  1. r >= 0

  2. r >= 1

  3. 0 >= r

  4. 1 >= r

A

32. Giving one period of periodic convolution is called

  1. periodic convolution

  2. aperiodic convolution

  3. correlation

  4. circular convolution

D

33. Forward and inverse Fourier transforms exist for samples having values

  1. integers

  2. infinite

  3. finite

  4. discrete

C

34. Band limited function can be recovered from its samples if acquired samples are at rate twice highest frequency, this theorem is called

  1. sampling theorem

  2. sampling theorem

  3. sampling theorem

  4. sampling theorem

A

35. Any function whose Fourier transform is zero for frequencies outside finite interval is called

  1. high pass function

  2. low pass function

  3. band limited function

  4. band pass function

C

36. Sampled frequency less than nyquist rate is called

  1. under sampling

  2. over sampling

  3. critical sampling

  4. nyquist sampling

A

37. Effect caused by under sampling is called

  1. smoothing

  2. sharpening

  3. summation

  4. aliasing

D

38. Product of two functions in spatial domain is what, in frequency domain

  1. correlation

  2. convolution

  3. Fourier transform

  4. fast Fourier transform

B

39. The principle energy source for images

  1. electrical spectrum

  2. magnetic spectrum

  3. electro spectrum

  4. electro magnetic spectrum

D

40. The most energetic rays of EM energy spectrum

  1. gamma rays

  2. x-rays

  3. ultraviolet rays

  4. visible rays

A

Impressum

Tag der Veröffentlichung: 24.06.2016

Alle Rechte vorbehalten

Widmung:
tHIS BOOK IS DEDICATED TO MY GURU, MY COLLEGE AND MY LITTLE DEAR LAKSHITH NIRANJAN AND MY HUSBAND NAGARAJAN FOR THEIR SUPPORT.

Nächste Seite
Seite 1 /