• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.01a
• /
• pp.69-72
• /
• 2011

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

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.12
• /
• pp.725-733
• /
• 2018

With urbanization projects involving trunk roads progressing, many simple interchanges, which separate passing traffic into the main traffic and access subtraffic, are being constructed to maximize the traffic capacity. Under the current Road Connection Rule, the access-prohibited section in an interchange is determined based on the access lane and limit distance in the complete interchange road, but separate criteria for the simple interchange are not defined. This may cause confusion in the Road Management Office's determination of the access-prohibited section in the simple interchange, or lead to the application of the criteria for the access-prohibited section in the complete interchange without considering the features of such interchange. This study conducted a comparative analysis of the domestic and overseas systems related to the installation of access section in trunk roads, such as general national roads. This paper presents a survey of the methods for applying the access-prohibited section in the interchange along with the actual cases and proposes improvement measures for a rational calculation of the access prohibited installation section in the simple interchange to minimize the downsides associated with the application of the extremely strict criteria. The proposed road connection rule improvement measures based on the consideration of the purpose of installing the simple interchange and on the consideration the features of the simple interchange are expected to prevent administration confusion by the field road management offices as well as the waste of unnecessary efforts and costs by petitioners so they can boost the service satisfaction for people and the administrative reliability.

• Korean Journal of Cognitive Science
• /
• v.10 no.1
• /
• pp.25-43
• /
• 1999

The focus of this study is on the elements of structure design that facilitate u user interaction with applications within cyberspace Structure design entails decisions regarding the optimal classification and hierarchical organization of information into s successively higher units. i.e .. the grouping of highly related information in the form of nodes of a site and the subsequent connection of nodes that are inter-related. The decisions are based on the designer's subjective classification framework. which is not always compatible with that of the user. We propose that the ensuing cognitive dissonance can be reduced via the employment of multiple hierarchies and cross-referencing links. Multiple hierarchies represent a single information space in terms of a number of single hierarchies. each of which represent a different perspective Cross-referencing refers to the inter-connection between the constituent hierarchies by providing a link to the alternate hierarchy for information that is most likely to be categorized in diverse manners by users with differing perspectives. In this study we conducted two empirical studies to gauge the effectiveness of multiple hierarchies and Cross-referencing links in the domain of cyber shopping malls. In the first phase. an experiment was conducted to determine how subjects classified given products with respect to two different perspectives for categorization. Experimental cyber malls were developed based on the results from the first phase to test the effectiveness of multiple hierarchies and cross-referencing links. Results show that the ease of navigation was higher for cyber malls that had implemented cross-referencing links are of greater value when used in conjunction with single hierarchical designs rather than multiple hierarchies. Users satisfaction with and ease of navigation was higher for cyber malls that had not implemented multiple hierarchies. This paper concludes with discussion of these results and their implications for designers of cyber malls.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.3
• /
• pp.208-217
• /
• 2006

This paper presents a cloth simulation technique that implements plastic deformation. Plasticity is the property that material does not restore completely to the original state once deformed, in contrast to elasticity. We model cloth using a particle model, and posit two kinds of connections between particles, i.e. the sequential connections between immediate neighbors, and the interlaced connections between every other neighbors. The sequential connections represent the compression and tension of cloth, and the interlaced connections the bending in cloth. The sequential connections are modeled by elastic springs, and the interlaced connections by elastic or plastic spring depending on the amount of the current deformation of the connections. Our model is obtained by adding plastic springs to the existing elastic particle model of cloth. Using the new model, we have been able to simulate bending wrinkles, permanently deformed wrinkles, and small wrinkles widely distributed over cloth. When constructing elastic and plastic spring models for sequential and interlaced connections, we took pain to prevent the stiffness matrix of the whole cloth system from being indefinite, in order to help achieve physical stability of the cloth motion equation and to improve the effectiveness of the numerical method.

• The Journal of the Korea Contents Association
• /
• v.7 no.7
• /
• pp.1-10
• /
• 2007

In this paper, we propose an indexing method for efficiently updating current positions of moving objects on road networks. The existing road network models increase update costs when objects move to adjacent road segments because their connectivity is not preserved. We propose an intersection based network model and a new index structure to solve this problem. The proposed intersection based network model preserves network connectivity through splitting road networks to contain intersection nodes always. The proposed index structure In our experiments, we show that our method is about 3 times faster than an existing index structure in terms of update costs.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.8
• /
• pp.95-101
• /
• 2011

In this paper, using pixel connectivity tracking feature to remove a doctor has been studied. Feature extraction method is a method using the crossing. However, by crossing a lot of feature extraction method sis a doctor. Extracted using the method of crossing the wrong feature to remove them from the downside and the eight pixels around the fork to trace if it satisfies the conditions in the actual feature extraction and feature conditions are not satisfied because the doctor was removed. To evaluate the performance using crossing methods and extracted using pixel connectivity trace was compared to the actual feature, the experimental results using pixel connectivity trace arcuate sentence, croissants sentence, sentence the defrost feature on your doctor about47%, respectively, 40%, 30%were found to remove.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.126-130
• /
• 2008

Mobile IP는 단말에게 이동성을 제공해 줌으로써 이동하면서도 인터넷에 접속할 수 있게 해준다. 하지만 L2 연결과 L3 연결이 순차적으로 진행되어 핸드오버시 지연과 데이터 로스의 문제가 발생한다. 이러한 핸드오버 과정에서 발생하는 지연과 데이터 로스를 줄이기 위해 L2 트리거를 이용한 Fast Handover 기술이 개발되었지만 Fast Handover 기술 역시 L2 연결과 L3 연결이 독립적으로 진행된다. 본 논문에서는 Mobile IP의 L3 핸드오버 과정과 이기종 네트워크들의 L2 핸드오버 과정을 통합하고 핸드오버 과정을 최적화하여 성능 개선된 핸드오버 방안을 제안하고 성능평가를 통해 우수함을 보인다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.6
• /
• pp.10-15
• /
• 2008

In this paper, a new NMOS gate cross-connected current-mirror type bridge rectifier for UHF RFID applications is presented. The DC converting characteristics of the proposed rectifier are analyzed with the high frequency equivalent circuit and the gate capacitance reduction technique for reducing the gate leakage current due to the increasing of operating frequency is also proposed theoretically by circuitry method. As the results, the proposed rectifier shows nearly same DC output voltages as the existing NMOS gate cross-connected rectifier, but it shows the gate leakage current reduced to less than 1/4 and the power consumption reduced more than 30% at the load resistor, and it shows more stable DC supply voltages for the valiance of load resistance. In addition, the proposed rectifier shows high enough and well-rectified DC voltages for the frequency range of 13.56MHz HF(for ISO 18000-3), 915MHz UHF(for ISO 18000-6), and 2.45 GHz microwave(for ISO 18000-4). Therefore, the proposed rectifier can be used as a general purpose one to drive RFID transponder chips on various RFID systems which use specified frequencies.

• The Journal of Korean Association of Computer Education
• /
• v.6 no.4
• /
• pp.61-69
• /
• 2003

RG(Railway Graph), which is a connected graph structure with the concepts of internal and external edges, is a data structure for representing railway assignments in a track network. In RG, it is possible to represent railway connectivities considering it's forward direction which is impossible in a digraph representation. But with RC, we can not still represent an othogonoal railway crossing in a track network. In this paper, we extend RG using the concept of dummy edge. Using ERG(Extended Railway Graph), we describe a method to consistently represent track network including othogonoal railway crossings, data structure for our ERG, and path allocation algorithm in ERG.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.11a
• /
• pp.397-400
• /
• 2006

본 논문에서는 위치기반 서비스에서 도로 네트워크 상을 움직이는 객체들의 현재 위치를 효율적으로 갱신하는 색인기법을 제안한다. 효율적인 시공간 질의 처리를 위하여 도로를 적절하게 분할하여 색인하게 된다. 기존의 도로 분할 방식은 연결정보를 포함하지 않기 때문에 객체가 현재의 도로 영역을 벗어났을 때 색인구조를 처음부터 검색해야 하는 단점이 있다. 제안하는 기법은 도로를 분할할 때 교차점을 포함하도록 분할하여 연결 정보가 유지되도록 한다. 이로 인해 제안하는 알고리즘은 객체가 색인된 현재의 도로 영역을 벗어났을 때 연결 정보와 NN(Nearest Neighbor) 검색 기법을 이용하여 벗어난 도로를 바로 찾아갈 수 있으므로 향상된 갱신 성능을 보인다.