登录
首页 » matlab » descomposition

descomposition

于 2020-09-20 发布 文件大小:1KB
0 180
下载积分: 1 下载次数: 100

代码说明:

  vo分解模型用于分解图像的纹理和卡通部分的matlab源代码(The vo decomposition model for the decomposition of the image texture and cartoon part of the Matlab source code)

文件列表:

descomposition.m,2687,2012-06-28

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

发表评论

0 个回复

  • 水体指数
    说明:  利用matlab对多光谱遥感影像进行水体指数(ndwi)以及植被指数(ndvi)提取(Extraction of Water body Index (ndwi) and vegetation Index (ndvi) from Multispectral remote Sensing Images by matlab)
    2020-11-04 09:49:51下载
    积分:1
  • pcnn
    说明:  输入灰度图像,采用pcnn算法进行边缘检测(Input gray image, use PCNN algorithm for edge detection)
    2020-01-03 10:43:37下载
    积分:1
  • a-series-of-programs
    ch5_1_1: 图像灰度线性变换 (§5 联合开发网 - pudn.com
    2020-07-03 05:20:01下载
    积分:1
  • Coloring-Problem
    图着色问题(Graph Coloring Problem, GCP)又称着色问题,是最著名的NP-完全问题之一。路线着色问题是图论中最著名的猜想之一。(Graph coloring problem (Graph Coloring Problem, GCP), also known as coloring problem, is the most famous NP-complete problems. Line graph coloring problem is one of the most famous conjecture.)
    2013-08-23 23:01:42下载
    积分:1
  • nsct pcnn
    利用pcnn和nsct实现图像融合,非下采样Contourlet变换,脉冲耦合神经网络,连接强度(Using NSCT and PCNN image fusion, the sampling Contourlet transform, the pulse coupled neural network, the connection strength)
    2020-10-29 23:19:56下载
    积分:1
  • bestlinefusion
    最佳拼接线方法进行图像拼接,对学习图像拼接很有用处(The best method of splicing line image mosaic, image stitching is useful for learning)
    2020-06-30 01:40:02下载
    积分:1
  • median-filtering
    中值滤波,取出奇数个数据进行排序,用排序后的中值取代要处理的数据即可(median filtering.rar)
    2013-12-05 17:24:42下载
    积分:1
  • intel
    简单的图像积分图的汇编算法;图像积分图的计算在图像处理中经常用到(A simple compilation of the image points map algorithm image points in the map frequently used for image processing)
    2009-07-19 13:41:12下载
    积分:1
  • arnold-logistic
    彩色图像的arnold图像置乱和logistic混沌序列的图像加密程序matlab源码(Color image of arnold image scrambling and logistic chaotic sequence of image encryption program Matlab source)
    2012-04-10 17:27:42下载
    积分: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资源总数
  • 106425会员总数
  • 12今日下载