• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.682-689
• /
• 2019

In part-based image representation, the partial shapes of an object are represented as basis vectors, and an image is decomposed as a linear combination of basis vectors where the coefficients of those basis vectors represent the partial (or local) feature of an object. In this paper, a face recognition for occluded faces is proposed in which face images are represented using non-negative matrix factorization(NMF), one of part-based representation techniques, and recognized using an artificial neural network technique. Standard NMF, projected gradient NMF and orthogonal NMF were used in part-based representation of face images, and their performances were compared. Learning vector quantizer were used in the recognizer where Euclidean distance was used as the distance measure. Experimental results show that proposed recognition is more robust than the conventional face recognition for the occluded faces.

• Journal of Korea Multimedia Society
• /
• v.7 no.10
• /
• pp.1478-1484
• /
• 2004

This paper presents a method that controls facial expression in realtime of 3D avatar by having the user select a sequence of facial expressions in the space of facial expressions. The space of expression is created from about 2400 frames of facial expressions. To represent the state of each expression, we use the distance matrix that represents the distances between pairs of feature points on the face. The set of distance matrices is used as the space of expressions. Facial expression of 3D avatar is controled in real time as the user navigates the space. To help this process, we visualized the space of expressions in 2D space by using the Principal Component Analysis(PCA) projection. To see how effective this system is, we had users control facial expressions of 3D avatar by using the system. This paper evaluates the results.

• Journal of Broadcast Engineering
• /
• v.17 no.2
• /
• pp.388-399
• /
• 2012

In the paper, we propose enhanced feature extraction and matching methods for a mobile environment based on modified SURF. We propose three methods to reduce the computational complexity in a mobile environment. The first is to reduce the dimensions of the SURF descriptor. We compare the performance of existing 64-dimensional SURF with several other dimensional SURFs. The second is to improve the performance using the sign of the trace of the Hessian matrix. In other words, feature points are considered as matched if they have the same sign for the trace of the Hessian matrix, otherwise considered not matched. The last one is to find the best distance-ratio which is used to determine the matching points. We find the best distance-ratio through experiments, and it gives the relatively high accuracy. Finally, existing system which is based on normal SURF method is compared with our proposed system which is based on these three proposed methods. We present that our proposed system shows reduced response time while preserving reasonably good matching accuracy.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.10 no.4
• /
• pp.1-13
• /
• 2007

We make image that accumulate two principal component after change picture to use GLCM(Gray Level Co-Occurrence Matrix)'s texture feature information. And then these images use preprocess to achieved corner detection and area detection. Experiment results, two principle component conversion accumulation images had most informations about six kind textures by Eigen value 94.6%. When compared with red tide area that uses sea color and red tide area of image that have all principle component, displayed the most superior result. Also, we creates Euclidian space using Euclidian distance measurement about red tide area and clear sea. We identify of red tide area by red tide area and clear sea about random sea area through Euclidian distance and spatial distribution.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2007.11a
• /
• pp.311-317
• /
• 2007

The reduction of the Vehicle interior noise has been the main interest of NVH engineers. The driver's perception on the vehicle noise is affected largely by psychoacoustic characteristic of the noise as well as the SPL. The previous methods to evaluation of the SQ about vehicle interior noise are linear regression analysis of subjective SQ metrics by statistics and the estimation of the subjective SQ values by neural network. But these are so depended on jury test very much that they result in many difficulties. So, to reduce jury test weight, we suggested a new method using Mahalanobis distance for SQ evaluation. And, optimal characteristic values influenced on the result of the SQ evaluation were derived by signal to noise ratio(SN ratio) of the Taguchi method. Finally, the new method to evaluate SQ is constructed using Mahalanobis-Taguchi system(MTS). Furthermore, the MTS method for SQ evaluation was compared by the result of SQ grade table at the previous study and their virtues and faults introduced.

• Development and Reproduction
• /
• v.23 no.3
• /
• pp.297-304
• /
• 2019

The higher fragment sizes (>2,100 bp) are not observed in the two C. spp. populations. The six oligonucleotides primers OPA-11, OPB-09, OPB-14, OPB-20, OPC-14, and OPC-18 were used to generate the unique shared loci to each tonguesole population and shared loci by the two tonguesole populations. The hierarchical polar dendrogram indicates two main clusters: Gunsan (GUNSAN 01-GUNSAN 11) and the Atlantic (ATLANTIC 12-ATLANTIC 22) from two geographic populations of tonguesoles. The shortest genetic distance displaying significant molecular difference was between individuals' GUNSAN no. 02-GUNSAN no. 01 (genetic distance=0.038). In the long run, individual no. 02 of the ATLANTIC tonguesole was most distantly related to GUNSAN no. 06 (genetic distance=0.958). These results demonstrate that the Gunsan tonguesole population is genetically different from the Atlantic tonguesole population. The potential of PCR analysis to identify diagnostic markers for the identification of two tonguesole populations has been demonstrated. As a rule, using various oligonucleotides primers, this PCR method has been applied to identify polymorphic/specific markers particular to species and geographical population, as well as genetic diversity/polymorphism in diverse species of organisms.

• Journal of Electrical Engineering and Technology
• /
• v.1 no.2
• /
• pp.170-176
• /
• 2006

This paper proposes a topological locating algorithm to determine the location of the power quality event source. This algorithm makes use of the information on the topology of the monitored network and on the direction of PQ events. As a result, the bus incidence matrix is modified using monitor location and the direction matrix is constructed. With this information, the algorithm determines the suspected locations of the PQ events. To reduce suspicious areas, it utilizes event cause and related equipment. In case of line fault event, it calculates the distance from the monitor to the location of event source. The overall algorithm is applied to the IEEE test feeder and accurately identifies the event source location.

• ETRI Journal
• /
• v.29 no.3
• /
• pp.381-389
• /
• 2007

In this paper we propose a graph-theoretic method based on linear congruence for constructing low-density parity check (LDPC) codes. In this method, we design a connection graph with three kinds of special paths to ensure that the Tanner graph of the parity check matrix mapped from the connection graph is without short cycles. The new construction method results in a class of (3, ${\rho}$)-regular quasi-cyclic LDPC codes with a girth of 12. Based on the structure of the parity check matrix, the lower bound on the minimum distance of the codes is found. The simulation studies of several proposed LDPC codes demonstrate powerful bit-error-rate performance with iterative decoding in additive white Gaussian noise channels.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1193-1209
• /
• 2015

Network coding is promising to maximize network throughput and improve the resilience to random network failures in various networking systems. In this paper, the problem of providing efficient confidentiality for practical network coding system against a global eavesdropper (with full eavesdropping capabilities to the network) is considered. By exploiting a novel combination between the construction technique of systematic Maximum Distance Separable (MDS) erasure coding and traditional cryptographic approach, two efficient schemes are proposed that can achieve the maximum possible rate and minimum encryption overhead respectively on top of any communication network or underlying linear network code. Every generation is first subjected to an encoding by a particular matrix generated by two (or three) Vandermonde matrices, and then parts of coded vectors (or secret symbols) are encrypted before transmitting. The proposed schemes are characterized by tunable and measurable degrees of security and also shown to be of low overhead in computation and bandwidth.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.4
• /
• pp.300-305
• /
• 2002

In this paper, we use the modified gaussian kernel function as clustering distance measure and recast the given hyper-ellipsoidal clustering problem as the optimization problem that minimizes the volume of hyper-ellipsoidal clusters, respectively and solve this using EVP (eigen value problem) that is one of the LMI (linear matrix inequality) techniques.