• Resources Recycling
• /
• v.10 no.1
• /
• pp.16-24
• /
• 2001

In this study, various mechanical properties of concretes employing waste concrete as aggregate were examined. These concretes were obtained by mixing seven types of aggregate for different ratios. So, the experimental variables are the kinds of aggregates (some different aggregate compositions) and W/C ratio (0.40, 0.45, 0.50). From experimental results, the reliable regression analysis equations between compressive strength and various experimental data for recycled aggregate concrete are presented. Consequently, this study was accomplished to investigate basic engineering properties of recycled aggregate concrete using waste concrete.

• Journal of Korea Multimedia Society
• /
• v.8 no.8
• /
• pp.1134-1141
• /
• 2005

With ever more popularity of video web-publishing, popular content is being compressed, reformatted and modified, resulting in excessive content duplication. Such overlapped data can cause problem of search speed and rate of searching. However, duplicated data on other site can provide alternatives while specific site cause problem. This paper proposes the efficient method, for retrieving. similar video data in large database. In this research we have used the method to compare summarized video image instead of the raw video data, and detected similar videos through clustering in that dimension feature vector through PCA(principle component analysis). We show that our proposed method is efficient and accurate through our experiment.

• 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 Biomedical Engineering Research
• /
• v.19 no.3
• /
• pp.305-312
• /
• 1998

A small PACS based on PC is designed for CR. To receive the digital image from CR, a DICOM Interface Unit (DIU) is designed that complied with the medical image standard, DICOM V3.0. The CR images acquired through the DIU are stored in a file-server; the patient information of the images is stored in a database. To improve the performance of PC and to use it easily, multiresolution images are constructed by wavelet transform and displayed progressively. Wavelet compression method is newly adopted to store the images hierarchically to storage units. In this compression method, the image is decomposed into subclasses of image by wavelet transform, and then the subclasses of the image are vector quantized using a multiresolution codebook. The storage units for CR images were divided into the short-term storage in file-server and the harddisk in viewing station. Image processing tools supported by general PACS is implemented based on PC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.324-332
• /
• 2004

In image communications related to web browsing, image database, and telemedicine, image data processing on the region of interest (ROI) for providing the primary information is needed in the view of saying search time and bandwidth. In this paper, an enhanced algorithm for processing image data that involves multiple ROIs is presented in order to increase PSNR vs. compression ratio performance above the previous JPEG2000 Part1 Maxshift method. Since the wavelet transform enables us to a progressive transmission mechanism, Multiple-ROI coding is possible to compress, transmit, and reconstruct the image data with a better quality than those of non-ROI method while the required transmission bandwidth is kept relatively low.

• The KIPS Transactions:PartD
• /
• v.11D no.6
• /
• pp.1335-1340
• /
• 2004

This study introduces a technology utilizing digital images as electronic money by inserting watermark into the images. Watermarking technology assign contents ID to images and inserts the contents ID into the images in an unnoticeable way. The server that manages the issue and the usage of mage electronic money (called ‘WaterCash’ hereafter) stores issued contents ID to database and manage them as electronic money. WaterCash guarantees anonymity and prevents the forgery and modification of WaterCash based on semi-fragile watermarking technique. In addition, WaterCash is transferable and the illegal use of WaterCash can be prevented based on the watermarking technology. The watermarking .technology used in this paper was designed to be robust to image compression but vulnerable to intentional or non-intentional Image processing.

• Clinical and Experimental Reproductive Medicine
• /
• v.33 no.2
• /
• pp.125-132
• /
• 2006

Objective: In the previous study, we complied the differentially expressed genes during early folliculogenesis. Objective of the present study was to identify downstream target genes of transcription factors (TFs) using bioinformatics for selecting the target TFs among the gene lists for further functional analysis. Materials & Methods: By using bioinformatics tools, constituent domains were identified from database searches using Gene Ontology, MGI, and Entrez Gene. Downstream target proteins/genes of each TF were identified from database searches using TF database ($TRANSFAC^{(R)}$ 6.0) and eukaryotic promoter database (EPD). Results: DNA binding and trans-activation domains of all TFs listed previously were identified, and the list of downstream target proteins/genes was obtained from searches of TF database and promoter database. Based on the known function of identified downstream genes and the domains, 3 (HNF4, PPARg, and TBX2) out of 26 TFs were selected for further functional analysis. The genes of wee1-like protein kinase and p21WAF1 (cdk inhibitor) were identified as potential downstream target genes of HNF4 and TBX2, respectively. PPARg, through protein-protein interaction with other protein partners, acts as a transcription regulator of genes of EGFR, p21WAF1, cycD1, p53, and VEGF. Among the selected 3 TFs, further study is in progress for HNF4 and TBX2, since wee1-like protein kinase and cdk inhibitor may involved in regulating maturation promoting factor (MPF) activity during early folliculogenesis. Conclusions: Approach used in the present study, in silico analysis of downstream target genes, was useful for analyzing list of TFs obtained from high-throughput cDNA microarray study. To verify its binding and functions of the selected TFs in early folliculogenesis, EMSA and further relevant characterizations are under investigation.

• Journal of KIISE:Databases
• /
• v.30 no.6
• /
• pp.651-665
• /
• 2003

To reduce cache misses emerges as the most important issue in today's situation of main memory databases, in which CPU speeds have been increasing at 60% per year, and memory speeds at 10% per year. Recent researches have demonstrated that cache-conscious index structure such as the CR-tree outperforms the R-tree variants. Its search performance can be poor than the original R-tree, however, since it uses a lossy compression scheme. In this paper, we propose alternatively a cache-conscious version of the R-tree, which we call MR-tree. The MR-tree propagates node splits upward only if one of the internal nodes on the insertion path has empty room. Thus, the internal nodes of the MR-tree are almost 100% full. In case there is no empty room on the insertion path, a newly-created leaf simply becomes a child of the split leaf. The height of the MR-tree increases according to the sequence of inserting objects. Thus, the HeightBalance algorithm is executed when unbalanced heights of child nodes are detected. Additionally, we also propose the CCMR-tree in order to build a more cache-conscious MR-tree. Our experimental and analytical study shows that the two-dimensional MR-tree performs search up to 2.4times faster than the ordinary R-tree while maintaining slightly better update performance and using similar memory space.

• Journal of Internet Computing and Services
• /
• v.19 no.1
• /
• pp.97-103
• /
• 2018

In oriental paintings, there is Luo-kuan that expressed in a single picture by compressing the artist's information. Such Luo-kuan includes various information such as the title of the work or the name of the artist. Therefore, information about Luo-kuan is considered important to those who collect or enjoy oriental paintings. However, most of the letters in the Luo-kuan are difficult kanji, kanzai, or various shapes, so it is difficult for the ordinary people to interpret. In this paper, we developed an Luo-kuan search application to easily check the information of the Luo-kuan. The application uses a search algorithm that analyzes the captured Luo-kuan image and sends it to the server to output information about the Luo-kuan candidates that are most similar to the Luo-kuan images taken from the database in the server. We also compared and analyzed the accuracy of the algorithm based on 170 Luo-kuan data in order to find out the ranking of the Luo-kuan that matched the Luo-kuan among the candidates. Accuracy Analysis Experimental Results The accuracy of the search algorithm of this application is confirmed to be about 90%, and it is anticipated that it will be possible to develop a platform to automatically analyze and search images in a big data environment by supplementing the optimizing algorithm and multi-threading algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.12
• /
• pp.3275-3284
• /
• 1998

In this paper, we deseribe a Medical Image Information System. Our system stores and manages 5 dimensional medical image data and provides the 3 dimensional medical data via the Internet. The Internet standard VR format. VRML(Virtual Reality Modeling Language) is used to represent the 3I) medical image data. The 3D images are reconstructed from medical image data which are enerated by medical imaging systems such ans CT(Computerized Tomography). MRI(Magnetic Resonance Imaging). PET(Positron Emission Tomograph), SPECT(Single Photon Emission Compated Tomography). We implemented the medical image information system shich rses a surface-based rendering method for the econstruction of 3D images from 2D medical image data. In order to reduce the size of image files to be transfered via the Internet. The system can reduce more than 50% for the triangles which represent the surfaces of the generated 3D medical images. When we compress the 3D image file, the size of the file can be redued more than 80%. The users can promptly retrieve 3D medical image data through the Internet and view the 3D medical images without a graphical acceleration card, because the images are represented in VRML. The image data are generated by various types of medical imaging systems such as CT, MRI, PET, and SPECT. Our system can display those different types of medical images in the 2D and the 3D formats. The patient information and the diagnostic information are also provided by the system. The system can be used to implement the "Tele medicaine" systems.