搜索资源列表
ZHUIzhu-moxing
- 追逐问题是现实生活中的常见问题,本文就三人绕正三角形的追逐问题建立起了两个数学模型:一个充分应用运动的周期性首先给出了三人共边的充要条件,然后直接给出在一个周期内三人共边的次数及起止时刻,另一个则利用初等数论的方法给出了三人共边的另一个充要条件 利用matlab长于计算和强大的绘图功能,本文分别给出了求解两个模型的matlab程序,通过动画仿真演示三人绕正三角形的追逐模型,并给出三者共边的时间起止点和共边的次数。 更多还原-The problem is that in real life the
Chapter-7-Edges-and-Contours
- Edge and contours - Image Processing
TuXiangChuLi
- 寻找衣服设计图像的交点以及拐点。 在设计的衣服图像中，有很多的交点（布料缝合处），还有衣服的边缘（拐点），可以通过程序找到这些点，并做标记以供后期处理。-Find clothing design intersection of image and inflection. In the graphic design of the clothes, there are a lot of intersection (cloth stitching), as well as the edges
Channel-Division-drak-image-enhancement
- A content-aware algorithm that enhances dark images, sharpens edges, reveals details in textured regions, and preserves the smoothness of flat regions is proposed. The algorithm produces an ad hoc transformation for each image, adapting the mapping f
GraphsNew
- A graph G = (V, E) consists of a set of vertices, V, and a set of edges, E, where each edge is a pair (v,w) s.t. v,w V Vertices are sometimes called nodes, edges are sometimes called arcs. If the edge pair is ordered then the graph is
regular_mesh
- Finland Matlab cannot do regular meshes for non-regtancular regions. However, one can manually do very coarse regular meshes for these type domains. The difficulty is with the edge data e. If this data does not correspond to the orientatio
PhaseCorners
- 基于相位一致性特征角点、边缘特征检测的基本原理介绍（ppt）-Phase Congruency Detects Corners and Edges
fast-template-matching
- 本文提出一种基于图像边缘几何特征的快速模板匹配算法。算法利用边缘 点的位置和梯度方向作为匹配信息进行相似度计算。可以很好的避免因图像明 暗变化、光照不均匀、旋转所带来的影响，且对于部分遮挡的情况，亦可以得 到良好的匹配结果。为了得到边缘点坐标和梯度方向，本文根据曲面拟合原理， 通过平移变换，推导出精确梯度方向和亚像素边缘坐标的快速算法。既加快了 算法的处理速度，也是匹配算法高精度的前提保证。为了使匹配算法满足实时 性要求，主要采用阈值判断和图像金字塔算法的搜索策略。在阈值
OPTICAL-waveguidehomework3
- 如上图所示，定向耦合器由完全相同的直波导与弯曲波导构成，波 导芯为宽高比相同（均为 a） 的正方形， 其工作波长，波导材料 对 TE 模式的折射率，及圆弧形弯曲波导的半径 r 等参数如图所 示，若波长为 1550 nm， 归一化光功率为 1 的光波从直波导输 入，请选择适当的满足单模工作的波导宽度 a， 然后给出从圆形弯 曲波导输出的归一化光功率 P4与两波导边缘的间距 d-Directional coupler by the same straight and curved
bilateral-filterlte
- In the existing bilateral filtering algorithm, the domain parameters and range parameters need to be predefined. Parameters of a bilateral filter are fixed and cannot guarantee to be optimal. A new adaptive bilateral filtering (ABF) is proposed i
Heuristic-method-for-the-Traveling-Salesman-Probl
- Heuristic method for the Traveling Salesman Problem A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected.
HM-TSP
- Heuristic method for the Traveling Salesman Problem A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected.