• Journal of Biosystems Engineering
• /
• 제23권4호
• /
• pp.381-390
• /
• 1998

An algorithm to extract the 3-D geometric information of a static object was developed using a set of 2-D computer vision system and a laser structured lighting device. As a structured light pattern, multi-parallel lines were used in the study. The proposed algorithm was composed of three stages. The camera calibration, which determined a coordinate transformation between the image plane and the real 3-D world, was performed using known 6 pairs of points at the first stage. Then, utilizing the shifting phenomena of the projected laser beam on an object, the height of the object was computed at the second stage. Finally, using the height information of the 2-D image point, the corresponding 3-D information was computed using results of the camera calibration. For arbitrary geometric objects, the maximum error of the extracted 3-D feature using the proposed algorithm was less than 1~2mm. The results showed that the proposed algorithm was accurate for 3-D geometric feature detection of an object.

• 제어로봇시스템학회논문지
• /
• 제15권11호
• /
• pp.1080-1087
• /
• 2009

This paper presents an algorithm to acquire 3D geometric information using a virtual plane method. The method to measure 3D information on the plane is easy, because it's not concerning value on the z-axis. A plane can be made by arbitrary three points in the 3D space, so the algorithm is able to make a number of virtual planes from feature points on the target object. In this case, these geometric relations between the origin of each virtual plane and the origin of the target object coordinates should be expressed as known homogeneous matrices. To include this idea, the algorithm could induce simple matrix formula which is only concerning unknown geometric relation between the origin of target object and the origin of camera coordinates. Therefore, it's more fast and simple than other methods. For achieving the proposed method, a regular pin-hole camera model and a perspective projection matrix which is defined by a geometric relation between each coordinate system is used. In the final part of this paper, we demonstrate the techniques for a variety of applications, including measurements in industrial parts and known patches images.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제18권7호
• /
• pp.1774-1794
• /
• 2024

In the field of environmental sensing, it is necessary to develop radio planning techniques for the next generation Internet of Things (IoT) networks over mixed terrains. Such techniques are needed for smart remote monitoring of utility supplies, with links situated close to but out of range of cellular networks. In this paper, a three-dimension (3-D) geometric optimization algorithm is proposed, considering the positions of edge IoT devices and antenna coupling factors. Firstly, a multi-level single linkage (MLSL) iteration method, based on geometric objectives, is derived to evaluate the data rates over ISM 915 MHz channels, utilizing optimized power-distance profiles of continuous waves. Subsequently, a federated learning (FL) data selection algorithm is designed based on the 3-D geometric positions. Finally, a measurement example is taken in a meadow biome of the Mexican Colima district, which is prone to fluvial floods. The empirical path loss model has been enhanced, demonstrating the accuracy of the proposed optimization algorithm as well as the possibility of further prediction work.

• 한국CDE학회논문집
• /
• 제22권2호
• /
• pp.110-117
• /
• 2017

Delaunay refinement algorithm is a classical method to generate quality triangular meshes when point cloud and/or constrained edges are given in two- or three-dimensional space. It computes the Delaunay triangulation for given points and edges to obtain an initial solution, and update the triangulation by inserting steiner points one by one to get an improved quality triangulation. This process repeats until it satisfies given quality criteria. The efficiency of the algorithm depends on the criteria and point insertion method. In this paper, we propose a method to accelerate the Delaunay refinement algorithm by applying geometric hashing technique called bucketing when inserting a new steiner point so that it can localize necessary computation. We have tested the proposed method with a few types of data sets, and the experimental result shows strong linear time behavior.

• 대한수학회논문집
• /
• 제37권3호
• /
• pp.915-938
• /
• 2022

We are interested in the problem of fitting a parabola to a set of data points in ℝ³. It can be usually solved by minimizing the geometric distances from the fitted parabola to the given data points. In this paper, a parabola fitting algorithm will be proposed in such a way that the sum of the squares of the geometric distances is minimized in ℝ³. Our algorithm is mainly based on the steepest descent technique which determines an adequate number λ such that h(λ) = Q(u - λ𝛁Q(u)) < Q(u). Some numerical examples are given to test our algorithm.

• 한국멀티미디어학회논문지
• /
• 제15권11호
• /
• pp.1292-1304
• /
• 2012

최근에 디지털 이미지는 광고주나 이미지 편집자들에 의해 극단적으로 수정되는 경우가 많다. 또한 일반인들도 간단한 편집 프로그램을 통해 원본 이미지를 수정함으로써 사진을 조작하곤 한다. 본 논문에서는 이러한 문제를 해결하기 위해서 수정된 이미지에 대한 식별 및 분석 방법을 제안하고자 한다. 수정 이미지 분석에는 크게 기하학적 변형(geometric changes)과 필터링 변형(filtering change)으로 나누었다. 이러한 변형에는 항상 보간법을 기반으로 한 알고리즘을 내포하고 있기 때문에 보간의 흔적을 분석할 수 있는 알고리즘을 제안하였다. 그 방법으로 minimum 필터와 laplacian 연산 그리고 maximum 필터를 이용한 보간 검출 맵을 구현하였으며, 실제로 수정된 이미지에 제안하는 알고리즘을 적용하여 변형된 흔적을 검출 맵을 통해 분석할 수 있었다.

• Journal of applied mathematics & informatics
• /
• 제7권3호
• /
• pp.983-994
• /
• 2000

We consider the problem of determining the circle of best fit to a set of data points in the plane. In [1] and [2] several algorithms already have been given for fitting a circle in least squares sense of minimizing the geometric distances to the given data points. In this paper we present another new descent algorithm which computes a parametric represented circle in order to minimize the sum of the squares of the distances to the given points. For any choice of starting values our algorithm has the advantage of ensuring convergence to a local minimum. Numerical examples are given.

• 한국CDE학회논문집
• /
• 제8권4호
• /
• pp.243-253
• /
• 2003

This paper presents a new geometric morphing algorithm for polygons based on a simple geometric structure called direction map, which is mainly composed of a circular list of direction vectors defined by two neighboring vertices of a polygon. To generate a sequence of intermediate morphing shapes, first we merge direction maps of given control shapes based on a certain ordering rule of direction vectors, and scale the length of each direction vectors using Bezier or blossom controls. We show that the proposed algorithm is an improvement of the previous methods based on Minkowski sum (or convolution) in th aspects of computational efficiency and geometric properties.

• Advances in robotics research
• /
• 제1권1호
• /
• pp.41-59
• /
• 2014

This paper deals with the problem of steering a group of mobile robots along a reference path while maintaining a desired geometric formation. To solve this problem, the overall formation is decomposed into numerous geometric patterns composed of pairs of robots, and the state of the geometric patterns is defined. A control algorithm for the problem is proposed based on the Nash equilibrium strategies incorporating receding horizon control (RHC), also known as model predictive control (MPC). Each robot calculates a control input over a finite prediction horizon and transmits this control input to its neighbor. Considering the motion of the other robots in the prediction horizon, each robot calculates the optimal control strategy to achieve its goals: tracking a reference path and maintaining a desired formation. The performance of the proposed algorithm is validated using numerical simulations.

• International Journal of Automotive Technology
• /
• 제3권2호
• /
• pp.71-78
• /
• 2002

A new control method far vision-based autonomous vehicle is proposed to determine navigation direction by analyzing lane information from a camera and to navigate a vehicle. In this paper, characteristic featured data points are extracted from lane images using a lane recognition algorithm. Then the vehicle is controlled using new Levenberg-Marquardt neural network algorithm. To verify the usefulness of the algorithm, another algorithm, which utilizes the geometric relation of a camera and vehicle, is introduced. The second one involves transformation from an image coordinate to a vehicle coordinate, then steering is determined from Ackermann angle. The steering scheme using Ackermann angle is heavily depends on the correct geometric data of a vehicle and a camera. Meanwhile, the proposed neural network algorithm does not need geometric relations and it depends on the driving style of human driver. The proposed method is superior than other referenced neural network algorithms such as conjugate gradient method or gradient decent one in autonomous lateral control .