CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - Contour Fill
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Search - Contour Fill - List
[
Special Effects
]
VisualC++ImageProcessing
DL : 0
实现各种图像处理技术,包括边缘检测、Hough变换、差影法、轮廓提取与跟踪、模板匹配、投影法、图像复原、阈值分割、种子填充等内容。-Realize a variety of image processing technologies, including edge detection, Hough transform, poor shadow method, contour extraction and tracking, template matching, projection method, image recovery, threshold segmentation, seed fill and so on.
Date
: 2026-01-01
Size
: 5.67mb
User
:
高旭
[
Special Effects
]
eagedetectandfigureoperate
DL : 0
图像边缘与轮廓运算包括 // RobertDIB() - robert边缘检测运算 // SobelDIB() - sobel边缘检测运算 // PrewittDIB() - prewitt边缘检测运算 // KirschDIB() - kirsch边缘检测运算 // GaussDIB() - gauss边缘检测运算 // HoughDIB() - 利用Hough变换检测平行直线 // ContourDIB() - 轮廓提取 // TraceDIB() - 轮廓跟踪 // FillDIB() - 种子填充算法1 // Fill2DIB() - 种子填充算法2-Image edge and the outline of computing, including// RobertDIB ()- robert edge detection operator// SobelDIB ()- sobel edge detection operator// PrewittDIB ()- prewitt edge detection operator// KirschDIB ()- kirsch edge detection operator// GaussDIB ( )- gauss edge detection operator// HoughDIB ()- the use of Hough transform detection of parallel straight lines// ContourDIB ()- contour extraction// TraceDIB ()- contour tracking// FillDIB ()- Seed Filling Algorithm 1// Fill2DIB ()-- seed fill algorithm 2
Date
: 2026-01-01
Size
: 5kb
User
:
kelly
[
Special Effects
]
quxiantu
DL : 0
程序1主要是实现正弦函数和余弦函数的线性组合,绘出两者相加后的图像。程序2、3、4中还包括罗盘图、轮廓图和填充图,从而实现这几种绘图功能。-Program is mainly a sine and cosine functions to achieve a linear combination of the two add up to draw the image. 2,3,4 program also includes compass map, contour map and fill map, in order to achieve these types of graphics.
Date
: 2026-01-01
Size
: 1kb
User
:
刘亮
[
Special Effects
]
polygon
DL : 0
典型的多边形填充算法主要包括扫描线填充算法和轮廓标志域填充算法,适用于矢量多边形文件的填充算法为扫描线填充算法-Typical polygon filling algorithm includes scan line fill algorithm and contour filling algorithm signs domain, suitable for vector polygon filling algorithm to scan the file line filling algorithm
Date
: 2026-01-01
Size
: 4kb
User
:
徐晓亮
[
Special Effects
]
EdgeContour
DL : 0
bmp图像的边缘检测,包括经典算法,功能有边缘检测,hough变换,轮廓提取,种子填充,轮廓跟踪等-bmp image edge detection, including the classic algorithm, edge detection function, hough transform, contour extraction, seed fill, contour tracking
Date
: 2026-01-01
Size
: 99kb
User
:
柯超
[
Special Effects
]
tiqubeijing
DL : 0
对叶片进行预处理和提取部分特征:1.均值去噪 2.k均值聚类提取复杂背景下的叶子图片 3.填充孔洞 4.去叶柄 5.提取轮廓 6计算纵横轴比、面积凹凸比、周长凹凸比、球形性、圆形性、偏心率、形状参数和矩形度等特征值并进行画图。- Pretreatment of leaves and extract some of the characteristics: a mean denoising 2.k means clustering leaf extract complex background picture fill holes 3 4 5 contour extraction petiole 6 to calculate the vertical and horizontal axis ratio, convex area ratio.. convex perimeter than spherical, circularity, eccentricity, and rectangular shape parameter values and other characteristics of the drawing.
Date
: 2026-01-01
Size
: 3kb
User
:
青
[
Special Effects
]
braintissue
DL : 0
对最大的连通区域依次进行膨胀,闭操作,填充空穴得到脑模板,再将原图和脑模板相乘得到脑组织图像;对距离函数取反,然后进行分水岭操作,显示每一个连通区域;对合并之后的连通区域进行闭操作去除分水线,然后将里面的空洞进行填充,再将其膨胀,减去填充后的模板便可得到各个结构的轮廓线-The maximum connected region sequentially inflated closing operation, fill the hole to give the brain a template, and then multiplying the original template and brain brain image a function of distance, then inverts watershed operation, displaying each connected region after the merger of regional connectivity will be closing operation to remove the dividing line, and then the inside of the cavity is filled, then it expands, the template can be obtained by subtracting the filled contour of each structure
Date
: 2026-01-01
Size
: 1kb
User
:
soso
[
Special Effects
]
Corner
DL : 0
1。将Canny边缘检测器应用于灰度图像,得到二值边缘图。 2。从边缘图中提取边缘轮廓,填补等高线上的空白。 三.计算每个轮廓的低曲率以保持所有真实的角,所有曲率的局部极大值被认为是初始角点。 4。使用自适应局部阈值来去除初始角点,以去除圆角。 5。角候选的角度进行评估,以消除任何虚假角落由于量化噪声和琐碎的细节。上述评价基于一个动态的支持区域,该区域根据其相邻的角候选对象进行更改。 6。轮廓线的端点被认为有附加的标准。(1. Apply the Canny edge detector to the grey level image and obtain a binary edge-map. 2. Extract the edge contours from the edge-map, fill the gaps in the contours. 3. Compute curvature at a low scale for each contour to retain all true corners.All of the curvature local maxima are considered as initial corner candidates. 4. Initial corner candidates are compared using an adaptive local threshold to remove the round corners. 5. The angles of corner candidates are evaluated to eliminate any false corners due to quantization noise and trivial details. The above evaluation is based on a dynamic region of support, which changes according to its adjacent corner candidates. 6. End points of contours are considered with an additional criterion.)
Date
: 2026-01-01
Size
: 107kb
User
:
下一秒
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.