• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.558-568
• /
• 2000

In the paper, we propose the automatic generation method of digital elevation map based on contour map. The proposed method classifies contour data and non-contour data by thinning and labelling process of the contour line and then connects smoothly broken contour line by Bezier curve. Finally, the digital devation map is generated by the interpolation using the height data of the contour line. The proposed method can reduce vest effort, time and expense which is spend to make digital elevation map.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.4
• /
• pp.519-528
• /
• 1998

This paper examines the effect of storage location configurations on dual command cycle times for the efficient operation of automated storage/retrieval systems. We use a contour line approach to determine storage location configurations. We present a contour line configuration generating scheme and a location indexing scheme. Given a contour line configuration, the location indexing scheme provides a unique priority to each location. The location priority is then used for determining the storage location of an incoming load. To investigate the effect of alternative contour line configurations on dual command cycle times, we perform a series of experiments under various storage policies.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5507-5528
• /
• 2016

In computer vision, salient object is important to extract the useful information of foreground. With active contour analysis acting as the core in this paper, we propose a bottom-up saliency detection algorithm combining with the Bayesian model and the global color distribution. Under the supports of active contour model, a more accurate foreground can be obtained as a foundation for the Bayesian model and the global color distribution. Furthermore, we establish a contour-based selection mechanism to optimize the global-color distribution, which is an effective revising approach for the Bayesian model as well. To obtain an excellent object contour, we firstly intensify the object region in the source gray-scale image by a seed-based method. The final saliency map can be detected after weighting the color distribution to the Bayesian saliency map, after both of the two components are available. The contribution of this paper is that, comparing the Harris-based convex hull algorithm, the active contour can extract a more accurate and non-convex foreground. Moreover, the global color distribution can solve the saliency-scattered drawback of Bayesian model, by the mutual complementation. According to the detected results, the final saliency maps generated with considering the global color distribution and active contour are much-improved.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.5
• /
• pp.195-200
• /
• 2014

Typical methods of active contour model for object contour extraction are snake and level. Snake is usually faster than level set, but has limitation to compute topology of objects. Level set on the other hand is slower but good at it. In this paper, a new object contour extraction algorithm to use advantage of each is proposed. The algorithm is composed of two main steps. In the first step, snake is used to extract the rough contour and then in the second step, level set is applied to extract the complex contour exactly. 5 binary images and 2 natural images with different contours are simulated by a proposed algorithm. It is shown that speed is reduced and contour is better extracted.

• Speech Sciences
• /
• v.11 no.1
• /
• pp.31-42
• /
• 2004

This paper presents methods using Gaussian normalization for converting pitch contours based on prosodic phrases along with experimental tests on the Korean database of 16 declarative sentences and the first sentences of the story of 'The Three Little Pigs'. We propose a new conversion method using Gaussian normalization to the pitch deviation of pitch contour subtracted by partial declination lines: by using partial declination lines for each accentual phrase of pitch contour, we avoid the problem that a Gaussian normalization using average values and standard deviations of intonational phrase tends to lose individual local variability and thus cannot modify individual characteristics of pitch contour from a source speaker to a target speaker. From the results of the experiments, we show that this slanted Gaussian normalization using these declination lines subtracted from pitch contour of accentual phrases can modify pitch contour more accurately than other methods using Gaussian normalization.

• Journal of Korea Multimedia Society
• /
• v.18 no.10
• /
• pp.1149-1156
• /
• 2015

This paper proposes the hand contour detector which is robust to noises. Existing methods reduce noises by applying morphology to extracted edges, detect finger tips by using the center of hands, or exploit the intersection of curves from hand area candidates based on J-value segmentation(JSEG). However, these approaches are so vulnerable to noises that are prone to detect non-hand parts. We propose the noise tolerant hand contour detection method in which non-skin area noises are removed by applying skin area detection, contour detection, and a threshold value. By using the implemented system, we observed that the system was successfully able to detect hand contours.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.10
• /
• pp.1047-1055
• /
• 2009

Since nuclear and chemical materials could damage people and disturb battlefield missions in a wide region, nuclear/chemical reconnaissance systems utilizing multiple mobile robots are highly desirable for rapid and safe reconnaissance. In this paper, we design a nuclear/chemical reconnaissance system including mobile robots. Also we propose time-efficient trajectory planning algorithms using grid coverage and contour finding methods for reconnaissance operation. For grid coverage, we performed in analysis on time consumption for various trajectory patterns generated by straight lines and arcs. We proposed BCF (Bounded Contour Finding) and BCFEP (Bounded Contour Finding with Ellipse Prediction) algorithms for contour finding. With these grid coverage and contour finding algorithms, we suggest trajectory planning algorithms for single, two or four mobile robots. Various simulations reveal that the proposed algorithms improve time-efficiency in nuclear/chemical reconnaissance missions in the given area. Also we conduct basic experiments using a commercial mobile robot and verify the time efficiency of the proposed contour finding algorithms.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.505-508
• /
• 2003

The current paper proposes a new vertex selection scheme for polygon-based contour ceding. To efficiently characterize the shape of an object, we incorporate the curvature information in addition to the conventional maximum distance criterion in vertex selection process. The proposed method consists of “two-step procedure.” At first, contour pixels of high curvature value are selected as key vertices based on the curvature scale space (CSS), thereby dividing an overall contour into several contour-segments. Each segment is considered as an open contour whose end points are two consecutive key vertices and is processed independently. In the second step, vertices for each contour segment are selected using progressive vertex selection (PVS) method in order to obtain minimum number of vertices under the given maximum distance criterion ( $D_{MAX}$). Experimental results are presented to compare the approximation performances of the proposed and conventional methods.s.

• Proceedings of the KSME Conference
• /
• 2001.11a
• /
• pp.378-383
• /
• 2001

In order to improve automobile maneuverability and tire durability, it is very important for one to determine a suitable sidewall contour producing the ideal tension and strain-energy distributions. In order to determine such a sidewall contour, one must apply multi-objective optimization technique. The optimization problem of tire carcass contour involves several objective functions. Hence, we execute the tire contour optimization for improving the maneuverability and the tire durability using satisficing trade-off method. And, the tire optimization also requires long cup time for the sensitivity analysis. In order to resolve this numerical difficulty, we apply neural network algorithm.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.341-344
• /
• 1997

The higher precision in manufacturing field is demanded, the more accurate servo controller is needed. To achieve the high precision, Koren proposed the cross-coupled control (CCC) method. The objective of the CCC is reducing the contour error rather than decreasing the individual axial error. The performance of CCC depends on the contour error model. In this paper we propose a new contour error model which utilizes contour error vector based on parametric curve interpolator. The experimental results show that the new CCC is more accurate than the variable-gain CCC during free-form curve motion.