• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.223-232
• /
• 2005

In this paper, we propose a novel post-filtering algorithm with low computational complexity that improves the visual quality of decoded images using block boundary classification and simple adaptive filter (SAF). At first, each block boundary is classified into smooth or complex sub-region. And for smooth-smooth sub-regions, the existence of blocking artifacts is determined using blocky strength. And simple adaptive filtering is processed in each block boundary area. The proposed method processes adaptively, that is, a nonlinear 1-D 8-tap filter is applied to smooth-smooth sub-regions with blocking artifacts, and for smooth-complex or complex-smooth sub-regions, a nonlinear 1-D variant filter is applied to block boundary pixels so as to reduce the blocking and ringing artifacts. And for complex-complex sub-regions, a nonlinear 1-D 2-tap filter is only applied to adjust two block boundary pixels so as to preserve the image details. Experimental results show that the proposed algorithm produced better results than those of conventional algorithms both subjective and objective viewpoints.

• The KIPS Transactions:PartD
• /
• v.13D no.7 s.110
• /
• pp.857-866
• /
• 2006

Performance of an image retrieval system is usually very low because of the semantic gap between the low level feature and the high level concept in a query image. Semantically relevant images may exhibit very different visual characteristics, and may be scattered in several clusters. In this paper, we propose a content based image rertrieval approach which combines region based image retrieval and a new relevance feedback method using adaptive clustering together. Our main goal is finding semantically related clusters to narrow down the semantic gap. Our method consists of region based clustering processes and cluster-merging process. All segmented regions of relevant images are organized into semantically related hierarchical clusters, and clusters are merged by finding the number of the latent clusters. This method, in the cluster-merging process, applies r: using v principal components instead of classical Hotelling's $T_v^2$ [1] to find the unknown number of clusters and resolve the singularity problem in high dimensions and demonstrate that there is little difference between the performance of $T^2$ and that of $T_v^2$. Experiments have demonstrated that the proposed approach is effective in improving the performance of an image retrieval system.

• Korean Journal of Remote Sensing
• /
• v.31 no.5
• /
• pp.395-408
• /
• 2015

High-resolution satellite image mosaics are becoming increasingly important in the field of remote sensing image analysis as an essential image processing to create a large image constructed from several smaller images. In this paper, we present an automatic seamline extraction technique and the procedure to generate a mosaic image by this technique. For more effective seamline extraction in the overlap region of adjacent images, an NDVI-based seamline extraction technique is developed, which takes advantage of the computational time and memory. The Normalized Difference Vegetation Index(NDVI) is an index of plant "greeness" or photosynthetic activity that is employed to extract the initial seamline. The NDVI can divide into manmade region and natural region. The cost image is obtained by the canny edge detector and the buffering technique is used to extract the ranging cost image. The seamline is extracted by applying the Dijkstra algorithm to a cost image generated through the labeling process of the extracted edge information. Histogram matching is also conducted to alleviate radiometric distortion between adjacent images acquired at different time. In the experimental results using the KOMPSAT-2/3 satellite imagery, it is confirmed that the proposed method greatly reduces the visual discontinuity caused by geometric difference of adjacent images and the computation time.

• Journal of the HCI Society of Korea
• /
• v.7 no.2
• /
• pp.25-34
• /
• 2012

A veterinary student learns and experiences veterinary processes though experiments and practices using real animals. However, animal protection laws regulate animal experiments and restrict number of the experiments on laboratory animals, veterinary students would have less chances of the experiments and the practices for their veterinary training with real animals. This paper proposes a simulator for veterinary education based on augmented reality (AR). We selected an intravenous injection procedure for the simulation because the injection procedure is the most frequently used procedure during veterinary training and the most difficult stage for beginning veterinary students. The proposed AR simulator provides with a tangible prop, of which shape looks like a leg of a real dog. It also has a injection simulator, which receives user's input and sends force feedbacks to indicate results of the injection simulation. We developed a WorkBench type AR system with an LED display and cameras for visual information processing. Finally, we evaluated its performance through experiments and user studies to check its acceptance level and usability of the proposed system. We compared the proposed system with a traditional video based education and an AR based system using a head mounded display (HMD). The results that the proposed system showed better performances over these systems.

• The KIPS Transactions:PartD
• /
• v.16D no.3
• /
• pp.339-352
• /
• 2009

There are a number of formal methods for distributed real-time systems in ubiquitous computing to analyze and verify the behavioral, temporal and the spatial properties of the systems. However most of the methods reveal structural and fundamental limitations of complexity due to mixture of spatial and behavioral representations. Further temporal specification makes the complexity more complicate. In order to overcome the limitations, this paper presents a new formal method, called Timed Calculus of Abstract Real-Time Distribution, Mobility and Interaction(t-CARDMI). t-CARDMI separates spatial representation from behavioral representation to simplify the complexity. Further temporal specification is permitted only in the behavioral representation to make the complexity less complicate. The distinctive features of the temporal properties in t-CARDMI include waiting time, execution time, deadline, timeout action, periodic action, etc. both in movement and interaction behaviors. For analysis and verification of spatial and temporal properties of the systems in specification, t-CARDMI presents Timed Action Graph (TAG), where the spatial and temporal properties are visually represented in a two-dimensional diagram with the pictorial distribution of movements and interactions. t-CARDMI can be considered to be one of the most innovative formal methods in distributed real-time systems in ubiquitous computing to specify, analyze and verify the spatial, behavioral and the temporal properties of the systems very efficiently and effectively. The paper presents the formal syntax and semantics of t-CARDMI with a tool, called SAVE, for a ubiquitous healthcare application.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.1
• /
• pp.55-68
• /
• 2012

In this paper, we propose a novel method to solve the problem of excessive segmentation out of the method of segmenting regions from an image using Homogeneity Threshold($H_T$). The algorithm of the previous image segmentation based on $H_T$ was carried out region growth by using only the center pixel of selected window. Therefore it was caused resulting in excessive segmented regions. However, before carrying region growth, the proposed method first of all finds out whether the selected window is homogeneity or not. Subsequently, if the selected window is homogeneity it carries out region growth using the total pixels of selected window. But if the selected window is not homogeneity, it carries out region growth using only the center pixel of selected window. So, the method can reduce remarkably the number of excessive segmented regions of image segmentation based on $H_T$. In order to show the validity of the proposed method, we carried out multiple experiments to compare the proposed method with previous method in same environment and conditions. As the results, the proposed method can reduce the number of segmented regions above 40% and doesn't make any difference in the quality of visual image when we compare with previous method. Especially, when we compare the image united with regions of descending order by size of segmented regions in experimentation with the previous method, even though the united image has regions more than 1,000, we can't recognize what the image means. However, in the proposed method, even though image is united by segmented regions less than 10, we can recognize what the image is. For these reason, we expect that the proposed method will be utilized in various fields, such as the extraction of objects, the retrieval of informations from the image, research for anatomy, biology, image visualization, and animation and so on.

• The KIPS Transactions:PartD
• /
• v.15D no.5
• /
• pp.713-720
• /
• 2008

Fingerprinting scheme uses digital watermarks to trace originator of unauthorized or pirated copies, however, multiple users may collude and escape identification by creating an average or median of their individually watermarked copies. Previous research works are based on ACC (anti-collusion code) for identifying each user, however, ACC are shown to be resilient to average and median attacks, but not to LCCA and cannot support large number of users. In this paper, we propose a practical SACC (scalable anti-collusion code) scheme and its angular decoding strategy to support a large number of users from basic ACC (anti-collusion code) with LCCA (linear combination collusion attack) robustness. To make a scalable ACC, we designed a scalable extension of ACC codebook using a Gaussian distributed random variable, and embedded the resulting fingerprint using human visual system based watermarking scheme. We experimented with standard test images for colluder identification performance, and our scheme shows good performance over average and median attacks. Our angular decoding strategy shows performance gain over previous decoding scheme on LCCA colluder set identification among large population.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.4
• /
• pp.309-318
• /
• 2004

This paper proposes the H.264-based selective fine granular scalable (FGS) coding scheme that selectively uses the temporal prediction data in the enhancement layer. The base layer of the proposed scheme is basically coded by the H.264 (MPEG-4 Part 10 AVC) visual coding scheme that is the state-of-art in codig efficiency. The enhancement layer is basically coded by the same bitplane-based algorithm of the MPEG-4 (Part 2) fine granular scalable coding scheme. In this paper, we introduce a new algorithm that uses the temproal prediction mechanism inside the enhancement layer and the effective selection mechanism to decide whether the temporally-predicted data would be sent to the decoder or not. Whenever applying the temporal prediction inside the enhancement layer, the temporal redundancies may be effectively reduced, however the drift problem would be severly occurred especially at the low bitrate transmission, due to the mismatch bewteen the encoder's and decoder's reference frame images. Proposed algorithm selectively uses the temporal-prediction data inside the enhancement layer only in case those data could siginificantly reduce the temporal redundancies, to minimize the drift error and thus to improve the overall coding efficiency. Simulation results, based on several test image sequences, show that the proposed scheme has 1∼3 dB higher coding efficiency than the H.264-based FGS coding scheme, even 3∼5 dB higher coding efficiency than the MPEG-4 FGS international standard.

• The KIPS Transactions:PartC
• /
• v.18C no.4
• /
• pp.265-278
• /
• 2011

The objective of this paper is to analyze and characterize end-to-end packet statistics after modeling and simulation of WiFi (IEEE 802.11g) and WiMAX (IEEE 802.16e) of a virtual wireless network using OPNET Modeler Wireless Suite. Wireless internal and external network simulators such as Remcom's Wireless InSite Real Time (RT) module, WinProp: W-LAN/Fixed WiMAX/Mobile WiMAX, and SMI system, are designed to consider data transfer rate based on wireless propagation signal strength. However, we approached our research in a different perspective without support for characteristic of these wireless network simulators. That is, we will discuss the purpose of a visual analysis for these packets, how to receive each point packets (e.g., wireless user, base station or access point, and http server) through end-to-end virtual network modeling based on integrated wired and wireless network without wireless propagation signal strength. Measuring packet statistics is important in QoS metric analysis among wireless network performance metrics. Clear packet statistics is an especially essential metric in guaranteeing QoS for WiMAX users. We have found some interesting results through modeling and simulation for virtual wireless network using OPNET Modeler Wireless Suite. We are also able to analyze multi-view efficiency through experiment/observation result.

• The KIPS Transactions:PartB
• /
• v.17B no.3
• /
• pp.197-206
• /
• 2010

High-quality and low-price digital printing devices are nowadays abused to print or forge official documents and bills. Identifying color laser printers will be a step for media forensics. This paper presents a new method to identify color laser printers with printed color images. Since different printer companies use different manufactural systems, printed documents from different printers have little difference in visual. Analyzing this artifact, we can identify the color laser printers. First, high-frequency components of images are extracted from original images with discrete wavelet transform. After calculating the gray-level co-occurrence matrix of the components, we extract some statistical features. Then, these features are applied to train and classify the support vector machine for identifying the color laser printer. In the experiment, total 2,597 images of 7 printers (HP, Canon, Xerox DCC400, Xerox DCC450, Xerox DCC5560, Xerox DCC6540, Konica), are tested to classify the color laser printer. The results prove that the presented identification method performs well with 96.9% accuracy.