• 대한전기학회논문지:시스템및제어부문D
• /
• 제54권7호
• /
• pp.453-457
• /
• 2005

With the expansion of Internet, a variety of image databases are widely used and it is needed to select the part of an image what he wants. In contents-based image retrieval system, Zernikie moment and ART Descriptors are used fur shape descriptors in MPEC-7. This paper presents a fast computation method to determine the radius of a bounding circle that encloses an object in a binary image. With conventional methods, the whole area of the image should be scanned first and the distance from every pixel to the center point be computed. The proposed 4-directional scan method and fast circle-drawing algorithm is utilized to minimize the scanning area and reduce the number of operations fur computing the distance. Experimental results show that proposed method saves the computation time to determine the radius of a bounding circle efficiently.

• International Journal of Contents
• /
• 제2권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.

• 한국정밀공학회지
• /
• 제19권9호
• /
• pp.142-150
• /
• 2002

This study describes a method of finding an optimal path of a soccer robot by using a concentric circle method with different radii of rotation. Comparing with conventional algorithms which try to find the shortest path length, the variable concentric circle method find the shortest moving time. The radius fur the shortest moving time for a given ball location depends on the relative location between a shooting robot and a ball. Practically it is difficult to find an analytical solution due to many unknowns. Assuming a radius of rotation within a possible range, total path moving time can be calculated by adding the times needed for straight path and circular path. Among these times the shortest time is obtained. In this paper, a graphical solution is presented such that the game ground is divided into 3 regions with a minimum, medium, and maximum radius of rotation.

• 충청수학회지
• /
• 제15권1호
• /
• pp.87-94
• /
• 2002

Trot(1999) considered how to calculate the expected area of a random triangle in the unit square $[0,1]{\times}[0,1]$. He used the Mathematica software package for the computational part. In this article, we study various aspects of the probability distribution of a triangle randomly chosen inside the circle of radius r. A simulation activity that can be conducted in statistics and probability classrooms is also considered.

• 호남수학학술지
• /
• 제34권1호
• /
• pp.103-111
• /
• 2012

Wetzel[5] proved if ${\Gamma}$ is a closed curve of length L in $E^n$, then ${\Gamma}$ lies in some ball of radius [L/4]. In this paper, we generalize Wetzel's result to the non-Euclidean plane with much stronger version. That is to develop a lower bound of length of a triangle inscribed in a circle in non-Euclidean plane in terms of a chord of the circle.

• 한국컴퓨터정보학회논문지
• /
• 제23권2호
• /
• pp.27-34
• /
• 2018

In this paper, we propose a new method to read the hand of analog gauges to prepare for the smart factory. In addition, we suggest a new and improved method that can apply, in general, diverse analog gauges even if their scale types and ranges are various. Many companies are making great efforts to build smart factories that increase energy efficiency and automation. Managers use a variety of equipment and tools to manage the production process at the factory. In this kind of factory, analog gauges have been often used with many equipment and tools. Analog gauges are mostly circular in shape, and most papers use circular hough transform to find the center and radius of a circle. However, when the object to be found is not of the correct circle type, it takes a long time to recognize the circle using the circular hough transform, and the center and radius of the circle can not be calculated accurately. The proposed method was tested on various circular analog gauges. As a result, we confirmed that our method is outstanding.

• 디지털융복합연구
• /
• 제11권2호
• /
• pp.215-220
• /
• 2013

현의 수직이등분선은 원의 중심을 지나고 임의의 두 현의 수직이등분선들의 교점은 중심이라는 것은 잘 알려진 원의 기하학적 특성이다. 본 논문은 홍채 분할을 위해 동공 영역을 검출할 시, 이러한 원의 기하학적 특성을 이용하여 동공의 중심과 반경을 고속으로 검출할 수 있는 고속 동공 검출 방법에 관한 것이다. 제안된 방법은 인간의 안구 영상에서 수리 형태학 연산을 통해 동공의 원형 윤곽 후보점들을 추출한 후, 원형 윤곽 상의 네 점을 이용하여 두 개의 현을 구하고 이 두 현의 수직이등분선들 간의 교점을 원의 중심으로 삼음으로써 동공의 중심과 반경을 고속으로 검출할 수 있는 것이 특징이다. 제안된 방법은 안구 영상에서 고속으로 동공의 반경과 중심을 검출할 수 있을 뿐만 아니라 부분적으로 가려진 동공도 검출할 수 있다.

• 한국멀티미디어학회논문지
• /
• 제10권12호
• /
• pp.1601-1611
• /
• 2007

In this paper, we presented geometric CAD watermarking scheme for Architectural design drawings using line, arc, and circle components to prevent infringement of copyright from unlawfulness reproductions and distribution. The conventional CAD watermarking scheme can be applied to both line and arc components. But the proposed scheme consists of line, arc and circle watermarking schemes for three basic components of CAD design. After extracting line, arc and circle components from designed drawing, the watermark is embedded into the length of Line component, the angle of arc component, and the radius of circle component considering the robustness against various geometric transformations. The embedding strengths in each component are determined to be preserving the transparency of the watermark. By experimental result, we confirmed the robustness and the invisibility of embedded watermarks in several conversions of architectural design drawing.

• 산업경영시스템학회지
• /
• 제42권3호
• /
• pp.52-60
• /
• 2019

This paper presents a numerically robust algorithm to construct a Voronoi diagram of circles in the plane. The circles are allowed to have intersections among them, but one circle cannot fully contain another circle. The Voronoi diagram is a tessellation of the plane into Voronoi regions of given circles. Each circle has its Voronoi region which is defined by a set of points in the plane closer to the circle than any other circles. The distance from a point p to a circle $c_i$ of center $p_i$ and radius $r_i$ is ${\parallel}p-p_i{\parallel}-r_i$, which is the closest Euclidean distance from p to the circle boundary. The proposed algorithm first constructs the point Voronoi diagram of centers of given circles, then it enlarges each point to the circle and expands its Voronoi region accordingly. This region-expansion process is done by local modifications and after completing this process for the whole circles the desired circle Voronoi diagram can be obtained. The proposed algorithm is numerically robust and we provide with a few examples to show its robustness. The algorithm runs in $O(n^2)$ time in the worst case and O(n) time on average where n is the number of the circles. The experiment shows that the region-expansion algorithm is robust and runs fast with strong linear time behavior.

• 제어로봇시스템학회논문지
• /
• 제18권4호
• /
• pp.365-370
• /
• 2012

Most path planning algorithms for a marine robot in the ocean environment have been developed without considering the robot's heading angle. As a result, the robot has a difficulty in following the path correctly. In this paper, we propose a limit-cycle circle set that applies to the $Theta^*$ algorithm. The minimum turning radius of a marine robot is calculated using a limit-cycle circle set, and circles of this radius is used to generate a configuration space of an occupancy grid map. After applying $Theta^*$ to this configuration space, the limit-cycle circle set is also applied to the start and end nodes to find the appropriate path with specified heading angles. The benefit of this algorithm is its fast computation time compared to other 3-D ($x,y,{\theta}$) path planning algorithms, along with the fact that it can be applied to the 3-D kinematic state of the robot. We simulate the proposed algorithm and compare it with 3-D $A^*$ and 3-D $A^*$ with post smoothing algorithms.