• Journal of the Korea Society of Computer and Information
• /
• v.21 no.6
• /
• pp.21-28
• /
• 2016

Circle detection has long been studied as one of fundamental image processing applications. It is used in divers areas including industrial inspection, medial image analysis, radio astronomy data analysis, and other object recognition applications. The most widely used class of circle detection techniques is the circle Hough transform and its variants. Management of 3 dimensional parameter histogram used in these methods brings about spatial and temporal overheads, and a lot of studies have dealt the problem. This paper proposes a robust circle detection method using maximal symmetry property of circle. The basic idea is that if perpendicular bisectors of pairs of edges are accumulated in image space, center of circle is determined to be the location of highest accumulation. However, directly implementing the idea in image space requires a lot of calculations. The method of this paper reduces the number of calculations by mapping the perpendicular bisectors into parameter space, selecting small number of parameters, and mapping them inversely into image space. Test on 22 images shows the calculations of the proposed method is 0.056% calculations of the basic idea. The test images include simple circles, multiple circles with various sizes, concentric circles, and partially occluded circles. The proposed method detected circles in various situations successfully.

• International Journal of Contents
• /
• v.2 no.3
• /
• pp.22-26
• /
• 2006

In this paper we introduce a new circle detection algorithm for occluded on/off pupil and iris boundary extraction. The proposed algorithm employs 7-step processing to detect a center and radius of occluded on/off eye images using the property of the chords. The algorithm deals with two types of occluded pupil and iris boundary information; one is composed of circle-shaped, incomplete objects, which is called occluded on iris images and the other type consists of arc objects in which circular information has partially disappeared, called occluded off iris images. This method shows that the center and radius of iris boundary can be detected from as little as one-third of the occluded on/off iris information image. It is also shown that the proposed algorithm computed the center and radius of the incomplete iris boundary information which has partially occluded and disappeared. Experimental results on RGB images and IR images show that the proposed method has encouraging performance of boundary detection for pupil and iris segmentation. The experimental results show satisfactorily the detection of circle from incomplete circle shape information which is occluded as well as the detection of pupil/iris boundary circle of the occluded on/off image.

• Current Optics and Photonics
• /
• v.3 no.3
• /
• pp.204-209
• /
• 2019

In an optical interferometer that uses sinusoidal modulation and quadrature detection, the amplitude and offset of the interference signal vary with time, even without considering system noise. As a result, the circular Lissajous figure becomes elliptical, with wide lines. We propose and experimentally demonstrate a method for compensating quadrature detection error, based on digital signal processing to deal with scaling and fitting. In scaling, fluctuations in the amplitudes of in-phase and quadrature signals are compensated, and the scaled signals are fitted to a Lissajous unit circle. To do so, we scale the average fluctuation, remove the offset, and fit the ellipse to a unit circle. Our measurements of a target moving with uniform velocity show that we reduce quadrature detection error from 5 to 2 nanometers.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.12
• /
• pp.2953-2960
• /
• 2014

In the field of image recognition, circle detection is one of the most widely used techniques. Conventional algorithms are mainly based on Hough transform, which is the most straightforward algorithm for detecting circles and for providing enough robust algorithm. However, it suffers from large memory requirements and high computational loads, and sometimes tends to detect incorrect circles. This paper proposes an optimal circle detection and approximation method which is applicable for inspecting fiber optic connector endface. The proposed method finds initial center coordinates and radius based on the initial edge lines. Then, by introducing the simplified K-means algorithm, the proposed method investigates a substitute-circle by minimizing the area of non-overlapped regions. Through extensive simulations, it is shown that the proposed method can improve the error rate by as much as 67% and also can reduce the computing time by as much as 80%, compared to the Hough transform provided by the OpenCV library.

• Journal of Korean Neurosurgical Society
• /
• v.29 no.3
• /
• pp.345-352
• /
• 2000

Objective : The purpose of this study was to compare computed tomographic angiography(CTA) with conventional cerebral angiography(CCA) and to assess usefulness of CTA in detection and anatomic definition of intracranial aneurysms of the circle of Willis in subarachnoid hemorrhage. Patients and Methods : Fifty consecutive patients with known or suspected intracranial saccular aneurysms underwent CTA with preoperative CCA from 1997 to 1999. Using surface shaded display post-processing technique, CTA was interpreted for the presence, location of aneurysms and anatomic features. The image obtained with CTA was then compared with CCA image. Results : In 47 patients, CCA revealed 57 cerebral aneurysms and CTA revealed 54 aneurysms. Two of the 57 cerebral aneurysms were located outside of the imaging volume of CTA and one case was misdiagnosed. The sensitivity of CTA was 94.7% and the specificity was 100%. The results obtained with CTA were, compared with the results obtained with CCA, equal in determining dome shape, direction and lobularity. However, CTA provided a 3-dimensional representation of aneurysmal lesion very useful for surgical planning. Moreover, CTA was useful for rapid and relatively noninvasive detection of aneurysms in the circle of Willis. Conclusion : CTA can be a diagnostic tool for the patients with acute subarachnoid hemorrhage due to a ruptured aneurysm of the circle of Willis and provides adequate anatomic detail for surgical planning, especially to complex cerebral aneurysms. However, we think CCA is necessary because of CTA limitations including its difficulty in detecting unusually located aneurysms(including those in cavernous sinus or distal artery) and combined vascular lesion (including arteriovenous malformation) and acquiring dynamic flow information.

• Journal of Digital Convergence
• /
• v.11 no.2
• /
• pp.215-220
• /
• 2013

They are well-known geometric properties of a circle that the perpendicular bisector of a chord passes through the center of a circle, and the intersection of the perpendicular bisectors of any two chords is its center. This paper is related to a fast pupil detection method capable of detecting the center and the radius of a pupil using these geometric properties at high speed when detecting the pupil region for iris segmentation. The proposed method is characterized as rapidly detecting the center and the radius of the pupil, extracting the candidate points of the circle in human eye images using morphological operations, and finding two chords using four points on the circular edge, and taking the intersection of the perpendicular bisectors of these two chords for its center. The proposed method can not only detect the center and the radius of a pupil rapidly but also find partially occluded pupils in human eye images.

• Journal of Internet Computing and Services
• /
• v.11 no.6
• /
• pp.31-39
• /
• 2010

The Generalized Hough Transform(GHT) is the most used algorithm for circle detection with high accuracy. However, it requires many computation time, because many different templates are applied in order to find circles of various size. In the case of circle detection and tracking in video, the classical approach applies GHT for each frame in video and thus needs much high processing time for all frames. This paper proposes the fast GHT algorithm in video, using two consecutive frames are similar. In the proposed algorithm, a change-driven method conducts GHT only when two consecutive frames have many changes, and trajectory-based method does GHT in candidate areas and with candidate radius using circles detected in a previous frame. The algorithm can reduce computation time by reducing the number of frames, the edge count, and the number of searching circles, as factors which affects the speed of GHT. Our experimental results show that the algorithm successfully detects circles with less processing time and no loss of accuracy in video acquisited by a fixed camera and a moving camera.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.607-611
• /
• 2008

This paper proposes new video signature using spatio-temporal information for copy detection. The proposed video copy detection method is based on concentric circle partitioning method for each key frame. Firstly, key frames are extracted from whole video using temporal bilinear interpolation periodically and each frame is partitioned as a shape of concentric circle. For the partitioned sub-regions, 4 feature distributions of average intensity, its difference, symmetric difference and circular difference distributions are obtained by using the relation between the sub-regions. Finally these feature distributions are converted into binary signature by using simple hash function and merged together. For the proposed video signature, the similarity distance is calculated by simple Hamming distance so that its matching speed is very fast. From experiment results, the proposed method shows high detection success ratio of average 97.4% for various modifications. Therefore it is expected that the proposed method can be utilized for video copy detection widely.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.9
• /
• pp.643-650
• /
• 2013

In this paper, we propose a novel method for enhancing the detection speed and rate by reducing the computation in Hough Circle Transform on real-time iris detection of smartphone camera image. First of all, we find a face and eyes from input image to detect iris and normalize the iris region into fixed size to prevent variation of size for iris region according to distance from camera lens. Moreover, we carry out histogram equalization to get regular image in bright and dark illumination from smartphone and calculate minimal iris range that contains iris with the distance between corner of the left eye and corner of the right eye on the image. Subsequently, we can minimize the computation of iris detection by applying Hough Circle Transform on the range including the iris only. The experiment is carried out in two case with bright and dark illumination. Our proposed method represents that detection speed is 40% faster and detection rate is 14% better than existing methods.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.1
• /
• pp.73-79
• /
• 1998

In this paper, a new traffic sign detection algorithm.. and a symbol recognition algorithm are proposed. For traffic sign detection, a dominant color transform is introduced, which serves as a tool of highlighting a dominant primary color, while discarding the other two primary colors. For symbol recognition, the curvilinear shape distribution on a circle centered on the centroid of symbol, called a circular pattern vector, is used as a spatial feature of symbol. The circular pattern vector is invariant to scaling, translation, and rotation. As simulation results, the effectiveness of traffic sign detection and recognition algorithms are confirmed, and it is shown that group of circular patter vectors based on concentric circles is more effective than circular pattern vector of a single circle for a given equivalent number of elements of vectors.