• Journal of Korea Spatial Information System Society
• /
• v.11 no.4
• /
• pp.65-73
• /
• 2009

With the rapid development of computer, information and communication technologies, the production and distribution of digital contents among various kinds of networks have become more common. In such environment, we need to store and to manage efficiently a large volume of geograpruc data because the amount of geographic data grows faster and faster. In this paper, as a key solution to manage efficiently such a huge amount of geograpruc data, we adopt the mechanism which compresses only the difference between original and updated data with high compression ratio. By transferring highly compressed updated part only instead of the entire of geographic data, we can reduce the network traffic during the download of contents and service.

• Journal of Broadcast Engineering
• /
• v.26 no.5
• /
• pp.553-565
• /
• 2021

Point cloud is a set of points for representing a 3D object, and consists of geometric information, which is 3D coordinate information, and attribute information, which is information representing color, reflectance, and the like. In this way of expressing, it has a vast amount of data compared to 2D images. Therefore, a process of compressing the point cloud data in order to transmit the point cloud data or use it in various fields is required. Unlike color information corresponding to all 2D geometric information constituting a 2D image, a point cloud represents a point cloud including attribute information such as color in only a part of the 3D space. Therefore, separate processing of geometric information is also required. Based on these characteristics of point clouds, MPEG under ISO/IEC standardizes V-PCC, which imitates point cloud images and compresses them into 2D DCT-based 2D image compression codecs, as a compression method for high-density point cloud data. This has limitations in accurately representing 3D spatial information to proceed with compression by converting 3D point clouds to 2D, and difficulty in processing non-existent points when utilizing 3D DCT. Therefore, in this paper, we present 3D Discrete Cosine Transform-based Point Cloud Compression (3DCT PCC), a method to compress point cloud data, which is a 3D image by utilizing 3D DCT, and confirm the efficiency of 3D DCT compared to V-PCC based on 2D DCT.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.9
• /
• pp.22-32
• /
• 1997

This paper proposes an imprecise compuitation model for DCT considering QOS of images and a two dimensional DCT architecture for imprecise computations. In case that many processes are scheduling in a hard real time system, the system resources are shared among them. Thus all processes can not be allocated enough system resources (such as processing power and communication bandwidth). The imprecise computtion model can be used to provide scheduling flexibility and various QOS(quality of service)levels, to enhance fault tolerance, and to ensure service continuity in rela time systems. The DCT(discrete cosine transform) is known as one of popular image data compression techniques and adopted in JPEG and MPEG algorithms since the DCT can remove the spatial redundancy of 2-D image data efficiently. Even though many commercial data compression VLSI chips include the DCST hardware, the DCT computation is still a very time-consuming process and a lot of hardware resources are required for the DCT implementation. In this paper the DCT procedure is re-analyzed to fit to imprecise computation model. The test image is simulated on teh base of this model, and the computation time and the quality of restored image are studied. The row-column algorithm is used ot fit the proposed imprecise computation DCT which supports pipeline operatiions by pixel unit, various QOS levels and low speed stroage devices. The architecture has reduced I/O bandwidth which could make its implementation feasible in VLSI. The architecture is proved using a VHDL simulator in architecture level.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.109-113
• /
• 2011

Recently, according to the development of ubiquitous computing, the u-GIS which not only used in u-Transport, u-Care, u-Fun, u-Green, u-Business, u-Government, and u-City but also used to provides various spatial information such as the location of user is being the core technology of the ubiquitous computing environment. In this paper, we implemented an mobile spatio-temporal Query Processing Systems for handling the Spatio-Temporal Data in mobile equipment.The mobile spatio-temporal Query Processing Systems provides the spatio-temporal data type and the spatio-temporal operator that is expanded by the spatial data type and the spatial operator from OepenGIS "Simple Feature Specification for SQL". It supports arithmetic coding compression techniques that is considered with a spatio-temporal data specific character. It also provides the function of data cashing for improving the importation and exportation of the spatio-temporal data between a embedded spatio-temporal DBMS and u-GIS server.

• Journal of Korea Multimedia Society
• /
• v.20 no.7
• /
• pp.1038-1045
• /
• 2017

The increase in frequency and scale of natural disasters is the typical negative examples of the global climate change and the change of the human living environment. The damage caused by natural disasters in particular including human and physical damage is directly linked to the safety and properties of citizens. Besides, damage occurs directly or indirectly to the SOC facility, and the damaged SOC facility violates the citizens' safety rights. Therefore, a plan to provide prompt and effective risk map information by linking a 3D disaster information display system, which handles the information of the damage that may occur to SOC facilities at the time of disasters, with an on-site assistance application is suggested in this study. The prompt provision of risk map information is defined as a dynamic expression technology in this study. It also processes and compresses the system to display disaster information, a spreading system that can utilize on-site information, and a module developed to organically link with the DB system that builds information and relationships. Based on the module, the effective disaster information compression plan will be prepared, and the prompt information transmission system will be secured.

• Journal of Biomedical Engineering Research
• /
• v.32 no.2
• /
• pp.158-164
• /
• 2011

Breast cancer is the most frequently appearing cancer in women, these days. To reduce mortality of breast cancer, periodic check-up is strongly recommended. X-ray mammography is one of powerful diagnostic imaging systems to detect 50~100 um micro-calcification which is the early sign of breast cancer. Although x-ray mammography has very high spatial resolution, it is not easy yet to distinguish cancerous tissue from normal tissues in mammograms and new tissue characterizing methods are required. Recently ultrasound elastography technique has been developed, which uses the phenomenon that cancerous tissue is harder than normal tissues. However its spatial resolution is not enough to detect breast cancer. In order to develop a new elastography system with high resolution we are developing x-ray elasticity imaging technique. It uses the small differences of tissue positions with and without external breast compression and requires an algorithm to detect tissue displacement. In this paper, computer simulation is done for preliminary study of x-ray elasticity imaging. First, 3D x-ray breast phantom for modeling woman's breast is created and its elastic model for FEM (finite element method) is generated. After then, FEM experiment is performed under the compression of the breast phantom. Using the obtained displacement data, 3D x-ray phantom is deformed and the final mammogram under the compression is generated. The simulation result shows the feasibility of x-ray elasticity imaging. We think that this preliminary study is helpful for developing and verifying a new algorithm of x-ray elasticity imaging.

• Journal of Korea Multimedia Society
• /
• v.8 no.7
• /
• pp.916-923
• /
• 2005

In recent times, mobile phones that play an important role in voice communication have became increasingly exciting due to the ability to transmit multimedia contents. However, user's communication cost and service usage fees for digital context exchange are still prohibitive. In this paper, we consider the task of transmitting a facial image in the context of mobile avatar generation. We present image compression as a useful technique to reduce service usage costs of data exchange in mobile communications. In view of this we propose an image compression algorithm that performs better than existing techniques. The suggested algorithm in this paper uses the location of significant coefficient on the wavelet image by detecting facial region as well as the spatial correlation between decomposed bands by wavelet transformation. The algorithm perform well and archives an efficient compression ratio. The proposed method recognizes location information of significant coefficient in advance, thus it is more suitable than existing general compression methods for mobile avatar generation systems.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.453-456
• /
• 2003

Spatial database systems achieve filtering steps with MBR(Minimum founding Rectangle) for efficient query processing, and then carry out refinement steps for candidate objects. While most operations require fast execution of filtering, it is necessary to increase the filtering rates and reduce the number of refinement steps in the low computing powered devices. The compact representation method is also needed in the mobile devices with low storage capacity. The paper proposes various approximation methods for efficient spatial operations in the multiplatform environments. This paper also designs a compression technique for MBR, which occupies almost 80% of index data in the two dimensional case. We also analyze the advantages and drawbacks of each method in terms of space utilization, filtering efficiency and speed.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.6
• /
• pp.1171-1179
• /
• 2021

Image forensic is performed to check image limpidness. In this paper, a robust scheme is discussed to detect median filtering in low quality images. Detection of median filtering assists in overall image forensic. Improved spatial statistical features are extracted from the image to classify pristine and median filtered images. Image array data is rescaled to enhance the spatial statistical information. Features are extracted using Markov model on enhanced spatial statistics. Multiple difference arrays are considered in different directions for robust feature set. Further, texture operator features are combined to increase the detection accuracy and SVM binary classifier is applied to train the classification model. Experimental results are promising for images of low quality JPEG compression.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.428-431
• /
• 2004

A multi-stage hierarchical clustering technique, which is an unsupervised technique, has been proposed in this paper for classifying the hyperspectral data .. The multistage algorithm consists of two stages. The 'local' segmentor of the first stage performs region-growing segmentation by employing the hierarchical clustering procedure with the restriction that pixels in a cluster must be spatially contiguous. The 'global' segmentor of the second stage, which has not spatial constraints for merging, clusters the segments resulting from the previous stage, using a context-free similarity measure. This study applied the multistage hierarchical clustering method to the data generated by band reduction, band selection and data compression. The classification results were compared with them using full bands.