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 11B, Issue 7 - Dec 2004
Volume 11B, Issue 6 - Oct 2004
Volume 11B, Issue 5 - Aug 2004
Volume 11B, Issue 4 - Aug 2004
Volume 11B, Issue 3 - Jun 2004
Volume 11B, Issue 2 - Apr 2004
Volume 11B, Issue 1 - Feb 2004
Volume 11, Issue 2 - 00 2004
Volume 11, Issue 1 - 00 2004
Selecting the target year
A Block Matching Algorithm using Motion Vector Predictor Candidates and Adaptive Search Pattern
Kwak, Sung-Keun ; Wee, Young-Cheul ; Kim, Ha-JIne ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 247~256
DOI : 10.3745/KIPSTB.2004.11B.3.247
In this paper, we propose the prediction search algorithm for block matching using the temporal/spatial correlation of the video sequence and the renter-biased property of motion vectors The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(Sum of Absolute Difference) value by the predicted motion vector from the same block of the previous frame and the predictor candidate pint in each search region and the predicted motion vector from the neighbour blocks of the current frame. And the searching process after moving the starting point is processed a adaptive search pattern according to the magnitude of motion vector Simulation results show that PSNR(Peak-to-Signal Noise Ratio) values are improved up to the 0.75dB as depend on the video sequences and improved about 0.05∼0.34dB on an average except the FS (Full Search) algorithm.
Appearance Information Extraction and Shading for Realistic Caricature Generation
Park, Yeon-Chool ; Oh, Hae-Seok ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 257~266
DOI : 10.3745/KIPSTB.2004.11B.3.257
This paper proposes caricature generation system that uses shading mechanism that extracts textural features of face. Using this method, we can get more realistic caricature. Since this system If vector-based, the generated character`s face has no size limit and constraint. so it is available to transform the shape freely and to apply various facial expressions to 2D face. Moreover, owing to the vector file`s advantage, It can be used in mobile environment as small file size This paper presents methods that generate vector-based face, create shade and synthesize the shade with the vector face.
The Interesting Moving Objects Tracking Algorithm using Color Informations on Multi-Video Camera
Shin, Chang-Hoon ; Lee, Joo-Shin ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 267~274
DOI : 10.3745/KIPSTB.2004.11B.3.267
In this paper, the interesting moving objects tracking algorithm using color information on Multi-Video camera is proposed Moving objects are detected by using difference image method and integral projection method to background image and objects image only with hue area, after converting RGB color coordination of image which is input from multi-video camera into HSI color coordination. Hue information of the detected moving area are normalized by 24 steps from 0
It is used for the feature parameters of the moving objects that three normalization levels with the highest distribution and distance among three normalization levels after obtaining a hue distribution chart of the normalized moving objects. Moving objects identity among four cameras is distinguished with distribution of three normalization levels and distance among three normalization levels, and then the moving objects are tracked and surveilled. To examine propriety of the proposed method, four cameras are set up indoor difference places, humans are targeted for moving objects. As surveillance results of the interesting human, hue distribution chart variation of the detected Interesting human at each camera in under 10%, and it is confirmed that the interesting human is tracked and surveilled by using feature parameters at four cameras, automatically
Bone loss Detection in Dental Digital X-ray Image by Structure Analysis
Ahn, Yong-Hak ; Chae, Ok-Sam ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 275~280
DOI : 10.3745/KIPSTB.2004.11B.3.275
In this paper, we propose automatic subtraction radiography algorithms to overcome conventional subtraction radiography`s defects by applying image processing technique. In order to reach these goals, this paper suggests the image alignment method that is necessary for getting subtraction image and ROI(Region Of Interest) focused on a selection method using the structure characteristics in target images. Therefore, we use these methods because they give accurary, consistency and objective information or data to results. According to the results, easily and visually we can identify fine difference int the affected parts wether they have problems or not.
Energy Minimization Model for Pattern Classification of the Movement Tracks
Kang, Jin-Sook ; Kim, Jin-Sook ; Cha, Eul-Young ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 281~288
DOI : 10.3745/KIPSTB.2004.11B.3.281
In order to extract and analyze complex features of the behavior of animals in response to external stimuli such as toxic chemicals, we implemented an adaptive computational method to characterize changes in the behavior of chironomids in response to treatment with the insecticide, diazinon. In this paper, we propose an energy minimization model to extract the features of response behavior of chironomids under toxic treatment, which is applied on the image of velocity vectors. It is based on the improved active contour model and the variations of the energy functional, which are produced by the evolving active contour. The movement tracks of individual chironomid larvae were continuously measured in 0.25 second intervals during the survey period of 4 days before and after the treatment. Velocity on each sample track at 0.25 second intervals was collected in 15-20 minute periods and was subsequently checked to effectively reveal behavioral states of the specimens tested. Active contour was formed around each collection of velocities to gradually evolve to find the optimal boundaries of velocity collections through processes of energy minimization. The active contour which is improved by T. Chan and L. Vese is used in this paper. The energy minimization model effectively revealed characteristic patterns of behavior for the treatment versus no treatment, and identified changes in behavioral states .is the time progressed.
A Wavelet-Based Watermarking Scheme of Digital Image Using ROI Method
Kim, Tae-Jung ; Hong, Choong-Seon ; Sung, Ji-Hyun ; Hwang, Jae-Ho ; Lee, Dae-Young ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 289~296
DOI : 10.3745/KIPSTB.2004.11B.3.289
General watermarking techniques tend not to consider intrinsic characteristics of image, so that watermarks are embeded to entire images. In this paper, we present a watermarking algorithm based on wavelet domain, and the watermark is embedded into large coefficients in region of interest(ROI) being based on principle of multi-threshold watermark coding(MTWC) for robust watermark insertion. We try to accomplish both image duality and robustness using human visual system(HVS). The watermarks are embedded in middle frequency bands because the distortion degree of watermarked images appears to be less than lower frequency bands, and the embedded watermarks in the middle bands showed high extraction ratios after some distortion. The watermarks are consisted of pseudo random sequences and detected using Cox`s similarity mesurement.
Cone Surface Classification and Threshold Value Selection for Description of Complex Objects
Cho, Dong-Uk ; Kim, Ji-Yeong ; Bae, Young-Lae ; Ko, Il-Seok ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 297~302
DOI : 10.3745/KIPSTB.2004.11B.3.297
In this paper, the 3-D shape description for the objects with the cone ridge and valley surfaces, and the corresponding threshold value selection for surface classification are considered. The existing method based on the mean and Gaussian curvatures(H and K) of differential geometries cannot properly describe cone primitives, which are some of the most common objects in the real world. Also the existing method for surface classification based on the sign values of H and K has Problems in practical applications. For this, cone surface shapes are classified cone ridges and cone valleys are derived from surfaces using the fact that H values are constant case of cylinder surfaces and variable for cone surfaces, respectively. Also threshold value selection for surface classification from a statistical point of view is proposed. The effectiveness of the proposed methods are verified through experiments.
Basis Function Truncation Effect of the Gabor Cosine and Sine Transform
Lee, Juck-Sik ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 303~308
DOI : 10.3745/KIPSTB.2004.11B.3.303
The Gabor cosine and sine transform can be applied to image and video compression algorithm by representing image frequency components locally The computational complexity of forward and inverse matrix transforms used in the compression and decompression requires O(
)operations. In this paper, the length of basis functions is truncated to produce a sparse basis matrix, and the computational burden of transforms reduces to deal with image compression and reconstruction in a real-time processing. As the length of basis functions is decreased, the truncation effects to the energy of basis functions are examined and the change in various Qualify measures is evaluated. Experiment results show that 11 times fewer multiplication/addition operations are achieved with less than 1% performance change.
Motion Vector Estimation using T-shape Diamond Search Algorithm
Kim, Ki-Young ; Jung, Mi-Gyoung ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 309~316
DOI : 10.3745/KIPSTB.2004.11B.3.309
In this paper, we proposed the TDS(T-shape Diamond Search) based on the directions of above, below, left and right points to estimate the motion vector fast and more correctly in this method, we exploit the facts that most motion vectors are enclosed in a circular region with a radius of 2 fixels around search center(0,0). At first, the 4 points in the above, below, left and right around the search center is calculated to decide the point of the MBD(Minimum Block Distortion). And then w. above point of the MBD is checked to calculate the SAD. If the SAD of the above point is less than the previous MBD, this process is repeated. Otherwise, the right and left points of MBD are calculated to decide The points that have the MBD between right point and left point. Above processes are repeated to the predicted direction for motion estimation. Especially, if the motions of image are concentrated in the crossing directions, the points of other directions are omitted. As a result, we can estimate motion vectors fast. Experiments show that the speedup improvement of the proposed algorithm over Diamond Search algorithm(DS) and HEXgon Based Search(HEXBS) can be up to 38∼50％ while maintaining similar image Quality.
Multiple Pedestrians Detection and Tracking using Color Information from a Moving Camera
Lim, Jong-Seok ; Kim, Wook-Hyun ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 317~326
DOI : 10.3745/KIPSTB.2004.11B.3.317
This paper presents a new method for the detection of multiple pedestrians and tracking of a specific pedestrian using color information from a moving camera. We first extract motion vector on the input image using BMA. Next, a difference image is calculated on the basis of the motion vector. The difference image is converted to a binary image. The binary image has an unnecessary noise. So, it is removed by means of the proposed noise deletion method. Then, we detect pedestrians through the projection algorithm. But, if pedestrians are very adjacent to each other, we separate them using RGB color information. And we track a specific pedestrian using RGB color information in center region of it. The experimental results on our test sequences demonstrated the high efficiency of our approach as it had shown detection success ratio of 97％ and detection failure ratio of 3％ and excellent tracking.
Development of an Edge-based Point Correlation Algorithm Avoiding Full Point Search in Visual Inspection System
Kang, Dong-Joong ; Kim, Mun-Jo ; Kim, Min-Sung ; Lee, Eung-Joo ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 327~336
DOI : 10.3745/KIPSTB.2004.11B.3.327
For visual inspection system in real industrial environment, it is one of most important tasks to design fast and stable pattern matching algorithm. This paper presents an edge-based point correlation algorithm avoiding full search in visual inspection system. Conventional algorithms based on NGC(normalized gray-level correlation) have to overcome some difficulties for applying to automated inspection system in factory environment. First of all, NGC algorithms need high time complexity and thus high performance hardware to satisfy real-time process. In addition, lighting condition in realistic factory environments if not stable and therefore intensity variation from uncontrolled lights gives many roubles for applying directly NGC as pattern matching algorithm in this paper, we propose an algorithm to solve these problems from using thinned and binarized edge data and skipping full point search with edge-map analysis. A point correlation algorithm with the thinned edges is introduced with image pyramid technique to reduce the time complexity. Matching edges instead of using original gray-level pixel data overcomes NGC problems and pyramid of edges also provides fast and stable processing. All proposed methods are preyed from experiments using real images.
A Cell Loading Algorithm for Realtime Navigation in the Web-Based Virtual Space
Lee, Ki-Dong ; Ha, Ju-Han ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 337~344
DOI : 10.3745/KIPSTB.2004.11B.3.337
Most of the virtual space constructed sufficiently realistic need a lot of memory space to navigate smoothly. And this kind of virtual space also requires real-time responsibility for the navigation as well as realism. In the off-line virtual system, real-time responsibility can be resolved by using large scale if secondary memory. In the web-based online virtual system, on the other hand, real-time responsibility is highly related to the latency time of network data communication. This induces the necessity of the algorithm for fast data loading. In this paper, we propose and verify the validity of the two methodology for cell leading algorithm. According to the results of computer simulation, the algorithm using hexagonal type cell promotes the real-time responsibility over 30％ than that of the rectangular type.
A Study on the Sound Quality Improvement Using the Equal Compensation Filter in Bark-scale for the Cross-talk Cancellation
Kim, Hack-Jin ; Kim, Soon-Hyub ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 345~352
DOI : 10.3745/KIPSTB.2004.11B.3.345
This paper deals a method to deliver more realistic sound by cancelling the cross-talk which is inherent to the 5.1 channel speaker system. The acoustical model for cross-talk cancellation is the free field model. This model minimizes distortion of sound. 1 used the bark scale sound quality compensation which based on psycho-acoustic. For the surround channels, band-limited sound quality compensation is performed in the frequency domain. I also performed the sound qualify assessment test on the traditional 2 channel stereo and 5.1 channel system. This test is performed in the tort chamber which satisfies the ITU-R specifications. 1 uses the IACC(Inter-Aural Cross-Correlation) to determine the preferences of the amateur and the golden ear experts to asses the trans-aural filter. According to the result from the proposed method, I got more the 38dB separation rates with the Dolby standard speaker array. The results on the diffusion by the subjective test with the experts shows 0.4∼0.5 point Increased then before.
Scene Change Detection with Sequential Access Method in Compressed MPEG Videos
Ahn, Eui-Sub ; Song, Hyun-Soo ; Lee, Jae-Dong ; Kim, Sung-Un ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 353~360
DOI : 10.3745/KIPSTB.2004.11B.3.353
The study on scene change detection in the compressed MPEG videos has been done by various approaches. However, most of these approacher accomplished scene change detection by carrying out decoding processes and then by comparing pixels with pixels. This approach it not suitable for real time applications owing to much computing time of decoding processes. Recently, the study on scene change detection algorithms using only information of compressed domain is becoming Increasingly important. In this paper, we propose a sequential access method as an efficient scene change detection algorithm in the compressed domain. According to the type of pictures in the compressed MPEG video streams (divided in I-blocks and each I-block into P-blocks), the proposed algorithm provides effective scene change detection by applying sequential access and block by block mechanism. The proposed sequential access method provides fast and accurate detection operation by reducing checking procedures of unnecessary pictures due to molt of operations in compressed domain and checking by block units. Also, this approach uses optimal algorithm to provide fast and accurate detection operation.
Multicast VOD System for Interactive Services in the Head-End-Network
Kim, Back-Hyun ; Hwang, Tae-June ; Kim, Ik-Soo ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 361~368
DOI : 10.3745/KIPSTB.2004.11B.3.361
This paper proposes an interactive VOD system to serve truly interactive VCR services using multicast delivery, client buffer and web-caching technique which implements the distributed proxy in Head-End- Network(HNET). This technique adopts some caches in the HNET that consists of a Switching Agent(SA), some Head-End-Nodes(HEN) and many clients. In this model, HENs distributively store the requested video under the control of SA. Also, client buffer dynamically expands to support various VCR playback rate. Thus, interactive services are offered with transmitting video streams from network, HENs and stored streams on buffer. Therefore this technique makes the load of network occur In the limited area, minimizes the additional channel allocation from server and restricts the transmission of duplicated video contents
Improving Performance of Search Engine By Using WordNet-based Collaborative Evaluation and Hyperlink
Kim, Hyun-Gil ; Kim, Jun-Tae ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 369~380
DOI : 10.3745/KIPSTB.2004.11B.3.369
In this paper, we propose a web page weighting scheme based on WordNet-based collaborative evaluation and hyperlink to improve the precision of web search engine. Generally search engines use keyword matching to decide web page ranking. In the information retrieval from huge data such as the Web, simple word comparison cannot distinguish important documents because there exist too many documents with similar relevancy. In this paper, we implement a WordNet-based user interface that helps to distinguish different senses of query word, and constructed a search engine in which the implicit evaluations by multiple users are reflected in ranking by accumulating the number of clicks. In accumulating click counts, they are stored separately according to lenses, so that more accurate search is possible. Weighting of each web page by using collaborative evaluation and hyperlink is reflected in ranking. The experimental results with several keywords show that the precision of proposed system is improved compared to conventional search engines.
Independent Component Analysis of Fixed-Point Algorithm for Clustering Components Using Kurtosis
Cho, Yong-Hyun ; Kim, A-Ram ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 381~386
DOI : 10.3745/KIPSTB.2004.11B.3.381
This paper proposes an independent component analysis(ICA) of the fixed-point(FP) algorithm based on Newton method by adding the kurtosis. The kurtosis is applied for clustering the components, and the FP algorithm of Newton method is applied for improving the analysis speed and performance. The proposed ICA has been applied to the problems for separating the 6-mixed signals of 500 samples and 8-mixed images of
pixels, respectively. The experimental results show that the proposed ICA has always a fixed analysis sequence. The result can be solved the limit of conventional ICA which has a variable sequence depending on the running of algorithm. Especially, the proposed ICA can be used to classify and identify the signals or the images.
Construction of Linearly Aliened Corpus Using Unsupervised Learning
Lee, Kong-Joo ; Kim, Jae-Hoon ;
The KIPS Transactions:PartB, volume 11B, issue 3, 2004, Pages 387~394
DOI : 10.3745/KIPSTB.2004.11B.3.387
In this paper, we propose a modified unsupervised linear alignment algorithm for building an aligned corpus. The original algorithm inserts null characters into both of two aligned strings (source string and target string), because the two strings are different from each other in length. This can cause some difficulties like the search space explosion for applications using the aligned corpus with null characters and no possibility of applying to several machine learning algorithms. To alleviate these difficulties, we modify the algorithm not to contain null characters in the aligned source strings. We have shown the usability of our approach by applying it to different areas such as Korean-English back-trans literation, English grapheme-phoneme conversion, and Korean morphological analysis.