• IEIE Transactions on Smart Processing and Computing
• /
• v.1 no.3
• /
• pp.125-132
• /
• 2012

This paper proposes an automatic object segmentation and background composition method for video communication over consumer mobile phones. The object regions were extracted based on the motion and color variance of the first two frames. To combine the motion and variance information, the Euclidean distance between the motion boundary pixel and the neighboring color variance edge pixels was calculated, and the nearest edge pixel was labeled to the object boundary. The labeling results were refined using the morphology for a more accurate and natural-looking boundary. The grow-cut segmentation algorithm begins in the expanded label map, where the inner and outer boundary belongs to the foreground and background, respectively. The segmented object region and a new background image stored a priori in the mobile phone was then composed. In the background composition process, the background motion was measured using the optical-flow, and the final result was synthesized by accurately locating the object region according to the motion information. This study can be considered an extended, improved version of the existing background composition algorithm by considering motion information in a video. The proposed segmentation algorithm reduces the computational complexity significantly by choosing the minimum resolution at each segmentation step. The experimental results showed that the proposed algorithm can generate a fast, accurate and natural-looking background composition.

• 한국HCI학회:학술대회논문집
• /
• 2008.02a
• /
• pp.618-622
• /
• 2008

In this paper, we suggest new music composition algorithm based on fractal theory. User can define and control fractal shape by setting an initial state and production rules in L-System. We generate an asymmetric fractal tree based on L-System and probability. Then a music is generated by the fractal tree image using sonification techniques. We introduce two composition algorithm using the fractal tree. First, monophonic music can be generated by mapping x and y axis to velocity and pitch, respectively Second, harmonic music also can be generated by mapping x and y axis to time and pitch, respectively Using our composition algorithm, user can easily generate a music which has repeated pattern created by recursive feature of fractal, and a music which has structure similar to fractal tree image.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.9 no.3
• /
• pp.63-74
• /
• 1999

In this paper we present a Hangul Encryption Algorithm (HEA) which encrypts composition Hangul syllables into composition Hangul syllables using the non-linear structure of Hangul. Since ciphertexts generated by HEA are displayable characters HEA can be used in applications such as Privacy Enhanced mail (PEM) where ciphertexts should be displayable characters. HEA is based on DES and it can be shown that HEA is as safe as DES against the exhaustive key search differential cryptanalysis and linear cryptanalysis. HEA also has randomness of phonemes of ciphertexts and satisfies plaintext-ciphetext avalanche effect and key-ciphertext avalanche effect.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.1-20
• /
• 2018

Service composition in the Inter-Cloud raises new challenges that are caused by the different Quality of Service (QoS) requirements of the users, which are served by different geo-distributed Cloud providers. This paper aims to explore how to select and compose such services while considering how to reach high efficiency on cost and response time, low network latency, and high reliability across multiple Cloud providers. A new hybrid multi-objective evolutionary algorithm to perform the above task called LS-NSGA-II-DE is proposed, in which the differential evolution (DE) algorithm uses the adaptive mutation operator and crossover operator to replace the those of the Non-dominated Sorting Genetic Algorithm-II (NSGA-II) to get the better convergence and diversity. At the same time, a Local Search (LS) method is performed for the Non-dominated solution set F{1} in each generation to improve the distribution of the F{1}. The simulation results show that our proposed algorithm performs well in terms of the solution distribution and convergence, and in addition, the optimality ability and scalability are better compared with those of the other algorithms.

• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.123-138
• /
• 2009

In recent years, the web services composition search has become an issue of great interest. The web services composition search is the process of integrating individual web services to yield desired behavior. Through the web services composition search, more sophisticated functionalities can be provided. Current solutions can be classified into three main classes: forward chaining approach, backward chaining approach and two-phase approach. However one-way chaining approaches, such as forward chaining approach and backward chaining approach have limitations of searching irrelevant web services. And two-phase approach has limitations of including redundant web services. In this paper, we propose an unredundant web services composition search based on the two-phase algorithm. The algorithm consists of a forward phase and a backward phase. In the forward phase, the candidate web services participating composition will be found efficiently by searching the Link Index. In the backward phase, unredundant web services compositions will be generated from candidate web services by using the Token Manager. The experimental results show that our proposed algorithm is more efficient than one-way chaining approaches. The experimental results also show that our algorithm can provide more solutions than previous two-phase approach and is comparable to previous one in execution time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.6
• /
• pp.139-143
• /
• 2023

In this paper, compared to the RT algorithm that constitutes CT images, the TPSM algorithm available in the conical CB-CT system was applied to enable 3D CT image configuration faster than the existing RT, and the image speeds of the two algorithms were compared and analyzed. To this end, the TPSM algorithm available in the conical CB-CT system was applied to enable real-time processing in 3D CT image composition. As a result of the experiment, it was found that the cross-sectional image constructed using TPSM decreases the quality of the image slightly by empty pixels as the distance from the center point increases, but in the case of TPSM rotation-based methods, the image composition speed is far superior to that of the RT algorithm.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.204-211
• /
• 2016

In this paper, we propose an automatic melody composition system that can generate a sophisticated melody by adding non-harmony tone in the given chord progression. An overall procedure consists of two steps, which are the rhythm generation and melody generation parts. In the rhythm generation part, we designed new fitness functions for rhythm that can be controlled by a user setting parameters. In the melody generation part, we designed new fitness functions for melody based on harmony theory. We also designed evolutionary operators that are conducted by considering a musical context to improve computational efficiency. In the experiments, we compared four metaheuristics to optimize the rhythm fitness functions: Simple Genetic Algorithm (SGA), Elitism Genetic Algorithm (EGA), Differential Evolution (DE), and Particle Swarm Optimization (PSO). Furthermore, we compared proposed genetic algorithm for melody with the four algorithms for verifying performance. In addition, composition results are introduced and analyzed with respect to musical correctness.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.5
• /
• pp.359-368
• /
• 2013

Mashup is a web application that combines several different sources to create new services using Open APIs(Application Program Interfaces). Although the mashup has become very popular over the last few years, there are several challenging issues when combining a large number of APIs into the mashup, especially when composite APIs are manually integrated by mashup developers. This paper proposes a novel algorithm for automatic Open API composition. The proposed algorithm consists of constructing an operation connecting graph and searching composition candidates. We construct an operation connecting graph which is based on the semantic similarity between the inputs and the outputs of Open APIs. We generate directed acyclic graphs (DAGs) that can produce the output satisfying the desired goal. In order to produce the DAGs efficiently, we rapidly filter out APIs that are not useful for the composition. The algorithm is evaluated using a collection of REST and SOAP APIs extracted from ProgrammableWeb.com.

• The KIPS Transactions:PartD
• /
• v.19D no.4
• /
• pp.299-306
• /
• 2012

To fulfill the complex user requirement, composition web service comprised of existing services is considered from the efficient and reusable point of view instead of making entirely new web service. However, with the growing the number of web services which provide the same functionality but differ in quality value, the service composition becomes a decision problem on which component services should be selected such that end-to-end QoS constraints by the client and overall QoS of the composition service are satisfied. QoS of service aspects is a determinant factor for selecting the services, since the performance of the composed service is determined by the performance of the involved component web service. In this paper, hybrid genetic algorithm is presented to select component services to take part in the QoS-aware composition. The local search method is used to be combined with the genetic algorithm to improve the individuals (component service) in population as well as composed service. The paper also presents a set of experiments conducted to evaluate the efficiency of selection algorithm using the real web service data.

• Proceedings of the IEEK Conference
• /
• 2002.06e
• /
• pp.149-152
• /
• 2002

The aim of this study is to analyse the problems occurred by using classical algorithm to synthesize the H$\infty$ optimal controller. The obtained result of analysis applied to the composition of algorithm for the new H$\infty$ optimal controller which was introduced in this study. The study investigates and compares H$\infty$ optimal controller formed by new algorithm with the one formed by classical algorithm. In particular, robustness related to the robust control is systematically described by using the composition of algorithm for the classical H$\infty$ optimal controller. In addition, the flow charts classified into classical algorithm and new one are discussed to synthesize the H$\infty$ optimal controller.