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 13B, Issue 7 - Dec 2006
Volume 13B, Issue 6 - Dec 2006
Volume 13B, Issue 5 - Oct 2006
Volume 13B, Issue 4 - Aug 2006
Volume 13B, Issue 3 - Jun 2006
Volume 13B, Issue 2 - Apr 2006
Volume 13B, Issue 1 - Feb 2006
Selecting the target year
Error Concealment Using Gradient Vectors in H.264 Decoder
Jeon Sung-Hoon ; Yoo Jae-Myeong ; Lee Guee-Sang ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 197~204
DOI : 10.3745/KIPSTB.2006.13B.3.197
Recent advances in information technology have resulted in rapid growth in the mobile communication. With this explosive growth, reliable transmission and error concealment technique become increasingly important to offer high quality multimedia services. In this paper, we propose an improved BMA(Boundary Matching Algorithm) method using gradient vectors to conceal channel errors in inter-frames of H.264 video images. General BMA method computes the sum of pixel differences of adjacent pixels of the candidate block and its neighbouring blocks, assuming that adjacent pixels have almost the same value. In real images, however, there exist some gradients, which means that the pixel values are increasing or decreasing in a specific direction. In this paper, we develop a precise estimation method of errors in candidates blocks using gradient information and try to recover lost blocks with this technique. Experimental results show the improvement of picture quality about
compared to existing methods.
Text Detection and Binarization using Color Variance and an Improved K-means Color Clustering in Camera-captured Images
Song Young-Ja ; Choi Yeong-Woo ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 205~214
DOI : 10.3745/KIPSTB.2006.13B.3.205
Texts in images have significant and detailed information about the scenes, and if we can automatically detect and recognize those texts in real-time, it can be used in various applications. In this paper, we propose a new text detection method that can find texts from the various camera-captured images and propose a text segmentation method from the detected text regions. The detection method proposes color variance as a detection feature in RGB color space, and the segmentation method suggests an improved K-means color clustering in RGB color space. We have tested the proposed methods using various kinds of document style and natural scene images captured by digital cameras and mobile-phone camera, and we also tested the method with a portion of ICDAR contest images.
Main Region and Color Extraction of Face for Heart Disease Diagnosis
Cho Dong-Uk ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 215~222
DOI : 10.3745/KIPSTB.2006.13B.3.215
People health improvement is becoming new subject through the combining with the oriental medicine diagnosis theory and IT technology. To do this, firstly, it needs sicked data that supply the visualization, objectification and quantification method. Especially, if an ocular inspection can be more objective and visual expression in oriental medicine, it seems to offer the biggest opportunity in diagnosis field. In this study, I propose a diagnosis to check the symptoms of heart diagnosis. Our research aim is on the visualization of diagnosis using image processing system which it can be actual analysis about the symptom of heart. To catch up this study, through the color support assistance by face image processing, I devide the face area and analyze the face form and also extract face characteristic point in heart disease diagnosis using oriental medicine based on an ocular inspection method. I would like to prove the usefulness of the method that proposed by an experiment.
An FPGA Implementation of Parallel Hardware Architecture for the Real-time Window-based Image Processing
Jin S.H. ; Cho J.U. ; Kwon K.H. ; Jeon J.W. ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 223~230
DOI : 10.3745/KIPSTB.2006.13B.3.223
A window-based image processing is an elementary part of image processing area. Because window-based image processing is computationally intensive and data intensive, it is hard to perform ail of the operations of a window-based image processing in real-time by using a software program on general-purpose computers. This paper proposes a parallel hardware architecture that can perform a window-based image processing in real-time using FPGA(Field Programmable Gate Array). A dynamic threshold circuit and a local histogram equalization circuit of the proposed architecture are designed using VHDL(VHSIC Hardware Description Language) and implemented with an FPGA. The performances of both implementations are measured.
An Improvement of Lossless Image Compression for Mobile Game
Kim Se-Woong ; Jo Byung-Ho ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 231~238
DOI : 10.3745/KIPSTB.2006.13B.3.231
In this paper, the method to make lossless image compression that holds considerable part of total volume of mobile game has been proposed. To increase the compression rate, we compress the image by Deflate algorithm defined in RFC 1951 after reorganize it at preprocessing stage before conducting actual compression. At the stage of preprocessing, we obtained the size of a dictionary based on the information of image which is the feature of Dictionary-Based Coding, and increased the better compression rate than compressing in a general manner using in a way of restructuring image by pixel packing method and DPCM prediction technique. It has shown that the method increased 9.7% of compression rate compare with existing mobile image format, after conducting the test of compression rate applying the suggested compression method into various mobile games.
Object Contour Tracking Using Optimization of the Number of Snake Points in Stereoscopic Images
Kim Shin-Hyoung ; Jang Jong-Whan ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 239~244
DOI : 10.3745/KIPSTB.2006.13B.3.239
In this paper, we present a snake-based scheme for contour tracking of objects in stereo image sequences. We address the problem by managing the insertion of new points and deletion of unnecessary points to better describe and track the object`s boundary. In particular, our method uses more points in highly curved parts of the contour, and fewer points in less curved parts. The proposed algorithm can successfully define the contour of the object, and can track the contour in complex images. Furthermore, we tested our algorithm in the presence of partial object occlusion. Performance of the proposed algorithm has been verified by simulation.
A Bitrate Control considering Interframe Variance of Image for H.264/AVC
Son Nam-Rye ; Lee Guee-Sang ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 245~254
DOI : 10.3745/KIPSTB.2006.13B.3.245
In this work, a new rate control algorithm for transmission of H.264/AVC video bit stream through CBR(constant bit rate) channel is proposed. The proposed algorithm predicts target bit rate and MAD(mean of absolute difference) for current frame considering image complexity variance between neighboring backward and current images. In details, respective linear regression analysis for MAD and encoded bit rate against image complexity variance produce correlation parameters. Additionally, it uses frame skip technique to maintain bit stream within a manageable range and protect buffer from overflow or underflow. Implementation and experimental results show that the proposed algorithm can provide accurate bit allocation, and can effectively visual degradation after scene changes. Also our proposed algorithm encodes the video sequences with less frame skipping compared to the existing rate control for H.264/AVC.
Video object segmentation using a novel object boundary linking
Lee Ho-Suk ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 255~274
DOI : 10.3745/KIPSTB.2006.13B.3.255
Moving object boundary is very important for the accurate segmentation of moving object. We extract the moving object boundary from the moving object edge. But the object boundary shows broken boundaries so we develop a novel boundary linking algorithm to link the broken boundaries. The boundary linking algorithm forms a quadrant around the terminating pixel in the broken boundaries and searches for other terminating pixels to link in concentric circles clockwise within a search radius in the forward direction. The boundary linking algorithm guarantees the shortest distance linking. We register the background from the image sequence using the stationary background filtering. We construct two object masks, one object mask from the boundary linking and the other object mask from the initial moving object, and use these two complementary object masks to segment the moving objects. The main contribution of the proposed algorithms is the development of the novel object boundary linking algorithm for the accurate segmentation. We achieve the accurate segmentation of moving object, the segmentation of multiple moving objects, the segmentation of the object which has a hole within the object, the segmentation of thin objects, and the segmentation of moving objects in the complex background using the novel object boundary linking and the background automatically. We experiment the algorithms using standard MPEG-4 test video sequences and real video sequences of indoor and outdoor environments. The proposed algorithms are efficient and can process 70.20 QCIF frames per second and 19.7 CIF frames per second on the average on a Pentium-IV 3.4GHz personal computer for real-time object-based processing.
Image Retrieval Using the Color Co-occurrence Histogram Describing the Size and Coherence of the Homogeneous Color Region
An Myung-Seok ; Cho Seok-Je ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 275~282
DOI : 10.3745/KIPSTB.2006.13B.3.275
For the efficient image retrieval, the method has studied that uses color distribution and relations between pixels. This paper presents the color descriptor that stands high above the others in image retrieval capacity. It is based on color co-occurrence histogram that the diagonal part and the non-diagonal part are attached the weight and modified to energy of color co-occurrence histogram, and the number of bins with petty worth have little influence is curtailed. It`s verified by analysis that the diagonal part carries size information of homogeneous color region and the non-diagonal part does information about the coherence of it, Moreover the non-diagonal part is more influential than diagonal part in survey of similarity between images. So, the non-diagonal part is attached more weight than the diagonal part as a result of the research. The experiments validate that the proposed descriptor shows better image retrieval performance when the weight for non-diagonal part is set to the value between 0.7 and 0.9.
A Real-Time Face Detection/Tracking Methodology Using Haar-wavelets and Skin Color
Park Young-Kyung ; Seo Hae-Jong ; Min Kyoung-Won ; Kim Joong-Kyu ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 283~294
DOI : 10.3745/KIPSTB.2006.13B.3.283
In this paper, we propose a real-time face detection/tracking methodology with Haar wavelets and skin color. The proposed method boosts face detection and face tracking performance by combining skin color and Haar wavelets in an efficient way. The proposed method resolves the problem such as rotation and occlusion due to the characteristic of the condensation algorithm based on sampling despite it uses same features in both detection and tracking. In particular, it can be applied to a variety of applications such as face recognition and facial expression recognition which need an exact position and size of face since it not only keeps track of the position of a face, but also covers the size variation. Our test results show that our method performs well even in a complex background, a scene with varying face orientation and so on.
Enhanced Image Mapping Method for Computer-Generated Integral Imaging System
Lee Bin-Na-Ra ; Cho Yong-Joo ; Park Kyoung-Shin ; Min Sung-Wook ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 295~300
DOI : 10.3745/KIPSTB.2006.13B.3.295
The integral imaging system is an auto-stereoscopic display that allows users to see 3D images without wearing special glasses. In the integral imaging system, the 3D object information is taken from several view points and stored as elemental images. Then, users can see a 3D reconstructed image by the elemental images displayed through a lens array. The elemental images can be created by computer graphics, which is referred to the computer-generated integral imaging. The process of creating the elemental images is called image mapping. There are some image mapping methods proposed in the past, such as PRR(Point Retracing Rendering), MVR(Multi-Viewpoint Rendering) and PGR(Parallel Group Rendering). However, they have problems with heavy rendering computations or performance barrier as the number of elemental lenses in the lens array increases. Thus, it is difficult to use them in real-time graphics applications, such as virtual reality or real-time, interactive games. In this paper, we propose a new image mapping method named VVR(Viewpoint Vector Rendering) that improves real-time rendering performance. This paper describes the concept of VVR first and the performance comparison of image mapping process with previous methods. Then, it discusses possible directions for the future improvements.
Performance Evaluation of Parameters for applying an Adequate ROI coding method in JPEG2000 Applications
Kang Ki-Jun ; Lee Bu-Kwon ; Seo Yeong-Geon ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 301~308
DOI : 10.3745/KIPSTB.2006.13B.3.301
Currently, the preferred processing of a user-centered ROI(Region-of-Interest) or a specific region of image than the transmission and decompression of a full image is needed in different applications. This preferred processing has been actively studied about from the ROI coding methods in JPEG2000 standards to the new methods complementing them. But, there does not exist an ROI coding method suitable for all applications. Therefore, this study shows a criterion of selection according to the application requirements for applying an adequate ROI coding method in JPEG2000 applications, and shows the experimental results deciding efficient parameters in the selected methods.
A Study on Efficient Feature-Vector Extraction for Content-Based Image Retrieval System
Yoo Gi-Hyoung ; Kwak Hoon-Sung ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 309~314
DOI : 10.3745/KIPSTB.2006.13B.3.309
Recently, multimedia DBMS is appeared to be the core technology of the information society to store, manage and retrieve multimedia data efficiently. In this paper, we propose a new method for content based-retrieval system using wavelet transform, energy value to extract automatically feature vector from image data, and suggest an effective retrieval technique through this method. Wavelet transform is widely used in image compression and digital signal analysis, and its coefficient values reflect image feature very well. The correlation in wavelet domain between query image data and the stored data in database is used to calculate similarity. In order to assess the image retrieval performance, a set of hundreds images are run. The method using standard derivation and mean value used for feature vector extraction are compared with that of our method based on energy value. For the simulation results, our energy value method was more effective than the one using standard derivation and mean value.
Improved Edge Detection Algorithm Using Ant Colony System
Kim In-Kyeom ; Yun Min-Young ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 315~322
DOI : 10.3745/KIPSTB.2006.13B.3.315
Ant Colony System(ACS) is easily applicable to the traveling salesman problem(TSP) and it has demonstrated good performance on TSP. Recently, ACS has been emerged as the useful tool for the pattern recognition, feature extraction, and edge detection. The edge detection is wifely utilized in the area of document analysis, character recognition, and face recognition. However, the conventional operator-based edge detection approaches require additional postprocessing steps for the application. In the present study, in order to overcome this shortcoming, we have proposed the new ACS-based edge detection algorithm. The experimental results indicate that this proposed algorithm has the excellent performance in terms of robustness and flexibility.
Gel Image Matching Using Hopfield Neural Network
Ankhbayar Yukhuu ; Hwang Suk-Hyung ; Hwang Young-Sup ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 323~328
DOI : 10.3745/KIPSTB.2006.13B.3.323
Proteins in a cell appear as spots in a two dimensional gel image which is used in protein analysis. The spots from the same protein are in near position when comparing two gel images. Finding out the different proteins between a normal tissue and a cancer one is important information in drug development. Automatic matching of gel images is difficult because they are made from biological experimental processes. This matching problem is known to be NP-hard. Neural networks are usually used to solve such NP-hard problems. Hopfield neural network is selected since it is appropriate to solve the gel matching. An energy function with location and distance parameters is defined. The two spots which make the energy function minimum are matching spots and they came from the same protein. The energy function is designed to reflect the topology of spots by examining not only the given spot but also neighborhood spots.
Comparison of Significant Term Extraction Based on the Number of Selected Principal Components
Lee Chang-Beom ; Ock Cheol-Young ; Park Hyuk-Ro ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 329~336
DOI : 10.3745/KIPSTB.2006.13B.3.329
In this paper, we propose a method of significant term extraction within a document. The technique used is Principal Component Analysis(PCA) which is one of the multivariate analysis methods. PCA can sufficiently use term-term relationships within a document by term-term correlations. We use a correlation matrix instead of a covariance matrix between terms for performing PCA. We also try to find out thresholds of both the number of components to be selected and correlation coefficients between selected components and terms. The experimental results on 283 Korean newspaper articles show that the condition of the first six components with correlation coefficients of |0.4| is the best for extracting sentence based on the significant selected terms.
Performance Improvement of Word Clustering Using Ontology
Park Eun-Jin ; Kim Jae-Hoon ; Ock Cheol-Young ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 337~344
DOI : 10.3745/KIPSTB.2006.13B.3.337
In this paper, we describe the design and the implementation of word clustering system using a definition of an entry word in the dictionary, called a dictionary definition. Generally word clustering needs various features like words and the performance of a system for the word clustering depends on using some kinds of features. Dictionary definition describes the meaning of an entry in detail, but words in the dictionary definition are implicative or abstractive, and then its length is not long. The word clustering using only features extracted from the dictionary definition results in a lots of small-size clusters. In order to make large-size clusters and improve the performance, we need to transform the features into more general words with keeping the original meaning of the dictionary definition as intact as possible. In this paper, we propose two methods for extending the dictionary definition using ontology. One is to extend the dictionary definition to parent words on the ontology and the other is to extend the dictionary definition to some words in fixed depth from the root of the ontology. Through our experiments, we have observed that the proposed systems outperform that without extending features, and the latter`s extending method overtakes the former`s extending method in performance. We have also observed that verbs are very useful in extending features in the case of word clustering.
Syntactic Category Prediction for Improving Parsing Accuracy in English-Korean Machine Translation
Kim Sung-Dong ;
The KIPS Transactions:PartB, volume 13B, issue 3, 2006, Pages 345~352
DOI : 10.3745/KIPSTB.2006.13B.3.345
The practical English-Korean machine translation system should be able to translate long sentences quickly and accurately. The intra-sentence segmentation method has been proposed and contributed to speeding up the syntactic analysis. This paper proposes the syntactic category prediction method using decision trees for getting accurate parsing results. In parsing with segmentation, the segment is separately parsed and combined to generate the sentence structure. The syntactic category prediction would facilitate to select more accurate analysis structures after the partial parsing. Thus, we could improve the parsing accuracy by the prediction. We construct features for predicting syntactic categories from the parsed corpus of Wall Street Journal and generate decision trees. In the experiments, we show the performance comparisons with the predictions by human-built rules, trigram probability and neural networks. Also, we present how much the category prediction would contribute to improving the translation quality.