• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.276-276
• /
• 2000

This paper presents the efficient algorithms for the pose determination of a circular object with and without a priori knowledge of the object radius. The developed algorithms valid for a circular object are the result of the elaboration of Ma's work [2], which determines the pose of a conic object from two perspective views. First, the geometric constraint of a circular object and its projection on the image plane of a camera is described. The number of perspective views required for the object pose determination with and without a priori knowledge of the object radius is also discussed. Second, with a priori knowledge of the object radius, the pose of a circular object is determined from a single perspective view. The object pose information, expressed by two surface normal vectors and one position vector, is given in a closed form and with no ambiguity. Third, without a priori knowledge of the object radius, the pose of a circular object is determined from two perspective views. While the surface normal vectors are obtained from the first view, the position vector is obtained from the two views.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.4
• /
• pp.414-418
• /
• 2016

In this paper, a hardware architecture of low area gradient magnitude calculator is proposed. For the hardware complexity reduction, the characteristic of orthogonal projection vector and hardware resource sharing technique are applied. The proposed hardware architecture can be implemented without degradation of the gradient magnitude data quality since the proposed hardware is implemented with original algorithm. The FPGA implementation result shows the 15% of logic elements and 38% embedded multiplier savings compared with previous work using Altera Cyclone VI (EP4CE115F29C7N) FPGA and Quartus II v15.0 environment.

• Environmental and Resource Economics Review
• /
• v.22 no.3
• /
• pp.499-520
• /
• 2013

This study proposes an iterative approach to the estimation of the marginal abatement costs of undesirable outputs by computing the slope of the efficient production possibilities frontier on the basis of the efficient projection points generated by the directional output distance function approach due to Fare et al. (2005) based on duality theory. In case of the latter methodology, the estimated marginal abatement costs differ significantly depending on the choice of the directional output vector. In addition, depending on the curvature of the underlying PPF the efficient projection points may be located at a significant distance away from their actually observed counterparts. While it would be more logical to estimate marginal abatement costs as a PPF slope at a point corresponding to the actually observed emissions level, the methodology based on duality theory is likely to produce unstable results due to the problems associated with applying the theorem of implicit function differentiation. Since our methodology is not based on duality theory, our results are immune to both of these problems. We apply our methodology to a sample of Western European countries for the period of 1995-2011 to illustrate our approach.

• Smart Media Journal
• /
• v.8 no.1
• /
• pp.43-50
• /
• 2019

As numerous devices are connected through a wireless network, there exist many studies conducted to efficiently connect the devices. While earlier studies often use clustering for efficient device management, there is a load-intensive cluster node which may lead the entire network to be unstable. In order to solve this problem, we propose a scheduling model for centralized unequal chain clustering for efficient management of sensor nodes. For the cluster configuration, this study is based on the cluster head range and the distance to the base station(BS). The main vector projection technique is used to construct clustering with concentricity where the positions of the base stations are not the same. We utilize a multiple radio access interface, multiple-input multiple-output (MIMO), for data transmission. Experiments show that cluster head energy consumption is reduced and network lifetime is improved.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.45 no.6
• /
• pp.67-76
• /
• 2008

Reliable face recognition under various illumination environments is essential for successful commercialization. Feature-based face recognition relies on a good choice of feature vectors. Gabor feature vectors are known to be more robust to variations of pose and illumination than any other feature vectors so that they are popularly adopted for face recognition. However, they are not completely independent of illuminations. In this paper, we propose an illumination-robust face recognition method based on the Gabor feature vector illumination PCA model. We first construct the Gabor feature vector illumination PCA model where Gator feature vector space is rendered to be decomposed into two orthogonal illumination subspace and face identity subspace. Since the Gabor feature vectors obtained by projection into the face identity subspace are separated from illumination, the face recognition utilizing them becomes more robust to illumination. Through experiments, it is shown that the proposed face recognition based on Gabor feature vector illumination PCA model performs more reliably under various illumination and Pose environments.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.8
• /
• pp.1187-1193
• /
• 2013

In this paper, we present realistic 3D head modeling and facial expression systems. For 3D head modeling, we perform generic model fitting to make individual head shape and texture mapping. To calculate the deformation function in the generic model fitting, we determine correspondence between individual heads and the generic model. Then, we reconstruct the feature points to 3D with simultaneously captured images from calibrated stereo camera. For texture mapping, we project the fitted generic model to image and map the texture in the predefined triangle mesh to generic model. To prevent extracting the wrong texture, we propose a simple method using a modified interpolation function. For generating 3D facial expression, we use the vector muscle based algorithm. For more realistic facial expression, we add the deformation of the skin according to the jaw rotation to basic vector muscle model and apply mass spring model. Finally, several 3D facial expression results are shown at the end of the paper.

• Journal of KIISE:Software and Applications
• /
• v.33 no.1
• /
• pp.130-137
• /
• 2006

The depth information in the face represents personal features in detail. In particular, the surface curvatures extracted from the face contain the most important personal facial information. This surface curvature and together with grouped projection vector which reduces the dimensions resulting less computations are collaborated into the proposed 3D face recognition algorithm. The maximum and minimum curvature are calculated from the surface curvature image, which are grouped into projected vectors for recognition. The minimum curvature showed the best recognition rate among the surface parameters.

• IEIE Transactions on Smart Processing and Computing
• /
• v.2 no.6
• /
• pp.323-331
• /
• 2013

An extreme learning machine (ELM) is an efficient learning algorithm that is based on the generalized single, hidden-layer feed-forward networks (SLFNs), which perform well in classification applications. Many studies have demonstrated its superiority over the existing classical algorithms: support vector machine (SVM) and BP neural network. This paper presents a novel face recognition approach based on a multi-class project extreme learning machine (MPELM) classifier and 2D Gabor transform. First, all face image features were extracted using 2D Gabor filters, and the MPELM classifier was used to determine the final face classification. Two well-known face databases (CMU-PIE and ORL) were used to evaluate the performance. The experimental results showed that the MPELM-based method outperformed the ELM-based method as well as other methods.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.784-787
• /
• 2006

In this paper, we propose a method for nonlinear grapheme segmentation in Korean printed character type classification. The characters are subdivided into six types based on character type information. The feature vector is consist of mesh features, vertical projection features and horizontal projection features which are extracted from gray-level images. We classify characters into 6 types using Back propagation. Character segmentation regions are determined based on character type information. Then, an optimal nonlinear grapheme segmentation path is found using multi-stage graph search algorithm. As the result, a proposed methodology is proper to classify character type and to find nonlinear char segmentation paths.

• Structural Engineering and Mechanics
• /
• v.69 no.6
• /
• pp.615-626
• /
• 2019

The 3-noded metric Timoshenko beam element with an offset of the internal node from the element centre is used here to demonstrate the best-fit paradigm using function space formulation under locking and mesh distortion. The best-fit paradigm follows from the projection theorem describing finite element analysis which shows that the stresses computed by the displacement finite element procedure are the best approximation of the true stresses at an element level as well as global level. In this paper, closed form best-fit solutions are arrived for the 3-noded Timoshenko beam element through function space formulation by combining field consistency requirements and distortion effects for the element modelled in metric Cartesian coordinates. It is demonstrated through projection theorems how lock-free best-fit solutions are arrived even under mesh distortion by using a consistent definition for the shear strain field. It is shown how the field consistency enforced finite element solution differ from the best-fit solution by an extraneous response resulting from an additional spurious force vector. However, it can be observed that when the extraneous forces vanish fortuitously, the field consistent solution coincides with the best-fit strain solution.