登录
首页 » Visual C++ » secret-sharing-ideas

secret-sharing-ideas

于 2012-04-10 发布 文件大小:381KB
0 128
下载积分: 1 下载次数: 15

代码说明:

  针对图像秘密共享前需要像素置乱的问题,基于(t, n)门限多重秘密共享思想,提出一种免置乱的图像秘密共享方案,以第n+1人的秘密份额作为因子参与秘密分割与重构,加大相邻像素之间的差距(Based on (t, n) threshold multiple secret sharing ideas, and put forward a kind of scrambling image from secret sharing scheme to n+ 1 people share the secret as factors involved in secret segmentation and reconstruction, increase the gap between adjacent pixels)

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

发表评论

0 个回复

  • algorithm-of-findpath
    绣花问题是连续型的填充,在不同区域的缝制过程中,缝针不能提针,因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法:先对轮廓走向进行 定义,通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割,采用交点的特征值比较彻底的解 决了分割时的重点问题,将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”,通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历(缝制)序列和每 个节点的缝制方向,最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone. Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a defined start-point, end-point)
    2012-12-09 23:26:22下载
    积分:1
  • 06
    说明:  图像形态学处理,图像腐蚀,图像膨胀,图像细化,边缘检测(Morphological image processing, image corrosion, image expansion, image thinning, edge detection)
    2009-05-23 21:05:57下载
    积分:1
  • DE
    说明:   最简单的差分格式有向前、向后和中心3种。 向前差分:f (n)=f(n+1)-f(n) 向后差分:f (n)=f(n)-f(n-1) 中心差分:f (n)=[f(n+1)-f(n-1)]/2(The easiest difference format forward, backward, and three kinds of centers. Forward differencing: f (n) = f (n+ 1)-f (n) Backward difference: f (n) = f (n)-f (n-1) Central difference: f (n) = [f (n+ 1)-f (n-1)]/2)
    2016-05-17 21:08:01下载
    积分:1
  • division
    图像的分割处理,可以将图像中的数字分割找出(IMAGE division)
    2010-08-28 08:43:02下载
    积分:1
  • Sobel-and-Prewitt-edge-detection-and-robert
    Image processing using sobel operator
    2012-05-26 02:04:51下载
    积分:1
  • Laplasse
    拉普拉斯算法的实现,程序是用vc++编写的(Laplasse algorithm)
    2011-12-28 15:43:07下载
    积分:1
  • IAcrossLine_Tn
    过线检测:依据物体运运动轨迹,分析是否过线 (In lane detection: Based on the trajectories of objects transported to analyze whether the line)
    2012-07-23 11:13:46下载
    积分:1
  • CGAL-4.5
    CGAL,Computational Geometry Algorithms Library,计算几何算法库,设计目标是,以C++库的形式,提供方便,高效,可靠的几何算法。CGAL可用于各种需要几何计算的领域,如计算机图形学,科学可视化,计算机辅助设计和建模,地理信息系统,分子生物学,医学成像,机器人运动规划,网格生成,数值方法等等。    计算几何算法库(CGAL),提供计算几何相关的数据结构和算法,诸如三角剖分(2D约束三角剖分及二维和三维Delaunay三角剖分),Voronoi图(二维和三维的点,2D加权Voronoi图,分割Voronoi图等),多边形(布尔操作,偏置),多面体(布尔运算),曲线整理及其应用,网格生成(二维Delaunay网格生成和三维表面和体积网格生成等),几何处理(表面网格简化,细分和参数化等),凸壳算法(2D,3D和dD),搜索结构(近邻搜索,kd树等),插值,形状分析,拟合,距离等。(The goal of the CGAL Open Source Project is to provide easy access to efficient and reliable geometric algorithms in the form of a C++ library. CGAL is used in various areas needing geometric computation, such as: computer graphics, scientific visualization, computer aided design and modeling, geographic information systems, molecular biology, medical imaging, robotics and motion planning, mesh generation, numerical methods... More on the projects using CGAL web page. The Computational Geometry Algorithms Library (CGAL), offers data structures and algorithms like triangulations (2D constrained triangulations, and Delaunay triangulations and periodic triangulations in 2D and 3D), Voronoi diagrams (for 2D and 3D points, 2D additively weighted Voronoi diagrams, and segment Voronoi diagrams), polygons (Boolean operations, offsets, straight skeleton), polyhedra (Boolean operations), arrangements of curves and their applications (2D and 3D envelopes, Minkowski sums), mesh generation (2D Del)
    2014-12-11 14:45:21下载
    积分:1
  • VCPP-image-processing-chapter08(1)
    VisualC++数字图像处理技术详解第2版光盘-第八章 分水岭分割算法(VisualC++ digital image processing technology Detailed Version 2 CD- Chapter VIII watershed segmentation)
    2016-04-16 13:48:00下载
    积分:1
  • Vista
    说明:  位图分析转换软件 可以分析8,16,24,32位BMP图 输出可选16位,18位,24位RGB格式 同时支持串行下载(Bitmap analysis of 8,16,24,32-bit conversion software can map out the optional 16-bit BMP, 18 bit, 24-bit RGB format also supports serial download)
    2010-04-24 17:24:09下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 31今日下载