• Journal of KIISE:Software and Applications
• /
• v.31 no.3
• /
• pp.379-386
• /
• 2004

Video segmentation is a fundamental task in video indexing and it includes two kinds of shot change detections such as the abrupt transition and the gradual transition. The abrupt shot boundaries are detected by computing the image-based distance between adjacent frames and comparing this distance with a pre-determined threshold value. However, the gradual shot boundaries are difficult to detect with this approach. To overcome this difficulty, we propose the method that detects gradual transition in the MPEG compressed video using the HMM (Hidden Markov Model). We take two different HMMs such as a discrete HMM and a continuous HMM with a Gaussian mixture model. As image features for HMM's observations, we use two distinct features such as the difference of histogram of DC images between two adjacent frames and the difference of each individual macroblock's deviations at the corresponding macroblock's between two adjacent frames, where deviation means an arithmetic difference of each macroblock's DC value from the mean of DC values in the given frame. Furthermore, we obtain the DC sequences of P and B frame by the first order approximation for a fast and effective computation. Experiment results show that we obtain the best detection and classification performance of gradual transitions when a continuous HMM with one Gaussian model is taken and two image features are used together.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.10
• /
• pp.474-492
• /
• 2007

In the protein interaction network, there are many meaningful functional modules, each involving several protein interactions to perform discrete functions. Pathways and protein complexes are the examples of the functional modules. In this paper, we propose a new method for detecting the functional modules based on concept. A conceptual functional module, briefly concept module is introduced to match the modules taking them as its instances. It is defined by the corresponding rule composed of triples and operators between the triples. The triples represent conceptual relations reifying the protein interactions of a module, and the operators specify the structure of the module with the relations. Furthermore, users can define a composite concept module by the counterpart rule which, in turn, is defined in terms of the predefined rules. The concept module makes it possible to detect functional modules that are conceptually similar as well as structurally identical to users' queries. The rules are managed in the XML format so that they can be easily applied to other networks of different species. In this paper, we also provide a visualized environment for intuitionally describing complexly structured rules.

• Journal of Korean Society of Forest Science
• /
• v.81 no.3
• /
• pp.263-272
• /
• 1992

In a torrential river, the flow of debris forms deposits in the river bed, which show the characteristics of the channel bed movement in the watershed. The annual rings of the trees, in the natural evenaged forests on the deposits, indicate when each deposit occurred. Based on the topographical and vegetational indicators on the sediment of Yongcheon and Yeounae rivers, the movement occurrence years were estimated. 1. The cross sectional shapes of deposits in torrential river are in tiers and even-aged forests tend to establish on each tier. 2. Generally the older the forest age is, the higher the height of step from the lowest base tend to become, which indicates discrete movement in magnitude and frequency. 3. The ages of trees indicate the year when deposition occurred, and so may be useful as plant indicator to get spatial-temporal information of deposits. 4. The deposits volumes(F. V.) were dependent on the age distribution of deposits in length, average width and average height. And the average width and the average height of deposits were increasing with the age.

• The KIPS Transactions:PartB
• /
• v.12B no.6 s.102
• /
• pp.637-646
• /
• 2005

Most of the multimedia contents for DBM services art provided as MPEG-2 bit streams. However, they have to be transcoded to H.264 bit streams for practical services because the standard video codec for DMB is H.264. The existing transcoder architecture is Cascaded Pixel-Domain Transcoding Architecture, which consists of the MPEG-2 dacoding phase and the H.264 encoding phase. This architecture can be easily implemented using MPEG-2 decoder and H.264 encoder without source modifying. However. It has disadvantages in transcoding time and DCT-mismatch problem. In this paper, we propose two kinds of transcoder architecture, DCT-OPEN and DCT-CLOSED, to complement the CPDT architecture. Although DCT-OPEN has lower PSNR than CPDT due to drift problem, it is efficient for real-time transcoding. On the contrary, the DCT-CLOSED architecture has the advantage of PSNR over CPDT at the cost of transcoding time.

• The KIPS Transactions:PartA
• /
• v.11A no.4
• /
• pp.277-284
• /
• 2004

This paper presents a facial expression control method of 3D avatar that enables the user to select a sequence of facial frames from the facial expression space, whose level of details the user can select hierarchically. Our system creates the facial expression spare from about 2,400 captured facial frames. But because there are too many facial expressions to select from, the user faces difficulty in navigating the space. So, we visualize the space hierarchically. To partition the space into a hierarchy of subspaces, we use fuzzy clustering. In the beginning, the system creates about 11 clusters from the space of 2,400 facial expressions. The cluster centers are displayed on 2D screen and are used as candidate key frames for key frame animation. When the user zooms in (zoom is discrete), it means that the user wants to see mort details. So, the system creates more clusters for the new level of zoom-in. Every time the level of zoom-in increases, the system doubles the number of clusters. The user selects new key frames along the navigation path of the previous level. At the maximum zoom-in, the user completes facial expression control specification. At the maximum, the user can go back to previous level by zooming out, and update the navigation path. We let users use the system to control facial expression of 3D avatar, and evaluate the system based on the results.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.5
• /
• pp.199-212
• /
• 2008

Software simulation has been widely used for the design and application development of a large-scale wireless sensor network. The degree of details of the simulation must be high to verify the behavior of the network and to estimate its execution time and power consumption of an application program as accurately as possible. But, as the degree of details becomes higher, the simulation time increases. Moreover, as the number of sensor nodes increases, the time tends to be extremely long. We propose an optimal-synchronous parallel discrete-event simulation method to shorten the time in a large-scale sensor network simulation. In this method, sensor nodes are partitioned into subsets, and each PC that is interconnected with others through a network is in charge of simulating one of the subsets. Results of experiments using the parallel simulator developed in this study show that, in the case of the large number of sensor nodes, the speedup tends to approach the square of the number of PCs participating in the simulation. In such a case, the ratio of the overhead due to parallel simulation to the total simulation time is so small that it can be ignored. Therefore, as long as PCs are available, the number of sensor nodes to be simulated is not limited. In addition, our parallel simulation environment can be constructed easily at the low cost because PCs interconnected through LAN are used without change.

• Environmental and Resource Economics Review
• /
• v.13 no.2
• /
• pp.219-243
• /
• 2004

Generally, electricity market has monopoly market structure because of need of enormous investment for infrastructure. However, the introduction of competition in network industry as electricity is a tendency of the world with decreasing the effects of economy of scale due to the advancement of technology. Now, electricity industry restructuring is in progress but the competition in electricity retail market is not in force yet in Korea. Whether a effective competition exist or not is very important to policy decision maker who drive restructuring, but there are small numbers of quantitative researches on that. In this study, we estimated the effectiveness of competition in the electricity retail market through switching costs. If switching costs are high, consumers actually can be locked in incumbent firm in spite of introduction of competition. Therefore switching is a critical factor to determine effectiveness of competition and to estimate the size of switching costs quantitatively can proffer the information about whether the competition in the electricity retail market is effective or not in the future. We estimated switching costs using consumer' stated-preference data by conjoint analysis. In according to estimation results, the cost of switching process is not so high, but the relative brand loyalty of an incumbent company is significantly high. And the price is considered as the most important factor choosing an electric service commodity. Based on the empirical results, it is possible to analyze the relationship between suppliers' competitiveness resulted from management efficiency and customers' switching possibilities. The paper therefore provides guidance for suppliers in deciding to enter into retail competition and for policy makers in introducing retail competition. And it has a significance of estimating the switching costs directly.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.7
• /
• pp.42-48
• /
• 2016

In this paper, a high-precision peak detector circuit that detects the output voltage information of a fly-back converter is proposed. The proposed design consists of basic analog elements with only one operational amplifier and three transistors. Because of its simple structure, the proposed circuit can minimize the delay time of the detection process, which has a strong impact on the precision of the regulation aspect of the fly-back converter. Furthermore, by using an amplifier and several transistors, the proposed detector can be fully integrated on-chip, instead of using discrete circuit elements, such as capacitors and diodes, as in conventional designs, which reduces the production cost of the fly-back converter module. In order to verify the performance of the proposed scheme, the peak detector was simulated and implemented by using a 0.35 m MagnaChip process. The gained results from the simulation with a sinusoidal stimulus signal show a very small detection error in the range of 0.3~3.1%, which is much lower than other reported detecting circuits. The measured results from the fabricated chip confirm the simulation results. As a result, the proposed peak detector is recommended for designs of high-performance fly-back converters in order to improve the poor regulation aspect seen in conventional designs.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.3 s.345
• /
• pp.48-58
• /
• 2006

This paper presents 8x8 two dimensional DCT/IDCT processor of adder-based distributed arithmetic architecture without applying ROM units in conventional memories. To reduce hardware cost in the coefficient matrix of DCT and IDCT, an odd part of the coefficient matrix was shared. The proposed architecture uses only 29 adders to compute coefficient operation in the 2-D DCT/IDCT processor, while 1-D DCT processor consists of 18 adders to compute coefficient operation. This architecture reduced 48.6% more than the number of adders in 8x8 1-D DCT NEDA architecture. Also, this paper proposed a form of new transpose network which is different from the conventional transpose memory block. The proposed transpose network block uses 64 registers with reduction of 18% more than the number of transistors in conventional memory architecture. Also, to improve throughput, eight input data receive eight pixels in every clock cycle and accordingly eight pixels are produced at the outputs.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.1
• /
• pp.1-10
• /
• 2000

In this paper, a new digital watermarking algorithm using wavelet transform is proposed. Wavelet transform is widely used for image processing, because of its multiresolution characteristic which conforms to the principles of the human visual system(HVS). It is also very efficient for localizing images in the spatial and frequency domain. Since wavelet coefficients can be characterized by the gaussian distribution, the proposed algorithm uses a gaussian distributed random vector as the watermark in order to achieve invisibility and robustness. After the original image is transformed using DWT(Discrete Wavelet Transform), the coefficients of all subbands including LL subband are utilized to equally embed the watermark to the whole image. To select perceptually significant coefficients for each subband, we use level-adaptive thresholding. The watermark is embedded to the selected coeffocoents, using different scale factors according to the wavelet characteristics. In the process of watermark detection, the similarity between the original watermark and the extracted watermark is calculated by using vector projection method. We analyze the performance of the proposed algorithm, compared with other transform-domain watermarking methods. The experimental results tested on various images show that the proposed watermark is less visible to human eyes and more robust to image compressions, image processings, geometric transformations and various noises, than the existing methods.