• 한국컴퓨터정보학회논문지
• /
• 제16권8호
• /
• pp.95-101
• /
• 2011

본 논문에서는 픽셀 연결성 추적을 이용한 의사 특징점 제거에 관하여 연구하였다. 특징점을 추출하는 방법에는 교차수를 이용한 방법이 있다. 그러나 교차수를 이용한 방법에서는 의사 특징점이 많이 추출된다. 교차수를 이용한 방법에서 잘못 추출된 특징점들을 제거하기 위하여 단점과 분기점 주위에 있는 8개 픽셀을 추적하여 조건을 만족하는 경우 실제 특징점으로 추출하고 조건을 만족하지 않는 경우 의사 특징점이므로 제거하였다. 성능 평가를 위하여 교차수를 이용한 방법과 픽셀 연결성 추적을 이용하여 추출된 실제 특징점을 비교하였으며, 실험결과 픽셀 연결성 추적을 이용하여 궁상문형, 와상문형, 제상문형에 대하여 의사특징점이 각각 47%, 40%, 30% 제거되었음을 알 수 있었다.

• 전기학회논문지
• /
• 제57권4호
• /
• pp.715-717
• /
• 2008

The connectivity weighted Hough transform is a useful method for detecting well-connected short lines without generating false lines yet requires extensive computation. This letter describes a method that reduces the computation of the connectivity weighted Hough transform by removing unnecessary weight calculations using the gradient angles of feature points. In simulations with synthetic images and experiments with liquid crystal display panel images, the proposed method showed significantly improved speed without compromising detectability.

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 2007년도 정기학술대회
• /
• pp.234-240
• /
• 2007

This paper argues that various kinds of displaced structures in English should be licensed by a more explicitly formulated type of rule schema in order to deal with what is called weak connectivity in English. This paper claims that the filler and the gap site cannot maintain the total identity of features but a partial overlap since the two positions need to obey the structural forces that come from occupying respective positions. One such case is the missing object construction where the subject fillers and the object gaps are to observe requirements that are imposed on the respective positions. Others include passive constructions and topicalized structures. In this paper, it is argued that the feature discrepancy comes from the different syntactic positions in which the fillers are assumed to be located before and after displacement. In order to capture this type of mismatch, syntactically relevant features are handled separately from the semantically motivated features in order to deal with the syntactically imposed requirements.

• 한국산학기술학회논문지
• /
• 제13권6호
• /
• pp.2812-2825
• /
• 2012

본 연구의 목적은 법학전문도서관의 기존사례 분석을 통하여 공간구성 특성을 조사, 규정하고 교육이념에 부응하는 법학전문도서관 특성을 반영한 계획안의 제시함으로서 법학전문도서관의 계획요소 및 디자인을 제안하고자 하였다. 법학도서관의 공간구성특성을 요약하면 (1) 접근성을 고려한 진입층의 공간구성 (2) 열람공간 이용자 중심의 열람실 공간구성 (3) 교육 및 연구 공간과 열람실의 연계성을 고려한 공간 구성으로 법학도서관의 특성을 규정할 수 있다. 이러한 결과를 토대로 한 법학도서관 설계 시 다음과 같은 디자인 쟁점사항을 도출하였다. 진입층 공간구성은 교육의 장소로서의 이용행태, 접근성과 연계성의 측면을 고려하여 공용공간과 함께 열람공간을 계획하여야 한다. 이용자 중심의 열람실과 서고의 공간구성이 계획되기 위한 방법으로는 일반열람실 또는 지정 도서실이 진입공간과 직접 연계되는 계획이 이루어 져야 된다. 교육 및 연구 공간과 열람실이 유기적으로 연결되어야 함에 따라서 코어를 중심으로 교육 및 연구 공간과 열람실을 수직적으로 연계하여 열람실과 교육 연구 공간의 연계성을 높이는 동시에 외부에서의 접근성도 고려한 계획이 되어야한다.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2011년도 제43차 동계학술발표논문집 19권1호
• /
• pp.69-72
• /
• 2011

본 논문에서는 방향 연결성 추적을 이용한 의사 특징점 제거에 관하여 연구하였다. 특징점을 추출하는 방법에는 교차수를 이용한 방법이 있다. 그러나 교차수를 이용한 방법에서는 의사 특징점이 많이 추출된다. 교차수를 이용한 방법에서 잘못 추출된 특징점들을 방향 연결성 추적을 이용한 의사 특징점 제거 알고리즘을 이용하여 의사 특징점을 제거하였다. 성능 평가를 위하여 교차수를 이용한 방법과 방향 연결성 추적을 이용하여 추출된 실제 특징점을 비교하였으며, 실험결과 방향 연결성 추적을 이용하여 많은 의사 특징점이 제거되었음을 알 수 있었다.

• 한국컴퓨터정보학회논문지
• /
• 제22권6호
• /
• pp.25-32
• /
• 2017

We are living in networks which are regarded as a society. However, it is difficult to designate a specific position or the impact over sociological relationships and virtual links. In this paper, we conceptualize two themes of the network as Physical Network and Virtual Network, and observe their cross-network effects. New concept called Networked Community (NC) is then introduced to walk through both PN and VN by using the element of connections say connectivity feature. Through modeling NC by the theme of network transposition and egocentric network, we try to comprehend all possible networks for detecting the problems and solutions by using both sides' idea. Experimental results show that we can model real-world problems and then analyze them through NC by measurable and structural manner.

• 한국환경복원기술학회지
• /
• 제5권6호
• /
• pp.14-23
• /
• 2002

Daejeon is a large city in Korea and very high-speedly developing city. Recently urban area is expanding and large forest patch is fragmenting into small habitats because of urban sprawl. The fragmentation of large forest patch decreases the size of habitats and increases the loss of biodiversity in urban area. This study is to analysis the connectivity of green space of Daejeon metropolitan city, and suggest the optimum location of greening site and corridor in order to increase the connectivity of green space of Daejeon metropolitan city. The findings of this study are as follows; (1) The result of this study showed that ${\alpha}$ and ${\gamma}$ index are -0.24 and 0.20. A ${\alpha}$ index is very low and a ${\gamma}$ index is relatively low. (2) The dispersion was very high, for urban forest patches were isolated through fragmentation. Therefore, it needed ecological corridors in order to connect the patches. (3) A urban streams were very important in connectivity of urban green space. Urban riparian corridor must be preserved and restored. (4) A urban green space policy and planning must be prepared to increase the connectivity and assessment of alternatives must be accomplished from perspective of connectivity. The results of this study show the practical implications in perspective of green space planning and policy in Daejeon metropolitan city. The suggestions by findings of this study are to connect green space between large forest patch in urban fringe and island green space in inner city. Also, It is required that urban stream is restored to natural feature for use of corridor by wildlife.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(4)
• /
• pp.359-362
• /
• 2002

In this paper, we propose a new feature-based text watermarking for the binary text image. The structure of specific characters from preprocessed text image are modified to embed watermark. Watermark message are embedded and detected by the following method; Hole line disconnect using the connectivity of the character containing a hole, Center line shift using the hole area and Differential encoding using difference of flippable score points. Experimental results show that the proposed method is robust to rotation and scaling distortion.

• 한국CDE학회논문집
• /
• 제5권2호
• /
• pp.196-205
• /
• 2000

This paper proposes a topology-based algorithm for recognizing the passage features using a concept of multi-face hole loop. The Multi-face hole loop is a concetpual hole loop that is formed over several connected faces. A passage feature is recognized in the proposed approach by two multi-face hole loops that constitute its enterance and exit. The algorithm proposed in this paper checks the connectivity of the two multi-face hole loops to recognize passage features. The total number of passage features in a part is calculated from Euler equation and is compared with the number of found passage features to decide when to terminate. To find all multi-face hole loops in a part, this paper proposes an algorithm for finding all combinations of connected faces. The edge convexity is used to judge the validity of multi-face hole loops. By using the algorithm proposed in this paper, the passage features could be recognized effectively. The approach proposed in this paper is illustrated with several example parts.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제27권4호
• /
• pp.324-341
• /
• 2023

Topological data analysis (TDA) is a data analysis technique, recently developed, that investigates the overall shape of a given dataset. The mapper algorithm is a TDA method that considers the connectivity of the given data and converts the data into a mapper graph. Compared to persistent homology, another popular TDA tool, that mainly focuses on the homological structure of the given data, the mapper algorithm is more of a visualization method that represents the given data as a graph in a lower dimension. As it visualizes the overall data connectivity, it could be used as a prediction method that visualizes the new input points on the mapper graph. The existing mapper packages such as Giotto-TDA, Gudhi and Kepler Mapper provide the descriptive mapper algorithm, that is, the final output of those packages is mainly the mapper graph. In this paper, we develop a simple predictive algorithm. That is, the proposed algorithm identifies the node information within the established mapper graph associated with the new emerging data point. By checking the feature of the detected nodes, such as the anomality of the identified nodes, we can determine the feature of the new input data point. As an example, we employ the fraud credit card transaction data and provide an example that shows how the developed algorithm can be used as a node prediction method.