• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.10
• /
• pp.2041-2046
• /
• 2009

In this paper, we propose the feature points extraction method of hand region using vision. To do this, first, we find the HCbCr color model by using HSI and YCbCr color model. Second, we extract the hand region by using the HCbCr color model and the fuzzy color filter. Third, we extract the exact hand region by applying labeling algorithm to extracted hand region. Fourth, after finding the center of gravity of extracted hand region, we obtain the first feature points by using Canny edge, chain code, and DP method. And then, we obtain the feature points of hand region by applying the convex hull method to the extracted first feature points. Finally, we demonstrate the effectiveness and feasibility of the proposed method through some experiments.

• Laser Solutions
• /
• v.18 no.1
• /
• pp.18-22
• /
• 2015

In this paper, controlling shape of optical fiber tip for endoscope was investigated for eliminating blind spot. The blind spot of endoscope is generated by divergence angle of optical fiber, so it is easy to generate blind spot when tightly focusing. In order to eliminate this region, fiber tip is necessary to be controlled as convex or concave. Illumination simulation of convex and concave type of fiber tip in the endoscope was in progress, so the distance of non- blind region was investigated in each case. As well as the simulation, the tip was fabricated as concave shape by UV laser machining. Then the beam radiation was measured to observe the blind region. The result showed that controlling the fiber tip as convex or concave shape makes the narrow blind region of illumination in endoscope.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.39-48
• /
• 2005

A convex region covers a family of curves if it contains a congruent copy of each curve in the family, and a 'worm problem' for that family is to find the convex region of smallest area. In this paper, we find the smallest triangular cover of any prescribed shape for the family S of all triangles of diameter 1.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.1-9
• /
• 2003

In this paper, we propose a new fingerprint feature extraction method using the convex structure. A fingerprint minutiae flows along the uniform direction and is regarded as a sinusoidal signal across the normal direction. Local maxima of the signal represent coarse thinned one-pixel-wide ridges in which the convex region of the signal correspond to ridges. The proposed fingerprint feature extraction method detects the convex structure and local maxima. Finally fingerprint features are extracted from one-pixel-wide ridges. Because it has no parameter, it is efficient for various fingerprint identification systems.

• Journal of applied mathematics & informatics
• /
• v.6 no.1
• /
• pp.279-289
• /
• 1999

Given n points in the plane the planar convex hull prob-lem in that of finding which of these points belong to the perimeter of the smallest convex region (a polygon) containing all n points. Here we suggest two kinds of methods. First we present a new sequential method for constructing the pla-nar convex hull O(1.5n) time in the quadratic decision tree model. Second using the sequential method we suggest a new parallel algo-rithm which solve the planar convex hull O(1.5n/p) time on a maspar Machine (CREW-PRAM) with O(n) processors. Also when we run on a maspar Machine we achieved a 37. 156-fold speedup with 64 pro-cessor.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.565-581
• /
• 2019

This paper investigates the wireless powered two way relay network (WPTWRN), where two single-antenna users and one single-antenna relay firstly harvest energy from signals emitted by a multi-antenna power beacon (PB) and then two users exchange information with the help of the relay by using their harvested energies. In order to improve the energy transfer efficiency, energy beamforming at the PB is deployed. For such a network, to explore the performance limit of the presented WPTWRN, an optimization problem is formulated to obtain the achievable rate region bounds by jointly optimizing the time allocation and energy beamforming design. As the optimization problem is non-convex, it is first transformed to be a convex problem by using variable substitutions and semidefinite relaxation (SDR) and then solve it efficiently. It is proved that the proposed method achieves the global optimum. Simulation results show that the achievable rate region of the presented WPTWRN architecture outperforms that of wireless powered one way relay network architecture. Results also show that the relay location has significant impact on achievable rate region of the WPTWRN.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.9
• /
• pp.2463-2476
• /
• 1994

Local mean fluctuating velocity components were measured in the separating and reattaching axisymmetrc region of turbulent boundary layer over the wall of convex cylinders placed in a water tunnel by using 2-color 4-beam fiber optics laser Doppler velocimetry. Measurements were made with three different diameters of cylinders with four different diameters of cylinders with four different diameter of the obstructions. The range of Reynolds number based on step height was between 5,000 to 25,200. The study demonstrates that the reattachment length decreases with decreasing cylinder radius and is always shorter than that for the two-dimensional backward-facing step flow at the condition of the same step height. It was also observed that the turbulent kinetic energy in the recirculating region increases with an increases in the radius of convex curvature. The measured velocity field suggests that the transverse curvature can effect definitely the formation of corner eddy.

• Proceedings of the KIEE Conference
• /
• 2001.11c
• /
• pp.438-441
• /
• 2001

This paper describes a system for tracking a face in a input video sequence using facial convex hull based facial segmentation and a robust hausdorff distance. The algorithm adapts YCbCr color model for classifying face region by [l]. Then, we obtain an initial face model with preprocessing and convex hull. For tracking, a Robust Hausdorff distance is computed and the best possible displacement is selected. Finally, the previous face model is updated using the displacement t. It is robust to some noises and outliers. We provide an example to illustrate the proposed tracking algorithm in video sequences obtained from CCD camera.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.19 no.10
• /
• pp.1069-1074
• /
• 2009

A sub-domain method for free vibration analysis of arbitrarily shaped, concave membranes with a deep groove is proposed in the paper. The proposed method divides the concave membrane of interest into two convex regions. The vibration displacement(approximate solution) of each convex region is assumed by linearly superposing plane waves generated at edges of the region. A sub-system matrix for each convex region is extracted by applying a provisional boundary condition to the approximate solution. Finally, a system matrix, which of the determinant gives eigenvalues of the concave membrane, is made by considering the fixed boundary condition(displacement zero condition) at edges and the compatibility condition(the condition of continuity in displacement and slope) at the interface between the two regions. Case studies show that the proposed method is valid and accurate when the eigenvalues by the proposed are compared to those by NDIF method, FEM, or the exact method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.12
• /
• pp.991-997
• /
• 2002

The concept of feasible & invariant region plays an important role to derive closed loop stability and achie adequate performance of constrained receding horizon predictive control. In this paper, we define a complex polyhedral feasible & invariant set for all stabilizable input-constrained linear systems by using a complex transform and propose a one-norm based receding horizon control scheme using these invariant sets. In order to get a larger stabilizable set, a convex hull of invariant sets which are defined for different state feedback gains is used as a target invariant set of the constrained receding horizon control. The proposed constrained receding horizon control scheme is formulated so that it can be solved via linear programming.