• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제20권3호
• /
• pp.225-242
• /
• 2016

The phase-type representation is strongly connected with the positive realization in positive system. We attempt to transform phase-type representation into sparse mono-cyclic positive representation with as low order as possible. Because equivalent positive representations of a given phase-type distribution are non-unique, it is important to find a simple sparse positive representation with lower order that leads to more effective use in applications. A Hypo-Feedback-Coxian Block (HFCB) representation is a good candidate for a simple sparse representation. Our objective is to find an HFCB representation with possibly lower order, including all the eigenvalues of the original generator. We introduce an efficient nonlinear optimization method for computing an HFCB representation from a given phase-type representation. We discuss numerical problems encountered when finding efficiently a stable solution of the nonlinear constrained optimization problem. Numerical simulations are performed to show the effectiveness of the proposed algorithm.

• Journal of Welding and Joining
• /
• 제18권4호
• /
• pp.104-110
• /
• 2000

An integral equation representation of cracks was presented, which differs from well-known "dislocation layer" representation. In this new representation, an integral equation representation of cracks was developed and coupled to the direct boundary-element method for treatment of cracks in plane finite bodies. The method was developed for in-plane (modes I and II) loadings only. In this paper, the method is formulated and applied to mode III problems involving smooth or kinked cracks in finite region. The results are compared to exact solutions where available and the method is shown to be very accurate despite of its simplicity.implicity.

• 인지과학
• /
• 제28권2호
• /
• pp.111-131
• /
• 2017

연결주의 모델은 계산주의적 관점에서 언어 처리를 연구하는 한 가지 접근법이다. 그리고 연결주의 모델 연구를 진행하는데 있어서 표상(representation)을 구축하는 것은, 모델의 학습 수준 및 수행 능력을 결정한다는 점에서 모델의 구조를 만드는 것만큼이나 중요한 일이다. 연결주의 모델은 크게 지역 표상(localist representation)과 분산 표상(distributed representation)이라는 두 가지 서로 다른 방식으로 표상을 구축해 왔다. 하지만 종래 연구들에서 사용된 지역 표상은 드문 목표 활성화 값을 갖고 있는 출력층의 유닛이 불활성화 하는 제한점을, 그리고 과거의 분산 표상은 표상된 정보의 불투명성에 의한 결과 확인의 어려움이라는 제한점을 갖고 있었으며 이는 연결주의 모델 연구 전반의 제한점이 되어 왔다. 본 연구는 이와 같은 과거의 표상 구축의 제한점에 대하여, 제한된 볼츠만 머신(restricted Boltzmann machine)이 갖고 있는 특징인 정보의 추상화를 활용하여 지역 표상을 가지고 분산 표상을 유도하는 새로운 방안을 제시하였다. 결과적으로 본 연구가 제안한 방법은 정보의 압축과 분산 표상을 지역 표상으로 역변환하는 방안을 활용하여 종래의 표상 구축 방법이 갖고 있는 문제를 효과적으로 해결함을 보였다.

• 한국게임학회 논문지
• /
• 제6권4호
• /
• pp.39-45
• /
• 2006

게임개발에서 설계내용은 디자인단계에서 뿐 아니라 구현단계와 테스트단계까지 자주 변경이 이루어진다. 게임의 설계내용은 게임규칙과 콘텐츠의 설계내용으로 이루어진다. 그 중에서 게임규칙의 설계 내용은, 모든 개발참여자들이 쉽고 정확하게 이해할 수 있어야 하고 자주 이루어지는 변경들이 효율적으로 관리되어야 하며 그리고 정확한 검증이 이루어져야 한다. 본 연구는 게임규칙의 설계내용에 대해, 게임디자인에서 적합하게 될 수 있는 표현방식을 찾기 위한 조사연구로서, 문서표현방식, UML 표현방식, 페트리네트 표현방식, 스크립트언어 표현방식에 대해 비교분석을 하였다. 비교분석은 게임규칙의 표현범위, 비주얼적 표현능력, 논리적 표현능력, 자동화된 검증 가능성, 그리고 효율적 형상관리 가능성에 대하여 이루어졌다. 비교분석결과 UML 표기방식이 가장 적합하였다. 그러나 UML 표기방식은 보다 편리한 자동화된 검증 방법의 연구개발이 필요한 것으로 판단되었다.

• Journal of Computing Science and Engineering
• /
• 제8권2호
• /
• pp.65-77
• /
• 2014

To address the problem of multi-target retrieval (MTR) of remote sensing images, this study proposes a new object-level feature representation model. The model provides an enhanced application image representation that improves the efficiency of MTR. Generating the model in our scheme includes processes, such as object-oriented image segmentation, feature parameter calculation, and symbolic image database construction. The proposed model uses the spatial representation method of the extended nine-direction lower-triangular (9DLT) matrix to combine spatial relationships among objects, and organizes the image features according to MPEG-7 standards. A similarity metric method is proposed that improves the precision of similarity retrieval. Our method provides a trade-off strategy that supports flexible matching on the target features, or the spatial relationship between the query target and the image database. We implement this retrieval framework on a dataset of remote sensing images. Experimental results show that the proposed model achieves competitive and high-retrieval precision.

• Journal of International Society for Simulation Surgery
• /
• 제3권2호
• /
• pp.46-48
• /
• 2016

Purpose In face reocognition area, estimating occlusion in face images is on the rise. In this paper, we propose a new face recognition algorithm based on dual sparse representation to solve this problem. Method Each face image is partitioned into several pieces and sparse representation is implemented in each part. Then, some parts that have large sparse concentration index are combined and sparse representation is performed one more time. Each test sample is classified by using the final sparse coefficient where correlation between the test sample and training sample is applied. Results The recognition rate of the proposed algorithm is higher than that of the basic sparse representation classification. Conclusion The proposed method can be applied in real life which needs to identify someone exactly whether the person disguises his face or not.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권6호
• /
• pp.2748-2766
• /
• 2016

Compared with traditional patch-based sparse representation, recent studies have concluded that group-based sparse representation (GSR) can simultaneously enforce the intrinsic local sparsity and nonlocal self-similarity of images within a unified framework. This article investigates an accelerated split Bregman method (SBM) that is based on GSR which exploits image compressive sensing (CS). The computational efficiency of accelerated SBM for the measurement matrix of a partial Fourier matrix can be further improved by the introduction of a fast Fourier transform (FFT) to derive the enhanced algorithm. In addition, we provide convergence analysis for the proposed method. Experimental results demonstrate that accelerated SBM is potentially faster than some existing image CS reconstruction methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권9호
• /
• pp.3745-3761
• /
• 2020

Low-rank representation methods already achieve many applications in the image reconstruction. However, for high-gradient image patches with rich texture details and strong edge information, it is difficult to find sufficient similar patches. Existing low-rank representation methods usually destroy image critical details and fail to preserve edge structure. In order to promote the performance, a new representation-based image super-resolution reconstruction method is proposed, which combines gradient domain guided image filter with the structure-constrained low-rank representation so as to enhance image details as well as reveal the intrinsic structure of an input image. Firstly, we extract the gradient domain guided filter of each atom in high resolution dictionary in order to acquire high-frequency prior information. Secondly, this prior information is taken as a structure constraint and introduced into the low-rank representation framework to develop a new model so as to maintain the edges of reconstructed image. Thirdly, the approximate optimal solution of the model is solved through alternating direction method of multipliers. After that, experiments are performed and results show that the proposed algorithm has higher performances than conventional state-of-the-art algorithms in both quantitative and qualitative aspects.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권7호
• /
• pp.3172-3193
• /
• 2018

Recently, several studies have shown that linear representation based approaches are very effective and efficient for image classification. One of these linear-representation-based approaches is the Collaborative representation (CR) method. The existing algorithms based on CR have two major problems that degrade their classification performance. First problem arises due to the limited number of available training samples. The large variations, caused by illumintion and expression changes, among query and training samples leads to poor classification performance. Second problem occurs when an image is partially noised (contiguous occlusion), as some part of the given image become corrupt the classification performance also degrades. We aim to extend the collaborative representation framework under limited training samples face recognition problem. Our proposed solution will generate virtual samples and intra-class variations from training data to model the variations effectively between query and training samples. For robust classification, the image patches have been utilized to compute representation to address partial occlusion as it leads to more accurate classification results. The proposed method computes representation based on local regions in the images as opposed to CR, which computes representation based on global solution involving entire images. Furthermore, the proposed solution also integrates the locality structure into CR, using Euclidian distance between the query and training samples. Intuitively, if the query sample can be represented by selecting its nearest neighbours, lie on a same linear subspace then the resulting representation will be more discriminate and accurately classify the query sample. Hence our proposed framework model the limited sample face recognition problem into sufficient training samples problem using virtual samples and intra-class variations, generated from training samples that will result in improved classification accuracy as evident from experimental results. Moreover, it compute representation based on local image patches for robust classification and is expected to greatly increase the classification performance for face recognition task.

• 디지털융복합연구
• /
• 제10권9호
• /
• pp.383-390
• /
• 2012

본 논문에서는 지식 표상 방식을 이용한 정보 검색 시각화 도구를 제안한다. 제안하는 정보 검색 시각화 도구는 사용자 검색이력 데이터를 이용하여 검색의도를 자동 추출하고, 추출된 검색의도를 지식 표상 방식 구조로 시각화 할 수 있도록 설계하였다. 검색의도 표상 방식을 위한 스키마는 인지 심리학적 지식 표상 방법론을 활용하였으며, 행동실험을 통해 그 효용성을 증명하였다. 실험결과 정보 검색 시각화 도구는 기존 검색방법에 비해 사용자 만족도 측면에서 약 39%의 향상이 있었으며, 정보 검색 과정에서의 재검색 문제를 해결할 수 있는 방안을 제시할 수 있었다.