• 농촌계획
• /
• 제23권2호
• /
• pp.29-42
• /
• 2017

Sustainable development is no longer an option, but a requirement. Under this awareness, UN adopted 17 goals for a new sustainable development agenda on September 2015, named 'Sustainable Development Goals(SDGs)'. The Korean Society of Rural Planning(KSRP) is established on July 1994 for the sustainable development of rural areas. On the purpose to quantitatively analyze the research trend of KSRP's publications with the viewpoint of SDGs, the qualitative documents of 17 SDGs and 771 publications were mathematically transformed into vectors and the similarity was numerically measured with the 'Vector Space Model(VSM)'. The results show that 'Sustainable cities and communities(SDG 11)', 'Zero hunger(SDG 2)', 'Life on land(SDG 15)' and 'Responsible consumption and production(SDG 12)' have strong relationships with KSRP, while those of 'Affordable and clean energy(SDG 7)', 'Peace, justice and strong institution(SDG 16)' and 'Gender equality(SDG 5)' are weak. It is also found that the relationships of KSRP publications with 'energy' and 'climate change' issues(SDG 7, 13) were greatly increased during the period of 1995-2016, in spite of their weak relationships.

• Smart Structures and Systems
• /
• 제26권1호
• /
• pp.23-33
• /
• 2020

Majority of the damage in engineering structures is nonlinear. Damage sensitive features (DSFs) extracted by traditional methods from linear time series models cannot effectively handle nonlinearity induced by structural damage. A new DSF is proposed based on vector space cosine similarity (VSCS), which combines K-means cluster analysis and Bayesian discrimination to detect nonlinear structural damage. A reference autoregressive moving average (ARMA) model is built based on measured acceleration data. This study first considers an existing DSF, residual standard deviation (RSD). The DSF is further advanced using the VSCS, and then the advanced VSCS is classified using K-means cluster analysis and Bayes discriminant analysis, respectively. The performance of the proposed approach is then verified using experimental data from a three-story shear building structure, and compared with the results of existing RSD. It is demonstrated that combining the linear ARMA model and the advanced VSCS, with cluster analysis and Bayes discriminant analysis, respectively, is an effective approach for detection of nonlinear damage. This approach improves the reliability and accuracy of the nonlinear damage detection using the linear model and significantly reduces the computational cost. The results indicate that the proposed approach is potential to be a promising damage detection technique.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제31권4호
• /
• pp.488-497
• /
• 2004

본 논문에서는 추출 요약 방식과 질의어 기반의 요약 방식을 혼합한 문서 요약 방법에 관해서 기술한다. 학습문서를 이용해 주제어구 추출을 위한 학습 모델을 만든다. 학습 알고리즘은 Naive Bayesian, 결정트리, Supported Vector Machine을 이용한다. 구축된 모델을 이용하여 입력 문서로부터 주제어구 리스트를 자동으로 추출한다. 추출된 주제어구들을 질의어로 하여 이들의 국부적 유사도에 의한 기여도를 계산함으로써 요약문을 추출한다. 본 논문에서는 주제어구가 원문 요약에 미치는 영향과, 몇 개의 주제어구 추출이 문서 요약에 적당한지를 실험하였다. 추출된 요약문과 수동으로 추출한 요약문을 비교하여 결과를 평가하였으며, 객관적인 성능 평가를 위하여 MS-Word에 포함된 문서 요약 기능과 실험 결과를 비교하였다.

• 제어로봇시스템학회논문지
• /
• 제16권3호
• /
• pp.269-276
• /
• 2010

In this paper, we present the detection method of moving objects based on two background models. These background models support to understand multi layered environment belonged in images taken by shaking camera and each model is MBM(Multiple Background Model) and TMBM (Temporal Median Background Model). Because two background models are Pixel-based model, it must have noise by camera movement. Therefore correlation coefficient calculates the similarity between consecutive images and measures camera motion vector which indicates camera movement. For the calculation of correlation coefficient, we choose the selected region and searching area in the current and previous image respectively then we have a displacement vector by the correlation process. Every selected region must have its own displacement vector therefore the global maximum of a histogram of displacement vectors is the camera motion vector between consecutive images. The MBM classifies the intensity distribution of each pixel continuously related by camera motion vector to the multi clusters. However, MBM has weak sensitivity for temporal intensity variation thus we use TMBM to support the weakness of system. In the video-based experiment, we verify the presented algorithm needs around 49(ms) to generate two background models and detect moving objects.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1650-1669
• /
• 2017

In this study, each pixel in an ear is used as a centroid to generate a cake. Subsequently the major axis length of this cake is computed and obtained. This obtained major axis length serves as a feature to recognize an ear. Later, the ear hole is used as a centroid and a 16-circle template is generated to extract the major axis lengths of the ear. The 16-circle template extracted signals are used to recognize an ear. In the next step, a ring-to-line mapping technique is used to map these major axis lengths to several straight-line signals. Next, the complex plane vector computing technique is used to determine the similarity of these major axis lengths, whereby a solution to the image-rotating problem is achieved. The aforementioned extracted signals are also compared to the ones that are extracted from its neighboring pixels, whereby solving the image-shifting problem. The algorithm developed in this study can precisely identify an ear image by solving the image rotation and image shifting problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권11호
• /
• pp.4556-4572
• /
• 2015

Dynamic texture (DT) recognition is a challenging problem in numerous applications. In this study, we propose a new algorithm for DT recognition based on group sparsity structure in conjunction with chaotic feature vector. Bag-of-words model is used to represent each video as a histogram of the chaotic feature vector, which is proposed to capture self-similarity property of the pixel intensity series. The recognition problem is then cast to a group sparsity model, which can be efficiently optimized through alternating direction method of multiplier algorithm. Experimental results show that the proposed method exhibited the best performance among several well-known DT modeling techniques.

• KIEE International Transaction on Systems and Control
• /
• 제12D권1호
• /
• pp.7-11
• /
• 2002

In this study, fur the shape-based image retrieval, a method using local differential invariants is proposed. This method calculates the differential invariant feature vector at every feature point extracted by Harris comer point detector. Then through vector quantization using LBG algorithm, all feature vectors are represented by a codebook index. All images are indexed by the histogram of codebook index, and by comparing the histograms the similarity between images is obtained. The proposed method is compared with the existing method by performing experiments for image database including various 1100 trademarks.

• 정보처리학회논문지D
• /
• 제13D권4호
• /
• pp.455-462
• /
• 2006

고차원 데이터 공간에서의 효과적인 검색을 위해 최근 VA-file[1], LPC-file[2] 등과 같이 벡터 근사에 기반을 둔 필터링 색인 방법들이 연구되었다. 필터링 색인 방법은 벡터를 근사한 작은 크기의 색인 정보를 사용하여 근사 거리를 계산하고, 이를 사용하여 질의 벡터와 유사하지 않은 대부분의 벡터들을 빠른 시간 안에 검색 대상에서 제외한다. 즉, 실제 벡터 대신 근사 벡터를 읽어 디스크 I/O 시간을 줄여 전체 검색 속도를 향상시키는 것이다. 하지만 VA-file 이나 LPC-file은 근사 거리를 구하는 방법이 순차 검색과 같거나 복잡하기 때문에 검색 속도 향상 효과가 그리 크지 않다는 문제점을 가지고 있다. 본 논문은 이러한 근사 거리 계산 시간을 줄이기 위하여 새로운 비트맵 색인 구조를 제안한다. 근사 거리 계산속도의 향상을 위하여, 각 객체의 값을 특성 벡터 공간상의 위치를 나타내는 비트 패턴으로 저장하고, 객체 사이의 거리를 구하는 연산은 실제 벡터 값의 연산보다 속도가 훨씬 빠른 XOR 비트 연산으로 대체한다. 실험에 의하면 본 논문이 제안하는 방법은 기존 벡터 근사 접근 방법들과 비교하여 데이터 읽기시간은 더 크지만, 계산 시간을 크게 줄임으로써 전체 검색 속도는 순차 검색의 약 4배, 기존의 방법들보다는 최대 2배의 성능이 향상되었다. 결과적으로, 데이터베이스의 속도가 충분히 빠른 경우 기존의 벡터 근사 접근법의 필터링을 위한 계산 시간을 줄임으로써 더욱 검색 성능을 향상 시킬 수 있음을 확인할 수 있다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.419-422
• /
• 2003

To improve the recognition accuracy of a developed artificial odor discrimination system for three mixture fragrance recognition, Fuzzy Similarity based Self-Organized Network inspired by Immune Algorithm (F-SONIA) is proposed. Minimum, average, and maximum values of fragrance data acquisitions are used to form triangular fuzzy numbers. Then the fuzzy similarity treasure is used to define the relationship between fragrance inputs and connection strengths of hidden units. The fuzzy similarity is defined as the maximum value of the intersection region between triangular fuzzy set of input vectors and the connection strengths of hidden units. In experiments, performances of the proposed method is compared with the conventional Self-Organized Network inspired by Immune Algorithm (SONIA), and the Fuzzy Learning Vector Quantization (FLVQ). Experiments show that F-SONIA improves recognition accuracy of SONIA by 3-9％. Comparing to the previously developed artificial odor discrimination system that used FLVQ as pattern classifier, the recognition accuracy is increased by 14-25％.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권11호
• /
• pp.4502-4518
• /
• 2015

Fisher linear discriminant analysis (LDA) is one of the most popular projection techniques for feature extraction and has been widely applied in face recognition. However, it cannot be used when encountering the single sample per person problem (SSPP) because the intra-class variations cannot be evaluated. In this paper, we propose a novel method called local similarity based linear discriminant analysis (LS_LDA) to solve this problem. Motivated by the "divide-conquer" strategy, we first divide the face into local blocks, and classify each local block, and then integrate all the classification results to make final decision. To make LDA feasible for SSPP problem, we further divide each block into overlapped patches and assume that these patches are from the same class. To improve the robustness of LS_LDA to outliers, we further propose local similarity based median discriminant analysis (LS_MDA), which uses class median vector to estimate the class population mean in LDA modeling. Experimental results on three popular databases show that our methods not only generalize well SSPP problem but also have strong robustness to expression, illumination, occlusion and time variation.