• Journal of Korea Multimedia Society
• /
• v.15 no.6
• /
• pp.805-813
• /
• 2012

In this paper, we have designed and developed a middleware for an effectively approaching database to the existed brain disease clinical research system. The brain disease clinical research system was consisted of two parts i.e., a register and an analyzer. Since the register collects the registration data the analyzer yields a statistical data which based on the diverse variables. The middleware has designed to database management and a large data query processing of clients. By separating the function of each feature as a module, the module which was weakened connectivity between functionalities has been implemented the re-use module. And image data module used a new compression method from image to text for an effective management and storage in database. We tested the middleware system using 700 actual clinical medical data. As a result, the total data transmission time was improved maximum 115 times faster than the existing one. Through the improved module structures, it is possible to provide a robust and reliable system operation and enhanced security functionality. In the future, these middleware importances should be increased to the large medical database constructions.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.477-481
• /
• 2004

High Quality CD, OAT audio requires that large amount of data. Currently, multi channel preference has been rapidly propagated among latest users. The MPEG(Moving Picture Expert Group) is provides data compression technology of sound and image system. The MPEG standard provides multi channel and 5.1 sounds, using the same audio algorithm as MPEG-l. And MPEG-2 audio is forward and backward compatible. The MDCT (Modified Discrete Cosine Transform) is a linear orthogonal lapped transform based on the idea of TDAC(Time Domain Aliasing Cancellation). In this paper, we proposed the micro-program type vector processor architecture a benefit in MDCT/IMDCT of MPEG-II AAC. And it's reduced operating coefficient by overlapped area to bind. To compare original algorithm with optimized algorithm that cosine coefficient reduced $0.5\%$multiply operating $0.098\%$ and add operating 80.58\%$. Algorithm test is used C-language then we designed hardware architecture of micro-programmed method that applied to optimized algorithm. This processor is 20MHz operation 5V.

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

Video stream invoke a variety of traffic with the structure of compression algorithm and image complexity. Thus, it is difficult to allocate the resource on the both sides of sender and receiver, and playout on the Internet such as a packet switched network. Thus, in this paper we proposed video stream smoothing using multistream for the effective transmission of video stream. This method specifies the type of LDU(logical data unit) according to the type of original stream, and then makes a large number of streams as a fixed size, and transfers them. So, the proposed method can reduce the buffering time which occurs during the process of the smoothing and prefetch be robust to the jitter on network, as well. Consequently, it has the effective transmission characteristics of fully utilizing the clients bandwidth.

• ETRI Journal
• /
• v.41 no.1
• /
• pp.93-108
• /
• 2019

Guaranteeing interoperability between devices and applications is the core role of standards organizations. Since its first JPEG standard in 1992, the Joint Photographic Experts Group (JPEG) has published several image coding standards that have been successful in a plethora of imaging markets. Recently, these markets have become subject to potentially disruptive innovations owing to the rise of new imaging modalities such as light fields, point clouds, and holography. These so-called plenoptic modalities hold the promise of facilitating a more efficient and complete representation of 3D scenes when compared to classic 2D modalities. However, due to the heterogeneity of plenoptic products that will hit the market, serious interoperability concerns have arisen. In this paper, we particularly focus on the holographic modality and outline how the JPEG committee has addressed these tremendous challenges. We discuss the main use cases and provide a preliminary list of requirements. In addition, based on the discussion of real-valued and complex data representations, we elaborate on potential coding technologies that range from approaches utilizing classical 2D coding technologies to holographic content-aware coding solutions. Finally, we address the problem of visual quality assessment of holographic data covering both visual quality metrics and subjective assessment methodologies.

• Korean Journal of Optics and Photonics
• /
• v.19 no.4
• /
• pp.262-269
• /
• 2008

In this paper, we propose an image watermark method using multiple decoding keys. The advantages of this method are that the multiple original images are reconstructed by using multiple decoding keys in the same watermark image, and that the quality of reconstructed images is clearly enhanced based on the idea of Walsh code without any side lobe components in the decoding process. The zero-padded original images, multiplied with random-phase pattern to each other, are Fourier transformed. Encoded images are then obtained by taking the real-valued data from these Fourier transformed images. The embedding images are obtained by the product of independent Walsh codes, and these spreaded phase-encoded images which are multiplied with new random-phase images. Also we obtain the decoding keys by multiplying these random-phase images with the same Walsh code images used in the embedding images. A watermark image is then made from the linear superposition of the weighted embedding images and a cover image, which is multiplied with a new independent Walsh code. The original image is simply reconstructed by the inverse-Fourier transform of the despreaded image of the multiplication between the watermark image and the decoding key. Computer simulations demonstrate the efficiency of the proposed watermark method with multiple decoding keys and a good robustness to the external attacks such as cropping and compression.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.4
• /
• pp.9-21
• /
• 2004

In this paper, we proposed the image hiding method which decreases calculation amount by encrypt partial data using discrete wavelet transform and linear scale quantization which were adopted as the main technique for frequency transform in JPEG2000 standard. Also we used the chaotic system which has smaller calculation amount than other encryption algorithms and then dramatically decreased calculation amount. This method operates encryption process between quantization and entropy coding for preserving compression ratio of images and uses the subband selection method and the random changing method using the chaotic system. For ciphering the quantization index we use a novel image encryption algerian of cyclically shifted in the right or left direction and encrypts two quantization assignment method (Top-down/Reflection code), made change of data less. Also, suggested encryption method to JPEG2000 progressive transmission. The experiments have been performed with the proposed methods implemented in software for about 500 images. consequently, we are sure that the proposed are efficient image encryption methods to acquire the high encryption effect with small amount of encryption. It has been shown that there exits a relation of trade-off between the execution time and the effect of the encryption. It means that the proposed methods can be selectively used according to the application areas. Also, because the proposed methods are performed in the application layer, they are expected to be a good solution for the end-to-end security problem, which is appearing as one of the important problems in the networks with both wired and wireless sections.

• Journal of Broadcast Engineering
• /
• v.7 no.1
• /
• pp.55-65
• /
• 2002

Wavelet transform has recently emerged as a promising technique for video processing applications due to its flexibility in representing non-stationary video signals. Motion estimation which uses wavelet transform of octave band division method is applied In many places but if motion estimation error happens in the lowest frequency band. motion estimation error is accumulated by next time strep and there has the Problem that time and the data amount that are cost In calculation at each steps are increased. On the other hand. wavelet packet that achieved the best image quality in a given bit rate from a rate-distortion sense is suggested. But, this method has the disadvantage of time costs on designing wavelet packet. In order to solve this problem we solved this problem by introducing Top_down method. But we did not find the optimum solution in a given butt rate. That image variance can represent image complexity is considered in this paper. In this paper. we propose a fast multiresolution motion estimation scheme based on the adaptive wavelet transform for video compression.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.3
• /
• pp.36-41
• /
• 2002

Generally, cartoon images are simple and involve a small number of colors and often include large homogeneous regions with same color or gradient. In this paper, effective compression method for complementary quadtree was suggested for cartoon images, by using those properties. And with progressive transmission, this method involves a progressive increase in the image resolution at the receiver from a lower to a higher resolution during the transmission of data. This is an effective way of using a limited transmission channel, because, after estimating the value of the data in the early transmission period, a decision can be made whether or not to proceed with the transmission of the remaining part. Since the proposed method is lossless and involves progressive transmission, it was compared with progressive PNG and progressive GIF, which had same functions.

• Journal of Korea Multimedia Society
• /
• v.8 no.8
• /
• pp.1080-1087
• /
• 2005

Significant computations for full search (FS) motion estimation have been a big obstacle in real-time video coding and recent MPEG-4 AVC (advanced video coding) standard requires much more computations than conventional MPEG-2 for motion estimation. To reduce an amount of computation of full search (FS) algorithm for fast motion estimation, we propose a new and fast matching algorithm without any degradation of predicted images like the conventional FS. The computational reduction without any degradation in predicted image comes from fast elimination of impossible candidate motion vectors. We obtain faster elimination of inappropriate motion vectors using efficient matching units from localization of complex area in image data and dithering order based matching scan. Our algorithm reduces about $30\%$ of computations for block matching error compared with the conventional partial distortion elimination (PDE) algorithm, and our algorithm will be useful in real-time video coding applications using MPEG-4 AVC or MPEG-2.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.160-174
• /
• 2008

In this paper, we propose new coding techniques for photometry data of three-dimensional(3-D) mesh models. We make a good use of geometry and connectivity information to improve coding efficiency of color, normal vector, and texture data. First of all, we determine the coding order of photometry data exploiting connectivity information. Then, we exploit the obtained geometry information of neighboring vortices through the previous process to predict the photometry data. For color coding, the predicted color of the current vertex is computed by a weighted sum of colors for adjacent vortices considering geometrical characteristics between the current vortex and the adjacent vortices at the geometry predictor. For normal vector coding, the normal vector of the current vertex is equal to one of the optimal plane produced by the optimal plane generator with distance equalizer owing to the property of an isosceles triangle. For texture coding, our proposed method removes discontinuity in the texture coordinates and reallocates texture image segments according to the coding order. Simulation results show that the proposed compression schemes provide improved performance over previous works for various 3-D mesh models.