• ETRI Journal
• /
• 제29권2호
• /
• pp.179-188
• /
• 2007

We propose a multi-strategic concept-spotting approach for robust spoken language understanding of conversational Korean in a hostile recognition environment such as in-car navigation and telebanking services. Our concept-spotting method adopts a partial semantic understanding strategy within a given specific domain since the method tries to directly extract predefined meaning representation slot values from spoken language inputs. In spite of partial understanding, we can efficiently acquire the necessary information to compose interesting applications because the meaning representation slots are properly designed for specific domain-oriented understanding tasks. We also propose a multi-strategic method based on this concept-spotting approach such as a voting method. We present experiments conducted to verify the feasibility of these methods using a variety of spoken Korean data.

• 대한원격탐사학회지
• /
• 제19권3호
• /
• pp.233-246
• /
• 2003

This paper presents a methodology to account for the partial or gradual changes of environmental phenomena in categorical map information for the fusion/integration of multiple spatial data. The fuzzy set based spatial data fusion scheme is applied in order to account for the fuzziness of boundaries in categorical information showing the partial or gradual environmental impacts. The fuzziness or uncertainty of boundary is represented as two kinds of fuzzy membership functions based on fuzzy object concept and the effects of them are quantitatively evaluated with the help of a cross validation procedure. A case study for landslide hazard assessment demonstrates the better performance of this scheme as compared to traditional crisp boundary representation.

• 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)
• /
• 제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.

• 한국실내디자인학회논문집
• /
• 제21권2호
• /
• pp.197-206
• /
• 2012

This study focuses on comparative study of the representation of 'traditionality' in Asian hotel guest rooms. Hotel can be a concentration of the country's culture and tradition and provide unique experience to guests through its space, decoration, and material. However, most hotels in Korea are lack of a strong identity based on the Korean culture and tradition, due to adoptation of the western hotel styles without any criticism. The purpose of this study was to investigate the expression methods of the traditionality in Asian hotel guest rooms to provide design guideline to enhance identity of hotel guest rooms in Korea. Through analysis of the previous researches, criteria of the three design application methods and the five design elements were defined to analyze the representation of the traditonality. Design application methods were categorized as "Original form", "Partial adoption", and "Metaphor". Five design elements include "Shape", "Material", "Color", "Object", and "Pattern". Thirty nine Asian hotels containing the traditional design elements were explored in the study. In result, design application methods in Korea used all three methods equally, while other Asian countries used mainly the Partial adoption and Metaphor methods to express their traditions rather than the Original form method. All five deign elements were mostly used in case of the Original form methods, and two or three elements among five elements were used for the Partial adoption and Metaphor methods. The traditional representation of hotel guest rooms in Korea, reflecting current thinking, living pattern and culture, will be a solution for the new hotel design as well as elevation of Korea's status to a higher level.

• 전기학회논문지P
• /
• 제53권4호
• /
• pp.210-215
• /
• 2004

This paper proposes an implicit method for computing the minimum cost feedback vertex set for a graph. For an arbitrary graph, a Boolean function is derived, whose satisfying assignments directly correspond to feedback vertex sets of the graph. Importantly, cycles in the graph are never explicitly enumerated, but rather, are captured implicitly in this Boolean function. This function is then used to determine the minimum cost feedback vertex set. Even though computing the minimum cost satisfying assignment for a Boolean function remains an NP-hard problem, it is possible to exploit the advances made in the area of Boolean function representation in logic synthesis to tackle this problem efficiently in practice for even reasonably large sized graphs. The algorithm has obvious application in flip-flop selection for partial scan. The algorithm proposed in this paper is the first to obtain the MFVS solutions for many benchmark circuits.

• 호남수학학술지
• /
• 제38권2호
• /
• pp.279-294
• /
• 2016

Half integer values of harmonic numbers and reciprocal binomial squared coeffients sums are investigated in this paper. Closed form representations and integral expressions are developed for the infiite series.

• 전자공학회논문지
• /
• 제52권5호
• /
• pp.136-146
• /
• 2015

차량 인식을 기반으로 하는 능동 제어는 지능형 자동차의 구현에 필요한 핵심 기술이며. 차폐 영역(occlusion)이 빈번하게 발생하는 도심에서 차량을 인식하기 위하여 차량의 부분적인 모습만으로도 차량을 인식할 수 있는 부분 기반 차량 표현이 필요하다. 본 논문에서는 지역적인 특징을 기저벡터로 사용하는 비음수 텐서 분해(non-negative tensor factorization, NTF)를 이용하여 차량을 표현하고, NTF 분해 계수를 특징으로 차량 인식률을 검증하였다. 실험 결과, 제안하는 방법이 기존의 비음수 행렬 분해를 사용한 경우에 비하여 보다 직관적인 부분 표현이 가능하며, 도심 영상에서도 보다 강건하게 차량을 인식함을 보여주었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제2권6호
• /
• pp.280-298
• /
• 2008

For efficient content-based image retrieval, diverse visual features such as color, texture, and shape have been widely used. In the case of leaf images, further improvement can be achieved based on the following observations. Most plants have unique shape of leaves that consist of one or more blades. Hence, blade-based matching can be more efficient than whole shape-based matching since the number and shape of blades are very effective to filtering out dissimilar leaves. Guaranteeing rotational invariance is critical for matching accuracy. In this paper, we propose a new shape representation, indexing and matching scheme for leaf image retrieval. For leaf shape representation, we generated a distance curve that is a sequence of distances between the leaf’s center and all the contour points. For matching, we developed a blade-based matching algorithm called rotation invariant - partial dynamic time warping (RI-PDTW). To speed up the matching, we suggest two additional techniques: i) priority queue-based pruning of unnecessary blade sequences for rotational invariance, and ii) lower bound-based pruning of unnecessary partial dynamic time warping (PDTW) calculations. We implemented a prototype system on the GEMINI framework [1][2]. Using experimental results, we showed that our scheme achieves excellent performance compared to competitive schemes.

• 한국전산응용수학회:학술대회논문집
• /
• 한국전산응용수학회 2003년도 KSCAM 학술발표회 프로그램 및 초록집
• /
• pp.4.2-4
• /
• 2003

In this paper, we describe how to approximate the solutions of partial differential equations by bicubic spline functions whose interpolation errors at non-grid points are smaller in general than those by linear interpolations of the original solution at grid points. We show that the bicubic spline function can be represented exactly or approximately by a fuzzy system, and that the resulting fuzzy rule table shows the contours of the solution function. Thus, the fuzzy rule table is identified as a digital image and the contours in the rule table provide approximate contours of the solution of partial differential equations. Several illustrative examples are included.