登录
首页 » matlab » ImageHistogramAndCentroidComputer_Matlab

ImageHistogramAndCentroidComputer_Matlab

于 2008-11-17 发布 文件大小:1KB
0 197
下载积分: 1 下载次数: 2

代码说明:

说明:  灰度图像二值化及目标提取和质心求取,Matlab代码.对初学者学习有用(Gray image binarization and target extraction and center of mass strike, Matlab code. Learn useful for beginners)

文件列表:

found_centroid.m
histequal.m
localhist.m

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • delaunay
    VC和OpenGL实现的点云读取界面,需要的朋友可以下载参考(VC and OpenGL realize the point cloud to read interface, the need for a friend can download the reference)
    2021-04-08 12:39:01下载
    积分:1
  • 基于BP神经网络的人脸识别(java源码)
    基于BP神经网络的人脸识别(java源码)
    2019-12-10下载
    积分:1
  • Edge-detection
    数字图像处理边缘检测算法VC源码,里面包括多种检测算子(Digital image processing edge detection algorithm VC source code,Which includes a variety of detection operator )
    2012-04-07 22:46:03下载
    积分:1
  • public_code_ST
    结构张量来进行自适应正则化图像重建,单幅图像重建(Structure tensor adaptive regularized image reconstruction, a single image reconstruction)
    2016-11-29 12:09:57下载
    积分:1
  • code
    数字图像哈弗曼编码,包括压缩和解压。压缩比、信噪比(Encoded digital image Hafu Man)
    2020-11-24 20:09:32下载
    积分:1
  • AMDGPU
    介绍图像处理技在AMD上的GPU的处理方案,加速高清,快速度(The processing scheme, image processing technology on AMD GPU accelerated HD, speed)
    2013-07-22 17:28:48下载
    积分:1
  • convert_fy3_data
    风云3号卫星投影转换工具,envi中使用,很实用。(FY-3 satellite projection conversion tool, very useful)
    2021-02-23 20:09:40下载
    积分:1
  • halcon检测胶圈闭合
    说明:  halcon检测封闭胶圈,halcon12版本(Halcon detection of closed aprons)
    2020-07-02 06:20:01下载
    积分:1
  • Graph-theory
    本文档主要讲解了基于图论着色的动态频谱分配研究,可以让大家快速的学习认知无线电中的频谱分配(This document is mainly on the dynamic spectrum allocation based on graph coloring theory research, so that we can quickly learn the spectrum allocation in cognitive radio)
    2012-05-08 15:34:50下载
    积分:1
  • Graph
    输入一个带权无向图的顶点数、边数、各条边信息(两个顶点和权值),建立该图的邻接矩阵结构,输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构,输出该邻接表;根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列,并输出遍历结果;用prim算法实现构造该带权无向图的最小生成树,并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)
    2020-12-13 15:29:15下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载