• Journal of Information Display
• /
• v.3 no.2
• /
• pp.19-25
• /
• 2002

In this paper, a new target extraction algorithm is proposed, in which the coordinates of target are obtained adaptively by using the difference image information and the optical BPEJTC(binary phase extraction joint transform correlator) with which the target object can be segmented from the input image and background noises are removed in the stereo vision system. First, the proposed algorithm extracts the target object by removing the background noises through the difference image information of the sequential left images and then controlls the pan/tilt and convergence angle of the stereo camera by using the coordinates of the target position obtained from the optical BPEJTC between the extracted target image and the input image. From some experimental results, it is found that the proposed algorithm can extract the target object from the input image with background noises and then, effectively track the target object in real time. Finally, a possibility of implementation of the adaptive stereo object tracking system by using the proposed algorithm is also suggested.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.18 no.6
• /
• pp.576-584
• /
• 2009

Up to now, it has been said that no satisfactory computer solution has been found for synthesizing four-bar linkage based on the prescribed coupler link curve. In our study, an algorithm has been developed to improve the design synthesis of four bar linkage based on the 5 precision points method. The suggested algorithm generates the desired coupler curve by using NURBS, and then the generated curve approximates as closely as possible to the desired curve representing coupler link trajectory. Also, when comparing each generated curve by constructing the control polygon, rapid comparison is easily achieved by applying convex hull of the control polygon. Finally, an optimization process using ADS is incorporated into the algorithm based on the 5 precision point method to reduce the total optimization process time. As for examples, two four bar linkages were tested and the result well demonstrated the effectiveness of the algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.5 s.311
• /
• pp.12-21
• /
• 2006

In this paper, we propose a technique for extracting attentive objects in images using feature maps, regardless of the complexity of images and the position of objects. The proposed method uses feature maps with edge and color information in order to extract attentive objects. We also propose a reference map which is created by integrating feature maps. In order to create a reference map, feature maps which represent visually attentive regions in images are constructed. Three feature maps including edge map, CbCr map and H map are utilized. These maps contain the information about boundary regions by the difference of intensity or colors. Then the combination map which represents the meaningful boundary is created by integrating the reference map and feature maps. Since the combination map simply represents the boundary of objects we extract the candidate object regions including meaningful boundaries from the combination map. In order to extract candidate object regions, we use the convex hull algorithm. By applying a segmentation algorithm to the area of candidate regions to separate object regions and background regions, real object regions are extracted from the candidate object regions. Experiment results show that the proposed method extracts the attentive regions and attentive objects efficiently, with 84.3% Precision rate and 81.3% recall rate.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.10
• /
• pp.126-131
• /
• 1999

Up until now, it is said that no satisfactory computer solutions have been found for synthesizing four-bar linkage based on the prescribed coupler link curve. In our study, an algorithm has been developed to improve the design synthesis of four-bar linkage automatically generating prescribed path by using B-spline interpolation. The suggested algorithm generates the desired coupler curve by using B-spline interpolation, and hence the generated curve approximates as closely as to the desired curve representing coupler link trajectory. Also, when comparing each generated polygon with the control polygon, rapid comparison by applying convex hull concept. finally, optimization process using ADS is incorporated into the algorithm based on the 5 precision point method to reduce the total optimization process time. As for examples, three different four-bar linkages were tested and the results showed the effectiveness of the algorithm.

• Journal of Korea Multimedia Society
• /
• v.6 no.6
• /
• pp.1054-1061
• /
• 2003

Electronic ink is multimedia data that have emerged from the development of pen-based computers such as PDAs whose major input device is a stylus pen. Recently with the development and supply of pen-based mobile computers, the necessity of data processing techniques of electronic ink has increased. Techniques to develop a gesture-allowed text editor in electronic ink domain were studied in this paper. Gesture and electronic ink data are a promising feature of pen-based user interface, but they have not yet been fully exploited. A new gesture recognition algorithm to identify pen gestures and a segmentation method for electronic ink to execute gesture commands were proposed. An electronic ink editor, called GesEdit was developed using proposed algorithms. The gesture recognition algorithm is based on eight features of input strokes. Convex hull and input time have been used to segment electronic ink data into GC(Gesture Components) unit. A variety of experiments by ten people showed that the average recognition rate reached 99.6% for nine gestures.

• Journal of Korean Society for Geospatial Information Science
• /
• v.20 no.4
• /
• pp.117-125
• /
• 2012

Although many studies have been conducted to extract buildings from airborne lidar data, most of them assume that all the boundaries of a building are straight line segments. This makes it difficult to model building boundaries containing curved segments correctly. This paper aims to model buildings containing curved segments as combination of straight lines and arcs. First, two sets of boundary points are extracted by adaptive convex hull algorithm and local convex hull algorithm with a larger radius. Then, arc segments are determined by average spacing of boundary points and intersection ratio of perpendicular lines. Finally, building boundary is modeled through regularization of least squares line or circle fitting. The experimental results showed that the proposed method can model the curved building boundaries as arc segments correctly by completeness of 69% and correctness of 100%. The approach will be utilized effectively to create automatically digital map that meets the conditions of the Korean digital mapping.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.1998-2009
• /
• 1998

An effective algorithm for tracking rigid or non-rigid moving object(s) which segments local moving parts from image sequence in the presence of backgraound motion by camera movenment, predicts the direction of it, and tracks the object is proposed. It requires no camera calibration and no knowledge of the installed position of camera. In order to segment the moving object, feature points configuring the shape of moving object are firstly selected, feature flow field composed of motion vectors of the feature points is computed, and moving object(s) is (are) segmented by clustering the feature flow field in the multi-dimensional feature space. Also, we propose IRMAS, an efficient algorithm that finds the convex hull in order to cinstruct the shape of moving object(s) from clustered feature points. And, for the purpose of robjst tracking the objects whose movement characteristics bring about the abrupt change of moving trajectory, an improved order adaptive lattice structured linear predictor is used.

• Korean Journal of Computational Design and Engineering
• /
• v.7 no.2
• /
• pp.131-139
• /
• 2002

Custom-tailored products always vary their sizes and shapes to satisfy the customers' tastes and requirements but they have to be fabricated as fast as possible when ordered. One way to solve this problem is to prepare several representative products in advance and each custom-tailored product is generated by machining the closest representative product. To realize this approach, it would be necessary to be able to group the products into several groups each of which has a representative product. Once the similar products are identified to be grouped, the representative shape can be generated such that all the products in the group can be made by machining the representative product. The custom-tailored products considered in this work have similar shapes but different sizes. Since these products have free surfaces, that are hard to be compared, their convex hulls are used for the grouping. Among all the products to be grouped, one product is chosen as a base shape. The shape and overall similarity values between the base shape and the remaining shapes are calculated as their convex hulls are rotated virtually. By calculating these similarity values at each rotation, the optimal alignment of the reference shape with respect to the base shape is determined. Overall similarity value at this optimal alignment is used as a measure for grouping. A prototype system based on the proposed methodology has been implemented and used to group the shoe-lasts for custom-tailored shoes.

• 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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.59-80
• /
• 1997

Designing highly survivable interoffice telecommunication networks is considered. The problem is formulated as a minimum-cost network design problem with three node connectivity constraints. These valid and facet-defining inequalities for the convex hull of the solution are presented. A branch and cut algorithm is proposed based on the inequalities to obtain the optimal solution. With the lower bound by the cutting plane algorithm, a delete-ink heuristic is proposed to otain a good upper bound in the branch and bound procedure. The effeciveness of the branch and cut algorithm is demonstrated with computational results for a variety of problem sets : different lower bounds, two types of link costs and large number of links. The cutting plane procedure based on the three inequalities provides excellent lower bounds to the optimal solutions.