Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The KIPS Transactions:PartB
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 10B, Issue 7 - Dec 2003
Volume 10B, Issue 6 - Oct 2003
Volume 10B, Issue 5 - Aug 2003
Volume 10B, Issue 4 - Aug 2003
Volume 10B, Issue 3 - Jun 2003
Volume 10B, Issue 2 - Apr 2003
Volume 10B, Issue 1 - Feb 2003
Selecting the target year
Correlation-based Robust Blind Watermarking
Joo, Snag-Hyun ; Seo, Yong-Seok ;
The KIPS Transactions:PartB, volume 10B, issue 5, 2003, Pages 479~484
DOI : 10.3745/KIPSTB.2003.10B.5.479
We propose a blind watermarking method that embeds a binary pseudo-random sequence (watermarks), (-1, 1), into wavelet dc components, while most watermarking techniques embed watermarks in the middle frequency range for robustness and fidelity. In our scheme, the watermarks are embedded into particular locations to be selected by a key, where some watermark embeddings are skipped to avoid severe degradation in quality. Our robustness is compared to some results registered to the ChechMark  that is one of the most popular benchmarking tools.
Digital Watermark Generation Algorithm Embedding Hangul Text
Cho, Dae-Jea ; Kim, Hyun-ki ;
The KIPS Transactions:PartB, volume 10B, issue 5, 2003, Pages 485~490
DOI : 10.3745/KIPSTB.2003.10B.5.485
In this paper, we propose the possibility of introducing chaotic sequences into digital watermarking systems as potential substitutes to commonly used pseudo noise sequences. Chaotic sequences have several good properties including the availability of a great number of them, the ease of their generation, as well as their sensitive dependence on their initial conditions. And the quantization does not destroy the good property. So this paper proposes a method that transforms Hangul text to chaotic sequence. And we presents how the Hangul text is expressed by an implied data and the implied data is regenerated into the original text. In this paper, we use this implied Hangul text for watermarking.
An Entropy Masking Model for Image and Video Watermarking
Kim, Seong-Whan ; Shan Suthaharan ;
The KIPS Transactions:PartB, volume 10B, issue 5, 2003, Pages 491~496
DOI : 10.3745/KIPSTB.2003.10B.5.491
We present a new watermark design tool for digital images and digital videos that are based on human visual system (HVS) characteristics. In this tool, basic mechanisms (inhibitory and excitatory behaviour of cells) of HVS are used to determine image dependent upper bound values on watermark insertion. This allows us to insert maximai allowable transparent watermark, which in turn is extremely hard to attack with common image processing, Motion Picture Experts Group (MPEG) compression. As the number of details (e.g. edges) increases in an image, the HVS decrease its sensitivity to the details. In the same manner, as the number of motion increases in a video signal, the HVS decrease its sensitivity to the motions. We model this decreased sensitivity to the details and motions as an (motion) entropy masking. Entropy masking model can be efficiently used to increase the robustness of image and video watermarks. We have shown that our entropy-masking model provides watermark scheme with increased transparency and henceforth increased robustness.
Fingerprint Classification Based On the Entropy of Ridges
Park, Chang-Hee ; Yoon, Kyung-Bae ; Ko, Chang-Bae ;
The KIPS Transactions:PartB, volume 10B, issue 5, 2003, Pages 497~502
DOI : 10.3745/KIPSTB.2003.10B.5.497
Fingerprint classification plays a role of reduction of precise joining time and improvement of the accuracy in a large volume of database. Patterns of fingerprint are classified as 5 patterns : left loop, right loop, arch, whorl, and tented arch by numbers and the location of core point and delta point. The existing fingerprint classification is useful in a captured fingerprint image of core point and delta point using paper and ink. However, this system is unapplicable in modern Automatic Fingerprint Identification System (AFIS) because of problems such as size of input and way of input. To solve the problem, this study is to suggest the way of being able to improve accuracy of fingerprint by fingerprint classification based on the entropy of ridges using fingerprint captured mage of core point and prove this through the experiment.
Design and Implementation of A Medical Image Guided System for Vertebroplasty
Tack, Gye-Rae ; Lee, Sang-Bum ; Lee, Sung-Jae ;
The KIPS Transactions:PartB, volume 10B, issue 5, 2003, Pages 503~508
DOI : 10.3745/KIPSTB.2003.10B.5.503
Since surgical treatment of the spine should overcome neurological compromises, the operative procedures need to be carefully planned and carried out with high degree of precision. Percutaneous vertebroplasty is a surgical procedure that was introduced for the treatment of compression fracture of the vertebrae. This procedure includes puncturing vertebrae and filling with polymethylmethacrylate (PMMA). Recent studies have shown that the procedure could provide structural reinforcement for the osteoporotic vertebrae while being minimally invasive and safe with immediate relief of pain. However, failures of treatment due to excessive PMMA volume injection have been reported as one of complications in vertebroplasty. It is believed that the control of PMMA volume is one of the most critical factors that can reduce the incidence of complications. Therefore, clinical success of vertebroplasty can be dependent on the volume of PMMA injection for a given patient. In this study, the optimal volume of PMMA injection for vertebroplasty was predicted based on the image analysis of a given patient.
Virtual Bronchoscopy for Diagnosis of Tracheo-Bronchial Disease
Kim, Do-Yeon ; Park, Jong-Won ;
The KIPS Transactions:PartB, volume 10B, issue 5, 2003, Pages 509~514
DOI : 10.3745/KIPSTB.2003.10B.5.509
The virtual bronchoscopy was implemented using chest CT images to visualize inside of tracheo-bronchial wall. The optical endoscopy procedures are invasive, uncomfortable for patients and sedation or anesthesia may be required. Also, they have serious side effects such as perforation, infection and hemorrhage. In order to determine the navigation path, we segmented the tracheo-bronchial wall from the chest CT image. We used the coordinates as a navigation path for virtual camera that were calculated from medial axis transformation. We used the perspective projection and marching cube algorithm to render the surface from volumetric CT image data. The tracheobronchial disease was classified into tracheobronchial stenosis causing from inflammation or lung cancer, bronchiectasis and bronchial cancer. The virtual bronchoscopy is highly recommended as a diagnosis tool with which the specific place of tracheobronchial disease can be identified and the degree of tracheobronchial disease can be measured qualitatively, Also, the virtual bronchoscopy can be used as an education and training tool for endoscopist and radiologist.
3D Reconstruction using vanishing points
Kim, Sang-Hoon ; Choi, Jong-Soo ; Kim, Tae-Eun ;
The KIPS Transactions:PartB, volume 10B, issue 5, 2003, Pages 515~520
DOI : 10.3745/KIPSTB.2003.10B.5.515
This paper proposes a calibration method from two images. Camera calibration is necessarily required to obtain 3D Information from 2D images. Previous works to accomplish the camera calibration needed the calibration object or required more than three images to calculate the Kruppa equation, however, we use the geometric constraints of parallelism and orthogonality can be easily presented in man-made scenes. The task of it is to obtain intrinsic and extrinsic camera parameters. The intrinsic parameters are evaluated from vanishing points and then the extrinsic parameters which are consisted of rotation matrix and translation vector of the camera are estimated from corresponding points of two views. From the calibrated parameters, we can recover the projection matrices for each view point. These projection matrices are used to recover 3D information of the scene and can be used to visualize new viewpoints.
Intensity Information and Curve Evolution Based Active Contour Model
Kim, Seong-Kon ;
The KIPS Transactions:PartB, volume 10B, issue 5, 2003, Pages 521~526
DOI : 10.3745/KIPSTB.2003.10B.5.521
In this paper, we propose a geometric active contour model based on intensity information and curve evolution for detecting region boundaries. We put boundary extraction problem as the minimization of the difference between the average intensity of the region and the intensity of the expanding closed curves. We used level set theory to implement the curve evolution for optimal solution. It offered much more freedom in the initial curve position than a general active contour model. Our methods could detect regions whose boundaries are not necessarily defiened by gradient compared to general edge based methods and detect multiple boundaries at the same time. We could improve the result by using anisotropic diffusion filter in image preprocessing. The performance of our model was demonstrated on several data sets like CT and MRI medical images.
A Shaking Snake for Contour Extraction of an Object
Yoon, Jin-Sung ; Kim, Kwan-Jung ; Kim, Gye-Young ; Paik, Doo-Won ;
The KIPS Transactions:PartB, volume 10B, issue 5, 2003, Pages 527~534
DOI : 10.3745/KIPSTB.2003.10B.5.527
An active contour model called snake is powerful tool for object contour extraction. But, conventional snakes require exhaustive computing time, sometimes can´t extract complex shape contours due to the properties of energy function, and are also heavily dependent on the position and the shape of an initial snake. To solving these problems, we propose in this paper an improved snake called "shaking snake", based on a greedy algorithm. A shaking snake consist of two steps. According to their appropriateness, we in the first step move each points directly to locations where contours are likely to be located. In the second step, we then align some snake points with a tolerable bound in order to prevent local minima. These processes shake the proposed snake. In the experimental results, we show the process of shaking the proposed shake and comparable performance with a greedy snake. The proposed snake can extract complex shape contours very accurately and run fast, approximately by the factor of five times, than a greedy snake.
Development of Assistive Software for color blind to Electronic Documents
Jang, Young-Gun ;
The KIPS Transactions:PartB, volume 10B, issue 5, 2003, Pages 535~542
DOI : 10.3745/KIPSTB.2003.10B.5.535
This study is concerned with an assistive technology which reduces color blinds´s confusion when they access electronic documents including color objects in their computers. In this study, 1 restrict the assistive technology would apply to windows operating system, 256 color mode and implement to minimize color distortion which occurs in multi window environments because of color approximation process. As a basic palette, I use a 216 colors web safe palette which the Christine proposed as a standard for color blind, expand it to 256 colors to apply all computer displays using Microsoft Windows as its operating system and implement it as windows application. To test its effectiveness, I use a simulator for dichromats, as results of the test, the developed color vision deficiency correction S/W is effective to reduce the confusion. It is more effective to use the implemented S/W in both of design and client process for electronic documents.
MPEG-7 based Video/Image Retrieval System (VIRS)
Lee, Jae-Ho ; Kim, Hyoung-Joon ; Kim, Whoi-Yul ;
The KIPS Transactions:PartB, volume 10B, issue 5, 2003, Pages 543~552
DOI : 10.3745/KIPSTB.2003.10B.5.543
An increasing in quantity of multimedia data brought a new problem that expected data should be retrieved fast and exactly. The adequate representation is a key element for the efficient retrieval. For this reason, MPEG-7 standard was established for description of multimedia data in 2001. However, the content of the standard is massive and the approach method is not clear for real application system yet, because of properties of MPEG-7 standard that has to include a lot of potential cases. In this paper, we suggested implementation scheme of retrieval system with using of only visual descriptors and presented the performance results of developed system. From the result of developed system, MPEG-7 VIRS (Video/Image Retrieval System), we analyzed the retrieval results between using individual descriptor and using multiple descriptors, and showed a layout for real application system.
Packetizing Scheme for Reliable Transmission of Wavelet Video Stream
Lee, Joo-Kyong ; Kang, Jin-Mi ; Kim, Chung-Kil ; Chung, Ki-Dong ;
The KIPS Transactions:PartB, volume 10B, issue 5, 2003, Pages 553~560
DOI : 10.3745/KIPSTB.2003.10B.5.553
Since Wavelet Transform decomposes a video frame into subbands with various frequencies and resolutions, the reconstructed video qualify at a receiver fluctuates according to the location of transmission errors within frames. This deteriorates the whole visual duality of the video. Specifically, for a wavelet based video which exploits the motion estimation prediction scheme, the transmission errors of a subband not only have a bad effect on other subbands within a same frame but also propagates to the subsequent frames. In this paper, we propose BDP(Block Based Dispersive Packetization) scheme, for a wavelet based video stream, which maintains constant video quality despite packet location that a transmission error occurs. To evaluate the performance of the proposed scheme, we use MRME(Multi-Resolution Motion Estimation) scheme to compress a video in Inter coding mode and Gilbert´s error model to generate the error patterns in wireless network environment. The simulation results show that BDP is more efficient than BP (Block based Packetization) or DP (Dispersive Packetization) in both PSNR and visual quality.
An algorithm of the natural view transition in the panoramic image based navigation using Fast Fourier Transform Techniques
Kim, Dae-Hyun ; Choi, Jong-Soo ; Kim, Tae-Eun ;
The KIPS Transactions:PartB, volume 10B, issue 5, 2003, Pages 561~566
DOI : 10.3745/KIPSTB.2003.10B.5.561
This paper proposes a new algorithm that generates smooth and realistic transition views from one viewpoint to another view point on the panorama based navigation system. The proposed algorithm is composed with two steps. One is prewarping that aligns the viewing direction in two panorama image, the other is bidirectional disparity morphing (BDM) that generates the intermediate scene from the aligned panorama images. For the prewarping, first of all, we compute the phase correlation between two images in order to get the information such as the displacement, rotation, and scale. Then we align the original images using these information. As soon as finishing the prewarping, we compute the block based disparity vectors (DVs) and smooth them using the two occluding patterns. As we apply these DVs to the BDM, we can get the elaborate intermediate scenes. We make an experiment on the proposed algorithm with real panoramic images and we can get the satisfactory results.
A Collision detection from division space for performance improvement of MMORPG game engine
Lee, Sung-Ug ;
The KIPS Transactions:PartB, volume 10B, issue 5, 2003, Pages 567~574
DOI : 10.3745/KIPSTB.2003.10B.5.567
Application field of third dimension graphic is becoming diversification by the fast development of hardware recently. Various theory of details technology necessary to design game such as 3D MMORPG (Massive Multi-play Online Role Flaying Game) that do with third dimension. Cyber city should be absorbed. It is the detection speed that this treatise is necessary in game engine design. 3D MMORPG game engine has much factor that influence to speed as well as rendering processing because it express huge third dimension city´s grate many building and individual fast effectively by real time. This treatise nay get concept about the collision in 3D MMORPG and detection speed elevation of game engine through improved detection method. Space division is need to process fast dynamically wide outside that is 3D MMORPG´s main detection target. 3D is constructed with tree construct individual that need collision using processing geometry dataset that is given through new graph. We may search individual that need in collision detection and improve the collision detection speed as using hierarchical bounding box that use it with detection volume. Octree that will use by division octree is used mainly to express rightly static object but this paper use limited OSP by limited space division structure to use this in dynamic environment. Limited OSP space use limited space with method that divide square to classify typically complicated 3D space´s object. Through this detection, this paper propose follow contents, first, this detection may judge collision detection at early time without doing all polygon´s collision examination. Second, this paper may improve detection efficiency of game engine through and then reduce detection time because detection time of bounding box´s collision detection.
Zero-tree packetization without additional memory using DFS
Kim, Chung-Kil ; Lee, Joo-Kyong ; Chung, Ki-Dong ;
The KIPS Transactions:PartB, volume 10B, issue 5, 2003, Pages 575~578
DOI : 10.3745/KIPSTB.2003.10B.5.575
SPIHT algorithm is a wavelet based fast and effective technique for image compression. It uses a list structure to store status information which is generated during set-partitioning of zero-tree. Usually, this requires lots of additional memory depending on how high the bit-rate is. Therefore, in this paper, we propose a new technique called MZP-DFS, which needs no additional memory when running SPIHT algorithm. It traverses a spatial-tree according to DFS and eliminates additional memory as it uses test-functions for encoding and LSB bits of coefficients for decoding respectively. This method yields nearly the same performance as SPIHT. This may be desirable in hardware implementation because no additional memory is required. Moreover. it exploits parallelism to process each spatial-tree that it can be applied well in real-time image compression