Dark Mode

Recent questions tagged digital-image-processing

0 votes

0 answers

1

Digital image processing, Fourier kernel
The 2D Fourier kernels k(x,y,u,v) = e^(-j2π(ux/M + vy/N)) is - a)Separable and antisymmetric b)Symmetric but not separable c)Separable and symmetric d)Antisymmetric and not separable

subhash112 asked in Digital Image Processing Nov 22, 2022

406 views

4 votes

0 answers

2

MTech and machine learning
I am a dropper and have worked an year on machine learning in the industry. I want to do learn more about ML/AI and image processing. I am getting a rank around 200(from GO rank predictor). I am open to 2 or 3 year courses and any college is fine as long as I get to work in my field of interest and the resources are good there. What are the best options for me?

subho16 asked in IISc/IITs Feb 9, 2019

818 views

1 vote

1 answer

3

UGC NET CSE | November 2017 | Part 3 | Question: 18
The three aspects of Quantization, programmers generally concerned with are Coding error, Sampling rate and Amplification Sampling rate, Coding error and Conditioning Sampling rate, Aperture time and Coding error Aperture time, Coding error and Strobing

Arjun asked in Computer Graphics Nov 5, 2017

by Arjun

1.2k views

1 vote

2 answers

4

UGC NET CSE | August 2016 | Part 3 | Question: 60
If the histogram of an image is clustered towards origin on X-axis of a histogram plot then it indicates that the image is ______. Dark Good contrast Bright Very low contrast

makhdoom ghaya asked in Others Oct 4, 2016

by makhdoom ghaya

1.2k views

1 vote

1 answer

5

UGC NET CSE | August 2016 | Part 3 | Question: 58
Which of the following is not used in standard JPEG image compression ? Huffman coding Runlength encoding Zig-zag scan K-L Transform

makhdoom ghaya asked in Others Oct 4, 2016

by makhdoom ghaya

982 views

2 votes

3 answers

6

UGC NET CSE | June 2016 | Part 3 | Question: 58
Consider a discrete memoryless channel and assume that H(x) is the amount of information per symbol at the input of the channel; H(y) is the amount of information per symbol at the output of the channel. H(x $\mid$ y) is the amount of uncertainty remaining on x knowing y; and I( ... $\mid$ y)]; p(x) max H(x $\mid$y); p(x)

go_editor asked in Digital Signal Processing Aug 21, 2016

1.5k views

1 vote

1 answer

7

UGC NET CSE | December 2015 | Part 3 | Question: 51
Blind image disconvolution is Combination of blur identification and image restoration Combination of segmentation and classification Combination of blur and non-blur image None of the above

go_editor asked in Digital Image Processing Aug 11, 2016

1.3k views

2 votes

1 answer

8

UGC NET CSE | December 2015 | Part 3 | Question: 49
Consider the conditional entropy and mutual information for the binary symmetric channel. The input source has alphabet $X=\{0,1\}$ and associated probabilities ${\dfrac{1}{2}, \dfrac{1}{2}}$. The channel matrix is $\begin{pmatrix} 1-p & p \\ p & 1-p \end{pmatrix}$ ... : $1$ $-p \log(p)-(1-p) \log(1-p)$ $1+p \log(p)+(1-p) \log(1-p)$ $0$

go_editor asked in Digital Image Processing Aug 11, 2016

2.1k views

2 votes

1 answer

9

UGC NET CSE | December 2014 | Part 3 | Question: 66
A Butterworth lowpass filter of order $n$, with a cutoff frequency at distance $D_{0}$ from the origin, has the transfer function $H(u, v)$ given by $\frac{1}{1+\left[\frac{D(u, v)}{D_{0}}\right]^{2n}}$ ... $\frac{1}{1+\left[\frac{D_{0}}{D(u, v)}\right]^{n}}$

makhdoom ghaya asked in Digital Signal Processing Aug 2, 2016

by makhdoom ghaya

1.3k views

1 vote

1 answer

10

UGC NET CSE | December 2014 | Part 3 | Question: 65
Given a simple image of size $10 \times 10$ whose histogram models the symbol probabilities and is given by $P_{1}$ $P_{2}$ $P_{3}$ $P_{4}$ a b c d The first order estimate of image entropy is maximum when $a = 0, b = 0, c = 0, d = 1$ ... $a=\frac{1}{4}, b=\frac{1}{4}, c=\frac{1}{4}, d=\frac{1}{4}$

makhdoom ghaya asked in Digital Image Processing Aug 2, 2016

by makhdoom ghaya

2.0k views

3 votes

1 answer

11

UGC NET CSE | December 2014 | Part 3 | Question: 64
Given two spatial masks $S_{1}= \begin{bmatrix} 0&1&0 \\ 1&-4&0 \\ 0&1&0 \end{bmatrix}$ $S_{2} = \begin{bmatrix} 1&1&1 \\ 1&-8&1 \\ 1&1&1 \end{bmatrix}$ ... can be used as the spatial mask ? only $S_{1}$ only $S_{2}$ Both $S_{1}$ and $S_{2}$ None of these

makhdoom ghaya asked in Digital Signal Processing Aug 2, 2016

by makhdoom ghaya

1.8k views

3 votes

2 answers

12

UGC NET CSE | Junet 2015 | Part 3 | Question: 65
The redundancy in images stems from pixel decolleration pixel colleration pixel quantization image size

go_editor asked in Others Aug 2, 2016

1.8k views

2 votes

1 answer

13

UGC NET CSE | December 2013 | Part 3 | Question: 31
Consider the formula in image processing $R_D = 1- \frac{1}{C_R}$ where $C_R = \frac{n_1}{n_2}. \quad C_R$ is called as compression ratio $n_1$ and $n_2$ denotes the number of information carrying units in ... this situation $R_D$ is called as relative ____ of the first data set. Data Compression Data Redundancy Data Relation Data Representation

go_editor asked in Others Jul 28, 2016

903 views

1 vote

1 answer

14

UGC NET CSE | September 2013 | Part 3 | Question: 55
MPEG involves both spatial compression and temporal compression. The spatial compression is similar to JPEG and temporal compression removes _____ frames. Temporal Voice Spatial Redundant

go_editor asked in Computer Graphics Jul 24, 2016

2.4k views

3 votes

2 answers

15

UGC NET CSE | June 2013 | Part 3 | Question: 57
If f(x, y) is a digital image, then x, y and amplitude values of f are Finite Infinite Neither finite nor infinite None of the above

go_editor asked in Computer Graphics Jul 18, 2016

2.5k views

2 votes

1 answer

16

UGC NET CSE | June 2013 | Part 3 | Question: 56
The number of distinct binary images which can be generated from a given binary image of right M $\times$ N are M+N M $\times$ N 2$^{M+N}$ 2$^{MN}$

go_editor asked in Computer Graphics Jul 18, 2016

1.5k views

3 votes

1 answer

17

UGC NET CSE | June 2013 | Part 3 | Question: 31
Images tend to be very large collection of data. The size of memory required for a 1024 by 1024 image in which the color of each pixel is represented by a n-bit number, (in an 8-bit machines) is n $\times$ 8 MB n/8 MB (1024 $\times$ 1024)/8 MB 1024 MB

go_editor asked in Computer Graphics Jul 17, 2016

2.5k views

1 vote

2 answers

18

UGC NET CSE | June 2013 | Part 3 | Question: 19
An image is 1024$*$800 pixels with 3 bytes/pixel. Assume the image is uncompressed. How long does it make to transmit it over a 10 Mbps Ethernet? 196.6 seconds 19.66 seconds 1.966 seconds 0.1966 seconds

go_editor asked in Computer Graphics Jul 16, 2016

4.4k views

2 votes

2 answers

19

UGC NET CSE | June 2012 | Part 3 | Question: 22
The transform which possess the highest ‘energy compaction’ property is Slant transform Cosine transform Fourier transform Karhunen-Loeve transform

go_editor asked in Others Jul 7, 2016

2.1k views

0 votes

0 answers

20

Sanjay Sharma asked in Digital Image Processing Jun 30, 2016

by Sanjay Sharma

420 views

5 votes

3 answers

21

ISRO2015-65
Which of the following is not an image type used in $\text{MPEG}?$ $\text{A}$ frame $\text{B}$ frame $\text{D}$ frame $\text{P}$ frame

go_editor asked in Digital Image Processing Jun 21, 2016

4.8k views

5 votes

1 answer

22

ISRO2015-63
Which of the following compression algorithms is used to generate a $\textsf{.png}$ file? $\text{LZ78}$ Deflate $\text{LZW}$ Huffman

go_editor asked in Digital Image Processing Jun 20, 2016

3.8k views

4 votes

1 answer

23

ISRO2014-7
What does a pixel mask mean? string containing only $1\text{'s}$ string containing only $0\text{'s}$ string containing two $0\text{'s}$ string containing $1\text{'s}$ and $0\text{’s}$

Nijpriya Advait asked in Digital Image Processing Jun 9, 2016

by Nijpriya Advait

6.8k views

0 votes

0 answers

24

Sanjay Sharma asked in Digital Image Processing May 6, 2016

by Sanjay Sharma

305 views

7 votes

3 answers

25

ISRO-2013-10
If the frame buffer has 8 bits per pixel and 8 bits are allocated for each of the $R, G, B$ components, what would be the size of the lookup table? $24$ bytes $1024$ bytes $768$ bytes $256$ bytes

makhdoom ghaya asked in Digital Image Processing Apr 25, 2016

by makhdoom ghaya

10.0k views

0 votes

0 answers

26

UGC NET CSE | December 2012 | Part 3 | Question: 64
If the Fourier transform of the function f(x,y) is F(m,n), then the Fourier transform of the function f(2x,2y) is $\frac{1}{4} F (\frac{m}{2}, \frac{n}{2})$ $\frac{1}{4} F (2m, 2n)$ $\frac{1}{4} F (m,n)$ $\frac{1}{4} F (\frac{m}{4}, \frac{n}{4})$

Sanjay Sharma asked in Digital Image Processing Apr 13, 2016

by Sanjay Sharma

1.6k views

To see more, click for the full list of questions or popular tags.

Recent questions tagged digital-image-processing