• Journal of Korean Society for Quality Management
• /
• v.32 no.4
• /
• pp.265-273
• /
• 2004

We got the growth distance curve by spline smoothing method with observed marketing data and the growth velocity curve by the derivation of the growth distance curve. Using this growth velocity curve, we defined the several characteristic points which describe the variation of marketing data. In this paper, to specify several patterns of marketing data, we suggested characteristic function by using these characteristic points. In addition, we applied characteristic function to the seventeen brands of electric home products data.

• The Journal of Korea Robotics Society
• /
• v.14 no.4
• /
• pp.357-362
• /
• 2019

This paper proposes a model and train method that can real-time detect objects and distances estimation based on a monocular camera by applying deep learning. It used YOLOv2 model which is applied to autonomous or robot due to the fast image processing speed. We have changed and learned the loss function so that the YOLOv2 model can detect objects and distances at the same time. The YOLOv2 loss function added a term for learning bounding box values x, y, w, h, and distance values z as 클래스ification losses. In addition, the learning was carried out by multiplying the distance term with parameters for the balance of learning. we trained the model location, recognition by camera and distance data measured by lidar so that we enable the model to estimate distance and objects from a monocular camera, even when the vehicle is going up or down hill. To evaluate the performance of object detection and distance estimation, MAP (Mean Average Precision) and Adjust R square were used and performance was compared with previous research papers. In addition, we compared the original YOLOv2 model FPS (Frame Per Second) for speed measurement with FPS of our model.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.1034-1039
• /
• 1991

A robot motion planning algorithm for time-varying obstacle avoidance is proposed. The robot motion planning problem is replaced with the optimization problem by using the distance function with the divided configuration space. To divide the configuration space, the polar coordinate system is used. For each divided configuration space, the admissible region where the robot can reach without collisions is obtained using the distance function. For an object moving in a plane, the admissible region is described by linear constraints on the polar coordinate system. A numerical algorithm that solves the optimization problem is shown and the computer simulation is carried out.

• International Journal of Contents
• /
• v.6 no.3
• /
• pp.5-9
• /
• 2010

To manage large database system with video, effective video indexing and retrieval are required. A large number of video retrieval algorithms have been presented for frame-wise user query or video content query, whereas a few video identification algorithms have been proposed for video sequence query. In this paper, we propose an effective video identification algorithm for video sequence query that employs the Cauchy function of histograms between successive frames and the modified Hausdorff distance. To effectively match the video sequences with a low computational load, we make use of the key frames extracted by the cumulative Cauchy function and compare the set of key frames using the modified Hausdorff distance. Experimental results with several color video sequences show that the proposed algorithm for video identification yields remarkably higher performance than conventional algorithms such as Euclidean metric, and directed divergence methods.

• Proceedings of the KIEE Conference
• /
• 1987.11a
• /
• pp.425-429
• /
• 1987

This paper describes a collision avoidance method for planning safe trajectories for multi-robot system in common work space. Usually objects have been approximated to convex polyhedra in most previous researches, but in case using such the approximation method it is difficult to represent objects analytically in terms of functions and also to describe tile relationship between the objects. In this paper, in order to solve such problems a modeling method which approximates objects to cylinder ended by hemispheres and or sphere is used and the maximum distance functions is defined which call be calculated simply. Using an objective function with inequality constraints which are related to minimum distance functions, work range and maximum allowable angular velocities of the robots, tile collision avoidance for two robots is formulated to a constrained function optimization problem. With a view to solve tile problem a penalty function having simple form is defined and used. A simple numerical example involving two PUMA-type robots is described.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.3048-3050
• /
• 1999

This paper suggests a position estimating algorithm using mono vision system with projective geometry method. Generally, 3-D information can not be easily extracted from mono vision system which is taken by a camera at a specific point. But this defect is overcome by adopting model-based image analysis and selecting lines and points on the ground as natural landmarks. And this paper suggests a method that estimates position from many natural landmarks by distance error weight function.

• Bulletin of the Korean Chemical Society
• /
• v.3 no.2
• /
• pp.44-49
• /
• 1982

Dynamic and equilibrium structures of a polymer chain immersed in solvent molecules have been investigated by a molecular dynamic method. The calculation employs the Lennard-Jones potential function to represent the interactions between two solvent molecules (SS) and between a constituent particle (monomer unit) of the polymer chain and a solvent molecule (CS) as well as between two non-nearest neighbor constituent particles of the polymer chain (CC), while the chemical bond for nearest neighbor constituent particles was chosen to follow a harmonic oscillator potential law. The correlation function for the SS, CS and CC pairs, the end-to-end distance square and the radius of gyration square were calculated by varying the chain length (= 5, 10, 15, 20). The computed end-to-end distance square and the radius of gyration square were found to be in a fairly good agreement with the corresponding results from the random-flight model. Unlike earlier works, the present simulation rsesult shows that the autocorrelation function of radius of gyration square decays slower than that of the end-to-end distance square.

• KIPS Transactions on Software and Data Engineering
• /
• v.11 no.4
• /
• pp.157-162
• /
• 2022

Today, most data is stored in a database (DB). In the DB environment, the users requests the DB to find the data they wants. Similarity Query has predicate that explained by a similarity. However, in the process of processing the similarity query, it is difficult to use an index that can reduce the range of processed records, so the cost of calculating the similarity for all records in the table is high each time. To solve this problem, this paper defines a lightweight similarity function. The lightweight similarity function has lower data filtering accuracy than the similarity function, but consumes less cost than the similarity function. We present a method for reducing similarity query processing cost by using the lightweight similarity function features. Then, Chebyshev distance is presented as a lightweight similarity function to the Euclidean distance function, and the processing cost of a query using the existing similarity function and a query using the lightweight similarity function is compared. And through experiments, it is confirmed that the similarity query processing cost is reduced when Chebyshev distance is applied as a lightweight similarity function for Euclidean similarity.

• Bulletin of the Korean Mathematical Society
• /
• v.45 no.4
• /
• pp.631-634
• /
• 2008

In this paper, the parabola will be characterized as the plane curve whose curvature function and support function satisfy a condition, where we define the support function as the distance from origin to the tangent line.

• Journal of the Optical Society of Korea
• /
• v.14 no.2
• /
• pp.104-108
• /
• 2010

We proposed an axis transformation technique which reveals a distance parameter directly from optical scanning holography (OSH). After synthesis of a real-only spectrum hologram and power fringe adjusted filtering, we transform an original frequency axis to a new frequency axis using interpolation. In the new frequency axis, the filtered hologram has a single frequency which is linearly proportional to the distance parameter. Thus, the inverse Fourier transformation of the filtered hologram gives a delta function pair in the new spatial axis. Finally, we extract the distance parameter by detecting the location of the delta function pair.