- 1、本文档共32页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
图形图像处理[第3讲]
图形图像处理;主要内容;卷积与滤波;CONV Convolution and polynomial multiplication.
C = CONV(A, B) convolves vectors A and B.
The resulting vector is length MAX([LENGTH(A)+LENGTH(B)-1,
LENGTH(A),LENGTH(B)]). If A and B are vectors of polynomial
coefficients, convolving them is equivalent to multiplying
the two polynomials.;卷积;二维卷积;二维卷积;二维卷积;二维卷积;C = CONV2(..., SHAPE) returns a subsection of the 2-D
convolution with size specified by SHAPE:
full - (default) returns the full 2-D convolution,
same - returns the central part of the convolution
that is the same size as A.
valid - returns only those parts of the convolution
that are computed without the zero-padded edges.
size(C) = max([ma-max(0,mb-1),na-max(0,nb-1)],0).
See also conv, convn, filter2 and, in the signal Processing
Toolbox, xcorr2.
;
;卷积的性质;问题;二维卷积示例;二???卷积示例;二维卷积示例;二维卷积示例;线性运算; subplot(221);
imshow(uint8(c));
hold on ;
subplot(222);
imshow(uint8(0.5*c));
hold on ;
subplot(223);
imshow(uint8(0.25*c));
hold on ;
subplot(224);
imshow(uint8(0.05*c));
hold on;;直方图;直方图;IMHIST(I,N) displays a histogram with N bins for the intensity image I
above a grayscale colorbar of length N. If I is a binary image then N
can only be 2.; IMHIST(X,MAP) displays a histogram for the indexed image X. This
histogram shows the distribution of pixel values above a colorbar of the
colormap MAP. The colormap must be at least as long as the largest index
in X. The histogram has one bin for each entry in the colormap.; [COUNTS,X] = imhist(...) returns the histogram counts in COUNTS and the
bin locations in X so that stem(X,COUNTS) shows the histogram. For
indexed images, it returns the histogram counts for each colormap entry;
the length of COUNTS is the same as the length of the colormap.;For intensity images, the N bins of the histogram are each half-open
intervals of width A/(N-1).
In partic
您可能关注的文档
最近下载
- 2025年湖南科技职业学院单招英语模拟试题(附答案解析).pdf VIP
- 2025年高考数学重点题型归纳精讲精练5.4三角形四心和奔驰定理(新高考地区)(原卷版) .docx VIP
- 新生儿窒息复苏试卷附有答案.docx
- 三 气体压强.ppt VIP
- 图解---“健康中国2030”规划纲要-医学课件.pptx
- 历史:第6课《中古时代的欧洲》课件 (川教版九年级上).ppt
- DeepSeek-清华大学104页《DeepSeek:从入门到精通》.pptx
- FANUC 0i-MB操作说明书 完整版.pdf
- (八省联考)2025年新高考适应性演练 政治试卷合集(含答详解案).docx
- 赤泥坝施工方案.doc
文档评论(0)