• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1253-1258
• /
• 2006

In the mobile vector map service environments, there are problems like as terminal resource shortage and transmission delay for the characteristics of large spatial data. For the normal mobile vector map services, some techniques are required to overcome the problems. Spatial data compression approach is one of the techniques to reduce the bandwidth and the waiting time at clients. However it also must be considered that the effect on total efficiency caused by the overhead of compression and restoration time. This thesis proposes two spatial data compression techniques. First approach is to get relative coordinates to first coordinate of each object. The other approach is to compute client coordinates before transmission. Through the implementation and experiments, proposed techniques are evaluated the compression effects and efficiency.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.358-362
• /
• 2004

According to the rapid advance of computer and communication techniques, the request of mobile internet services is highly increasing. However, the main obstacles for mobile vector map service environments, are large data volume and narrow wireless bandwidth. Among the many possible solutions, spatial data compression technique may contribute to reduce the load of bandwidth and client response time. This thesis proposes two methods for spatial data compression. The one is relative coordinates transformation method, and the other is client coordinates transformation method. And, this thesis also proposes the system architecture for experiments. The two compression methods could be evaluated the compression effect and the response time.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.1
• /
• pp.41-47
• /
• 2002

Fractal image compression can reduce the size of image data by the contractive mapping that is affine transformation to find the block(called as range block) which is the most similar to the original image. Even though fractal image compression is regarded as an efficient way to reduce the data size, it has high distortion rate and requires long encoding time. In this paper, we presented a hybrid fractal image compression system with the modified SOFM Vector Quantizer which uses improved competitive learning method. The simulation results showed that the VQ hybrid fractal using improved competitive loaming SOFM has better distortion rate than the VQ hybrid fractal using normal SOFM.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.107-116
• /
• 2011

Due to development of environment of wireless Internet, location based services on the basis of spatial data have been increased such as real time traffic information as well as CNS(Car Navigation System) to provide mobile user with route guidance to the destination. However, the current application adopting the file-based system has limitation of managing and storing the huge amount of spatial data. In order to supplement this challenge, research which is capable of managing large amounts of spatial data based on embedded database system is surely demanded. For this reason, this study aims to suggest the lossless compression technique by using the hybrid approach of BytePacking and Lempel-Ziv which can be applicable in DBMS so as to save a mass spatial data efficiently. We apply the proposed compression technique to actual the Seoul and Inchcon metropolitan area and compared the existing method with suggested one using the same data through analyzing the query processing duration until the reconstruction. As a result of comparison, we have come to the conclusion that suggested technique is far more performance on spatial data demanding high location accuracy than the previous techniques.

• The KIPS Transactions:PartB
• /
• v.12B no.2 s.98
• /
• pp.131-136
• /
• 2005

Motion Estimation (ME) has been developed to remove redundant data contained in a sequence of image. And ME is an important part of video encoding systems, since it can significantly affect the qualify of an encoded sequences. Generally, ME consists of two stages, the integer pixel motion estimation and the half pixel motion estimation. Many methods have been developed to reduce the computational complexity at the integer pixel motion estimation. However, the studies are needed at the half pixel motion estimation to reduce the complexity. In this paper, a method based on the correlations between integer pixel motion vectors and half pixel motion vectors is proposed for the half pixel motion estimation. The proposed method has less computational complexity than the full half pixel search method (FHSM) that needs the bilinear interpolation of half pixels and examines nine half pixel points to the find the half pixel motion vector. Experimental results show that the speedup improvement of the proposed method over FHSM can be up to $2.5\~80$ times faster and the image quality degradation is about to $0.07\~0.69(dB)$.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.3 s.15
• /
• pp.45-53
• /
• 2005

Nowadays, using the mobile communication devices, such as a mobile phone, PDA, telematics device, and so forth, are increasing. The large parts of the services with these mobile devices are the position tracking and the route planning. For offering these services, it is increasing the use of the spatial data on the mobile environment. Although the storage of mobile device expands more than before, it still lacks the necessary storage on the spatial data. In this paper, lossy compression technique on the spatial data is suggested, and then it is analyzed the compression ratio and the amount of loss data by the test. Suggested compression technique on the spatial data at this paper is applied to the real-data, and others methods, suggested at the previous studies, is applied to same data. According as the results from both are compared and analyzed, compression technique suggested at this study shows better performance when the compression result is demanded the high position accuracy.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.5
• /
• pp.88-98
• /
• 2011

Recently, according as the importance of GIS(geography information system) database security is embossed, much researches had been achieved about GIS network security. But most such researches are weak against sourceful illegal reproductions and distributions of GIS vector data map. In this paper, we proposed an efficient layer unit contents based partial encryption technique in the vector map compression domain to prevent illegal distributions and unauthorized accesses. This method achieves a partial encryption about each central coordinate and directional parameters of a MCA(minimum coding attribute) that is created at the vector map compression processing in the vector space. First, the position encryption is applied as permutating randomly the center coordinate of each record that is minimum unit of vector map shape. And second, the direction encryption that changing shapes of vector map topography is applied as encrypting the direction of vertices's coordinates of each record. In experimental results, we confirmed that our proposed method can encipher the large volumed vector map data effectively in low computational complexity. Also, we could minimize the decline of compression efficiency that occurred by conventional contents based encryption schemes using AES or DES algorithms.

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

최근 이동전화, PDA, 텔레매틱스 단말기 등과 같은 모바일 기기에서 공간데이터에 대한 사용이 증가하고 있다. 하지만 모바일 기기의 저장 공간이 늘어났음에도 불구하고 여전히 공간데이터에 대한 요구를 수용하기에는 한계가 있다. 따라서 본 연구에서는 모바일 환경에서 사용 가능한 공간데이터에 대한 손실 압축 기법을 제시하고, 실험을 통한 압축률, 데이터 손실률을 분석하여 연구의 타당성과 적용 가능성을 제시하고자 한다. 세부적으로 압축률과 데이터 손실에 따르는 위치 정확도 관계에서 위치정확도를 높일 수 있는 방향을 모색하여 보았다. 그리고 다양한 군집화 기법 중 연구에 적용 가능한 기법을 선정 이용하였다. 또한 저장 공간뿐만 아닌 연산 성능 측면에서도 열악한 모바일 환경에서 만족할 만한 복원 성능을 보여야 한다. 따라서 압축된 데이터를 복원하는데 소요되는 비용을 최소화할 수 있는 방향이 연구되었다.

• The Journal of the Korea Contents Association
• /
• v.6 no.2
• /
• pp.65-74
• /
• 2006

The MPEG-2 video compressed bitstream is very sensitive to transmission errors due to the complex coding structure of the MPEG-2 video coding standard. If one packet is lost or received with errors, not only the current frame will be corrupted, but also errors will propagate to succeeding frames within a group of pictures. Therefore, we employ various error resilient coding/decoding techniques to protect and reduce the transmission error effects. Error concealment technique is one of them. Error concealment technique exploits spatial and temporal redundancies of the correctly received video data to conceal the corrupted video data. Motion vector recovery and compensation with the estimated motion vector is good approach to conceal the corrupted data. In this paper, we propose various error concealment algorithms based on motion vector recovery, and compare their performance to those of conventional error concealment methods.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1995.06a
• /
• pp.175-178
• /
• 1995

기존이 연속 출력 분포형 HMM은 시계열의 과도적 변화에 대하여 표현 능력이 부족하다는 단점이 있다. 이것을 보완하기 위해 본 논문에서는 음성의 동적 변화를 반영하기 위한 특징 파라메타로서 여러 개의 프레임을 결합하여 세그멘트를 구성하여 각각에 대해 한 개의 벡터를 만들었다. 이것을 그대로 이용하면 세그멘트의 프레임수에 대응하는 파라메타의 차원수가 증가하기 때문에 학습 데이터가 불충분한 경우 모델의 파라메타를 잘 추정할 수 없으므로 K-L 전개로서 파라메타의 차원을 압축하여 파라메타수를 감소시켰다. 인식실험은 한국어 단음절에 대하여 멜켑스트럼ㅇ르 K-L 전개로 압축한 벡터를 이용한 결과와 멜켑스트럼, 멜켑스트럼 선형회귀계수를 파라메타로 이용한 경우를 비교하였다. 실험결과 K-L 전개로 압축한 벡터만을 이용한 경우는 멜켑스트럼 + 선형회귀계수를 파라메타로 이용한 경우보다 인식율이 낮앗으나 멜켑스트럼 + K-L 전개로 압축한 경우와 거의 동등한 결과를 얻을 수 있었다.