• Journal of Biomedical Engineering Research
• /
• v.17 no.4
• /
• pp.433-442
• /
• 1996

Since one texture property(i.e coarseness, orientation, regularity, granularity) for ultrasound liver ages was not sufficient enough to classify the characteristics of livers, we used multi texture vectors tracted from ultrasound liver images and a statistical classifier. Multi texture vectors are selected among the feature vectors of the normal liver, fat liver and cirrhosis images which have a good separability in those ultrasound liver images. The statistical classifier uses multi texture vectors as input vectors and classifies ultrasound liver images for each multi texture vector by the Bayes decision rule. Then the decision of the liver disease is made by choosing the maximum value from the averages of a posteriori probability for each multi texture vector In our simulation, we obtained higtler correct ratio than that of other methods using single feature vector, for the test set the correct ratio is 94% in the normal liver, 84% in the fat liver and 86% in the cirrhosis liver.

• Journal of Computational Design and Engineering
• /
• v.1 no.2
• /
• pp.88-95
• /
• 2014

Because the cost of performance testing using actual products is expensive, manufacturers use lower-cost computer-aided design simulations for this function. In this paper, we propose using hexahedral meshes, which are more accurate than tetrahedral meshes, for finite element analysis. We propose automatic hexahedral mesh generation with sharp features to precisely represent the corresponding features of a target shape. Our hexahedral mesh is generated using a voxel-based algorithm. In our previous works, we fit the surface of the voxels to the target surface using Laplacian energy minimization. We used normal vectors in the fitting to preserve sharp features. However, this method could not represent concave sharp features precisely. In this proposal, we improve our previous Laplacian energy minimization by adding a term that depends on multi-normal vectors instead of using normal vectors. Furthermore, we accentuate a convex/concave surface subset to represent concave sharp features.

• Korean Journal of Computational Design and Engineering
• /
• v.12 no.2
• /
• pp.109-117
• /
• 2007

Three-dimensional mesh models have been widely used in various applications such as simulations, animations, and e-catalogs. In such applications the normal vectors of mesh models are used mainly for shading and take up the major portion of data size and transmission time paper over networks. Therefore a variety of techniques have been developed to compress them efficiently. In this paper, we propose the MOEC (Modified Octree Encoding Compression) algorithm, which allow multi lever compression ratios for 3D mesh models. In the algorithm, a modified octree has nodes representing their own positions and supporting a depth of the tree so that the normal vectors are compressed up to levels where the shading is visually indistinguishable. This approach provides efficient in compressing normals with multi-level ratios, without additional encoding when changing in compression ratio is required.

• Proceedings of the KOSOMBE Conference
• /
• v.1995 no.11
• /
• pp.177-182
• /
• 1995

Since one property(i.e. coarseness, orientation, regularity, granularity etc.) of ultrasound liver images was not sufficiently enough to classify the characteristics of livers, we used the multi-feature vectors from ultrasound images to diagnose the liver disease. The proposed classifier, which uses the multi-feature vectors and Bayes decision rule, performed well for the classification of normal, fat and cirrhosis liver. In our simulation, we used the Battacharyya distance and Hotelling Trace Criterion to select the best multi-feature vectors for the classifier and obtained less classification errors than other methods using single feature vector.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.1
• /
• pp.179-193
• /
• 1995

A multi-objective, single-stage scheduling problem with stochastic processing times is considered where the objective is to simultaneously minimize the expected value and the variance of total flowtime, and the mean probability of tardiness. In cases where processing times follow normal distributions, a method using pairwise interchange of two jobs(PITJ) is proposed to generate a set of the approximate efficient schedules. The efficient schedules are not dominated by the criterion vectors of any other permutation schdules in the feasible region. Numerical experiments performed to ascertain the effectiveness of PITJ algorithm are also reported in the results.

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.10
• /
• pp.958-964
• /
• 2015

In this paper, an object recognition method based on the depth information from the RGB-D camera, Xtion, is proposed for an indoor mobile robot. First, the RANdom SAmple Consensus (RANSAC) algorithm is applied to the point cloud obtained from the RGB-D camera to detect and remove the floor points. Next, the removed point cloud is classified by the k-means clustering method as each object's point cloud, and the normal vector of each point is obtained by using the k-d tree search. The obtained normal vectors are classified by the trained multi-layer perceptron as 18 classes and used as features for object recognition. To distinguish an object from another object, the similarity between them is measured by using Levenshtein distance. To verify the effectiveness and feasibility of the proposed object recognition method, the experiments are carried out with several similar boxes.

• Journal of Korea Multimedia Society
• /
• v.17 no.12
• /
• pp.1383-1392
• /
• 2014

In this paper, we proposed a method to automatically determine the optimal radius through multi-scale LBP operation generalizing the size of radius variation and boosting learning in facial emotion recognition. When we looked at the distribution of features vectors, the most common was $LBP_{8.1}$ of 31% and sum of $LBP_{8.1}$ and $LBP_{8.2}$ was 57.5%, $LBP_{8.3}$, $LBP_{8.4}$, and $LBP_{8.5}$ were respectively 18.5%, 12.0%, and 12.0%. It was found that the patterns of relatively greater radius express characteristics of face well. In case of normal and anger, $LBP_{8.1}$ and $LBP_{8.2}$ were mainly distributed. The distribution of $LBP_{8.3}$ is greater than or equal to the that of $LBP_{8.1}$ in laugh and surprise. It was found that the radius greater than 1 or 2 was useful for a specific emotion recognition. The facial expression recognition rate of proposed multi-scale LBP method was 97.5%. This showed the superiority of proposed method and it was confirmed through various experiments.

• Journal of Advanced Navigation Technology
• /
• v.17 no.1
• /
• pp.98-106
• /
• 2013

In this paper, we propose a moving object detection and tracking method for multi-view camera environment. Based on the similarity and characteristics of motion vectors and coding block modes extracted from compressed bitstreams, validation of moving blocks, labeling of the validated blocks, and merging of neighboring blobs are performed. To continuously track objects for temporary stop, crossing, and overlapping events, a window based object updating algorithm is proposed for single- and multi-view environments. Object detection and tracking could be performed with an acceptable level of performance without decoding of video bitstreams for normal, temporary stop, crossing, and overlapping cases. The rates of detection and tracking are over 89% and 84% in multi-view environment, respectively. The rates for multi-view environment are improved by 6% and 7% compared to those of single-view environment.

• Communications for Statistical Applications and Methods
• /
• v.22 no.3
• /
• pp.295-304
• /
• 2015

This paper considers the problem of estimation of the Hurst parameter H ${\in}$ (1/2, 1) from longitudinal data with the error term of a fractional Brownian motion with Hurst parameter H that gives the amount of the long memory of its increment. We provide a new estimator of Hurst parameter H using a two scale sampling method based on $A{\ddot{i}}t$-Sahalia and Jacod (2009). Asymptotic behaviors (consistent and central limit theorem) of the proposed estimator will be investigated. For the proof of a central limit theorem, we use recent results on necessary and sufficient conditions for multi-dimensional vectors of multiple stochastic integrals to converges in distribution to multivariate normal distribution studied by Nourdin et al. (2010), Nualart and Ortiz-Latorre (2008), and Peccati and Tudor (2005).

• Journal of the Korean Data and Information Science Society
• /
• v.28 no.2
• /
• pp.435-442
• /
• 2017

Consider the problem of estimating a $p{\times}1$ mean vector ${\theta}$ (p ${\geq}$ 3) under the quadratic loss from multi-variate normal population. We find a James-Stein type estimator which shrinks towards the projection vectors when the underlying distribution is that of a variance mixture of normals. In this case, the norm ${\parallel}{\theta}-K{\theta}{\parallel}$ is known where K is a projection vector with rank(K) = q. The class of this type estimator is quite general to include the class of the estimators proposed by Merchand and Giri (1993). We can derive the class and obtain the optimal type estimator. Also, this research can be applied to the simple and multiple regression model in the case of rank(K) ${\geq}2$.