Results 211 to 220 of about 388,018 (266)
Some of the next articles are maybe not open access.
An effective voting method for circle detection
Pattern Recognition Letters, 2005The drawbacks of the standard Hough transform (SHT) are the large computation and the large storage requirement. Moreover, the voting method of SHT plays an important role to affect the pattern detection accuracy. In this paper, a new voting method is proposed to reduce the computation and the storage requirements of SHT for circle detection.
Shih-Hsuan Chiu, Jiun-Jian Liaw
openaire +3 more sources
2012
In his 1913 letter to G.H. Hardy, Ramanujan gave an asymptotic formula for the nth coefficient of the inverse of a theta function. This was the earliest result obtained using the circle method, the rudiments of which Ramanujan seemed to have had before his journey to England.
M. Ram Murty, V. Kumar Murty
openaire +1 more source
In his 1913 letter to G.H. Hardy, Ramanujan gave an asymptotic formula for the nth coefficient of the inverse of a theta function. This was the earliest result obtained using the circle method, the rudiments of which Ramanujan seemed to have had before his journey to England.
M. Ram Murty, V. Kumar Murty
openaire +1 more source
An Improved Method for Circle Detection
2008The algorithm of Hough transform for edge detection is very useful in digital image processing because of its insensitivity to the noises in the source image, so perfect results can be achieved when the dimension of parameters is less than two. However, the difficulty and complexity of calculation will be increased if the dimension of parameters is ...
Cheng Xing, Jianqiang Wang
openaire +1 more source
Discrete Mathematics and Applications, 1991
See the review in Zbl 0711.11036.
openaire +1 more source
See the review in Zbl 0711.11036.
openaire +1 more source
1985
We mentioned in Chapter 1 that the number r s (n) of solutions of the Diophantine equation $$ \sum\limits_{{k = 1}}^s {x_i^2} = n $$ (12.1) is the coefficient of x n in the Taylor expansion of the function \( 1 + \sum\nolimits_{{n = 1}}^{\infty } {{r_s}(n){x^n}} \).
openaire +1 more source
We mentioned in Chapter 1 that the number r s (n) of solutions of the Diophantine equation $$ \sum\limits_{{k = 1}}^s {x_i^2} = n $$ (12.1) is the coefficient of x n in the Taylor expansion of the function \( 1 + \sum\nolimits_{{n = 1}}^{\infty } {{r_s}(n){x^n}} \).
openaire +1 more source
An efficient method for multiple-circle detection
[1990] Proceedings Third International Conference on Computer Vision, 2002A novel approach for circle detection based on the Hough transform is presented. It avoids the use of trigonometric functions in the transform equations. Instead of using traditional circle parameterization, which involves gradient direction information, this method uses three edge points to accumulate evidence for circle centers.
Xing Cao, Farzin Deravi
openaire +1 more source
Global optimization method for finding dense packings of equal circles in a circle
European Journal of Operational Research, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wenqi Huang 0001, Tao Ye 0005
openaire +2 more sources
An improved method for circle detection
2015A split and merge method for detecting circular objects has been proposed in this paper. In the split stage, curve segmentation is performed by using a dominant point detection method. The segments are then classified as linear or nonlinear segments by the linearity criterion.
openaire +1 more source