• Journal of Korea Multimedia Society
• /
• v.16 no.11
• /
• pp.1261-1271
• /
• 2013

Zoom tracking involves the automatic adjustment of the focus motor in response to the zoom motor movements for the purpose of keeping an object of interest in focus, and is typically achieved by moving the zoom and focus motors in a zoom lens module so as to follow the so-called "trace curve", which shows the in-focus motor positions versus the zoom motor positions for a specific object distance. Thus, one can simply implement zoom tracking by following the most closest trace curve after all the trace curve data are stored in memory. However, this approach is often prohibitive in practical implementation because of its large memory requirement. Many other zoom tracking methods such as GZT, AZT and etc. have been proposed to avoid large memory requirement but with a deteriorated performance. In this paper, we propose a new zoom tracking method called 'Approximate Feedback Zoom Tracking method (AFZT)' on DM36x-based IP network camera, which does not need large memory by approximating nearby trace curves, but generates better zoom tracking accuracy than GZT or AZT by utilizing focus value as feedback information. Experiments through real implementation shows the proposed zoom tracking method improves the tracking performance and works in real-time.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.9
• /
• pp.447-453
• /
• 2001

In this paper, a new auto-focusing algorithm for digital cameras is proposed. One of the primary concerns of digital image processing is to increase image quality, and the most important factor for degrading the images is the blurring effect due to inexact focusing. The blurring effect occurs when the focusing lens is located on an unsuitable position. Therefore, focusing on an object should be proceeded before acquiring images. The proposed auto-focusing algorithm is MMDT(min-max difference threshold), and the performance of the proposed algorithm is evaluated by the use of the focus curve. It is shown that the proposed algorithm is superior to other previous auto-focusing algorithms in both the focus shape and computation time aspects. Especially, the improvement of the focus curve shape in both monotonousness and slope indicates that focusing can be done rapidly in comparison with other previous proposed algorithms.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.935-938
• /
• 1998

In this paper, we propose a new auto focus algorithm using variance which estimate spread characteristic of image. In the proposed algorithm, the focus value is calculated via variance of difference between two adjacent pixels. This algorithm, we propose, show much more sharp focus curve than any other algorithms. It is shown experimentally that the proposed auto focus algorithm can be a efficient alternative to existing Tenengrad-based auto focusing algorithms.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.4
• /
• pp.709-714
• /
• 2017

The curved panel is widely used for display of TVs and smart phones. This paper proposes a new auto-focusing method for curved panel inspection system. Since the distance between the camera and the panel varies with the curve position, the camera should change its focus at every inspection time. In order to reduce the focusing time, we propose an effective focusing method that considers the mathematical model of panel curve. The Lagrange polynomial equation is applied to modeling the panel curve. The foci of initial three points are used to get the curve equation, and the other foci are calculated automatically from the curve equation. The experiment result shows that the proposed method can reduce the focusing time.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.38-41
• /
• 2002

Many scientifc applications include manipulation of data points tying in a space. We describe a method, based on sector labeling to generate a space-filling curve for partitioning such given data points. Our method is straightforward and flexible, equipping a one-one correspondence between point-values on the curve and data points in space in more efficient than designated methods found in the literature. It is widely believed that the Hilbert curve achieves the desired properties on linear mappings due to the locality between data points. Therefore we focus on the Hilbert curve since, later on, we identify it as the most suitable for our application. We demonstrate on using our method for the data particles of an n-body simulation that based on Barnes-Hut algorithm.

• Honam Mathematical Journal
• /
• v.39 no.4
• /
• pp.637-647
• /
• 2017

Elastica is known as classical curve that is a solution of variational problem, which minimize a thin inextensible wire's bending energy. Studies on elastica has been conducted in Euclidean space firstly, then it has been extended to Riemannian manifold by giving different characterizations. In this paper, we focus on energy of the elastic curve in a Lie group. We attepmt to compute its energy by using geometric description of the curvature and the torsion of the trajectory of the elastic curve of the trajectory of the moving particle in the Lie group. Finally, we also investigate the relation between energy of the elastic curve and energy of the same curve in Frenet vector fields in the Lie group.

• Earthquakes and Structures
• /
• v.23 no.4
• /
• pp.353-361
• /
• 2022

The dynamic behavior of a single pile was investigated by using analytical and numerical studies. The focus of this study was to develop the dynamic p-y curve of a pile for pseudo-static analysis considering the shear wave velocity of the soil by using three-dimensional numerical analyses. Numerical analyses were conducted for a single pile in dry sand under changing conditions such as the shear wave velocity of the soil and the acceleration amplitudes. The proposed dynamic p-y curve is a shape of hyperbolic function that was developed to take into account the influence of the shear wave velocity of soil. The applicability of pseudo-static analysis using the proposed dynamic p-y curve shows good agreement with the general trends observed by dynamic analysis. Therefore, the proposed dynamic p-y curve represents practical improvements for the seismic design of piles.

• International Journal of Highway Engineering
• /
• v.10 no.3
• /
• pp.97-107
• /
• 2008

I study for design criteria and research about Interchange diverging area of express highway and freeway, the most recent, at interchange diversion of express highway and freeway, design criteria and researches are focus on safety guarantee a point of view movement dynamics of vehicle and road geometric as to transition section, deceleration section, curve radius, nose section, outflow angle etc, that is, design criteria and research of Interchange diverging area have not consider a point of view movement dynamics of vehicle and road geometric and driver, so that I will be focus characteristic of runing speed on trasion curve. and I will consider vehicle running speed characteristics and study problem of Interchange diverging area design criteria. For this study, First, analysis meaning about theory of now design criteria, Second, look at vehicle running speed and traffic accident characteristics of Interchange diverging area, Third, propose new deceleration transition curve design method get along vehicle running speed characteristics of Interchange diverging area. new deceleration transition curve design method put out new outcoums, that is, I definite cause to safety new deceleration transition curve design method better than pressently, used design criteria of Interchange diverging area, especially, deceleration transition curve design criteria produced good result in the running speed 50km/h, 40km/h, that is inertia better than inertia of present used design criteria. and deceleration transition curve is extended better than present transition curve criteria, so that new deceleration transition curve design method safety is good better than the past method safety.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1128-1131
• /
• 1996

The collision-free path planning presented here uses linear parametric curve with one intermediate connection point between start and target points. The algorithm, in which connection point is organized in elliptic chord.(.theta., .delta.), maps objects in Euclidean Space into images in CPS through intersection check between path and obstacles a process defined as GM. Elliptic locus has special property that the total distance between focus points through a point on ellipse is the same regardless of .theta.. Hence by locating the start and target points to focus points of ellipse, and organizing connection point in elliptic coordinate, the .delta.-axis of CPS represents length of path. The GM of EWS requires calculation of interference in circumferential direction only. The procedures for GM is developed which include categorization of obstacles to reduce calculation amount. Simulations of GM of EWS, on a PC with Pentium/90MHz, is carried out to measure performance of algorithm and the results are reported on a table. The simulations are done for number of cases with different number of obstacles and location of start/target points.

• Current Optics and Photonics
• /
• v.4 no.5
• /
• pp.411-420
• /
• 2020

Non-contact three-dimensional (3D) measuring technology is used to identify defects in miniature products, such as optics, polymers, and semiconductors. Hence, this technology has garnered significant attention in computer vision research. In this paper, we focus on shape from focus (SFF), which is an optical passive method for 3D shape recovery. In existing SFF techniques using interpolation, all datasets of the focus volume are approximated using one model. However, these methods cannot demonstrate how a predefined model fits all image points of an object. Moreover, it is not reasonable to explain various shapes of datasets using one model. Furthermore, if noise is present in the dataset, an error will be generated. Therefore, we propose an algorithm based on polynomial regression analysis to address these disadvantages. Our experimental results indicate that the proposed method is more accurate than existing methods.