• 한국경영과학회지
• /
• 제22권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.

• Computers and Concrete
• /
• 제11권1호
• /
• pp.75-91
• /
• 2013

In this paper, a new approach for cable layout design of pre-stressed concrete slabs is presented. To account the cable profile accurately, it is modelled by B-spline. Using the convex hull property of the B-spline, an efficient algorithm has been developed to obtain the cable layout for pre-stressed concrete slabs. For finite element computations, tendon and concrete are modelled by 3 noded bar and 20 noded brick elements respectively. The cable concrete interactions are precisely accounted using vector calculus formulae. Using the proposed technique a two way prestressed concrete slab has been successfully designed considering several design criteria.

• 대한수학회보
• /
• 제43권2호
• /
• pp.343-352
• /
• 2006

A real matrix A is called a sign-central matrix if for, every matrix $\tilde{A}$ with the same sign pattern as A, the convex hull of columns of $\tilde{A}$ contains the zero vector. A sign-central matrix A is called a tight sign-central matrix if the Hadamard (entrywise) product of any two columns of A contains a negative component. A real vector x = $(x_1,{\ldots},x_n)^T$ is called stable if $\|x_1\|{\leq}\|x_2\|{\leq}{\cdots}{\leq}\|x_n\|$. A tight sign-central matrix is called a $tight^*$ sign-central matrix if each of its columns is stable. In this paper, for a matrix B, we characterize those matrices C such that [B, C] is tight ($tight^*$) sign-central. We also construct the matrix C with smallest number of columns among all matrices C such that [B, C] is $tight^*$ sign-central.

• Journal of Multimedia Information System
• /
• 제5권3호
• /
• pp.179-188
• /
• 2018

In order to overcome the problems of contact palmprint recognition, a non-contact palmprint recognition system is developed on personal computer (PC) platform. Three methods, namely "double-line-single-point" (DLSP), "double-assistant-crosshair" (DAC) and "none-assistant-graphic" (NAG), are implemented for the palmprint localization to solve the severe technical challenges, including the complex background, variant illuminations, uncontrollable locations and gestures of hands. In NAG, hand segmentation and the cropping of region of interest are performed without any assistant graphics. The convex hull contour of hand helps detect the outside contour of little finger as well as the valley bottom between thumb and index finger. The three methods of palmprint localization have good operating efficiency and can meet the performance requirements of real-time system. Furthermore, an attendance system on PC platform is designed and developed based on non-contact palmprint recognition.

• 대한수학회논문집
• /
• 제11권3호
• /
• pp.665-672
• /
• 1996

Let U denote the set of all Schwarzian derivatives $S_f$ of conformal function f in the unit disk D. We show that if $S_f$ is a local extreme point of U, then f cannot omit an open set. We also show that if $S_f \in U$ is an extreme point of the closed convex hull $\bar{co}U$ of U, then f cannot omit a set of positive area. The proof of this uses Nguyen's theorem.

• Journal of information and communication convergence engineering
• /
• 제6권3호
• /
• pp.331-336
• /
• 2008

In this paper, we propose a real-time people tracking system with multiple CCD cameras for security inside the building. To achieve this goal, we present a method for 3D walking human tracking based on the IMPRESARIO framework incorporating cascaded classifiers into hypothesis evaluation. The efficiency of adaptive selection of cascaded classifiers has been also presented. The camera is mounted from the ceiling of the laboratory so that the image data of the passing people are fully overlapped. The implemented system recognizes people movement along various directions. To track people even when their images are partially overlapped, the proposed system estimates and tracks a bounding box enclosing each person in the tracking region. The approximated convex hull of each individual in the tracking area is obtained to provide more accurate tracking information. We have shown the improvement of reliability for likelihood calculation by using cascaded classifiers. Experimental results show that the proposed method can smoothly and effectively detect and track walking humans through environments such as dense forests.

• 한국CDE학회논문집
• /
• 제2권1호
• /
• pp.19-27
• /
• 1997

This paper presents rough cut tool path planning for the fewer-axis machine consisting of a three-axis CNC machine and a rotary indexing table. In the problem dealt with in this paper, the tool orientation is "intermediately" changed, distinguished from the conventional problem where the tool orientation is assumed to be fixed. The developed rough cut path planning algorithm tries to minimize the number of tool orientation (setup) changes together with tool changes and the machining time for the rough cut by the four procedures: a) decomposition of the machining area based on the possibility of tool interference (via convex hull operation), b) determination of the optimal tool size and orientation (via network graph theory and branch-and bound algorithm), c) generation of tool path for the tool and orientation (based on zig-zag pattern), and d) feedrate adjustment to maintain the cutting force at an operation level (based on average cutting force). The developed algorithms are validated via computer simulations, and can be also used in pure fiveaxis machining environment without modification.

• 한국지능시스템학회논문지
• /
• 제11권7호
• /
• pp.641-648
• /
• 2001

A face detection in color images is important for many multimedia applications. It is first step for face recognition and can be used for classifying specific shorts. This paper describes a new method to detect faces in color images based on the skin color and hair color. This paper presents a fuzzy-based method for classifying skin color region in a complex background under varying illumination. The Fuzzy rule bases of the fuzzy system are generated using training method like a genetic algorithm(GA). We find the skin color region and hair color region using the fuzzy system and apply the convex-hull to each region and find the face from their intersection relationship. To validity the effectiveness of the proposed method, we make experiment with various cases.

• 한국정밀공학회지
• /
• 제16권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 Information Display
• /
• 제3권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.