• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.3
• /
• pp.15-26
• /
• 2012

Recently, due to applicability increase of vector data based digital map for geographic information and evolution of geographic measurement techniques, large volumed GIS(geographic information service) services having high resolution and large volumed data are flowing actively. This paper proposed an efficient vector map compression technique using the SEC(spatial energy compaction) based on classified bins for the vector map having 1cm detail and hugh range. We encoded polygon and polyline that are the main objects to express geographic information in the vector map. First, we classified 3 types of bins and allocated the number of bits for each bin using adjacencies among the objects. and then about each classified bin, energy compaction and or pre-defined VLC(variable length coding) were performed according to characteristics of classified bins. Finally, for same target map, while a vector simplification algorithm had about 13%, compression ratio in 1m resolution we confirmed our method having more than 80% encoding efficiencies about original vector map in the 1cm resolution. Also it has not only higher compression ratio but also faster computing speed than present SEC based compression algorithm through experimental results. Moreover, our algorithm presented much more high performances about accuracy and computing power than vector approximation algorithm on same data volume sizes.

• Journal of Korea Multimedia Society
• /
• v.14 no.2
• /
• pp.210-218
• /
• 2011

Generally, GIS digital map has been represented and transmitted by ASCII and Binary data forms. Among these forms, Binary form has been widely used in many GIS application fields for the transmission of mass map data. In this paper, we present a hierarchical compression technique of polyline and polygon components for effective storage and transmission of vector map with various degree of decision. These components are core geometric components that represent main layers in vector map. The proposed technique performs firstly the energy compaction of all polyline and polygon components in spatial domain for the lossless compression of detailed vector map and compress independently integer parts and fraction parts of 64bit floating points. From experimental results, we confirmed that the proposed technique has superior compressive performance to the conventional data compression of 7z, zip, rar and gz.

• Journal of Korea Multimedia Society
• /
• v.16 no.4
• /
• pp.418-429
• /
• 2013

This paper presents a GIS vector map data compression scheme based on hybrid polyline simplification method and SEC(spatial energy compaction). The proposed method extracts all layers which contain polylines in the GIS vector map and compress all polylines in extracted layers by the hybrid polyline simplification and SEC based on MAE(minimum area error) for each segment in the line. The proposed simplification and SEC increase the compression ratio while preserving the shape quality. We analyze the visual aspects and compression efficiency between the original GIS vector map and the compressed map. From experimental results, we verify that our method has the higher compression efficiency and visual quality than conventional methods.

• 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.

• Journal of Broadcast Engineering
• /
• v.27 no.1
• /
• pp.56-68
• /
• 2022

In this paper, we propose a compression method for multi-resolution feature maps for VCM. The proposed compression method removes the redundancy between the channels and resolution levels of the multi-resolution feature map through PCA-based transformation. According to each characteristic, the basis vectors and mean vector used for transformation, and the transformation coefficient obtained through the transformation are compressed using a VVC-based coder and DeepCABAC. In order to evaluate performance of the proposed method, the object detection performance was measured for the OpenImageV6 and COCO 2017 validation set, and the BD-rate of MPEG-VCM anchor and feature map compression anchor proposed in this paper was compared using bpp and mAP. As a result of the experiment, the proposed method shows a 25.71% BD-rate performance improvement compared to feature map compression anchor in OpenImageV6. Furthermore, for large objects of the COCO 2017 validation set, the BD-rate performance is improved by up to 43.72% compared to the MPEG-VCM anchor.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.3
• /
• pp.184-193
• /
• 2010

This paper proposes a biological iridescence BRDF(Bidirectional Reflectance Distribution Function) compression and rendering method. In the graphics technology, iridescence sometimes is named structure colors. The main features of these symptoms are shown transform of color and brightness by varying viewpoint. Graphics technology to render this is the BRDF technology. The BRDF methods enable realistic representation of varying view direction, but it requires a lot of computing power because of large data. In this paper, we obtain reflection map from iridescence BRDF, analyze color of reflection map and propose representation method by several colorfully concentric circle. The one concentric circle represents beam width of reflection ray by one normal vector. In this paper, we synthesize rough concentric by using several virtually optical normal vectors. And we obtain spectrum information from concentric circles passing through the center point. The proposed method enables IBR(image based rendering) technique which results is realistic illuminance and spectrum distribution by one texture from reduced BRDF data within spectrum.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.12
• /
• pp.91-97
• /
• 2013

Image and it's processing techniques are widely applied and very important in the recent IT environment. In this paper, we try to reconstruct original BMP(Bitmap) image into indexed image and codebook utilizing vector quantization and represent high quality image only with same pixel depth of previous indexed image like JPEG etc. That is, By adopting common map method onto index image with $2^n$ color codebook, image can be represented as high quality as $2^{n+1}$ color codebook. When proposed output image is compared with original BMP image, it provides as much around 2dB as higher PSNR than conventional 8 bit index image(normal JPEG). Furthermore, this improvement(2 dB higher PSNR) could be provided when using the 9 bit indexed image.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.10
• /
• pp.2615-2628
• /
• 1997

In this paper, a new codebook design algorithm is proposed. It uses a DCT map based on two-dimensional discrete cosine of transform (2D DCT) and finite state vector quantizer (FSVQ) when the vector quantizer is designed for image transmission. We make the map by dividing input image according to edge quantity, then by the map, the significant features of training image are extracted by using the 2D DCT. A master codebook of FSVQ is generated by partitioning the training set using binary tree based on tree-structure. The state codebook is constructed from the master codebook, and then the index of input image is searched at not master codebook but state codebook. And, because the coding of index is important part for high speed digital transmission, it converts fixed length codes to variable length codes in terms of entropy coding rule. The huffman coding assigns transmission codes to codes of codebook. This paper proposes single-side growing huffman tree to speed up huffman code generation process of huffman tree. Compared with the pairwise nearest neighbor (PNN) and classified VQ (CVQ) algorithm, about Einstein and Bridge image, the new algorithm shows better picture quality with 2.04 dB and 2.48 dB differences as to PNN, 1.75 dB and 0.99 dB differences as to CVQ respectively.

• Journal of Korea Multimedia Society
• /
• v.10 no.8
• /
• pp.997-1003
• /
• 2007

H.264/AVC enhances inter-frame coding performance adopting new intra and inter mode prediction in inter-frame motion prediction. H.264 encoder provides performance superior to existing standards with the prediction modes. Instead of enhanced performance, however, both predictions increase complexity of encoder and demand a lot of coding time. This paper proposes a method using local statistics of resultant intra mode, my and mode map to predict inter mode. There are relationship between intra and inter mode, and we can predict inter mode using neighboring macroblocks' resultant mode and motion vector according to the contents of frame. The experimental results show that the proposed algorithm reduces encoding time by 31% on average with a negligible loss of PSNR and bitrate.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.6
• /
• pp.1419-1427
• /
• 2007

In this paper, we propose an algorithm which implements a multi-sided side match finite-state vector quantization(MSMVQ). After extracting the edge information from an image and classifying the image into edge blocks or non-edge blocks, we construct an edge map. We subdivide edge blocks into sixteen classes using discrete cosine transform(DCT) AC coefficients. Based on edge map information, a state codebook is made from the master codebook, and side match calculation is done for two-sided or three-sided current block of image. For reducing transmitted bits, a decision is made whether or not to encode the non-edge blocks among the pre-coded blocks by using the master codebook. Also for reducing allocation bits of codeword indices to decoder, a variable length coder is used. Considering the comparison with side match finite-state vector quantization(SMVQ) and two-sided SMVQ(TSMVQ) algorithm about Zelda, Lenna, Bridge and Peppers image, the new algorithm shows better picture quality than SMVQ and TSMVQ respectively.