• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2002.04a
• /
• pp.567-572
• /
• 2002

The equipment of industrial robot in manufacturing and assembly lines has rapidly increased. In order to achieve high productivity and flexibility, it becomes very important to develop the visual feedback control system with Off-Line Programming System(OLPS ). We can save much efforts and time in adjusting robots to newly defined workcells by using Off-Line Programming System. A proposed visual calibration scheme is based on position-based visual feedback. The visual calibration system is composed of a personal computer, an image processing board, a video monitor, and one camera. The calibration program firstly generates predicted images of objects in an assumed end-effector position. The process to generate predicted images consists of projection to screen-coordinates, visible range test, and construction of simple silhouette figures. Then, camera images acquired are compared with predicted ones for updating position and orientation data. Computation of error is very simple because the scheme is based on perspective projection, which can be also expanded to experimental results. Computation time can be extremely reduced because the proposed method does not require the precise calculation of tree-dimensional object data and image Jacobian.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2001.10a
• /
• pp.140-145
• /
• 2001

The equipment of industrial robot in manufacturing and assembly lines has rapidly increased. In order to achieve high productivity and flexibility, it becomes very important to develop the visual feedback control system with Off-Line Programming System(OLPS). We can save much efforts and time in adjusting robots to newly defined workcells by using Off-Line Programming System. A proposed visual calibration scheme is based on position-based visual feedback. The visual calibration system is composed of a personal computer, an image processing board, a video monitor, and one camera. The calibration program firstly generates predicted images of objects in an assumed end-effector position. The process to generate predicted images consists of projection to screen-coordinates, visible range test, and construction of simple silhouette figures. Then, camera images acquired are compared with predicted ones for updating position and orientation data. Computation of error is very simple because the scheme is based on perspective projection, which can be also expanded to experimental results. Computation time can be extremely reduced because the proposed method does not require the precise calculation of tree-dimensional object data and image Jacobian.

• Journal of the Korean Society of Industry Convergence
• /
• v.17 no.2
• /
• pp.54-60
• /
• 2014

The equipment of SCARA robot in processing and assembly lines has rapidly increased. In order to achieve high productivity and flexibility, it becomes very important to develop the visual feedback control system with Off-Line Programming System(OLPS). We can save much efforts and time in adjusting robots to newly defined workcells by using OLPS. A proposed visual calibration scheme is based on position-based visual feedback. The calibration program firstly generates predicted images of objects in an assumed end-effector position. The process to generate predicted images consists of projection to screen-coordinates, visible range test, and construction of simple silhouette figures. Then, camera images acquired are compared with predicted ones for updating position and orientation data. Computation of error is very simple because the scheme is based on perspective projection, which can be also expanded to experimental results. Computation time can be extremely reduced because the proposed method does not requirethe precise calculation of tree-dimensional object data and image Jacobian.

• Journal of the Korea Computer Industry Society
• /
• v.4 no.4
• /
• pp.443-448
• /
• 2003

Approximate k-nearest neighbor queries are frequently occurred for finding the k nearest neighbors to a given query point in spatial database systems. The number of searched nodes in an index must be minimized in order to increase the performance of approximate k nearest neighbor queries. In this paper. we suggest the technique of approximate k nearest neighbor queries on R-tree family by improving the existing algorithm and evaluate the performance of the proposed method in dynamic spatial database environments. The simulation results show that a proposed method always has a low number of disk access irrespective of object distribution, size of nearest neighbor queries and approximation rates as compared with an existing method.

• Journal of KIISE:Software and Applications
• /
• v.26 no.3
• /
• pp.365-379
• /
• 1999

본 논문에서는 객체지향 데이터베이스의 클래스 계층에 대한 색인기법으로 이차원 색인구조를 이용하여 조율 가능한 이차원 클래스 색인기법인 2D-CHI를 제안한다. 2D-CHI 에서는 색인된 속성의 키값 도메인과 클래스 식별자 도메인으로 구성된 이차원 도메인상의 색인엔트리들에 대한 클러스터링 문제를 다룬다. 클러스터링 특성이 하나의 속성에 의해서 독점되는 B+-Tree 와 같은 일차원 색인구조를 이용하는 기존의 클래스 색인기법들은 특정 형태의 질의에 대해서만 적합한 색인기법들로서 다양한 형태의 질의들로 구성된 질의 패턴에 대해서 적절하게 대응하지 못한다. 2D-CHI에서는 질의 피턴에 따라 키값 도메인과 클래스 식별자 도메인 사이에서 색이 엔트리들의 클러스터링 정도를 조정함으로써 질의처리의 성능을 향상시킨다. 2D-CHI 의 성능평가를 위하여, 먼저 데이터의 균일 분포를 가정으로 비용 모델을 정립하여 기존의 색인기법들과 색인의 성능을 비교한다. 그리고, 계층 그리드 파일을 이용하여 구현한 2D-CHI의 실험으로 비용 모델을 검증하며, 다양한 실험을 통하여 데이터의 분포와 주어진 질의 형태에 따라 최적의 이차원 클래스 계층 색인구조를 구성할 수 있음을 보인다.

• Korean Journal of Environment and Ecology
• /
• v.8 no.1
• /
• pp.58-67
• /
• 1994

Object of this study is to suggest the plan for natural vegetation restoration and management by ecological approach. The concept of biotope planting technique was introduced in order to restore the natural vegetation in the northern part of Mt. Nam in Seoul, and Quercus mongolica forests was surveyed so as to obtain the basic data. This study focused on the vegetational context between northern part of Mt. Nam and develop-reserved site. The results are following ; 1. It is suitable to plant 25~30 trees in $100\m^2$ with trees of DBH 10cm and below at intervals of about 2m in canopy layer. In the case of subtree layer of DBH 2cm, about 30 trees were planted at an Intervals of 1.5~2m around in $100\m^2$. 2. In the last step of nature vegetation restoration, it is desiable that canopy density is $5/100\m^2$ and 녀btree one is 10~20/$100\m^2$. 3. Management plans was proposed to use the native species of Mt. Nam around and to investigate the ecological situation once a year such as species introduce, dead-tree, soil, fauna etc.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.9-17
• /
• 2006

Moving objects database systems manage a set of moving objects which changes its locations and directions continuously. The traditional spatial indexing scheme is not suitable for the moving objects because it aimed to manage static spatial data. Because the location of moving object changes continuously, there is problem that expense that the existent spatial index structure reconstructs index dynamically is overladen. In this paper, we analyzed the insertion/deletion costs for processing the movement of objects. The results of our extensive experiments show that the Dynamic Hashing Index outperforms the original R-tree and the fixed grid typically by a big margin.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1198-1206
• /
• 1996

This paper proposes the functionality of communication network management which operates in central control station of satellite communication network, which will be constructed to DAMA-SCPC ground station using KORE ASAT. And communication network configuration components are classified with hierarchical structure in order to efficiently maintain communication network operation management, and configuration components that are classified into graphic objects and this graphic objects are visualized with tree structure which can be handled uniformally and efficiently. In addition to that, this paper proposes expression method of graphic object to implement our real time communication network management system, and the real time communication net-work management composed as client-server system. The performance of the proposed algorithm is analyzed through the computer simulation.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.5
• /
• pp.1027-1036
• /
• 1996

X.500 Directory is an application level protocol in the Open Systems Interconnection(OSI) 7 layer's reference model adopted by the international Standards Organization (ISO). It manages effectively needed information for the communication service, and is a service to support the functions that the user can approach conveniently. Tourist information is distribution on several locations. The access of distributed information is similar to X.500 directory service. Therefore, we design of Tourist Information System(TIS) and directory schema using X.500 directory services. To define tourist information, we also propose Directory Information Tree(DIT) of locality architecture and several new object classes, such as museum, mountain, sea, hotel, etc.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.7
• /
• pp.1671-1679
• /
• 1998

Temporal databases support an efficient hist0rical representation and operation for an object in the real world. Especiallv, temporal aggregates generate In additional by information by means of computations from objects that is valid at past as well as current time. It is one of important areas to serve to users as various type of aggregates as possible so that they enhance the overall system performance and efficiency. In this paper, we not only introduce temporal aggregate tree strategy as an efficient processing technique for given temporal aggregate query, but also analyze the ovemll processing cost and then evaluate its perfomlance.