Search - Radius point

Search - Radius point - List

[matlab] radon_ambiguity DL : 0: ％radon transform clear all ％ N=800 n=1:N fs=200 t=n/fs x1=exp(j*2*pi*(5*t+0.5*5*t.^2)) x2=exp(j*2*pi*(5*t+0.5*15*t.^2)) x=x1+x2 ％N=length(x) ％ ambifunb(x ) ％*****************************************RAT naf=ambifunb(x) htl(abs(naf)) ％ [wh,rho,theta]=htl(abs(naf)) colormap([0,0,0]) ％ xlabel( 极半径 ) ％ ylabel( 角度 ) ％**************************************％找出峰值点的坐标,计算初始频率和调频斜率(正确) ％找出峰值点的坐标 b=max(max(wh)) [u,a]=find(wh>=0.8*b) - Radon transformclear all N = 800 n = 1: N fs = 200 t = n/fs x1 = exp (j* 2* pi* (5* t+ 0.5* 5* t. ^ 2)) x2 = exp ( j* 2* pi* (5* t+ 0.5* 15* t. ^ 2)) x = x1+ x2 N = length (x) ambifunb (x)***************************************** RATnaf = ambifunb (x) htl (abs (naf)) [wh, rho, theta ] = htl (abs (naf)) colormap ([0,0,0]) xlabel (polar radius) ylabel (angle)************************************** to find the coordinates of the peak point, calculating the initial slope of the frequency and FM (right) find the peak point of the coordinates b = max (max ( wh)) [u, a] = find (wh
Date : 2025-12-31 Size : 1kb User : abcde
[matlab] Circle-Fit DL : 0: 这次上传的程序源码是关于根据给定的xy点，拟合一个圆，依据是半径平方偏差的和。-The upload program source code is about according to the given xy point, fitting a circle, based on the radius squared deviations and.
Date : 2025-12-31 Size : 43kb User : apple
[matlab] calcAngularDerivative DL : 0: This function calculates the radial derivative of an input image. Input parameters: inputImage - the image to calculate the derivative from radialFilterLength - the length of the filter to use, total length will be 2*radialFilterLength+1 centerX and centerY - the point that is considered the center of the image, for the calculation minRadius and maxRadius - the minimum and maximum radius to calculate the angular derivative for. radialApproach - set to 1 to use a radius and angle search method, or 0 for a per-pixel approach -This function calculates the radial derivative of an input image. Input parameters: inputImage - the image to calculate the derivative from radialFilterLength - the length of the filter to use, total length will be 2*radialFilterLength+1 centerX and centerY - the point that is considered the center of the image, for the calculation minRadius and maxRadius - the minimum and maximum radius to calculate the angular derivative for. radialApproach - set to 1 to use a radius and angle search method, or 0 for a per-pixel approach
Date : 2025-12-31 Size : 1kb User : alan
[matlab] HoughObject DL : 0: Circles We can extend the Hough transform to other shapes that can be expressed parametrically. For example, a circle of fixed radius can be described fully by the location of its center (x, y). Think of each feature (edge) point on the circle as saying, ”if I’m on the circle, the center must be in one of these places”. It turns out that the locus of these votes is itself a circle. But what about circles of unknown size? In this case, we need a third parameter: the radius of the circle. So, we can parameterize circles of arbitrary size by (x, y, r). Instead of casting votes in a circular pattern into a two-dimensional accumulator, we cast votes in circles of successively larger size in a three-dimensional accumulator.
Date : 2025-12-31 Size : 102kb User : mina
[matlab] BallFretting190809 DL : 0: This tool is a simplification of the ballpivoting algorithm. It imagines a bella eating a delaunay traignulation in order to extract a manifold surface. It requires a single parameter: radius of the fretting ball. Ball Fretting Given a uniform sampled filled point cloud returns a tight triangulation. Input: ■tetr: a set of tetraedrons, nx4 array. If the cloud is not tesselated yet you need to call a delaunay triangulator prior calling this function. ■p : nx3 array, 3D set of points. ■r : the only parameter of the algorithm, the radius of the fretting ball Output: ■t : triangles ids, nx3 array ■tnorm: normals of triangles with outwards orientation
Date : 2025-12-31 Size : 832kb User : tao lu
[matlab] cylinder2 DL : 0: Making Cylinder code for matlab using top and bottom point with radius
Date : 2025-12-31 Size : 3kb User : josh
[matlab] bcross DL : 0: 将断层剖面划分为一组网格，并以固定的事件数或固定的扫描半径，计算每个网格点处的b值。然后用色彩表示断层面上b值的分布情况，从而反应断层的应力积累情况，便于地震学家分析该断层是否存在发震的可能-This subroutine creates a grid with spacing dx,dy (in degreees). The size will be selected interactively or grids the entire cross section. The b-value in each volume is computed around a grid point containing ni earthquakes or in between a certain radius. The standard deviation is calcualted either with the max. likelihood or by bootstrapping, when that box is checked. If not, both options can be assigned by the additional run assignment. Standard deviation of b-value in non-bootstrapping case is calculated from Aki-formula!
Date : 2025-12-31 Size : 4kb User : 柳青
[matlab] susan DL : 0: mallest Univalue Segment Assimilating Nucleus is used to extract the edge and corner points of local feature area. The principle of operator SUSAN is to make a mask on the circle area of one point with the radius of r and then observe every point in the whole image on the consistency of this point with all points contained in the mask area.
Date : 2025-12-31 Size : 40kb User : omid
[matlab] segmentiris DL : 0: Edge detection result should be enhanced using linear method like Median filter to remove the garbage around the pupil to gain clear pupil to determine perfect centre. Get the centre of the pupil by counting the number of black pixels (zero value) of each column and row. Then get each row and column that has the maximum number of these black pixels. Then determine the center by simple calculation according to the image coordinate to set it correct on the image, consequently we can determine the radius of the pupil. Thus we can find the pupillary boundary (inner). A similar procedure is extended by using a coarse scale to locate the outer boundary (limbus) which can be apparent by using the mid-point algorithms of circle and ellipse.
Date : 2025-12-31 Size : 1kb User : boss
[matlab] hysthresh DL : 0: Edge detection result should be enhanced using linear method like Median filter to remove the garbage around the pupil to gain clear pupil to determine perfect centre. Get the centre of the pupil by counting the number of black pixels (zero value) of each column and row. Then get each row and column that has the maximum number of these black pixels. Then determine the center by simple calculation according to the image coordinate to set it correct on the image, consequently we can determine the radius of the pupil. Thus we can find the pupillary boundary (inner). A similar procedure is extended by using a coarse scale to locate the outer boundary (limbus) which can be apparent by using the mid-point algorithms of circle and ellipse.
Date : 2025-12-31 Size : 2kb User : boss
[matlab] nonmaxsup DL : 0: Edge detection result should be enhanced using linear method like Median filter to remove the garbage around the pupil to gain clear pupil to determine perfect centre. Get the centre of the pupil by counting the number of black pixels (zero value) of each column and row. Then get each row and column that has the maximum number of these black pixels. Then determine the center by simple calculation according to the image coordinate to set it correct on the image, consequently we can determine the radius of the pupil. Thus we can find the pupillary boundary (inner). A similar procedure is extended by using a coarse scale to locate the outer boundary (limbus) which can be apparent by using the mid-point algorithms of circle and ellipse.
Date : 2025-12-31 Size : 1kb User : boss
[matlab] linecoords DL : 0: Edge detection result should be enhanced using linear method like Median filter to remove the garbage around the pupil to gain clear pupil to determine perfect centre. Get the centre of the pupil by counting the number of black pixels (zero value) of each column and row. Then get each row and column that has the maximum number of these black pixels. Then determine the center by simple calculation according to the image coordinate to set it correct on the image, consequently we can determine the radius of the pupil. Thus we can find the pupillary boundary (inner). A similar procedure is extended by using a coarse scale to locate the outer boundary (limbus) which can be apparent by using the mid-point algorithms of circle and ellipse.
Date : 2025-12-31 Size : 1kb User : boss
[matlab] circlecoords DL : 0: Edge detection result should be enhanced using linear method like Median filter to remove the garbage around the pupil to gain clear pupil to determine perfect centre. Get the centre of the pupil by counting the number of black pixels (zero value) of each column and row. Then get each row and column that has the maximum number of these black pixels. Then determine the center by simple calculation according to the image coordinate to set it correct on the image, consequently we can determine the radius of the pupil. Thus we can find the pupillary boundary (inner). A similar procedure is extended by using a coarse scale to locate the outer boundary (limbus) which can be apparent by using the mid-point algorithms of circle and ellipse.
Date : 2025-12-31 Size : 1kb User : boss
[matlab] houghcircle DL : 0: Edge detection result should be enhanced using linear method like Median filter to remove the garbage around the pupil to gain clear pupil to determine perfect centre. Get the centre of the pupil by counting the number of black pixels (zero value) of each column and row. Then get each row and column that has the maximum number of these black pixels. Then determine the center by simple calculation according to the image coordinate to set it correct on the image, consequently we can determine the radius of the pupil. Thus we can find the pupillary boundary (inner). A similar procedure is extended by using a coarse scale to locate the outer boundary (limbus) which can be apparent by using the mid-point algorithms of circle and ellipse.
Date : 2025-12-31 Size : 1kb User : boss
[matlab] gaborconvolve DL : 0: Edge detection result should be enhanced using linear method like Median filter to remove the garbage around the pupil to gain clear pupil to determine perfect centre. Get the centre of the pupil by counting the number of black pixels (zero value) of each column and row. Then get each row and column that has the maximum number of these black pixels. Then determine the center by simple calculation according to the image coordinate to set it correct on the image, consequently we can determine the radius of the pupil. Thus we can find the pupillary boundary (inner). A similar procedure is extended by using a coarse scale to locate the outer boundary (limbus) which can be apparent by using the mid-point algorithms of circle and ellipse.
Date : 2025-12-31 Size : 1kb User : boss
[matlab] RBNN DL : 0: Algorithm based in graph theory, in which form cluster around of a radius r of a point.
Date : 2025-12-31 Size : 1kb User : omga
[matlab] BEM_FOR_MATLAB DL : 1: 边界元测量垂直接地极地表电势的MATLAB程序垂直接地极半径r=0.05m，长度l=0.5m,垂直接地极上电位V0=30V,边界元法求解径向向外8个点的电势.-Boundary element potential measuring vertical ground Polar table MATLAB program vertical ground electrode radius r = 0.05m, length l = 0.5m, the vertical grounding on potential V0 = 30V, the Boundary Element Method radially outwardly eight-point potential.
Date : 2025-12-31 Size : 82kb User : 凌厉
[matlab] WTLS_fitting DL : 0: 基于加权整体最小二乘迭代算法，利用井壁同一截面特征点坐标序列，拟合煤矿井筒圆心的坐标序列和半径，监测竖井变形情况-Overall weighted least-squares iterative algorithm, using the same sequence of the wall section feature point coordinates, the coordinates of the center of mine shaft fitting sequence and radius shaft deformation monitoring
Date : 2025-12-31 Size : 1kb User : qinchangbiao
[matlab] MoM_Dipole_Antenna_Current_Distribution_HallenIE. DL : 0: Current distribution a center fed (delta-gap) thin dipole antenna (length=2L, radius=a) will be solved with Method of Moments. Hallen s integro-differential equation will be solved by using pulse basis function and point matching testing scheme.-Current distribution on a center fed (delta-gap) thin dipole antenna (length=2L, radius=a) will be solved with Method of Moments. Hallen s integro-differential equation will be solved by using pulse basis function and point matching testing scheme.
Date : 2025-12-31 Size : 1kb User : caner
[matlab] 20090322 DL : 0: 一、算法伪码： 1、初始化： 1.1每一个空间的点映射到二维窗格，每个空间的点分配唯一的二维窗格坐标。一个窗格只能有一个点。 1.2为每一只蚂蚁在二维窗格分配唯一的地址（第一步需要注意的是：空间上点的位置和平面窗格上点的位置完全是两回事，空间上两个点的位置来计算两点之间的距离；而平面上点的位置，主要是用来确定半径为S的区域内的点，计算两个点的空间距离，进而计算群体相似度，最后通过群体相似度来计算拾起或者放下的概率） 2、迭代tmax次 3、所有的蚂蚁运动一次 4、产生一个0-1之间的随机数R 5、如果当前蚂蚁处于未负载状态，而且当前蚂蚁所在处的有点Oi 5.1、计算群体相似度f(Oi)和拾起概率Pp(Oi) 5.2、如果拾起概率Pp(Oi)》R 5.2.1、当前蚂蚁拾起点Oi（注意Oi在窗格中的位置是不断变动的） 5.3 5.2结束 6、如果条件5不成立，如果当前蚂蚁处于负载状态，持有点Oi，而且当前位置没有其他点 6.1计算群体相似度f(Oi)和放下概率Pd(Oi) 6.2如果放下概率Pd(Oi)》R 6.2.1放下节点Oi（注意点Oi在窗格中的位置是不断变动的） 6.3 6.2结束 7、5结束 8、当前蚂蚁移到邻近区域内的没有被其他蚂蚁占据的节点 9、所有的蚂蚁运动一次结束 10、迭代tmax次结束 -First, the algorithm pseudocode: 1. Initialization: 1.1 point each to the two-dimensional space mapping pane, the point of each space is assigned a unique two-dimensional coordinates of the pane. A pane of only one point. 1.2 for each ant is assigned a unique address in the two-dimensional pane (the first step should be noted: the location and position of plane points pane space is completely different points, two points on the spatial position is calculated distance between two points and the position of the point on the plane is mainly used to determine the radius of the dot area S within the space of two points to calculate the distance, and then calculate the similarity group, and finally through group similarity calculating pickup probability plays or put down) 2, iterative tmax 3 times, once all the ants motion 4, R 5 a generates a random number between 0 and 1, if the current state of the ant is unloaded, and the current location at the little ant Oi 5.1 calculating the similar
Date : 2025-12-31 Size : 326kb User : chensumin

« 12 »