搜索资源列表
Asy_test
- opencl实现任务并行，流水线操作。3个kernel同时运行-the opencl overlap
ransacOverlap
- 程序使用sift提取和匹配图像的特征点，使用RANSAC得到图像的单应矩阵H，再将其中一幅图像通过H变换到另一幅图像的坐标系中。最后计算得到两幅图像重叠区域。图像可以换成自己的。-This code use SIFT to extract and match feature points.Then RANSAC is utilized to calculate homography matrix.Finally,the overlap rate of these two images will
Chessboard
- 在一个 （k≥0）个方格组成的棋盘中，恰有一个方格与其他方格不同，称该方格为特殊方格。显然，特殊方格在棋盘中可能出现的位置有 种，因而有4k种不同的棋盘，图a所示是k=2时16种棋盘中的一个。棋盘覆盖问题（chess cover problem）要求用图 (b)所示的4种不同形状的L型骨牌覆盖给定棋盘上除特殊方格以外的所有方格，且任何2个L型骨牌不得重叠覆盖。-In a (k = 0) squares which board, just a different box and other box
memcpy-sh4
- It is assumed that there is no overlap between src and dst.
cir-conv-using-overlao-add
- Program to find circular convolution by overlap add method
YZJYXBPFX
- 基于最大重叠离散小波谱的定义, 本文提出了一种确定分形信号局部奇异性指数的算法, 构造了一种 类似于奇异性谱的直方图, 并用之来描述信号奇异性的全局统计分布. 算法的有效性通过数字试验及在真实心率数据 中的应用得到了验证.-Based on the definition of wavelet spectrum of the maximal overlap discrete wavelet transform, we propose a novel algorithm for dete
fir_windows
- In signal processing, a window function (also known as an apodization function or tapering function[1]) is a mathematical function that is zero-valued outside of some chosen interval. For instance, a function that is constant inside the interval and
2
- 有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<
VB-shape-dectectopm
- 简单的检测一幅图像中是否有正方形长方形圆及三角形，一幅图图像中可以有很多图形，但是竖直方向不能重合-Simple detect whether an image of a circle and a square rectangle triangle, a picture can have a lot of graphic images, but can not overlap in the vertical direction
2131244
- 交叠最小干扰对齐算法，多用户干扰消除，有关求取最大特征值-The minimum overlap interference alignment algorithm, multi-user interference cancellation, related to strike the largest eigenvalues
conv
- For given A/B returns conv(A,B) (non-circular). Subroutine can automatically choose between three implementations: straightforward O(M*N) formula for very small N (or M), overlap-add algorithm for cases where max(M,N) is significantly large
KNN
- 邻近算法，或者说K最近邻(kNN，k-NearestNeighbor)分类算法是数据挖掘分类技术中最简单的方法之一。所谓K最近邻，就是k个最近的邻居的意思，说的是每个样本都可以用它最接近的k个邻居来代表。 kNN算法的核心思想是如果一个样本在特征空间中的k个最相邻的样本中的大多数属于某一个类别，则该样本也属于这个类别，并具有这个类别上样本的特性。该方法在确定分类决策上只依据最邻近的一个或者几个样本的类别来决定待分样本所属的类别。 kNN方法在类别决策时，只与极少量的相邻样本有关。由于kNN方
overlap
- 主要是针对视频中图像字符叠加关键技术、核心算法以及实现的探讨。希望对大家有帮助-Mainly for the video image character overlay of key technologies, and to explore the core algorithm implemented. Hope everyone has to help
gll
- Packing Problem means within a given area of material to find the global optimum is ranked arrangement of parts, making maximum utilization of materials and parts that do not overlap.
sysmem
- Banks don t overlap and there s at least one page gap between adjacent bank entries.
tegra
- Must be section-aligned since a section mapping is used early on. Must not overlap with regions in mach-tegra io.c:tegra_io_desc[].
my_pinjie
- 基于matlab的图像拼接源程序（两幅图片的重叠部分在50 以上）-Matlab-based image stitching source code (part two images overlap in more than 50 )
sys_ia64
- handle fixed mapping: prevent overlap with huge pages.
DWT
- Discrete Wavelet Transform based speech compression technique with zero percent overlap haar mother wavelet.
fw-api-rs
- TODO: avoid overlap between legacy and HT rates.