• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.7A
• /
• pp.1044-1049
• /
• 2000

Projection that can be used as a feature for image representation, includes much available informations such as approximated shape and location. But when we retrieve image using it, there are some disadvantage such as requiring much index data and making different length of projected vector for differenr image size. In order to overcome these problems, we propose a method of using block variance for the projected vector. We use block variance of the projection vector to localize the characteristics of image and to reduce the number of index data in database. Proposed algorithm can make use of statistical advantage through database including various size of images and be executed with fast response time in implementation.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.05a
• /
• pp.603-605
• /
• 2023

최근 SNS 의 발달로 인해 자신의 감정을 빠르고 효과적으로 전달할 수 있는 이모지의 중요성이 커지고 있다. 하지만 이모지를 수동으로 생성하기 위해서 시간과 비용이 많이 들고 자신의 감정에 맞는 이모지를 찾아야 하며 해당 이모지가 없을 수 있다. 기존 DCGAN 을 활용한 이모지 자동 생성연구에서는 부족한 데이터셋으로 인해 G(Generator)와 D(Discriminator)가 동등하게 학습하지 못해서 두 모델 간 성능 차이가 발생한다. D 가 G 보다 최적해에 빠르게 수렴하여 G 가 학습이 되지 않아 낮은 품질의 이모지를 생성하는 불안정 문제가 발생한다. 이 문제를 해결하기 위해 본 논문에서는 Latent vector 분포를 데이터셋에 맞게 조정하여 적은 데이터로 G 에서 안정적으로 학습할 수 있게 하는 G 구조와 다양한 이모지 생성을 위한 Latent vector 평균 조정 기법을 제안한다. 비교 실험 결과 불안정 문제를 개선하였고 FID 와 IS 수치를 통해 성능 개선 효과를 검증했다.

• 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.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2884-2896
• /
• 1998

For on-line signature verification, the local shape of a signature is an important information. The current approaches, in which signatures are represented into a function of time or a feature vector without regarding of local shape, have not used the various features of local shapes, for example, local variation of a signer, local complexity of signature or local difficulty of forger, and etc. In this paper, we propose a new technique for on-line signature verification based on a structural signature representation so as to analyze local shape and to make a selection of important local parts in matching process. That is. based on a structural representation of signature, a technique of important of local weighting and personalized decision threshold is newly introduced and its experimental results under different conditions are compared.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.1
• /
• pp.402-410
• /
• 2017

For many years, researchers in face description area have been representing and recognizing faces based on different methods that include subspace discriminant analysis, statistical learning and non-statistics based approach etc. But still automatic face recognition remains an interesting but challenging problem. This paper presents a novel and efficient face image representation method based on Optimized Local Ternary Pattern (OLTP) texture features. The face image is divided into several regions from which the OLTP texture feature distributions are extracted and concatenated into a feature vector that can act as face descriptor. The recognition is performed using nearest neighbor classification method with Chi-square distance as a similarity measure. Extensive experimental results on Yale B, ORL and AR face databases show that OLTP consistently performs much better than other well recognized texture models for face recognition.

• ETRI Journal
• /
• v.36 no.3
• /
• pp.460-468
• /
• 2014

This paper addresses the problem of joint time of arrival (TOA) and direction of arrival (DOA) estimation in impulse radio ultra-wideband systems with a two-antenna receiver and links the joint estimation of TOA and DOA to the sparse representation framework. Exploiting this link, an orthogonal matching pursuit algorithm is used for TOA estimation in the two antennas, and then the DOA parameters are estimated via the difference in the TOAs between the two antennas. The proposed algorithm can work well with a single measurement vector and can pair TOA and DOA parameters. Furthermore, it has better parameter-estimation performance than traditional propagator methods, such as, estimation of signal parameters via rotational invariance techniques algorithms matrix pencil algorithms, and other new joint-estimation schemes, with one single snapshot. The simulation results verify the usefulness of the proposed algorithm.

• Spatial Information Research
• /
• v.3 no.2
• /
• pp.147-159
• /
• 1995

To construct GIS successfully, mapping technology, primary S/W technology, and DB tool technology are necessarily required. Among them, the mapping technology is the most important one in constructing a GIS spatial database that needs much time and effort. In this paper, we designed and implemented a systematic and effective vectoring tool. The general vectoring process was analyzed and parted into an automated part and a remaining part for increasing overall efficiency. We also proposed a multi -level representation method for vector data and applied it to the developed vect1lring tool. We could verify usefulness of the proposed representation method.

• Korean Journal of Mathematics
• /
• v.26 no.2
• /
• pp.175-189
• /
• 2018

In this paper, at first we generalize the notion of algebra over a field. A ${\Gamma}$-algebra is an algebraic structure consisting of a vector space V, a groupoid ${\Gamma}$ together with a map from $V{\times}{\Gamma}{\times}V$ to V. Then, on every associative ${\Gamma}$-algebra V and for every ${\alpha}{{\in}}{\Gamma}$ we construct an ${\alpha}$-Lie algebra. Also, we discuss some properties about ${\Gamma}$-Lie algebras when V and ${\Gamma}$ are the sets of $m{\times}n$ and $n{\times}m$ matrices over a field F respectively. Finally, we define the notions of ${\alpha}$-derivation, ${\alpha}$-representation, ${\alpha}$-nilpotency and prove Engel theorem in this case.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.1 no.1
• /
• pp.35-53
• /
• 1997

This paper analyzes the time complexity of Genetic Algorithm based Task Scheduling (GATS) which is designed for the scheduling of parallel programs with diverse embedded parallelism types in a heterogeneous network systems. The analysis of time complexity is performed based on two representation methods (REIA, REIS) which are proposed in this paper to encode the scheduling information. And the heterogeneous network systems consist of a set of loosely coupled parallel and vector machines connected via a high-speed network. The objective of heterogeneous network computing is to solve computationally intensive problems that have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. Therefore, when scheduling in heterogeneous network systems, the matching of the parallelism characteristics between tasks and parallel machines should be carefully handled in order to obtain more speedup. This paper shows how the parallelism type matching affects the time complexity of GATS.

• Journal of the Korean Society for information Management
• /
• v.22 no.3 s.57
• /
• pp.261-287
• /
• 2005

The purpose of this paper is to explore the ways to improve the performance of SVM (Support Vector Machines) text classifier using inter-document similarities. SVMs are powerful machine learning systems, which are considered as the state-of-the-art technique for automatic document classification. In this paper text categorization via SVMs approach based on feature representation with document vectors is suggested. In this approach, document vectors instead of index terms are used as features, and vector similarities instead of term weights are used as feature values. Experiments show that SVM classifier with document vector features can improve the document classification performance. For the sake of run-time efficiency, two methods are developed: One is to select document vector features, and the other is to use category centroid vector features instead. Experiments on these two methods show that we can get improved performance with small vector feature set than the performance of conventional methods with index term features.