




版權(quán)說明:本文檔由用戶提供并上傳,收益歸屬內(nèi)容提供方,若內(nèi)容存在侵權(quán),請(qǐng)進(jìn)行舉報(bào)或認(rèn)領(lǐng)
文檔簡(jiǎn)介
Chapter2
DigitalImageFundamentalsChapter2
DigitalImageFundamentals2.1ElementsofVisualPerception2.2Light&EMSpectrum2.3ImageSensing&Acquisition2.3.4AsimpleImageFormationModelf(x,y)=i(x,y)r(x,y)i(x,y):illuminationcomponents,0<i(x,y)<∞r(nóng)(x,y):reflectancecomponents,0<r(x,y)<12.4.1BasicConceptinSampling&Quantization2.4.1BasicConceptinSampling&Quantization2.4.1BasicConceptinSampling&Quantization2.4.2RepresentingDigitalImageMatrixor2-DArray2.4.3Spatial&IntensityResolutionSpatialResolutionLinepairsperunitdistanceDots(pixels)perunitdistanceDpi:dotperinchSpatialresolutionisameasureoftheaccuracyordetailofagraphicdisplay,expressedasdotsperinch,pixelsperinch,linesperinch,etc.SpatialResolution
Exercise10inch,1024X768SpatialResolution=?ExerciseDiagonallength=10inch2.4.3Spatial&IntensityResolutionIntensityResolutionIntensityLevelUsuallyisanintegerpoweroftwo8bitsHDMI
1.3
support10bits,12bits,16bitsforeachcolorcomponent(channel)IntensityResolutionIntensityResolutionHowtogetn-bitsimage?7bit6bit5bit4bit3bit2bit1bit0bit007bit6bit5bit4bit3bit2bit7bit6bit5bit4bit3bit2bit00>><<IntensityResolution[Programming]Exercise:byte[,]get_n_bits_image(byte[,]f,intn);2.5SameBasicRelationshipbetweenpixels2.5.1Neighborsofapixel2.5.1Neighborsofapixelp:(x,y)4-Neighborsofp:N4(p)={(x+1,y),(x-1,y),(x,y+1),(x,y-1)}2.5.1Neighborsofapixelp:(x,y)D-Neighbors(Diagonal-Neighbors)ofp:ND(p)={(x+1,y+1),(x-1,y+1),(x+1,y-1),(x-1,y-1)}2.5.1Neighborsofapixelp:(x,y)8-Neighborsofp:N8(p)=N4(p)UND(p)2.5.2Adjacency,Connectivity,RegionandBoundariesAdjacencyBinaryimage:Intensity{0,1}Usually0meansbackgroundand1meansforeground
0000000000000000000110000011110000111100001111000000000000000000AdjacencyBothpandqareintheforeground(V:{1})4-adjacency:qinN4(p)8-adacency:qinN8(p)m-adjacency(mixedadjacency)qinN4(p)orqinN8(p)andthesetN4(p)∩N4(q)hasnopixelswhosevaluearefromV(V:{1})Adjacencym-adjacency(mixedadjacency)qinN4(p)orqinN8(p)andthesetN4(p)∩N4(q)hasnopixelswhosevaluearefromV(V:{1})00000011010001m-Adjacencyp:(yellow),q:(green)BluebackgroundpixelmeanssetN4(p)∩N4(q)m-adjacency(mixedadjacency)qinN4(p)orqinN8(p)andthesetN4(p)∩N4(q)hasnopixelswhosevaluearefromV(V:{1})00000000000000000000000000000m-Adjacencyp:(yellow),q:(blue)BluebackgroundpixelmeanssetN4(p)∩N4(q)m-adjacency(mixedadjacency)qinN4(p)orqinN8(p)andthesetN4(p)∩N4(q)hasnopixelswhosevaluearefromV(V:{1})00000[Programing]boolIs_4adjacent(intpx,intpy,intqx,intqy);boolIs_8adjacent(intpx,intpy,intqx,intqy);BoolIs_m_adjacent(byte[,]f,intpx,intpy,intqx,intqy);DigitalPathDigitalPathfrompixelptopixelqisasequenceofdistinctpixelswithcoordinates(x0,y0),(x1,y1),…,(xn,yn)where(xi-1,yi-1)and(xi,yi)areadjacent,i:[1..n]DigitalPathp6p7p8p9=qp5p4p3p2p1p0=pDigitalPath(Closed)p6p7p8p9p5p10p4p11p3p12p2P13=qp1p0=pConnectedSet(Region)ConnectedSet(Region)qqpPS2S1AdjacentRegionsIfRiURjisaconnectedset,RiandRjaraadjacentregions.RjRiDisjointRegionsNotAdjacentForeground/BackgroundBFForeground/BackgroundKdisjointregions,Rk,k=1,2,..,KRu=R1UR2U…URK(Ru)c,cmeanscomplementForeground:RuBackground:(Ru)cForeground/BackgroundB:(Ru)cF:RuBoundary(Border/Contour)ofRegionInnerBorderofRegionB(in)={(x,y)|(x,y)∈R,(x,y)adjacentto(R)c}p4p5P6p7p8P3p9P2p12p11p10P1p13p0p15p14Exercise:
byte[,]getInnerBorder(byte[,]f)Intput:fisabinaryimage,0meansbackgroundand255meansforeground(regions)Output:binaryimage.255meansinnerbordersoftheregionsininputimageBoundary(Border/Contour)ofRegionInnerBorderofRegionExercise:
byte[,]getOuterBorder(byte[,]f)OuterBorderofRegionB(out)={(x,y)|(x,y)∈(R)c,(x,y)adjacenttoR}Exercise:
byte[,]getOuterBorder(byte[,]f)Intput:fisabinaryimage,0meansbackgroundand255meansforeground(regions)Output:binaryimage.255meansouterbordersoftheregionsininputimage2.5.3DistanceMeasureDistanceFunctionp(x,y),q(s,t),z(u,v)D(p,q)≥0,D(p,q)=0iffp=qD(p,q)=D(q,p)D(p,z)≤D(p,q)+D(q,z)2.5.3DistanceMeasureEuclideandistance[Eu’cl[ai]dean] 2.5.3DistanceMeasureCity-blockdistanceD4(p,q)=│x-s│+│y-t│;p:(x,y),q(s,t)2.5.3DistanceMeasureChessboarddistanceD8(p,q)=max(│x-s│,│y-t│) chessman:king2.5.3DistanceMeasureChessboarddistanceqPExerciseMax(De,D4,D8)=?Min(De,D4,D8)=?D4(p,q)=│x-s│+│y-t│D8(p,q)=max(│x-s│,│y-t│)Exerc
溫馨提示
- 1. 本站所有資源如無特殊說明,都需要本地電腦安裝OFFICE2007和PDF閱讀器。圖紙軟件為CAD,CAXA,PROE,UG,SolidWorks等.壓縮文件請(qǐng)下載最新的WinRAR軟件解壓。
- 2. 本站的文檔不包含任何第三方提供的附件圖紙等,如果需要附件,請(qǐng)聯(lián)系上傳者。文件的所有權(quán)益歸上傳用戶所有。
- 3. 本站RAR壓縮包中若帶圖紙,網(wǎng)頁(yè)內(nèi)容里面會(huì)有圖紙預(yù)覽,若沒有圖紙預(yù)覽就沒有圖紙。
- 4. 未經(jīng)權(quán)益所有人同意不得將文件中的內(nèi)容挪作商業(yè)或盈利用途。
- 5. 人人文庫(kù)網(wǎng)僅提供信息存儲(chǔ)空間,僅對(duì)用戶上傳內(nèi)容的表現(xiàn)方式做保護(hù)處理,對(duì)用戶上傳分享的文檔內(nèi)容本身不做任何修改或編輯,并不能對(duì)任何下載內(nèi)容負(fù)責(zé)。
- 6. 下載文件中如有侵權(quán)或不適當(dāng)內(nèi)容,請(qǐng)與我們聯(lián)系,我們立即糾正。
- 7. 本站不保證下載資源的準(zhǔn)確性、安全性和完整性, 同時(shí)也不承擔(dān)用戶因使用這些下載資源對(duì)自己和他人造成任何形式的傷害或損失。
最新文檔
- 浙江省諸暨市榮懷小學(xué)2024-2025學(xué)年六年級(jí)上學(xué)期期末考試語(yǔ)文試題
- 漢字對(duì)話課件
- 網(wǎng)紅經(jīng)濟(jì)現(xiàn)狀與未來趨勢(shì)分析
- 2025年農(nóng)村土地轉(zhuǎn)讓協(xié)議模板
- 2024年秋新北師大版數(shù)學(xué)一年級(jí)上冊(cè)教學(xué)課件 第二單元 5以內(nèi)數(shù)加與減 第5課時(shí) 可愛的小貓
- 水表井安全知識(shí)培訓(xùn)課件記錄
- 燃?xì)庠O(shè)備緊急故障應(yīng)急方案
- 混凝土施工過程中的溫差控制技術(shù)方案
- 建筑工程項(xiàng)目施工現(xiàn)場(chǎng)物流與倉(cāng)儲(chǔ)方案
- 消防疏散指示標(biāo)志設(shè)置方案
- 2025屆高考日語(yǔ)二輪復(fù)習(xí) 閱讀理解“主旨題”解題技巧 課件
- 社區(qū)衛(wèi)生服務(wù)中心護(hù)理管理工作制度
- 安徽省A10聯(lián)盟2024-2025學(xué)年高二上學(xué)期9月初開學(xué)摸底考數(shù)學(xué)(B卷)試題2
- 干部廉政檔案登記表
- 吊籃施工安全技術(shù)交底
- 第七單元 專題突破9 聚焦變異熱點(diǎn)題型-2025年高中生物大一輪復(fù)習(xí)
- 2023年海南省社區(qū)網(wǎng)格員真題九十天沖刺打卡單選題+多選題+填空題+判斷題+客觀題A卷
- 《初中數(shù)學(xué)變式題》課件
- 個(gè)人替公司代付協(xié)議
- XF-T 3004-2020 汽車加油加氣站消防安全管理
- 2.2算法的概念及其描述課件人教中圖版高中信息技術(shù)必修1
評(píng)論
0/150
提交評(píng)論