• Journal of the Korea Computer Graphics Society
• /
• v.24 no.1
• /
• pp.27-33
• /
• 2018

This paper presents a new adaptive LSB steganography for high capacity in spatial color images. The number of least signi ficant bit (LSB) of each RGB component in a color image pixel, to replace with the data bits to be hidden, was determine d through analysis of the worst case peak signal noise ratio (PSNR). In addition, the combination of the number of bits is determined adaptively according to image content. That is, 70% of the data to be hidden is proposed to be replaced with 3 bit LSB of two components, 2 bit LSB of the rest component, and 30% be replaced with 4 bit LSB of each RGB compon ent. To find edge areas in an image, delta sorting in local area is also suggested. Using the proposed method, the data cap acity is 9.2 bits per pixel (bpp). The average PSNR value of the tested images with concealed data of up to 60Kbyte was 43.9 db and also natural histograms were generated.

• Journal of Korea Multimedia Society
• /
• v.9 no.1
• /
• pp.59-72
• /
• 2006

The rapid growth of technology for network and terminal devices is able to service multimedia contents in mobile environments. But as the environment of networks and the performance of devices is varied, the same quality service is very difficult to be provided for user in internet and mobile environment. Therefore, multimedia streaming system must provide an adaptive service in considering network and device environment. Video transcoding techniques are the good solution that can provide video streaming service in various network environments adaptively. This paper proposes a dynamic frame-skipping transcoding scheme to provide adaptive streaming service in various network environments. This scheme uses the prediction period for transcoding. A proposed transcoding scheme can reduce time complexity through combination of prediction period and skipping period to control frame-skipping rate in encoder. In simulation results, the performance of proposed scheme is similar to the performance of a traditional dynamic frame-skipping scheme in PSNR value. But the performance of proposed scheme outperforms the performance of traditional scheme in time complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.1957-1967
• /
• 1997

Adaptive channel equlization accomplished without resorting to a training sequence is known as blind equalization. In this paper, in order to reduce the speed of the convergence and the steady-state mean squared error simultaneously, we propose the multi-stage RD(radius-directed) algorithm derived from the combination of the constant modulus algorithm and the radius-directed algorithm. In the starting stage, multi-stage RD algorithm are identical to the constant modulus algorithm which guarantees the convergence of the equalizer. As the blind identical to the constant modulus algorithm which guarantees the convergence of the equalizer. As the blind equalizer converges, the number of the level of the quantizers is increased gradually, so that the proposed algorithm operate identical to the radius-directed algorithm which leads to the low error power after the covnergence. Therefore, the multi-stage RD algorithm obtains fast convergence rage and low steady stage mean square error.

• Smart Structures and Systems
• /
• v.26 no.3
• /
• pp.345-360
• /
• 2020

Modern swarm intelligence heuristic search methods are widely applied in the field of structural health monitoring due to their advantages of excellent global search capacity, loose requirement of initial guess and ease of computational implementation etc. To this end, a hybrid strategy is proposed based on butterfly optimization algorithm (BOA) and differential evolution (DE) with purpose of effective combination of their merits. In the proposed identification strategy, two improvements including mutation and crossover operations of DE, and dynamic adaptive operators are introduced into original BOA to reduce the risk to be trapped in local optimum and increase global search capability. The performance of the proposed algorithm, hybrid butterfly optimization and differential evolution algorithm (HBODEA) is evaluated by two numerical examples of a simply supported beam and a 37-bar truss structure, as well as an experimental test of 8-story shear-type steel frame structure in the laboratory. Compared with BOA and DE, the numerical and experimental results show that the proposed HBODEA is more robust to detect the reduction of stiffness with limited sensors and contaminated measurements. In addition, the effect of search space, two dynamic operators, population size on identification accuracy and efficiency of the proposed identification strategy are further investigated.

• The Journal of the Convergence on Culture Technology
• /
• v.4 no.1
• /
• pp.291-297
• /
• 2018

In this paper, we present an automatic image object tracking system for Studio cameras on the stage. For object tracking, we use the OpenCV-based Python program using PC, Raspberry Pi 3 and mobile devices. There are many methods of image object tracking such as mean-shift, CAMshift (Continuously Adaptive Mean shift), background modelling using GMM(Gaussian mixture model), template based detection using SURF(Speeded up robust features), CMT(Consensus-based Matching and Tracking) and TLD methods. CAMshift algorithm is very efficient for real-time tracking because of its fast and robust performance. However, in this paper, we implement an image object tracking system for studio cameras based CMT algorithm. This is an optimal image tracking method because of combination of static and adaptive correspondences. The proposed system can be applied to an effective and robust image tracking system for continuous object tracking on the stage in real time.

• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.65-74
• /
• 2016

Ship ad-hoc network (SANET) extends the coverage of the maritime communication among ships with the reduced cost. To fulfill the growing demands of real-time services, the SANET requires an efficient clock time synchronization algorithm which has not been carefully investigated under the ad-hoc maritime environment. This is mainly because the conventional algorithms only suggest to decrease the beacon collision probability that diminishes the clock drift among the units. However, the SANET is a very large-scale network in terms of geographic scope, e.g., with 100 km coverage. The key factor to affect the synchronization performance is the signal propagation delay, which has not being carefully considered in the existing algorithms. Therefore, it requires a robust multi-hop synchronization algorithm to support the communication among hundreds of the ships under the maritime environment. The proposed algorithm has to face and overcome several challenges, i.e., physical clock, e.g., coordinated universal time (UTC)/global positioning system (GPS) unavailable due to the atrocious weather, network link stability, and large propagation delay in the SANET. In this paper, we propose a logical clock synchronization algorithm with multi-hop function for the SANET, namely multi-hop clock synchronization for SANET (MCSS). It works in an ad-hoc manner in case of no UTC/GPS being available, and the multi-hop function makes sure the link stability of the network. For the proposed MCSS, the synchronization time reference nodes (STRNs) are efficiently selected by considering the propagation delay, and the beacon collision can be decreased by the combination of adaptive timing synchronization procedure (ATSP) with the proposed STRN selection procedure. Based on the simulation results, we finalize the multi-hop frame structure of the SANET by considering the clock synchronization, where the physical layer parameters are contrived to meet the requirements of target applications.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.2
• /
• pp.179-190
• /
• 2010

This paper describes a new stochastic heuristic algorithm in engineering problem optimization especially in power system applications. An improved particle swarm optimization (PSO) called adaptive particle swarm optimization (APSO), mixed with simulated annealing (SA), is introduced and referred to as APSO-SA. This algorithm uses a novel PSO algorithm (APSO) to increase the convergence rate and incorporate the ability of SA to avoid being trapped in a local optimum. The APSO-SA algorithm efficiency is verified using some benchmark functions. This paper presents the application of APSO-SA to find the optimal location, type and size of flexible AC transmission system devices. Two types of FACTS devices, the thyristor controlled series capacitor (TCSC) and the static VAR compensator (SVC), are considered. The main objectives of the presented method are increasing the voltage stability index and over load factor, decreasing the cost of investment and total real power losses in the power system. In this regard, two cases are considered: single-type devices (same type of FACTS devices) and multi-type devices (combination of TCSC, SVC). Using the proposed method, the locations, type and sizes of FACTS devices are obtained to reach the optimal objective function. The APSO-SA is used to solve the above non.linear programming optimization problem for better accuracy and fast convergence and its results are compared with results of conventional PSO. The presented method expands the search space, improves performance and accelerates to the speed convergence, in comparison with the conventional PSO algorithm. The optimization results are compared with the standard PSO method. This comparison confirms the efficiency and validity of the proposed method. The proposed approach is examined and tested on IEEE 14 bus systems by MATLAB software. Numerical results demonstrate that the APSO-SA is fast and has a much lower computational cost.

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

Web designers generally use a story board, a site map, a flow chart or the combination of these for representing web sites. But these methods are difficult to represent the entire architecture of a web site, and may be not adaptive for describing the detail flow of web pages. To solve these problems to some degree, there were works using EMFG(Extended Mark Flow Graph) recently. However the conventional EMFG representation method is not adaptive to represent the dynamic interface of web sites because that cover only the static parts of a web site. Internet utilization is rapidly growing in our life and we cannot imagine the worlds of work, study and business without internet. And web sites recently have not only more complex and various architecture but also web pages containing the dynamic interface. Therefore we propose the representation method of these web sites - for example, a web site containing varying pages with time and varying page status or contents with mouse operations - using EMFG. We expect our work to be help the design and maintenance of web sites.

• Journal of KIISE:Software and Applications
• /
• v.30 no.11
• /
• pp.1072-1079
• /
• 2003

This study is purported for suggesting a new clustering algorithm that enables incremental categorization of numerous documents. The suggested algorithm adopts the natures of the spherical k-means algorithm, which clusters a mass amount of high-dimensional documents, and the fuzzy ART(adaptive resonance theory) neural network, which performs clustering incrementally. In short, the suggested algorithm is a combination of the spherical k-means vector space model and concept vector and fuzzy ART vigilance parameter. The new algorithm not only supports incremental clustering and automatically sets the appropriate number of clusters, but also solves the current problems of overfitting caused by outlier and noise. Additionally, concerning the objective function value, which measures the cluster's coherence that is used to evaluate the quality of produced clusters, tests on the CLASSIC3 data set showed that the newly suggested algorithm works better than the spherical k-means by 8.04% in average.

• Wind and Structures
• /
• v.28 no.1
• /
• pp.31-47
• /
• 2019

The accurate prediction of snow distributions under the wind action on roofs plays an important role in designing structures in civil engineering in regions with heavy snowfall. Affected by some factors such as building shapes, sizes and layouts, the snow drifting on roofs shows more three-dimensional characteristics. Thus, the research on three-dimensional snow distribution is needed. Firstly, four groups of stepped flat roofs are designed, of which the width-height ratio is 3, 4, 5 and 6. Silica sand with average radius of 0.1 mm is used to model the snow particles and then the wind tunnel test of snow drifting on stepped flat roofs is carried out. 3D scanning is used to obtain the snow distribution after the test is finished and the mean mass transport rate is calculated. Next, the wind velocity and duration is determined for numerical simulations based on similarity criteria. The adaptive-mesh method based on radial basis function (RBF) interpolation is used to simulate the dynamic change of snow phase boundary on lower roofs and then a time-marching analysis of steady snow drifting is conducted. The overall trend of numerical results are generally consistent with the wind tunnel tests and field measurements, which validate the accuracy of the numerical simulation. The combination between the wind tunnel test and CFD simulation for three-dimensional typical roofs can provide certain reference to the prediction of the distribution of snow loads on typical roofs.