Location:
Search - local maxima
Search list
Description: 一种比较好用的边缘检测方法CORNER Find corners in tensity image.
％ CORNER works by the following step:
％ 1. Apply the Canny edge detector to the gray level image and obtain a
％ binary edge-map.
％ 2. Extract the edge contours from the edge-map, fill the gaps in the
％ contours.
％ 3. Compute curvature at a low scale for each contour to retain all
％ true corners.
％ 4. All of the curvature local maxima are considered as corner
％ candidates, then rounded corners and false corners due to boundary
％ noise and details were eliminated.
％ 5. End points of line mode curve were added as corner, if they are not
％ close to the above detected corners.
Platform: |
Size: 79363 |
Author: 林蛋大 |
Hits:
Description: 利用登山算法实现图像分割。算法适用于中心灰度较大，而向邻域逐渐递减的区域分割，如微钙化点图像。根据当前窗口手动设定的局部点，寻找局部灰度极大值点，找到16个角度下的种子点。然后以这16个点为种子点进行区域增长，约束条件为相应的灰度约束和空间约束。-Climbing algorithm using image segmentation. Algorithm applied to a larger central gray, and gradually descending to the neighborhood of the region segmentation, such as micro-calcifications image. Based on the current window to manually configure the local point, looking for gray-scale local maxima, found under the perspective of 16 seed points. Then 16 points this seed point for regional growth, constraints for the corresponding gray-bound and space bound.
Platform: |
Size: 93184 |
Author: fly_sea |
Hits:
Description: SUSAN算子用于角点检测的基本步骤： 1） 对于感兴趣的每个象素点（一般的情况就是图像中的每个象素点）作用一圆模板； 2） 根据亮度比较函数计算圆模板中的USAN区域； 3） 根据几何阈值，计算象素点的初始响应； 4） 使用USAN重心与核中心的距离法则去除伪角点，使用USAN重心与核中心的连线上的每个点都必须在USAN区域来保证算法的一致性（即USAN区域的相连性） 5） 对每个象素点的响应，使用 （或更大）的窗口搜索局部极大值，进行非极大值抑制 -SUSAN operator for corner detection of the basic steps: 1) For each pixel of interest points (the general situation is that each image pixel points) the role of one circle template 2) calculated according to the brightness comparison function round Usan template region 3) According to the geometric threshold, calculating the pixel-point initial response 4) the use of Usan center of gravity and nuclear center removed from the law of pseudo-corner, the use of Usan center of gravity and nuclear center to connect the each point must be in the Usan region to ensure consistency algorithm (that is linked to sexual Usan region) 5) points for each pixel in response to, the use of (or greater) of the local maxima search window for non-polar large value of inhibition
Platform: |
Size: 4109312 |
Author: 张妙言 |
Hits:
Description: 一种比较好用的边缘检测方法CORNER Find corners in tensity image.
％ CORNER works by the following step:
％ 1. Apply the Canny edge detector to the gray level image and obtain a
％ binary edge-map.
％ 2. Extract the edge contours from the edge-map, fill the gaps in the
％ contours.
％ 3. Compute curvature at a low scale for each contour to retain all
％ true corners.
％ 4. All of the curvature local maxima are considered as corner
％ candidates, then rounded corners and false corners due to boundary
％ noise and details were eliminated.
％ 5. End points of line mode curve were added as corner, if they are not
％ close to the above detected corners.-A more useful edge detection method CORNER Find corners in tensity image. CORNER works by the following step: 1. Apply the Canny edge detector to the gray level image and obtain a binary edge-map. 2. Extract the edge contours from the edge-map, fill the gaps in the contours. 3. Compute curvature at a low scale for each contour to retain all true corners. 4. All of the curvature local maxima are considered as corner candidates, then rounded corners and false corners due to boundary noise and details were eliminated. 5. End points of line mode curve were added as corner, if they are not close to the above detected corners.
Platform: |
Size: 78848 |
Author: 林蛋大 |
Hits:
Description: 小波脊中单脊提取与多脊提取的程序，其中单脊提取为相位法，多脊提取为局部极大值法。-Wavelet ridge extraction in a single ridge with ridge extraction procedure, in which single-phase method for ridge extraction, multi-ridge extraction method for the local maxima.
Platform: |
Size: 1024 |
Author: 李明 |
Hits:
Description: A new approach toward target representation and localization, the central component in visual tracking
of non-rigid objects, is proposed. The feature histogram based target representations are regularized
by spatial masking with an isotropic kernel. The masking induces spatially-smooth similarity functions
suitable for gradient-based optimization, hence, the target localization problem can be formulated using
the basin of attraction of the local maxima. We employ a metric derived from the Bhattacharyya
coefficient as similarity measure, and use the mean shift procedure to perform the optimization. In the
presented tracking examples the new method successfully coped with camera motion, partial occlusions,
clutter, and target scale variations. Integration with motion filters and data association techniques is also
discussed. We describe only few of the potential applications: exploitation of background information,
Kalman tracking using motion models, and face tracking.-A new approach toward target representation and localization, the central component in visual trackingof non-rigid objects, is proposed. The feature histogram based target representations are regularizedby spatial masking with an isotropic kernel. The masking induces spatially-smooth similarity functionssuitable for gradient-based optimization, hence, the target localization problem can be formulated usingthe basin of attraction of the local maxima. We employ a metric derived from the Bhattacharyyacoefficient as similarity measure, and use the mean shift procedure to perform the optimization. In thepresented tracking examples the new method successfully coped with camera motion, partial occlusions, clutter, and target scale variations. Integration with motion filters and data association techniques is alsodiscussed. We describe only few of the potential applications: exploitation of background information, Kalman tracking using motion models, and face tracking .
Platform: |
Size: 2779136 |
Author: |
Hits:
Description: A collection of functions is presented which includes 2nd generation wavelet decomposition and reconstruction tools for images as well as functions for the computation of moment invariants. The wavelet schemes rely on the lifting scheme of Sweldens. Rectangular grids are split into quincunx grids, also known as red-black ordering. The prediction filters include Neville filters as well as a few nonlinear ones fairly capable of preserving local maxima or minima. The decomposition and reconstruction functions are called in the style of the Matlab Wavelet Toolbox. Many small and a few elaborate examples have been included, ranging from the
computation of moment invariants to
multiresolution image fusion. Please
see Contents.m for an exhaustive list.
-A collection of functions is presented which includes 2nd generation wavelet decomposition and reconstruction tools for images as well as functions for the computation of moment invariants. The wavelet schemes rely on the lifting scheme of Sweldens. Rectangular grids are split into quincunx grids, also known as red-black ordering. The prediction filters include Neville filters as well as a few nonlinear ones fairly capable of preserving local maxima or minima. The decomposition and reconstruction functions are called in the style of the Matlab Wavelet Toolbox. Many small and a few elaborate examples have been included, ranging from the computation of moment invariants to multiresolution image fusion. Please see Contents.m for an exhaustive list.
Platform: |
Size: 592896 |
Author: yuan |
Hits:
Description: 提出一种新的目标表示和定位方法,该方法是非刚体跟踪的核心技术.利用均质空间掩膜规范基于特征直方图的目标表示,该掩膜引入了适合于梯度优化的空间平滑相似函数,所以可以将目标定位问题转换为局部极大值求解问题.我们利用从Bhattacharyya系数倒出的规则作为相似度量,利用mean shift procedure完成优化求解.在给出的测试用例中, 本文方法成功解决了相机移动,阴影,以及其他的图象噪声干扰.文章对运动滤波和数据关联技术的集成也进行了讨论.-A new objective and positioning method to track non-rigid body' s core technology. Standardizing the use of homogeneous space mask the characteristics of histogram based on the objectives that the mask is suitable for the introduction of gradient optimization is similar to spatial smoothing function, Therefore, targeting the problem can be converted to solve the problem of local maxima. We poured from the rules of Bhattacharyya coefficient as similarity measure, using mean shift procedure for solving optimization. give the test cases in, the method succeeded in solving the camera Mobile, shadows, and other image noise. article on the campaign filtering and data association techniques of integration were also discussed.
Platform: |
Size: 2700288 |
Author: maolei |
Hits:
Description: 基于小波变换的分开—合并图像分割matlab
．采用多尺度小波变换系数作为四分树结构的分开一合并法图像分割的一致性度量 从而在大的图像块中。去除噪声的影响，在小的图像块中，以小波变换的局部极大值精确定位边缘，根据边缘信息进行分开一合并法图像分割 ．实验表明．算法得到满意的结果 ．
-Separately based on wavelet transform- the combined image segmentation matlab. The use of multi-scale wavelet coefficients as a separate quarter of the tree structure of one combined method of image segmentation in order to measure the consistency of a large block of images. The impact of noise, in a small block of the image, the wavelet transform to local maxima of the edge of precise positioning, according to the brink of a merger of separate information for image segmentation method. Experiments show that. Algorithm is satisfied with the results.
Platform: |
Size: 125952 |
Author: 陳子力 |
Hits:
Description: Find local maxima in matlab
Platform: |
Size: 1024 |
Author: idillus |
Hits:
Description: this function will help to find local maximas of an one dimensional data,inputs are data array and minimum gap between two local maximas, it is better to use this function after filtering data using median filter
Platform: |
Size: 1024 |
Author: saneem |
Hits:
Description: A new approach toward target representation and localization, the central component in visual tracking of nonrigid objects,
is proposed. The feature histogram-based target representations are regularized by spatial masking with an isotropic kernel. The
masking induces spatially-smooth similarity functions suitable for gradient-based optimization, hence, the target localization problem
can be formulated using the basin of attraction of the local maxima. We employ a metric derived from the Bhattacharyya coefficient as
similarity measure, and use the mean shift procedure to perform the optimization. In the presented tracking examples, the new method
successfully coped with camera motion, partial occlusions, clutter, and target scale variations. Integration with motion filters and data
association techniques is also discussed. We describe only a few of the potential applications: exploitation of background information,
Kalman tracking using motion models, and face tracking.
Platform: |
Size: 2459648 |
Author: Ali |
Hits:
Description:
cntrd: calculates the centroid of bright spots to sub-pixel accuracy.
Inspired by Grier & Crocker s feature for IDL, but greatly simplified and optimized
for matlab
INPUTS:
im: image to process, particle should be bright spots on dark background with little noise
ofen an bandpass filtered brightfield image or a nice fluorescent image
mx: locations of local maxima to pixel-level accuracy from pkfnd.m
sz: diamter of the window over which to average to calculate the centroid.
should be big enough
to capture the whole particle but not so big that it captures others.
if initial guess of center (from pkfnd) is far from the centroid, the
window will need to be larger than the particle size. RECCOMMENDED
size is the long lengthscale used in bpass plus 2.
interactive: OPTIONAL INPUT set this variable to one and it will show you the image used to calculate
each centroid, the pixel-level peak and the centroid-
cntrd: calculates the centroid of bright spots to sub-pixel accuracy.
Inspired by Grier & Crocker s feature for IDL, but greatly simplified and optimized
for matlab
INPUTS:
im: image to process, particle should be bright spots on dark background with little noise
ofen an bandpass filtered brightfield image or a nice fluorescent image
mx: locations of local maxima to pixel-level accuracy from pkfnd.m
sz: diamter of the window over which to average to calculate the centroid.
should be big enough
to capture the whole particle but not so big that it captures others.
if initial guess of center (from pkfnd) is far from the centroid, the
window will need to be larger than the particle size. RECCOMMENDED
size is the long lengthscale used in bpass plus 2.
interactive: OPTIONAL INPUT set this variable to one and it will show you the image used to calculate
each centroid, the pixel-level peak and the centroid
Platform: |
Size: 2048 |
Author: santhu |
Hits:
Description: Peak detection is one of the most important time-domain functions performed in signal monitoring. Peak detection is the process of finding the locations and amplitudes of local maxima and minima in a signal that satisfies certain properties. These properties can be simple or complex. For example, requiring that a peak exceeds a certain threshold value is a simple property. However, requiring that a peak’s shape resembles that of a prototype peak is a complex property.
Platform: |
Size: 1024 |
Author: Kirill Sakhnov |
Hits:
Description: 针对现有的PCB（Printed Circuit Board）缺陷视觉检测系统实时性较差，难以检测线宽过窄等问题，首先对 PCB 缺陷图像进行小波变换压缩，提高了系统实时性；然后应用小波边缘检测算法对缺陷图像边缘精确定位，在图像小波变换局部模极大值对应的梯度方向上计算边缘点距离，根据特定规则提取、识别并定位特定缺陷，实验结果表明上述方法简单有效。-For the existing PCB (Printed Circuit Board) real-time visual inspection system for defects is poor, difficult to detect a narrow line width and other issues, first of all defects on the PCB image compression using wavelet transform and improve the system real time and then apply the wavelet edge detection algorithm precise location of the defect edge in the wavelet transform and local maxima correspond to the gradient direction of edge points to calculate the distance, according to a specific rule extraction, to identify and target specific defects, experimental results show that the method is simple and effective.
Platform: |
Size: 134144 |
Author: 李瑶 |
Hits:
Description: Find peaks in signal. Look for local maxima and minima. In the window of search find the maximum maxima and the minimum minuma. Return two values which are the maximum and the minimum local maximas
Platform: |
Size: 1024 |
Author: Gazo |
Hits:
Description: 基于概率推断的全局轮廓检测技术的研究中的部分程序，其中以canny源代码为主程序，可以自己下载-Probability-based global inference in contour detection technology to find local maxima and the removal of a small edge
Platform: |
Size: 1024 |
Author: pei |
Hits:
Description: 利用膨胀的方法找到局部极大值，可用于一维或多维信号的处理。-Expansion of the method used to find local maxima, can be used for one-dimensional or multidimensional signal processing.
Platform: |
Size: 1024 |
Author: zzg |
Hits:
Description: INDIVIDUAL TREE CROWNS DELINEATION USING LOCAL MAXIMA APPROACH AND SEEDED REGION GROWING TECHNIQUE
Platform: |
Size: 974848 |
Author: moumou |
Hits:
Description: SUSAN角点检测程序，基于像素临域包含若干元素的近似圆形模板，对每个像素基于该模板领域的图像灰度计算角点响应函数（CRF）的数值，如果大于某阈值且为局部极大值，则认为该点为角点。-SUSAN corner detection procedures, pixel-based Pro Domain contains a number of elements in quasi-circular template, the value of each pixel based on the template the field of image gray calculate the angle of the point response function (CRF), if greater than a threshold and local maxima, it is considered the corner.
Platform: |
Size: 3072 |
Author: nana |
Hits: