数字图像处理期末复习经典.doc

遥感与数字图像处理基础知识一、名词解释：数字影像图像采样灰度量化像素数字影像：数字影像又称数字图像，即数字化的影像。

基本上是一个二维矩阵，每个点称为像元。

像元空间坐标和灰度值均已离散化，且灰度值随其点位坐标而异。

图像采样：指将在空间上连续的图像转换成离散的采样点集的操作。

灰度量化:将各个像素所含的明暗信息离散化后，用数字来表示。

像素：像素是A/D转换中的取样点，是计算机图像处理的最小单元二、填空题：1光学图像是一个连续的光密度函数。

2、数字图像是一个_离散的光密度_函数。

3、通过成像方式获取的图像是连续的，无法直接进行计算机处理。

此外，有些遥感图像是通过摄影方式获取的，保存在胶片上。

只有对这些获取的图像（或模拟图像）进行数字化后，才能产生数字图像。

数字化包括两个过程：—采样—和—量化—。

4、一般来说，采样间距越大，图像数据量_____________ 小_____ ,质量_______ 低_____ ;反之亦然。

5、一幅数字图像为8位量化，量化后的像素灰度级取值范围是________________________ 的整数。

设该数字图像为600行600列，则图像所需要的存储空间为____________________ 字节。

6、设有图像文件为200行，200列，8位量化，共7个波段，则该图像文件的大小为 ________________________三、不定项选择题：（单项或多项选择）1数字图像的_______________ 。

①空间坐标是离散的，灰度是连续的②灰度是离散的，空间坐标是连续的③两者都是连续的④两者都是离散的2、采样是对图像 _____________ 。

①取地类的样本②空间坐标离散化③灰度离散化3、量化是对图像 ____________ 。

①空间坐标离散化②灰度离散化③以上两者。

4、图像灰度量化用6比特编码时，量化等级为___________________ 。

①32个②64个③128个④256个5、数字图像的优点包括 _______________ 。

第1章 数字图像处理的基本知识1.1 连续图像如何转换为数字图像？数字图像将图像看成是许多大小相同、形状一致的像素组成。

这样，数字图像可以用二维矩阵表示。

将自然界的图像通过光学系统成像并由电子器件或系统转化为模拟图像（连续图像）信号，再由模拟/数字转化器（ADC ）得到原始的数字图像信号。

图像的数字化包括离散和量化两个主要步骤。

在空间将连续坐标过程称为离散化，而进一步将图像的幅度值（可能是灰度或色彩）整数化的过程称为量化。

1.2当对模拟图像取样时不满足取样定律将出现什么现象？从取样图像中恢复原来的图像需要满足二维的香农取样定理，否则出现失真现象。

1.3图像处理的基础、最主要的任务是什么？图像处理的基础是数学，最主要的任务就是各种算法的设计和实现。

1.4 数字图像处理主要包括哪些研究内容？1）图像变换；2）图像增强；3）图像复原； 4）图像压缩编码；5）图像分割与特征提取。

1.5 数字图像研究的三大方面：提高视觉效果、特征提取和目标识别、编码和压缩数据。

1.6 计算下面图像的平均灰度值，写出计算下面图像平均灰度值的Matlab 程序245631536262⎡⎤⎢⎥⎢⎥⎢⎥⎣⎦答：a=[2 4 5 6;3 1 5 3;6 2 6 2];average=mean2(a);运行结果，平均average=3.751.7 写出画大小为512512⨯的黑底（灰度值为0），中央有200200⨯大小白(灰度值为1)正方形图像的Matlab 程序。

答：x=zeros(512);x(256-100:256+99,256-100:256+99)=1;imshow(x)1.8 数字图像处理就是将图像转换为一个数字矩阵存放在计算机中，并采用一定的算法对其进行处理。

第2章图像处理中的常用数学变换2.1 (教材51页)用Matlab编程做出如图2.37所示图像的二维离散余弦变换(a)(b)图2.37答：% DCTa=ones(64);a(29:36,29:36)=0; % 8*8% a(29:36,31:34)=0; % 4*8f=dct2(a);figure, imshow(a,'notruesize')figure,imshow(log(abs(f)+1),'notruesize')2.2 做出对灰度图像’lenagray.bmp’进行傅里叶变换，并把直流分量平移到中央的Matlab程序，并注明每个程序的作用。

《数字图像处理》复习指南选择题I 、 采用幕次变换进行灰度变换时，当幕次取大于1时，该变换是针对如下哪一类图像进 彷曾强。

（B ）A 图像整体偏暗 B图像整体偏亮 C 图像细节淹没在暗背景中 D图像同时存在过亮和过喑背景 2、图像灰度方差说明了图像哪一个属性 （B ）A 平均灰度B 图像对比度 图像整体亮度 D 图像细节计算机显示器主要采用哪一种彩色模型（A ）A 、RGB B 、CMY 或 CMYK采用模板［-1 IIP 主要检测（A 3、4、 C 、HSI D 、HSV ）方向的边缘。

D.1350 C ） D .中值滤波 A.水平 B.450 C.垂直5、 下列算法中属于图象锐化处理的是：（ A.低通滤波 B.加权平均法 C.高通滤波6、 维纳滤波器通常用于（ C ）A^去噪 B 、减小图像动态范围7、彩色图像增强时， 型。

A. C. 8、 A. C. 9、高通滤波后的图像通常较暗，为改善这种情况，将高通滤波器的转移函数加上一常数量以便引入一些低频分量。

这样的滤波器叫（ B ）A.巴特沃斯高通滤波器B.高频提升滤波器C.高频加强滤波器D.理想高通滤波器10、图象与灰度直方图间的对应关系是（A.一一对应B.多对一C. 一对多 II 、 下列算法中属于图象锐化处理的是：（ A.低通滤波 B.加权平均法 C.高通滤波12、一幅256*256的图像,若灰度级数为16, A. 256K B.512K C. IM C.2M 13、 一幅灰度级均匀分布的图象，其灰度范围在［0, 255］,则该图象的信息量为：（D ）C 、复原图像D 、平滑图像 ）处理可以采用RGB 彩色模 B. D. 同态滤波 中值滤波直方图均衡化加权均值滤波 旦滤波器在对图像复原过程中需要计算噪声功率谱和图像功率谱。

逆滤波 B.维纳滤波约束最小二乘滤波 D.同态滤波B ） D.都不C ） D.中值滤波 则存储它所需的比特数是：（A ）a. 0b.255c.6d.814、下列算法中属于局部处理的是：(D)a.灰度线性变换b.二值化c.傅立叶变换d.中值滤波15、下列算法中属于点处理的是：(B)a.梯度锐化b.二值化c.傅立叶变换d.中值滤波16、下列算法中属于图象平滑处理的是：(C)a.梯度锐化b.直方图均衡c.中值滤波placian增强17、设灰度图中每一个像素点由1个字节表示，则可表示的灰度强度范围是(B) A. 128 B. 256 C. 36 D. 9618.对椒盐噪声抑制效果最好的是下列那种图像增强技术？(D )A低通滤波B Laplace微分C邻域平均D中值滤波19.将图像“name.tif”存储到文件中的命令(C )A、imread('name.tif') Bload C、imwrite('name.tif') D、imshow('name.tif')20.计算机显示设备使用的颜色模型是(A )A.RGBB. HSVC. CMYD.以上都不对21.下列关于直方图的叙述错误的是(D )A.描绘了各个灰度级像素在图像中出现的概率B.描述图像中不同灰度级像素出现的次数C.没有描述出像素的空间关系D.直方图均衡化不能增强图像整体对比度的效果22.锐化滤波器的主要用途不包括( B)A.突出图像中的细节增强被模糊了的细节B.超声探测成像分辨率低可以通过锐化来使图像边缘模糊C.图像识别中分割前的边缘提取D.锐化处理恢夏过度钝化、暴光不足的图像23.假设f(x,y)是一幅图像，则下列有关f(x,y)的傅里叶变换说法中不正确(C )A.在原点的傅里叶变换等于图像的平均灰度级B.一个二维傅里叶变换可以由两个连续一维的傅里叶运算得到C.图像频率域过滤可以通过卷积来实现D.傅里叶变换具有线性移不变性24.列有关图像复原和图像增强的说法错误的是(D )A.与图像增强不同，图像复原的目的是提供给用户喜欢接收的图像B.图像增强主要是一个客观过程，而图像复原主要是一个主观过程C.图像增强被认为是一种对比度拉伸，图像反原技术追求恢笈原始图像的一种近似估计值D.图像复原技术只能使用频率域滤波器实现A、box模板B、中值滤波器27、对一幅二值图像做腐蚀的结果（B ）A、图像面积放大B、图像面值缩小28、下列算法中属于局部处理的是（D ）A、灰度线性变换B、二值化C^ gauss模板C、图像面积不变C、傅里叶变换D、prewittD、图像边界变圆D、中值滤波25、下列哪一个模板可用于图像平滑（AA 、1/91/91/9B、111C、1/31/31/3D、・-1-1 1/91/91/91-811/31/31/3-18-1 1/91/91/91111/31/31/3-1-1-126、对于含有孤立线噪声的图像，既要保证图像的边缘，又要去除噪声应该用那种滤波器（B）判别正确、错误1.图像按其亮度等级的不同，可以分为二值图像和灰度图像两种。

1图像的特点:1)直观形象2)易懂3)信息量大2 图像的分类：1）按灰度分类：二值图像，多灰度图像2）按色彩分类：单色图像，动态图像3）按运动分类：静态图像，动态图像4）按时空分布分类：二维图像，三维图像3 数字图像处理的主要内容：1）图像获取2）图像变换3）图像增强4）图像复原5)图像编码6）图像分析7）图像识别8）图像理解4数字图像处理方法：1）空域法2）变换域法5什么是数字图像的采样和量化？采样：将模拟图像在空间上连续的点按照一定的规则变换成离散点的操作。

量化：由于采样图像被分割成空间上离散的像素，但其灰度是连续的，还不能用计算机进行处理，所以要对采样后的图像进行量化，即将连续的像素灰度值转换成离散的整数值的过程。

6图像像素间的邻接、连接和连通的区别？邻接：两个像素是否邻接就看它是否接触，一个像素和在它邻域中的像素是邻接的。

邻接仅仅考虑了像素间的空间关系。

连接：对两个像素，要确定它们是否连接，要考虑两点：①空间上要邻接；②灰度值要满足某个特点的相似准则第二章1 试述图像采集系统的结构及其各部分的功能？2 连续图像随机过程可以用哪些数字特征来描述？概率密度，一阶矩或平均值，二阶矩或自相关函数，自协方差，方差3 为什么说只要满足采样定理，就可以有离散图像无失真的重建元连续图像？这是由图像的连续性决定的，由图像上某一点的值可以还原出该点的一个小邻域里的值，这个图像连续性越好，这个邻域就可以越大，抽样次数可以很少就可以无失真还原。

而抽样定理对应这个邻域最小的情况即抽样次数最多的情况，大概是每周期两个样本4与标量量化相比，向量量化有哪些优势？合理地利用样本间的相关性,减少量化误差提高压缩率,5 Matlab图像处理工具箱提供了哪几类类型的数字图像？它们之间能否转换？如果可以如何转换？二进制图像，索引图像，灰度图像，多帧图像，RGB图像，它们之间可以相互转换，转换函数（23页6 数字图像的空间分辨率和采样间隔有什么联系？采样间隔是决定图像分辨率的主要参数1 FFT的基本思想是什么?？利用DFT系数的特性，合并DFT运算中的某些项，把长序列DFT变成短序列DFT，从而减少其运算量。

第一章数字图像处理概论*图像是对客观存在对象的一种相似性的、生动性的描述或写真。

*数字图像空间坐标和灰度均不连续的、用离散的数字（一般整数）表示的图像（计算机能处理）。

是图像的数字表示，像素是其最小的单位。

*数字图像处理（Digital Image Processing）利用计算机对数字图像进行（去除噪声、增强、复原、分割、特征提取、识别等）系列操作，从而获得某种预期的结果的技术。

（计算机图像处理）图像处理：【图像输入——（图像处理<增强、复原、编码、压缩等>）——图像输出）图像识别：【图像输入——（图像预处理<增强、复原>）——（图像分割）——（特征提取）——（图像分类）——类别、识别结果】图像理解：【图像输入——（图像预处理）——（图像描述）——（图像分析和理解）——图像解释】第二章数字图像处理基础取样：图像空间坐标的数字化量化值太小出现伪轮廓！取样值太小出现棋盘格！量化：图像函数值（灰度值）的数字化存储一幅M×N的数字图像，需要的存储位数为：b = M × N × k 字节数为：B=b/8优先采用4邻接空间操作：单像素操作，领域操作！第三章图像变换领域与预定义的操作一起称为空间滤波器**直方图均衡化是将原图象的直方图通过变换函数修正为均匀的直方图，然后按均衡直方图修正原图象。

*图象均衡化处理后，图象的直方图是平直的，即各灰度级具有相同的出现频数，那么由于灰度级具有均匀的概率分布，图象看起来就更清晰了。

*直方图均衡化实质上是减少图象的灰度级以换取对比度的加大。

*在均衡过程中，原来的直方图上频数较小的灰度级被归入很少几个或一个灰度级内，故得不到增强。

*若这些灰度级所构成的图象细节比较重要，则需采用局部区域直方图均衡。

均值：平均值灰度方差：对比度第四章**同态滤波(1)灰度级动态范围很大，即黑的部分很黑，白的部分很白，而我们感兴趣的图中的某一部分灰度级范围又很小，分不清物体的灰度层次和细节。

Digital Image Processing Examination1. Fourier Transform problem.1） F or an image given by the function f(x,y)=(x+y)3 where x,y are continuous varibales; evaluatef(x,y)δ(x-1,y-2) and f(x,y)* δ(x-1,y-2),where δ is the Dorac Delta function.2） F or the optical imaging system shoen below,consisting of an image scaling and two forwardFourier transforms show that the output image is a scale and inverted replica of the original3) three binary images (with value 1 on black areas and value 0 elsewhere) are shown below. Sketch the continuous 2D FT of these images(don’t do this mathematically, try to use instead the convolution theorem and knowledge of FTs of common functions)2. The rate distortion function of a zero memory Gaussian source of arbitary mean and variance σ2 with respect to the mean-square error criterion is⎪⎩⎪⎨⎧≥≤≤=2220log 21)(σσσD D for D D Ra) Plot this functionb) What is D max c) If a distortion of no mor than 75% of the source’s variance is allowed, what is the maximumcompression that can be achieved?3. The PDF of an image is given by Pr(r) as shown below. Find the transform toconvert the image's PDF to Pr(z). Assume continuity, and find the transform in terms of r and z. Explain the transformation.4. A certain inspection application gathers black & white images of parts as they travel along a con-veyor belt. It is necessary to sort the parts into two categories: parts with holes and parts with-out holes. An example of an image that might be taken by the inspection camera is shown at the right. Propose a method to identify and locate the objects of each category in the image so that they can be picked up by a robotic system and placed in different bins. Assume that the imaging system knows where each image pixel is located on the conveyor belt at every point in time.Provide an annotated flow chart of the algorithm you propose.5.In a given application, an averaging mask is applied to input images to reduce noise and then aLaplacian mask is applied to enhance small details. Would mathematics predict that the result should be the same if the order of the operations were reversed? What practical issues would be encountered in computer implementation?Digital Image Processing Examination1. A preprocessing step in an application of microscopy is concerned with the issue ofisolating individual round particles from similar particles that overlap in groups of two or more.Assuming that all particles are of the same size, propose a morphological algorithm that will produce an image that contains only the isolated (non-overlapping) particles that are not in contact with the boundary of the image.2. An image represented by a continuous function f(x, y) is w = 2 cm wide and h = 3 cm high. The imageis to be converted to an array of pixels by a scanner whose response is zero above 80 lines/centimeter in both the horizontal and vertical directions. The discrete image is represented by an array ˆf(n, m) where n and m take on integer values, 0 ~ n ~ N - 1, 0~ m ~ M-1.(a)Determine suitable values for N and M.(b)Assume that ˆf(n, m) = f(na, mb). Determine the values of a and b.(c)Determine constants A, B, C, D, E such that the DFT of fˆ can be expressed as)(00) ,() , (EvmDuniBnCmemnfAvu F+-==∑∑=(d)Find numbers (P1, P2) such that F(u + jP1, v + kP2) = F(u, v) for any integers j, k, u, v.3. The arithmetic decoding process is the reverse of the encoding procedure. Decode the message 0.23355 given the coding model.4. The gradient of a function f (x) is defined as⎥⎥⎥⎥⎦⎤⎢⎢⎢⎢⎣⎡∂∂∂∂=⎥⎥⎥⎦⎤⎢⎢⎢⎣⎡=∇y f x f G G f y xComputationally, the first derivative is implemented by calculating the difference between adjacent pixels.(a) Is the following a linear operator?2122⎥⎥⎦⎤⎢⎢⎣⎡⎪⎪⎭⎫ ⎝⎛∂∂+⎪⎭⎫ ⎝⎛∂∂=∇y f x f f (b) State how would you implement the above operator using differences between pixels.(c) A Sobel operator uses two masks, Hx and Hy to process an image. Explain why are two masksneeded and what do they measure?(d)Write down the masks Hx and Hy, and identify them in the followingfigures:5. The three images shown were blurred using square averaging masks of sizes n=23, 25 , and 45, respectively. The vertical bars on the left lower part of (a) and (c) are blurred, but a clear separation exists between them. However, the bars have merged in image (b), in spite of the fact that the mask that produced this image is significantly smaller than the mask that produced image (c). explain this.Digital Image Processing Examination1. An image array f(m, n) of size M1 × N1 is to be convolved with a filter array h(m, n) of size M2 × N2 to produce a new image array g(m, n).1)Write a pseudo code program that describes a method to compute g(m, n) throughthe use of Fourier transforms. The result should be the same size as would beachieved with direct convolution.2)Modify the algorithm so that it does the correlation f ~ h rather than theconvolution.2. You have the job of designing an algorithm that will count the number of objects with holes and the number of objects without holes in images of the kind shown here. Assume that the images are binary with 0 corresponding to black and 1 correspondingto white. The imaging system is of low quality and produces images that are corrupted with salt and pepper noise.The objects do not overlap or touch, but may be close to each other in any direction.They may be of any shape or size. The algorithm should not be confused by the salt and pepper noise, and should not count noise pixels as objects.Write a pseudo-code description of your algorithm. You may also include a block diagram and other information to make it understandable to a programmer. State any assumptions you make, such as: “Objects must contain at least 50 pixels.”least 50 pixels.”3. Suppose that an image has the gray-level probability density functions shown. Here, p 1(z) corresponds to objects and p 2(z) corresponds to the background. Assume that p 1=p 2 and find the optimal threshold between object and back ground pixels.4. The Sobel operator computes the following quantity at each location (x, y) in an image array, A:Gx[j,k]=(A[j+1,k+1]+2A[j+1,k]+A[j+1,k-1])-(A[j-1,k+1]+2A[j-1,k]+A[j-1,k-1]) Gy[j,k]=(A[j-1,k-1]+2A[j,k-1]+A[j+1,k-1])-(A[j-1,k+1]+2A[j,k+1]+A[j+1,k+1]) G[j,k] = |Gx[j,k]| + |Gy[j,k]|The position of A[j, k] is column j and row k of the array.The operation is implemented as the convolution of the image array A with two masks, Mx and My followed by the magnitude operation.1) Write a 3 × 3 array for each mask, Mx and My.2) What mathematical operation on an image array is approximated by the Sobeloperator? Show how the Sobel operator is related to the mathematical operation.5. Answer the following questions about morphological image processing.(a) Shown below are two tables with expressions that relate to binary morphological image processing. Associate each expression in the left table with one from the right table.(b) A well-known morphological algorithm uses the following iteration with a structuring element B.(1) Initialize X[p] = 1 for some pixel A p ∈(2) A B X Y )(⊕=(3) If X Y ≠ then set X = Y and repeat (2)An original set A is shown in (A) and an initial pixel p 2 A is shown in (B). The result after one iteration of the algorithm with structuring element⎥⎥⎥⎦⎤⎢⎢⎢⎣⎡=010111010Bis shown in (C). Fill in the result of the next two iterations by marking theappropriate pixels for the set Y in (D) and (E). In frame (F) show the result for Y that would be reached after a large number of iterations.Digital Image Processing Examination1. Consider the edge model depicted below. Sketch the gradient and Laplacian of the signal. It is not needed to compute exact numerical values in your answer. Plot of approximate shapes of the responses will be sufficient.2. The white bars in the test pattern shown are 7pixels wide and 210 pixels high. The separation between bars is 17 pixels. What would this image look like after application of .1) A 3*3 arithmetic mean filter?2) A 7*7 median filter.3) A 9*9 contraharmonic mean filter with Q=13. The video coding system introduced in the class utilizes several major components –inter-frame motion estimation, motion compensated prediction, DCT, Huffman coding,and quantization.(a)When an encoded signal can be used to reconstruct the exact value of theoriginal signal, we say the encoding method is lossless; otherwise, it’s calledlossy. A lossy coding technique introduces distortion to the signal.Which component in the above video coding system is lossy?(b)The motion compensation process in the encoder generates a motion vectorand prediction errors for each image block in the video signal. Suppose duringthe transmission of the encoded video stream, one motion vector is lost (e.g.,due to the network erasure error). What will be the visual effects of suchtransmission errors on the decoded image sequence?4.Consider a black-and-white image consisting of round and rectangular objects, as shown in the image below. Assume the sizes of the objects are fixed and known. We also know that the width and length of the rectangles are larger than the diameter of the circles. None of the rectangles are tilted. In general, the objects may overlap with each other.Design a morphological operation based system to automatically detect all the instances of the rounds objects that overlap with rectangular objects.5. An image A, represented by an N × M array of bytes, has a uniform brightnesshistogram. It is desired transform A into an image B in a way that produces a triangular brightness histogram2550,36240][≤≤=k k MNk h bDescribe a process that will accomplish the transformation. If possible, derive an equation for the transformation function. At a minimum, sketch the transformation function and indicate how you would use it in a program to compute the array B.模拟试卷一1.对将一个像素宽度的8通路转换到4通路提出一种算法。

题型：选择10道20分，填空10-15道10-15分，名词解析3-4道15-20分，简答题2道20分，程序题1道10分，计算2道20分一、1、数字图像的特点：图像数据量庞大；精度高；再现性好2、数字图像的应用领域：医学：x-ray，超声波成像，CT遥感：农作物估产，地质勘探，天气预报工业：无损探伤，外观自动检查。

军事公安：巡航导弹地形识别，指纹识别，手迹鉴定考题：如医学上数字图像的应用表现在：x-ray，超声波成像，CT3、DIP的应用：电磁波，声波，超声波，电子，合成；电磁波：Gamma 射线（PET），X射线（CT），紫外线，可见光，红外（多光谱遥感），微波（雷达），无线电波（MRI）二、1、人眼的构造：锥状细胞：分辨力强，色彩；白昼视觉；杆状细胞：对低照度敏感；夜视觉（填空或选择题）2、不同照明下，人眼辨别光强度变化的能力不同。

（低照明时，亮度辨别较差（韦伯比大）高照明时，亮度辨别力好（韦伯比小）（填空题）3、马赫带效应：当亮度发生跃变时，视觉上会感到边缘的亮侧更亮些，暗侧更暗些。

在图像轮廓部分发生的主观亮度对比度加强的现象，又称为边缘对比效应。

（名词解析题）4、同时对比效应：眼睛对物体的主观亮度强烈的依赖于物体自身的背景。

当灰色物体周围是黑色背景时，主观亮度增强；当周围背景变明亮时，主观亮度会减弱。

（名词解析题）5、1）图像获取的步骤答：采样Sampling：图像空间坐标的数字化。

将空间上连续的图像变换成离散点的操作。

量化Quantization：图像函数值（灰度值）的数字化。

将像素灰度转换成离散的整数值的过程。

2）影响采样和量化的因素答：空间分辨率：图像中可辨别的最小细节。

采样。

采样间隔越小，像素数越多，空间分辨率高，图像质量好，但数据量大。

采样间隔越大，像素数越少，空间分辨率低，图像质量差，严重时出现像素呈块状的国际棋盘效应；灰度级分辨率：灰度级别中可分辨的最小变化。

量化量化等级越多，图像层次越丰富，灰度分辨率高，图像质量好，但数据量大；量化等级越少，图像层次欠丰富，灰度分辨率低，会出现假轮廓现象，图像质量变差，但数据量小。

（完整版）数字图像处理复习整理《数字图像处理》复习第⼀章绪论数字图像处理技术的基本内容：图像变换、图像增强、图象恢复、图像压缩编码、图像分割、图像特征提取（图像获取、表⽰与描述）、彩⾊图像处理和多光谱及⾼光谱图像处理、形态学图像处理第⼆章数字图像处理基础2-1 电磁波谱与可见光1.电磁波射波的成像⽅法及其应⽤领域：⽆线电波（1m-10km）可以产⽣磁共振成像，在医学诊断中可以产⽣病⼈⾝体的横截⾯图像☆微波（1mm-1m）⽤于雷达成像，在军事和电⼦侦察领域⼗分重要红外线（700nm-1mm）具有全天候的特点，不受天⽓和⽩天晚上的影响，在遥感、军事情报侦察和精确制导中⼴泛应⽤可见光（400nm-700nm）最便于⼈理解和应⽤最⼴泛的成像⽅式，卫星遥感、航空摄影、天⽓观测和预报等国民经济领域☆紫外线（10nm-400nm）具有显微镜⽅法成像等多种成像⽅式，在印刷技术、⼯业检测、激光、⽣物学图像及天⽂观测X射线（1nm-10nm）应⽤于获取病⼈胸部图像和⾎管造影照⽚等医学诊断、电路板缺陷检测等⼯业应⽤和天⽂学星系成像等伽马射线（0.001nm-1nm）主要应⽤于天⽂观测2-2 ⼈眼的亮度视觉特征2.亮度分辨⼒——韦伯⽐△I/I（I—光强△I—光照增量），韦伯⽐⼩意味着亮度值发⽣较⼩变化就能被⼈眼分辨出来，也就是说较⼩的韦伯⽐代表了较好的亮度分辨⼒2-3 图像的表⽰3.⿊⽩图像：是指图像的每个像素只能是⿊或⽩，没有中间的过渡，⼀般⼜称为⼆值图像（⿊⽩图像⼀定是⼆值图像，⼆值图像不⼀定是⿊⽩图像）灰度图像：是指图像中每个像素的信息是⼀个量化了的灰度级的值，没有彩⾊信息。

彩⾊图像：彩⾊图像⼀般是指每个像素的信息由R、G、B三原⾊构成的图像，其中的R、B、G是由不同的灰度级来描述的。

4.灰度级L、位深度k L=2^k5.储存⼀幅M×N的数字图像所需的⽐特 b=M×N×k例如，对于⼀幅600×800的256灰度级图像，就需要480KB的储存空间（1KB=1024Byte 1Byte=8bit）2-4 空间分辨率和灰度级分辨率6.空间分辨率是图像中可分辨的最⼩细节，主要由采样间隔值决定，反映了数字化后图像的实际分辨率。

数据图像处理期末复习1.1数字图像处理及特点1、什么是数字图像？什么是数字图像处理？数字图像：数字图像是物体的一个数字表示，是以数字格式存放的图像，它传递着物理世界事物状态的信息，是人类获取外界信息的主要途径。

数字图像处理：它指将图像信号转换成数字信号并利用计算机对其进行处理的过程，已提高图像的实用性，达到人们所要求的的预期结果。

2、图像处理的目的①提高图像的视觉质量，以达到赏心悦目的目的。

②提取图像中所包含的某些特征或特殊信息，便于计算机分析。

③对图像数据进行变换、编码和压缩，便于图像的存储和传输。

3、数字图像的特点①处理信息量很大②数字图像处理占用的频带较宽③数字图像中各个像素相关性大1.2数字图像处理系统1、数字图像处理系统的组成（结构）数字图像处理系统由输入设备、输出设备、存储、处理组成。

图像输入设备将图像输入的模拟物理量转变为数字化的电信号，以供计算机处理。

图像输出设备则是将图像处理的中间结果或最后结果显示或打印记录。

图像处理计算机系统是以软件方式完成对图像的各种处理和识别，是数字图像处理系统的核心部分。

由于图像处理的信息量大，还必须有存储设备。

2、数字图像处理的优点①精度高②再现性好③通用性、灵活性强1.3数字图像处理的主要研究内容1、数字图像处理的主要研究内容①图像增强②图像编码③图像复原④图像分割⑤图像分类⑥图像重建1.4数字图像处理的应用和发展1、举例说明数字图像处理有哪些应用和发展？①航天和航空技术方面的应用②生物医学工程方面的应用③通信工程方面的应用④工业和工程方面的应用⑤军事、公安方面的应用⑥文化艺术方面的应用⑦其他方面的应用2、数字图像处理领域的发展方向①图像处理的发展向着高速率、高分辨率、立体化、多媒体化、智能化和标准化方向发展。

②图像、图形结合朝着三维成像或多维成像的方向发展③结合多媒体技术，硬件芯片越来越多，把图像处理的众多功能固化在芯片上将会有更加广阔的应用领域④在图像处理领域近年来引入了一些新的理论并提出了一些新的算法，如神经网络。

复习题一、填空题1、储存一幅大小为 1024 1024 ，256 个灰度级的图像，需要8M bit。

2、依照图像的保真度，图像压缩可分为有损和无损。

3、关于彩色图像，往常用以差别颜色的特征是亮度、色彩、饱和度。

4、模拟图像转变成数字图像需要经过采样、量化两个过程。

5、直方图修正法包含直方图的平衡化和规定化。

6、图像像素的两个基本属性是空间地点和像素值；7、一般来说，模拟图像的数字化过程中采样间隔越大，图像数据量小，质量差；8、图像办理中常用的两种邻域是四领域和八领域；9、在频域滤波器中， Butter-worth 滤波器与理想滤波器对比，能够防止或减弱振铃现象。

10、高通滤波法是使低频遇到克制而让高频顺利经过，进而实现图像锐化。

二、判断题1、马赫带效应是指图像不一样灰度级条带之间灰度交界处，亮侧亮度上冲，暗侧亮度下冲的现象。

（Y ）2、均值光滑滤波器可用于锐化图像边沿。

（N ）3、变换编码常用于有损压缩。

（Y）4、同时对照效应是指同一刺激因背景不一样而产生的感觉差别的现象.（Y ）5、拉普拉斯算子可用于图像的光滑办理。

（N）三、选择题6、图像与图像灰度直方图的对应关系是（ B ）A 一对多B多对一C一一对应D都不对7、以下图像处理算法中属于点办理的是（ B ）A 图像锐化B二值化C均值滤波D中值滤波8、以下图像办理中属于图像光滑办理的是（C）A Hough 变换B直方图平衡 C 中值滤波 D Roberts 算子9、以下图像办理方法中，不可以用于图像压缩的是（A）A 直方图平衡B DCT 变换C FFT 变换D小波变换四、名词解说1、数字图像p12、灰度直方图2、图像锐化4、图像还原五、简答题1、简述数当在白日进入一个黑暗剧场时，在能看清并找到空座位时需要适应一段时间，试述发生这类现象的视觉原理。

（书 p21 第三点）2、你所知道的数字图像办理在实质中哪些领域有应用？联合所学知识，就此中一种应用，简单表达原理。

Digital Image Processing Examination1. Fourier Transform problem.1） F or an image given by the function f(x,y)=(x+y)3 where x,y are continuous varibales; evaluatef(x,y)δ(x-1,y-2) and f(x,y)* δ(x-1,y-2),where δ is the Dorac Delta function.2） F or the optical imaging system shoen below,consisting of an image scaling and two forwardFourier transforms show that the output image is a scale and inverted replica of the original image f(x,y). f(x,y) Scaling f(ax,by) F F g(x,y)_3) three binary images (with value 1 on black areas and value 0 elsewhere) are shown below. Sketch the continuous 2D FT of these images(don’t do this mathematically, try to use instead the convolution theorem and knowledge of FTs of common functions)2. The rate distortion function of a zero memory Gaussian source of arbitary mean and variance σ2 with respect to the mean-square error criterion is⎪⎩⎪⎨⎧≥≤≤=22200log 21)(σσσD D for D D Ra) Plot this functionb) What is D maxc) If a distortion of no mor than 75% of the source’s variance is allowed, what is the maximumcompression that can be achieved?3. The PDF of an image is given by Pr(r) as shown below. Find the transform toconvert the image's PDF to Pr(z). Assume continuity, and find the transform in terms of r and z. Explain the transformation.4. A certain inspection application gathers black & white images of parts as they travel along a con-veyor belt. It is necessary to sort the parts into two categories: parts with holes and parts with-out holes. An example of an image that might be taken by the inspection camera is shown at the right. Propose a method to identify and locate the objects of each category in the image so that they can be picked up by a robotic system and placed in different bins. Assume that the imaging system knows where each image pixel is located on the conveyor belt at every point in time.Provide an annotated flow chart of the algorithm you propose.5.In a given application, an averaging mask is applied to input images to reduce noise and then aLaplacian mask is applied to enhance small details. Would mathematics predict that the result should be the same if the order of the operations were reversed? What practical issues would be encountered in computer implementation?Digital Image Processing Examination1. A preprocessing step in an application of microscopy is concerned with the issue ofisolating individual round particles from similar particles that overlap in groups of two or more.Assuming that all particles are of the same size, propose a morphological algorithm that will produce an image that contains only the isolated (non-overlapping) particles that are not in contact with the boundary of the image.2. An image represented by a continuous function f(x, y) is w = 2 cm wide and h = 3 cm high. The imageis to be converted to an array of pixels by a scanner whose response is zero above 80 lines/centimeter in both the horizontal and vertical directions. The discrete image is represented by an array ˆf(n, m) where n and m take on integer values, 0 ~ n ~ N - 1, 0~ m ~ M-1.(a)Determine suitable values for N and M.(b)Assume that ˆf(n, m) = f(na, mb). Determine the values of a and b.(c)Determine constants A, B, C, D, E such that the DFT of fˆ can be expressed as)(00) ,() , (EvmDuniBnCmemnfAvu F+-==∑∑=(d)Find numbers (P1, P2) such that F(u + jP1, v + kP2) = F(u, v) for any integers j, k, u, v.3. The arithmetic decoding process is the reverse of the encoding procedure. Decode the message 0.23355 given the coding model.4. The gradient of a function f (x) is defined as ⎥⎥⎥⎥⎦⎤⎢⎢⎢⎢⎣⎡∂∂∂∂=⎥⎥⎥⎦⎤⎢⎢⎢⎣⎡=∇y f x f G G f y xComputationally, the first derivative is implemented by calculating the difference between adjacent pixels.(a) Is the following a linear operator?2122⎥⎥⎦⎤⎢⎢⎣⎡⎪⎪⎭⎫ ⎝⎛∂∂+⎪⎭⎫ ⎝⎛∂∂=∇y f x f f (b) State how would you implement the above operator using differences between pixels.(c) A Sobel operator uses two masks, Hx and Hy to process an image. Explain why are two masksneeded and what do they measure?(d) Write down the masks Hx and Hy, and identify them in the followingfigures:5. The three images shown were blurred using square averaging masks of sizes n=23, 25 , and 45, respectively. The vertical bars on the left lower part of (a) and (c) are blurred, but a clear separation exists between them. However, the bars have merged in image (b), in spite of the fact that the mask that produced this image is significantly smaller than the mask that produced image (c). explain this.Digital Image Processing Examination1. An image array f(m, n) of size M1 × N1 is to be convolved with a filter array h(m, n) of size M2 × N2 to produce a new image array g(m, n).1)Write a pseudo code program that describes a method to compute g(m, n) throughthe use of Fourier transforms. The result should be the same size as would beachieved with direct convolution.2)Modify the algorithm so that it does the correlation f ~ h rather than theconvolution.2. You have the job of designing an algorithm that will count the number of objects with holes and the number of objects without holes in images of the kind shown here. Assume that the images are binary with 0 corresponding to black and 1 correspondingto white. The imaging system is of low quality and produces images that are corrupted with salt and pepper noise.The objects do not overlap or touch, but may be close to each other in any direction.They may be of any shape or size. The algorithm should not be confused by the salt and pepper noise, and should not count noise pixels as objects.Write a pseudo-code description of your algorithm. You may also include a block diagram and other information to make it understandable to a programmer. State any assumptions you make, such as: “Objects must contain at least 50 pixels.”least 50 pixels.”3. Suppose that an image has the gray-level probability density functions shown. Here, p 1(z) corresponds to objects and p 2(z) corresponds to the background. Assume that p 1=p 2 and find the optimal threshold between object and back ground pixels.4. The Sobel operator computes the following quantity at each location (x, y) in an image array, A:Gx[j,k]=(A[j+1,k+1]+2A[j+1,k]+A[j+1,k-1])-(A[j-1,k+1]+2A[j-1,k]+A[j-1,k-1]) Gy[j,k]=(A[j-1,k-1]+2A[j,k-1]+A[j+1,k-1])-(A[j-1,k+1]+2A[j,k+1]+A[j+1,k+1]) G[j,k] = |Gx[j,k]| + |Gy[j,k]|The position of A[j, k] is column j and row k of the array.The operation is implemented as the convolution of the image array A with two masks, Mx and My followed by the magnitude operation.1) Write a 3 × 3 array for each mask, Mx and My.2) What mathematical operation on an image array is approximated by the Sobeloperator? Show how the Sobel operator is related to the mathematical operation.5. Answer the following questions about morphological image processing.(a) Shown below are two tables with expressions that relate to binary morphological image processing. Associate each expression in the left table with one from the right table.(b) A well-known morphological algorithm uses the following iteration with a structuring element B.(1) Initialize X[p] = 1 for some pixel A p ∈(2) A B X Y )(⊕=(3) If X Y ≠ then set X = Y and repeat (2)An original set A is shown in (A) and an initial pixel p 2 A is shown in (B). The result after one iteration of the algorithm with structuring element⎥⎥⎥⎦⎤⎢⎢⎢⎣⎡=010111010Bis shown in (C). Fill in the result of the next two iterations by marking theappropriate pixels for the set Y in (D) and (E). In frame (F) show the result for Y that would be reached after a large number of iterations.Digital Image Processing Examination1. Consider the edge model depicted below. Sketch the gradient and Laplacian of the signal. It is not needed to compute exact numerical values in your answer. Plot of approximate shapes of the responses will be sufficient.2. The white bars in the test pattern shown are 7pixels wide and 210 pixels high. The separation between bars is 17 pixels. What would this image look like after application of .1) A 3*3 arithmetic mean filter?2) A 7*7 median filter.3) A 9*9 contraharmonic mean filter with Q=13. The video coding system introduced in the class utilizes several major components –inter-frame motion estimation, motion compensated prediction, DCT, Huffman coding,and quantization.(a)When an encoded signal can be used to reconstruct the exact value of theoriginal signal, we say the encoding method is lossless; otherwise, it’s calledlossy. A lossy coding technique introduces distortion to the signal.Which component in the above video coding system is lossy?(b)The motion compensation process in the encoder generates a motion vectorand prediction errors for each image block in the video signal. Suppose duringthe transmission of the encoded video stream, one motion vector is lost (e.g.,due to the network erasure error). What will be the visual effects of suchtransmission errors on the decoded image sequence?4.Consider a black-and-white image consisting of round and rectangular objects, as shown in the image below. Assume the sizes of the objects are fixed and known. We also know that the width and length of the rectangles are larger than the diameter of the circles. None of the rectangles are tilted. In general, the objects may overlap with each other.Design a morphological operation based system to automatically detect all the instances of the rounds objects that overlap with rectangular objects.5. An image A, represented by an N × M array of bytes, has a uniform brightnesshistogram. It is desired transform A into an image B in a way that produces a triangular brightness histogram2550,36240][≤≤=k k MNk h bDescribe a process that will accomplish the transformation. If possible, derive an equation for the transformation function. At a minimum, sketch the transformation function and indicate how you would use it in a program to compute the array B.模拟试卷一1.对将一个像素宽度的8通路转换到4通路提出一种算法。

1.欧氏距离：坐标分别位于（x，y）和（u，v）处的像素p和像素q之间的欧氏距离定义为：D e(p,q)=（x−u）2+（y−u）212。

2.街区距离：坐标分别位于（x，y）和（u，v）处的像素p和像素q之间的街区距离定义为:D4p，q=x−u+y−v。

3.棋盘距离：坐标分别位于（x，y）和（u，v）处的像素p和像素q之间的街区距离定义为:D8p，q=man（x−u，y−v）。

4.灰度数字图像有什么特点？答：灰度数字图像的特点是只有灰度（亮度）属性，没有彩色属性。

对于灰度级为L的图像，起灰度取值范围为[0，L-1].5.一副200×300的二值图像、16灰度级图像和256灰度级图像分别需要多少存储空间？答：由于存储一副M×N的灰度级为L 的数字图像所需的位数为：M ×N×L，其中L=2k。

二值图像，16灰度级图像和256灰度级图像的k值分别为1、4和8，也即存储一个像素需要的位数分别为1位、4位和8位。

所以，一副200×300的二值图像所需的存储空间为200×300×1/8=7.5kB；一副200×300的16灰度级图像所需的存储空间为200×300×4/8=30kB；一副200×300的256灰度级的图像所需的存储空间为200×300×8/8=60kB。

6.简述采样数变化对图像视觉效果的影响。

答：在对某景物的连续图像进行均匀采样时，在空间分辨率（这里指线对宽度）不变的情况下，采样数越少，即采样密度越低，得到的数字图像阵列M×N越小，也即数字图像尺寸就越小。

反之，采样数越多，即采样密度越高，得到的数字图像阵列M×N 越大，也即数字图像的尺寸就越大。

7.简述灰度级分辨率变化对图像视觉效果的影响。

答：灰度级分辨率是指在灰度级别克分辨的最小变化。

灰度级别越大，也即图像的灰度级分辨率越高，景物图像总共反映其亮度的细节就越丰富，图像质量也就越高。