• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.2
• /
• pp.26-31
• /
• 2005

In this paper, we present the document summarizers which are simpler and more condense than the existing ones generally used in the web search engines. This method is a statistic-based summarization method using the concept of the complete graph. We suppose that each sentence as a vertex and the similarity between two sentences as a link of the graph. We compare this summarizer with those of Clustering and MMR techniques which are well-known as the good summarization methods. For the comparison, we use FScore using the summarization results generated by human subjects. Our experimental results verify the accuracy of this method, being about $30\%$ better than the others.

• School Mathematics
• /
• v.10 no.1
• /
• pp.43-61
• /
• 2008

This study is based on the pedagogical aspect that both connections of mathematical concepts and a geometric approach enhance the understanding of structures in school mathematics. This study is to investigate the graphical properties of quadratic functions such as symmetry, coordinates of vertex, intercepts and congruency through the geometric properties of graphs of linear functions. From this investigation this study would give suggestions on a new pedagogical perspective about current teaching and learning methods of quadratic function graphs which is focused on routine algebraic transformation of the completing squares. In addition, this study would provide the topic of quadratic function graphs with the understanding of geometric perspective.

• The Journal of the Korea Contents Association
• /
• v.11 no.2
• /
• pp.31-39
• /
• 2011

The facial recognition algorithms using Gabor wavelet based face graph produce very good performance while they have some weakness such as a large amount of computation and an irregular result depend on initial location. We proposed a fully automatic facial recognition algorithm using a Gabor feature based geometric deformable face graph matching. The initial location and size of a face graph can be selected using Adaboost detection results for speed-up. To find the best face graph with the face model graph by updating the size and location of the graph, the geometric transformable parameters are defined. The best parameters for an optimal face graph are derived using an optimization technique. The simulation results show that the proposed algorithm can produce very good performance with recognition rate 96.7% and recognition speed 0.26 sec for FERET database.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.2
• /
• pp.60-65
• /
• 2008

The matching preclusion set of a graph is a set of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. The matching preclusion number is the minimum cardinality over all matching preclusion sets. We show in this paper that, for any $m{\geq}4$, the matching preclusion numbers of both m-dimensional restricted HL-graph and recursive circulant $G(2^m,4)$ are equal to degree m of the networks, and that every minimum matching preclusion set is the set of edges incident to a single vertex.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.2
• /
• pp.415-420
• /
• 2016

A graph G=(V,E) is called an interval graph with a set V of vertices representing intervals on a line such that there is an edge $(i,j){\in}E$ if and only if intervals i and j intersect. In this paper, we are concerned in the vertex connectivity, one of various characteristics of the graph. Specifically, the vertex connectivity of an interval graph is represented by the overlapping of intervals. Also we propose an efficient algorithm to compute the vertex connectivity on the fully dynamic environment in which the vertices or the edges are inserted or deleted. Using a special kind of interval tree, we show how to compute the vertex connectivity and to maintain the tree in O(logn) time when a new interval is added or an existing interval is deleted.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.3
• /
• pp.380-388
• /
• 1999

본 논문에서는 완전삼트리를 재귀원형군에 임베딩하는 문제를 고려한다. 재귀원형군 G(N,d)는 N개의 노드와 N보다 작은 d의 거듭제곱에 의한 점프에지를 가지는 원형군그래프이다. 임베딩 문제를 해결하고자 본 논문에서는 노드수가 3k인 삼항트리 Tk새롭게 도입한다. 먼저 N개 이하의 정점을 가지는 삼항트리가 G(N, 2)와 G(N,3)의 부그래프임을 보인다. 또한 완전 삼진트리가 삼항트리에 연장률 2, 확장률2, 밀집률 2로 임베딩됨을 보인다. 이러한 결과들을 결합하면서 N개 이하의 정점을 가지는 완전삼진 트리가 재귀원형군G(2N, 2)과 G(2N, 3)에 연장률 2, 밀집률 2로 임베딩 가능하게 한다. 임베딩 과정에서 이용된 삼항트리는 2 -포트 방송모델에서 최소방송트리임을 보이고, 이를 이용하여 재귀원형군 G(2m, 2)가 2-포트 방송모델에서 최소방송시간을 가짐을 보인다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.5
• /
• pp.263-269
• /
• 2014

In this paper, I disprove Hadwiger conjecture of the vertex coloring problem, which asserts that "All $K_k$-minor free graphs can be colored with k-1 number of colors, i.e., ${\chi}(G)=k$ given $K_k$-minor." Pursuant to Hadwiger conjecture, one shall obtain an NP-complete k-minor to determine ${\chi}(G)=k$, and solve another NP-complete vertex coloring problem as a means to color vertices. In order to disprove Hadwiger conjecture in this paper, I propose an algorithm of linear time complexity O(V) that yields the exact solution to the vertex coloring problem. The proposed algorithm assigns vertex with the minimum degree to the Maximum Independent Set (MIS) and repeats this process on a simplified graph derived by deleting adjacent edges to the MIS vertex so as to finally obtain an MIS with a single color. Next, it repeats the process on a simplified graph derived by deleting edges of the MIS vertex to obtain an MIS whose number of vertex color corresponds to ${\chi}(G)=k$. Also presented in this paper using the proposed algorithm is an additional algorithm that searches solution of ${\chi}^{{\prime}{\prime}}(G)$, the total chromatic number, which also remains NP-complete. When applied to a $K_4$-minor graph, the proposed algorithm has obtained ${\chi}(G)=3$ instead of ${\chi}(G)=4$, proving that the Hadwiger conjecture is not universally applicable to all the graphs. The proposed algorithm, however, is a simple algorithm that directly obtains an independent set minor of ${\chi}(G)=k$ to assign an equal color to the vertices of each independent set without having to determine minors in the first place.

• Journal of Korean Institute of Industrial Engineers
• /
• v.20 no.4
• /
• pp.65-72
• /
• 1994

An independent set of nodes is a set of nodes no two of which are joined by an edge. An independent set is called maximal if no more nodes can be added to the set without destroying its independence. The greatest number of maximal independent set is the maximum possible number of maximal independent set of a graph. We consider the greatest number of maximal independent set in connected graphs with fixed numbers of edges and nodes. For arbitrary number of nodes with a certain class of number of edges, we present the connected graphs with the greatest number of maximal independent set. For a given class of number of edges, the structure of graphs with the greatest number of maximal independent set is that the two components are completely joined; one consists of disjoint triangles as many as possible and the other is the complete graph with remaining nodes.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.392-394
• /
• 2000

본 논문에서는 DNA칩 이미지 처리시스템을 위한 완전 그리딩 알고리즘을 제안한다. DNA칩 이미지를 분석하여 처리할 수 있는 많은 DNA칩 분석 시스템이 있다. 하지만 이전의 시스템들은 정확한 이미지 처리를 통한 올바른 유전자 발현정보를 얻기 위해서 많은 사용자의 개입이 필요한 단점이 있었다. 본 논문에서는 사용자의 개입이 없는 정확한 자동 이미지 처리를 위해서, $\varepsilon$-그래프 모델링 기법을 제시하고, MBR, Mass, Geometry 등 세가지 종류의 반점(spot) 중심을 이용한 완전 그리딩 알고리즘을 제안한다. 제시된 이미지 처리 기술은 완전한 자동 DNA칩 분석 시스템으로, 사용자의 개입없이도 정확한 DNA칩 위치 정보를 얻을 수 있다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2022.06a
• /
• pp.101-104
• /
• 2022

MPEG Immersive Video (MIV) 표준화 기술은 다시점 영상 부호화 시 비디오 코덱의 부담을 최소화하기 위해 각 시점 영상의 차분 정보만을 표현하는 처리 기술을 바탕으로 하고 있다. 본 논문에서는 시점 간 중복성 제거를 진행하는 과정인 프루닝(pruning) 과정에서 복잡도 절감을 위해 병렬처리에 용이하도록 구성되는 프루닝 클러스터 그래프에 대해 서술하고, 각 클러스터 그래프 별 구성 전략에 따른 성능 분석을 진행한다. 클러스터 그래프 내에서 중복성 제거를 진행하지 않고 완전한 정보를 보존하는 바탕 시점(basic view)의 개수가 적게 포함될수록 처리할 전체 픽셀 화소율(pixel rate)은 감소하지만, 복원 화질 역시 감소하며 프루닝 복잡도는 증가하는 경향을 보인다. 실험 결과를 통해 프루닝 클러스터 그래프 구성에 따른 트레이드오프를 탐색하고, 최적화된 그래프 구성 전략에 따라 몰입형 비디오의 효율적인 전송이 가능함을 보인다.