search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
1 vote
684 views

Blind image disconvolution is

  1. Combination of blur identification and image restoration
  2. Combination of segmentation and classification
  3. Combination of blur and non-blur image
  4. None of the above
in Digital Signal Processing
recategorized by
684 views

1 Answer

2 votes

Ans is A

In image processing, blind deconvolution is a deconvolution technique that permits recovery of the target scene from a single or set of "blurred" images in the presence of a poorly determined or unknown point spread function (PSF).

Answer:

Related questions

2 votes
1 answer
1
1.2k views
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}$ wgere p is the transition probability. Then ... is given by: $1$ $-p \log(p)-(1-p) \log(1-p)$ $1+p \log(p)+(1-p) \log(1-p)$ $0$
asked Aug 11, 2016 in Digital Image Processing jothee 1.2k views
2 votes
3 answers
2
864 views
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(x;y)is the information transmission. ... -H(y $\mid$ x)]; p(x) max [H(x)-H(x $\mid$ y)]; p(x) max H(x $\mid$y); p(x)
asked Aug 21, 2016 in Digital Signal Processing jothee 864 views
2 votes
1 answer
3
587 views
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(u, v)}{D_{0}}\right]^{n}}$ $\frac{1}{1+\left[\frac{D_{0}}{D(u, v)}\right]^{2n}}$ $\frac{1}{1+\left[\frac{D_{0}}{D(u, v)}\right]^{n}}$
asked Aug 2, 2016 in Digital Signal Processing makhdoom ghaya 587 views
3 votes
1 answer
4
1.2k views
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}$ The Laplacian of an image at all points $(x, y)$ can be implemented by convolving the image with spatial mask. Which of the following can be used as the spatial mask ? only $S_{1}$ only $S_{2}$ Both $S_{1}$ and $S_{2}$ None of these
asked Aug 2, 2016 in Digital Signal Processing makhdoom ghaya 1.2k views
...