• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1297-1307
• /
• 1997

This paper presents a multimedia mail system which transmit and redeive multimedia mailing messges on Intemet.This mail system is an extension of the exsting e-mail system for multimedia uncluding,text,image,MPEG video,and binary data,The MIME(Multipurpose Intert Mail Extensions)format,which is an extension of REF-822 maill format,is used to reprssent multimedia,and SMTP(Simple Mail Transfer Protocol)is utilized as a mail transport prttocol.The IMAP(Intenet Mail Access Protcol)which privides more functions than the widely used POP(Post Office Protocol)is used as a mailbox retrival protocol.The mail client is complemented on a multimedia PC while the server is implemented on a UNIX system.In the mail system, a mail sending program allows a user to attach binary files such as Postscript files and MPEG compressed video,while a receiving program provides direct interface to application programs to play back received multimedia mail messages.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.4
• /
• pp.8-15
• /
• 2002

This Paper proposes designing and implementing the database system storing the medical images. This system collects the medical image when doctors operate and diagnose the patients using the endoscope in the orthopedics, then stores the medical image data to database. Therefore. system avoids duplicated medical data, retrieves and updates the medical data effectively. The medical image data can be shared to the multiple users and application programs. This system consists of the five components. that is, the input module acquiring the medical image from the endoscope. the modulo storing the medical image. the database design and implementation storms the patient's disease history and the medical image data, user friendly interface design and implementation, and the simple data retrieval engine. The features of the system are followed. The image catcher program using DirectShow is portable any image catcher board And because the image catcher algorithm is implemented as a public module, The throughput can be increased during the development of video and audio contents on internet.

• Archives of design research
• /
• v.19 no.4 s.66
• /
• pp.101-110
• /
• 2006

In this study, I suggested a new model of universal web navigation design which can enhance users' web usability. I would like to prove that when users enjoy web navigation design, they access information much more effectively. Using a survey, I suggest some types of web navigation design for users. After that, I conducted an experiment with 4 types of web navigation designs, which have been developed to reflect varying stages of comprehensibility. My survey focused on three points. First I measured the time they spent to search for information. Second, I tested whether they lost their way while searching for information and if they did lose their way, I checked whether they could recover from their errors and find their way back. Third, I investigated whether layout, location and size of the web navigation design factors affected usability. The results of my survey indicated that users spend the shortest time, have the easiest interface, and have least error incidence under the web navigation design to enhance old-aged users' web usability. Thus, developing a universal web navigation design can encourage people to be more involved with the internet.

• Journal of Internet Computing and Services
• /
• v.20 no.6
• /
• pp.1-10
• /
• 2019

Object-based image matching algorithms have been widely used in the image processing and computer vision fields. A variety of applications based on image matching algorithms have been recently developed for object recognition, 3D modeling, video tracking, and biomedical informatics. One prominent example of image matching features is the Scale Invariant Feature Transform (SIFT) scheme. However many applications using the SIFT algorithm have implemented based on stand-alone basis, not client-server architecture. In this paper, We initially implemented based on client-server structure by using SIFT algorithms to identify and match objects in biomedical images to provide useful information to the user based on the recently released Mobile platform. The major methodological contribution of this work is leveraging the convenient user interface and ubiquitous Internet connection on Mobile device for interactive delineation, segmentation, representation, matching and retrieval of biomedical images. With these technologies, our paper showcased examples of performing reliable image matching from different views of an object in the applications of semantic image search for biomedical informatics.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5C
• /
• pp.382-390
• /
• 2005

Huffman codes are widely used for image and video data transmission. As the increase of real-time data, a lot of studies on effective decoding algorithms and architectures have been done. In this paper, we proposed a balanced binary search tree for Huffman decoding and compared the performance of the proposed architecture with that of previous works. Based on definitions of the comparison of codewords with different lengths, the proposed architecture constructs a balanced binary tree which does not include empty internal nodes, and hence it is very efficient in the memory requirement. Performance evaluation results using actual image data show that the proposed architecture requires small number of table entries, and the decoding time is 1, 5, and 2.41 memory accesses in minimum, maximum, and average, respectively.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.6
• /
• pp.1-10
• /
• 2009

Flash memory has the advantages of nonvolatile, low power consumption, light weight, and high endurance. This enables the flash memory to be utilized as a storage of mobile computing device such as PMP(Portable Multimedia Player). Potable device with a mass flash memory can store various multimedia data such as video, audio, or image. Typical index systems for mobile computer are inefficient to search a form of text like lyric or title. In this paper, we propose a new text index system, named EMTEX(Embedded Text Index). EMTEX has the following salient features. First, it uses a compression algorithm for embedded system. Second, if a new insert or delete operation is executed on the base table. EMTEX updates the text index immediately. Third, EMTEX considers the characteristics of flash memory to design insert, delete, and rebuild operations on the text index. Finally, EMTEX is executed as an upper layer of DBMS. Therefore, it is independent of the underlying DBMS. We evaluate the performance of EMTEX. The Experiment results show that EMTEX can outperform th conventional index systems such as Oracle Text and FT3.

• Journal of Broadcast Engineering
• /
• v.14 no.6
• /
• pp.661-675
• /
• 2009

The carelessly and illegally copied contents are raising serious social problem as internet and multimedia technologies are advancing. Therefore, development of video copy detection system must be settled without delay. In this paper, we propose the hierarchical video copy detection method that estimates similarity using statistical characteristics between original video and manipulated(transformed) copy video. We rank according to luminance value of video to be robust to spacial transformation, and choose similar videos categorized as candidate segments in huge amount of database to reduce processing time and complexity. The copy videos generally insert black area in the edge of the image, so we remove rig black area and decide copy or not by using statistical characteristics of original video and copied video with center part of frame that contains important information of video. Experiment results show that the proposed method has similar keyframe accuracy to reference method, but we use less memory to save feature information than reference's, because the number of keyframes is less 61% than that of reference's. Also, the proposed method detects if the video is copied or not efficiently despite expansive spatial transformations such as blurring, contrast change, zoom in, zoom out, aspect ratio change, and caption insertion.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1222-1228
• /
• 2006

In this paper, I propose a video watermaking method using adaptive threshold value and half-cell motion vector. Conventional method cause a lot of change of motion vectors and bring about a falling-off in invisibility, because it search embedding condition about whole macroblocks and watermarks are embedded in arbitrary motion vectors. Proposed method improve invisibility and decrease in number of change of motion vectors, because it create threshold value by using power of motion vector(PMV), and watermarks are embedded in motion vectors which greater than threshold value. Consequently, proposed method improve invisibility with on an average 5.4 dB ~9.3dB according to video bit-stream.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.1
• /
• pp.91-96
• /
• 2010

Concentric mosaics are made with arranging and summing of video frames by using common spacial standards. Compared with previous works on 3-D wavelet transform coding, we have made important design considerations to enable flexible partial decoding and bit-stream random access. A just-in-time(JIT) rendering engine of the compressed concentric mosaic is developed. However, computationally, it is still demanding to accomplish the real-time rendering. Only the contents for specific scene representation are need to be decoded by maintaining compressed data. Thus our proposed algorithm is able to render real concentric mosaic by using lifting scheme instead of wavelet transform.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1219-1223
• /
• 2010

This paper proposes a fast motion estimation algorithm based on motion speed and multiple initial center points. The proposed method predicts initial search points by means of the spatio-temporal neighboring motion vectors. A dynamic search pattern based on the motion speed and the predicted initial center points is proposed to quickly obtain the motion vector. Due to the usage of the spatio-temporal information and the dynamic search pattern, the proposed method greatly accelerates the search speed while keeping a good predicted image quality. Experimental results show that the proposed method has a good predicted image quality in terms of PSNR with less searching time comparing with the Full Search, New Three-Step Search, and Four-Step Search.