• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.1
• /
• pp.8-14
• /
• 2003

In this paper, we investigate a rekey mechanism for a secure multicast group communications and relate the mechanism to the loss of information from group key exposal. We also combine cost for the information loss and cost for group key updates and analyze the optimum rekey interval. Using the results of the analysis in this paper, we can manage a secure multicast group efficiently with the minimal cost on the bases of number of group members, each member's security level and withdrawal rates.

• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.532-538
• /
• 2018

This paper proposes an algorithm for signal processing which is used in pulse induction metal mine detectors. The detection power can be obtained from magnetic variation on the search coil. The calibration data should be made when there is no target because the detection power is difference between with and without a target. And it is also updated periodically because of surrounding various noises. Lastly, we keep a watch on the signal slope to identify exact position and signal power of mine detection.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1160-1170
• /
• 2010

Existing multipath routing mechanism has much overhead to maintain the state of nodes on the multipath route and does not guarantees completely disjoint multipath construction from source to destination. In this paper, we propose an Explicit Disjoint Multipath (EDM) routing algorithm to enhance energy efficiency through removing the flooding mechanism for route discovery process, minimizing the number of nodes participating in route update and balancing the traffic load for entire network. EDM constructs logical pipelines which can create disjoint multipaths in logical way. Then it physically performs anchor node based geographic routing along the logical pipeline in order to build multipath to the destination. EDM can provide the distribution effect of traffic load over the network, help to balance the energy consumption and therefore extend the network lifetime.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.19 no.4
• /
• pp.395-404
• /
• 2001

To support the second step of Land Information System building, we are studied about the way of image(included map, document) input, computerization way of cadastral map and the program development which can efficiently carry out the application and update of the constructed digital data. The final object of this study is in raising the efficiency of the cadastral-map computerization, building an accurate DB and its speedy, efficient application. Because the program which was developed in this study is designed to fit the Cadastral Affair Computerization, the integration of the each division's affaires is possible. Because of it, we can raise the specialization of the works and we can reduce time and cost to build Data Share System and cadastral digital data.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2004.12a
• /
• pp.125-131
• /
• 2004

LiDAR 데이터의 필터링은 원 데이터로부터 건물, 수목 등과 같은 비지면점을 제거하는 과정이며, 이러한 필터링을 통해 DEM을 생성할 수 있다. 대표적인 필터링 방법들로는 분산을 이용한 linear prediction 기법, 주변 점들과의 경사관계를 이용한 slope-based 기법, morphology 필터, local maxima 필터 등이 있으며 이러한 기존의 기법들의 단점을 보완하기 위한 연구가 활발히 진행되고 있다. 대부분의 필터링 기법들은 필터의 크기(윈도우의 크기)와 같은 인자를 대상 지역에 적합하게 사용자가 직접 설정해주어야 한다. 더욱이 복잡한 지형, 지물이 존재하는 지역에 적용하기 위해서는 인자를 변형시켜줘야 하며 특히, 다양한 크기의 건물이 존재하는 지역에 대하여 적용하기 위해서는 가변적인 크기의 필터가 필요하다. 이에 본 논문에서는 다양한 크기의 건물이 존재하는 지역에 대하여 필터의 크기를 변화시키지 않고 필터링을 수행할 수 있는 연산기법을 제안하였다. 본 연구에서는 수목이나 자동차 등과 같은 작은 개체의 제거를 위해 고정된 작은 크기의 윈도우를 가지는 모폴로지 필터를 우선 적용한다. 그 후 건물과 같은 큰 개체의 포인트는 이웃 포인트와의 고도차이를 이용하여 인식하고 이웃에 위치하는 지면 포인트로 대체하며, 갱신된 값이 바로 다음 연산에 반영 되도록 한다. 또한 상, 하, 좌, 우 네 방향에 대하여 라인별로 독립된 연산을 수행한 후에 이들을 비교함으로써 오차를 보정한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.7
• /
• pp.1817-1823
• /
• 1998

V.42bis, a type of LZW(Lempel-Ziv-Welch) code, is well-known as theinter national standard is asynchronous data compression. In this paper, we analyze several undesirable phenomena arising from the application of v.42bis to high speed data transmission, and we propose a modified technique to overcome them. the proposed technique determines the proper size of the dictionary, one of important factors affecting the compression ratio, and improves the method of dictionary generation for a higher compression ratio. Furthermore, we analyze the problem of excessive mode changes and solve it to a certain degree by adjusting the threshold for mode change. By doing this, we can achieve smiller variation of the compression ratio in time. This improvement chtributes to easier and better design and control of the buffer in high speed data transmission.

• Spatial Information Research
• /
• v.14 no.2 s.37
• /
• pp.191-209
• /
• 2006

This study is analyzing what necessary law and institution is to solve various problem that is happened in process that execute the first$\sim$second National GIS Master Plan in the meantime at visual point that the second National GIS Master Plan(2001-2005) period is expired. Specially, it is that present what improvement direction of law and institution by each field is. Minimize of obstacle factors far National GIS Master Plan is purposeful during the third National GIS Master Plan period. To achieve study purpose, this study analyzes background of National GIS law and institution, objective, system. It is expected that of this article can contribute to the picture of National GIS law and institution.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.3
• /
• pp.85-93
• /
• 2007

This paper describes a compression scheme for volumetric video data(3D space X 1D time) there each frame of the volume is decompressed and rendered in real-time. Since even one frame size of volume is very large, runtime decompression can be a bottleneck for real-time playback of time-varying volume data. To increase the run-time decompression speed and compression ratio, we decompose the volume into small blocks and only update significantly changing blocks. The results show that our compression scheme compromises decompression speed and image quality well enough for interactive time-varying visualization.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2010.07a
• /
• pp.31-33
• /
• 2010

웹 사용 환경에서의 새로운 웹 환경의 적용은 이전의 정적인 웹 환경에서 동적인 웹 사용 환경으로 움직이고 있다는 것을 의미하며, 새로이 생성된 데이터에 의하여 모든 것이 움직이게 됨을 의미되며, 이에 따라 정적인 웹과 동적인 웹에서 사용되는 웹 페이지의 일반적인 성격을 분석하면 단순한 정적 및 동적 페이지의 성격만을 보여주지 않는다. 이러한 관점에서 새로운 웹 운영 환경은 읽기만 하는 웹부터 메타웹까지의 기본적인 개념을 모두 적용하며, 이 과정에서 가장 중요하게 여겨지는 것이 바로 웹뷰로 새로운 웹 사용 환경을 통하여 만들어진 데이터가 웹 인터페이스를 통하여 사용자에게 결과를 전송하게 되며, 새로운 웹 사용 환경에서는 주변에서의 끊임없는 데이터의 갱신을 통하여 다양한 사용자 요구에 따른 결과를 생성, 전송하게 된다. 그러나 웹은 데이터 모델의 사용과 질의어 정의 등에 대한 서비스를 제공하지 않으며, 데이터베이스의 운용에 대한 개념도 존재하지 않아 처리되는 데이터에 대한 소유권에 대한 주장 등이 명확하지 않다. 이러한 문제점을 해결하기 위하여 본 연구에서는 새로운 웹 사용 환경과 웹 서비스의 관련성을 확인하여 추후의 응용에 대비하고자 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.6A
• /
• pp.488-496
• /
• 2012

In this paper, the scheme for designing optimal beamforming matrix for interference control is proposed. The optimal beamforming matrix is found though linear combination of interference alignment conditions and renewal of linear combination coefficient. The proposed scheme has advantages that the complexity is reduced and there is no multiplying operation in matrix calculations even if proposed scheme has the form similar to that of existing least square based scheme. The simulation results show that proposed scheme has about 4bps/Hz higher gain than existing least square scheme. Also there is no additional multiplying calculation and increase of matrix size when the number of transmit and receive antennas is increased.