• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.673-676
• /
• 1998

Future land remote sensing satellite systems will kikely be constrained in terms of communication band-width. To alleviate this limitation, the data must be compressed. Image data obtained from satellite exhibit a high degree of spatial and spectral correlations that must be properly exploited. In this paper we propose multispectral image data compression using wavelet transform and selective predicted vector quantization. Th eproposed method is based on accuratly predicting other band from reference band and reducing bit rate through threshold map. we can achieve better compression effeciency than conventional methods.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.24 no.5
• /
• pp.379-387
• /
• 2006

The real world is spatially modelled conceptually either as discrete objects or earth surface. The generated data models are then usually represented as vector and raster respectively. Although there are limited cases where only one data model is sufficient to solve the spatial problem at hand, it is now generally accepted that GIS should be able to handle various types of data model. Recent advances in spatial technology introduced even more variety of heterogeneous data models and the need is ever growing to handle and manage efficiently these large variety of spatial data. The OGC (Open GIS Consortium), an international organization pursuing standardization in the geospatial industry. recently introduced the GMLJP2 (Geographic Mark-Up Language JP2) format which enables store and handle heterogeneous spatial data. The GMLJP2 format, which is based on the JP2 format which is an abbreviation for JPEG2000 wavelet image compression format, takes advantage of the versatility of the GML capabilities to add extra data on top of the compressed image. This study takes a close look into the GMLJP2 format to analyse and exploit its potential to handle and mange hetergeneous spatial data. Aerial image, digital map and LIDAR data were successfully transformed end archived into a single GMLJP2 file. A simple viewing program was made to view the heterogeneous spatial data from this single file.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.11
• /
• pp.1645-1654
• /
• 1993

Unlike a noise removal recursive temporal filter, this paper presents a temporal filter which improves visual quality and data compression efficiency. In general, for the temporal band-limitation, temporal aliasing should be considered. Since most of a video signal has temporally aliased components, it is desirable to consider them. From a signal processing point of view, it is impossible to realize the filtering not afeced by the aliasings. However, in this paper, efficient filtering with de-aliasing characteristics is proposed. Considering the location of a video signal, temporal filtering can be accomplished by the spatial filtering along the motion vector trajectory (Motion Adaptive Spatial Filter). This filtered result dose not include the aliasings. Besides the efficient band-limitation, temporal noise is also reduced. For the evaluation of the MASF, its realization and filtering characteristics will be discussed in ditail.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.1
• /
• pp.38-43
• /
• 2004

We designed and implemented a medical image query system, including a relational database and DBMS (database management system), which can visualize image data and can achieve spatial, attribute, and mixed queries. Image data used in querying can be visualized in slice, MPR(multi-planner reformat), volume rendering, and overlapping on the query system. To reduce spatial cost and processing time in the system. brain images are spatially clustered, by an adaptive Hilbert curve filling, encoded, and stored to its database without loss for spatial query. Because the query is often applied to small image regions of interest(ROI's), the technique provides higher compression rate and less processing time in the cases.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.28 no.12
• /
• pp.1608-1615
• /
• 2004

CFD data compression methods based on Full-3D and Quasi-1D supercompact multiwavelets are presented. Supercompact wavelets method provide advantageous benefit that it allows higher order accurate representation with compact support. Therefore it avoids unnecessary interaction with remotely located data across singularities such as shock. Full-3D wavelets entails appropriate cross-derivative scaling function & wavelets, hence it can allow highly accurate multi-spatial data representation. Quasi-1D method adopt 1D multiresolution by alternating the directions rather than solving huge transformation matrix in Full-3D method. Hence efficient and relatively handy data processing can be conducted. Several numerical tests show swift data processing as well as high data compression ratio for CFD simulation data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3C
• /
• pp.387-397
• /
• 2004

The wavelet transform providing both of the frequency and spatial information of an image is proved to be very much effective for the compression of images, and recently lot of studies on coding algorithms for images decomposed by the wavelet transform together with the multi-resolution theory are going on. This paper proposes a quadtree decomposition method of image compression applied to the images decomposed by wavelet transform by using the correlations between pixels and '0'data grouping. Since the coefficients obtained by the wavelet transform have high correlations between scales and high concentrations, the quadtree method can reduce the data quantity effectively. the experimental infrared image with 256${\times}$256 size and 8〔bit〕, was used to compare the performances of the existing and the proposed compression methods.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• pp.766-768
• /
• 2003

Selectivity estimation for spatial query is curial in Spatial Database Management Systems(SDBMS). Many works have been performed to estimate accurate selectivity. Although they deal with some problems such as false-count, multi-count arising from properties of spatial dataset, they can not get such effects in little memory space.* Therefore, we need to compress spatial dataset into little memory. In this paper, we propose a new technique called MW Histogram which is able to compress summary data and get reasonable results. Our method is based on two techniques:(a)MinSkew partitioning algorithm which deal with skewed spatial datasets. efficiently (b) Wavelet transformation which compression effect is proven. We evaluate our method via real datasets. The experimental result shows that the MW Histogram has the ability of providing estimates with low relative error and retaining the similar estimates even if memory space is small.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.204-207
• /
• 2002

The current paper proposes a new multispectral image data compression algorithm that can efficiently reduce spatial and spectral redundancies by applying classified prediction, a Karhunen-Loeve transform (KLT), and the three-dimensional set partitioning in hierarchical trees (3-D SPIHT) algorithm In the wavelet transform (WT) domain. The classification is performed in the WT domain to exploit the interband classified dependency, while the resulting class information is used for the interband prediction. The residual image data on the prediction errors between the original image data and the predicted image data is decorrelated by a KLT. Finally, the 3D-SPIHT algorithm is used to encode the transformed coefficients listed in a descending order spatially and spectrally as a result of the WT and KLT. Simulation results showed that the reconstructed images after using the proposed algorithm exhibited a better quality and higher compression ratio than those using conventional algorithms.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.429-438
• /
• 2012

This study presents two reversible data hiding schemes based on the coefficient shifting (CS) algorithm. The first scheme uses the CS algorithm with a mean predictor in the spatial domain to provide a large payload while minimizing distortion. To guard against manipulations, the second scheme uses a robust version of the CS algorithm with feature embedding implemented in the integer wavelet transform domain. Simulations demonstrate that both the payload and peak signal-to-noise ratio generated by the CS algorithm with a mean predictor are better than those generated by existing techniques. In addition, the marked images generated by the variant of the CS algorithm are robust to various manipulations created by JPEG2000 compression, JPEG compression, noise additions, (edge) sharpening, low-pass filtering, bit truncation, brightness, contrast, (color) quantization, winding, zigzag and poster edge distortion, and inversion.

• Spatial Information Research
• /
• v.14 no.4 s.39
• /
• pp.379-389
• /
• 2006

Map databases for CNS (Car Navigation System) can be accessed quickly and compressed efficiently due to that these are usually recorded as in a PSF (Physical Storage Format). However, it is difficult to create and manage data storage based on a file-system. To solve these problems, DBMS needs to be combined with spatial data management. Therefore, we developed an embedded DBMS with which to store data and conduct quick searches in CNS. Spatial data could be easily managed and accessed using the compression method, Multi-Link, spatial index, and spatial division. In the result, the proposed embedded DBMS searched quickly and stably supported data management. If synchronization is applied in DBMS, it is expected to utilize the advantages of an embedded DBMS.