UNIT-V

241. Image compression comprised of

a) Encoder

b) Decoder

c) Frames

d) Encoder and decoder

Answer: d

 242. Decoder is used for

a) Image enhancement

b) Image compression

c) Image decompression

d)Image equalization

Answer: c

243.

A codec is capable of

a) Encoding

b) Decoding

c) Framing

d) Encoding and decoding

Answer: d

244.

 Encoder is used for

a) Image enhancement

b) Image compression

c) Image decompression

d) Image equalization

Answer: b

245.

Digitizing the image intensity amplitude is called

a) Sampling

b) Quantization

c) Framing

d) Sampling and quantization

Answer: b

246.

Compressed image can be recovered back by

a)  Image enhancement

b) Image decompression

c) Image contrast

d) Image equalization

Answer: b

247.

 Digital video is sequence of

a) Pixels

b) Matrix

c) Frames

d) Coordinates

Answer: b

248

 Every run length pair introduce new

a) Pixels

b) Matrix

c) Frames

d) Intensity

Answer: d

249

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

a) Reversible

b) Irreversible

c) Temporal

d)Facsimile

Answer: a

250

 Replication of the pixels is called

a) Coding redundancy

b) Spatial redundancy

c) Temporal redundancy

d) Coding redundancy and spatial redundancy

Answer: d

251

Transforming the difference between adjacent pixels is called

a) Mapping

b) Image compression

c) Image watermarking

d) Image equalization

Answer: a

252

Image segment methods are of

a) 2 types

b) 3 types

c) 4 types

d) 5 types

Answer: b

253

 Low frequency components are passed by

a) Low pass filter

b) Band pass filter

c) High pass filter

d) Max filter

Answer: a

254

Local histogram processing deals with

a) Whole image

b) Slices of image

c) Center of image

d) Edges of image

Answer: b

256

Thresholding gradient image produces good

a) Discontinuity

b) Segmentation

c) Continuity

d) Edge detection

Answer: d

257

 Digital functions derivatives are defined as

a) Differences

b) Multiplication

c) Addition

d)Division

Answer: a

258

Ortho normal filter is developed around filter called

a) Up sampling

b) Filtering

c) Prototype

d) Digital segment filtering

Answer: d

259

Sensor strip mounted in a ring configuration is used in

a)  Microscopy

b) Medical

c) Industry

d) Radar

Answer: b

260

 The threshold used for each pixel depends on the location of the pixel in terms of the sub images, this type of thresholding is

a) optimal thresholding

b) global thresholding

c) adaptive thresholding

d) local thresholding

Answer: c

261

In geometric mean filters when alpha is equal to 1 then it works as

a)  Notch filter

b) Band pass filter

c) Wiener filter

d) Inverse filter

Answer: d

262

 First derivative approximation says that values of constant intensities must be

a) 1

b) 0

c) Positive

d) Negative

Answer: b

263

 If the inner region of the object is textured then approach we use is

a) Discontinuity

b) Similarity

c) Extraction

d) Recognition

Answer: b

264

To avoid the negative values taking absolute values in Laplacian image doubles

a) Thickness of lines

b)  Thinness of lines

c) Thickness of edges

d) Thinness of edges

Answer: a

265

Gradient magnitude images are more useful in

a) Point detection

b) Line detection

c) Area detection

d) Edge detection

Answer: d

266

 Image having gradient pixels is called

a) Sharp image

b) Blur image

c) Gradient image

d) Binary image

Answer: c

267

 In Laplacian images light shades of gray level is represented by

a) 0

b) 1

c) Positive

d) Negative

Answer: c

268

 For noise reduction we use

a) Image smoothing

b) Image contouring

c) Image enhancement

d) Image recognition

Answer: a

269

 Diagonal lines are angles at

a) 0

b) 30

c) 45

d) 90

Answer: c

270

Transition between objects and background shows

a) Ramp edges

b) Step edges

c) Sharp edges

d) Ramp edges and step edges

Answer: d

271

Horizontal lines are angles at

a) 0

b) 30

c) 45

d) 90

Answer: a

272

Standard deviation is referred to as noiseless if having the value

a) 0.1

b) 0.2

c) 0.3

d) 0.4

Answer: a

273

For edge detection we use

a)  First derivative

b) Second derivative

c) Third derivative

d) First derivative and second derivative

Answer: a

274

Erosion is referred to as

a) Reflection

b) Compression

c) Filtering

d) Decompression

Answer: c

275

Dilation is used for image

a) Expansion

b) Compression

c) Decompression

d) Translation

Answer: a

276

Two main operations of morphology are

a) Erosion

b) Dilation

c) Set theory

d) Erosion and Dilation

Answer: d

277

Reflection and translation of the image objects are based on

a) Pixels

b) Frames

c) Structuring elements

d) Coordinates

Answer: c

278

Structuring elements have origins at

a) Top left

b) Top right

c) Center

d) Bottom left

Answer: b

279

Dilation followed by erosion is called

a) Opening

b) Closing

c) Blurring

d) Translation

Answer: b

28 Tuple is referred to as

0

a) 1D vector

b) 2D vector

c) 3D vector

d) 4D vector

Answer: b

281

Reflection is applied on image's

a) x coordinate

b) y coordinate

c) z coordinate

d) x and y coordinate

Answer: d

282

 Histogram equalization make image intensity changes

a) Low

b) High

c) Visible

d) Invisible

Answer: c

283

 In the coding redundancy technique we use

a) Fixed length code

b) Variable length code

c) Byte

d) Fixed length code and variable length code

Answer: d

28  Morphology refers to

4

a)pixels

b) matrix

c) frames

d)shape

Answer: d

285

Source of information depending on finite no of outputs is called

a) Markov

b) Finite memory source

c) Zero source

d) Markov and finite memory source

Answer: d

286. __ is the difference between the actual and predicted value of that pixel.

a) New information of a pixel

b) Lossless predictive coding

c) Lossy compression

d) Lossy predictive coding

Answer: a

287. The average code word length achieved by

a)

b) H ( z )≤Lavg<H ( z )+Pmax+0. 086

c) H ( z )≤Lavg<H ( z )+Pmin+0 .096

d) H ( z )≤Lavg<H ( z )+Pmax+0. 096

Answer: b

288. The representation of gray level of m-bit gray scale image in the form of base 2 polynomial is,

a) am−1 2m−1+am−2 2m−2+. .. . .. .. . ..+a1 21+a0 20

b) am−1 22m−1+am−2 22m−2+. .. .. . .. .. .+a1 22+a0 20

c) am−1 2m−1+am−2 2m−2+. .. . .. .. . ..+a1 22+a0 21

d) am−1 22m−1+am−2 22m−2+. .. .. . .. .. .+a222+a121

Answer: a

289. __________ technique is used to remove inter pixel redundancies.

a) Bit-plane decomposition

b) Bit-plane coding

c) Arithmetic coding

d) Huffman coding

Answer: b

290. The prediction formed by a linear combination of m previous pixels is

a) Fn¿=round [∑i=2

n

α i f n−1]

b) Fn¿=round [∑i=1

m

α i f n−1]

c) Fm¿

=round [∑i=1

m

αi f m−1]

d) Fn¿=round [∑i=1

m

α i f m−1 ] Answer: b

291. A method of compressing a binary image or bit plane by using special code words to identify large areas of contiguous 1's or 0's by dividing the image in to blocks of size PXQ pixels

a. run length coding

b. contour tracing coding

c. predictive coding

d. constant area coding

Answer: d

292. A simple method of decomposing the image in to a collection of binary images to separate the m coefficients of the polynomial in to m-1 bit planes

a. Predictive code

b. Arithmetic decomposition

c. Bit plane decomposition

d. Bit plane and arithmetic decomposition

Answer: c

293. The technique for removing coding redundancy is

a. Contour coding

b. Hamming coding

c. Bit plane coding

d. Huffman coding

Answer: d

294. In most transform coding systems, the retained coefficients are selected on the basis of maximum magnitude

a. zonal coding

b. threshold coding

c. bit plane coding

d. run length coding

Answer: b

295. When the transform encoding is fixed for all sub images in a transform coding

a. lossy predictive coding

b. adaptive transform coding

c. predictive coding

d. non adaptive transform coding

Answer: d

296. In most transform coding systems, the retained coefficients are selected on the basis of maximum variance

a. run length coding

b. threshold coding

c. zonal coding

d. bit plane coding

Answer: c

297. LZW coding is

a. lossy predictive compression

b. error free compression

c. predictive compression

d. lossy compression

Answer: b

298. The compression that use image information redundancy to construct an estimate of the gray level value of an image element from values of gray levels in its neighborhood

a. predictive compression methods

b. bit plane coding methods

c. variable length coding methods

d. transform based methods

Answer: a

299. A coding technique in which a quantizer is added and redundancies of closely spaced pixels are eliminated by the difference between the actual and predicted value of that pixel [19S05]

a. bit plane coding

b. Huffman coding

c. arithmetic coding

d. lossy predictive coding

Answer: d

300. An approach based on eliminating the inter pixel redundancies of closely spaced pixels by extracting and coding the new information from the difference between the actual and predicted value of that pixel

a. run length coding

b. huffman coding

c. arithmetic coding

d. lossless predictive pixel

Answer: d