• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.395-400
• /
• 2005

The IEEE 802.11b WLAN supports multiple transmission rates and the rate is chosen in an adaptive manner by an auto rate control algorithm. This auto rate control algorithm deeply affects the total system performance of the IEEE 802.11b WLAN. In this paper, we examine the WLAN performance with regard to the auto rate control algorithm especially the ARF scheme. The experimental results indicate that the ARF scheme works well in the face of signal noise due to node location. However, the ARF scheme severely degrades system performance when multiple nodes contend to obtain the wireless channel and the packet is lost due to signal collision. In addition, TCP prevent the performance degradation due to ARF scheme by retaining number of active nodes. However, some applications, such as transporting multimedia data, adopt the UDP. Therefore, the TCP cannot be an optimal solution for all WLAN applications.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.365-372
• /
• 2000

he paper introduces evolutionary computing to Fractal Image Compression(FIC). In Fractal Image Compression(FIC) a partitioning of the image into ranges is required. As a solution to this problem there is a propose that evolution computation should be applied in image partitionings. Here ranges are connected sets of small square image blocks. Populations consist of $N_p$ configurations, each of which is a partitioning with a fractal code. In the evolution each configuration produces $\sigma$ children who inherit their parent partitionings except for two random neighboring ranges which are merged. From the offspring the best ones are selected for the next generation population based on a fitness criterion Collage Theorem. As the optimum image includes duplication in image data, it gets smaller in saving space more efficient in speed and more capable in image quality than any other technique in which other coding is used. Fractal Image Compression(FIC) using evolution computation in multimedia image processing applies to such fields as recovery of image and animation which needs a high-quality image and a high image-compression ratio.

• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.74-83
• /
• 2000

There is a rapid increase in the use of digital video information in recent years. Especially, user requires the environment which retrieves video from passive access to active access, to be more efficiently. we need to implement video retrieval system including video parsing, clustering, and browsing to satisfy user's requirement. In this paper, we first divide video sequence to shots which are primary unit for automatic indexing, using a hybrid method with mixing histogram method and pixel-based method. After the shot boundaries are detected, corresponding key frames can be extracted. Key frames are very important portion because they help to understand overall contents of video. In this paper, we first analyze camera operation in video and then select different number of key frames depend on shot complexity. At last, we compose panorama images from shots which are containing panning or tilting in order to provide more useful and understandable browsing environment to users.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.269-280
• /
• 2004

The Pyramid-Technique is based on mapping n-dimensional space data into one-dimensional data and expresses it as a B+-tree. By solving the problem of search time complexity the pyramid technique also prevents the effect of "phenomenon of dimensional curse" which is caused by treatment of hypercube range query in n-dimensional data space. The SPY-TEC applies the space division strategy in pyramid method and uses spherical range query suitable for similarity search so that Improves the search performance. However, nearest neighbor query is more efficient than range query because it is difficult to specify range in similarity search. Previously proposed index methods perform well only in the specific distribution of data. In this paper, we propose an efficient searching technique for nearest neighbor object using PdR-Tree suggested to improve the search performance for high dimensional data such as multimedia data. Test results, which uses simulation data with various distribution as well as real data, demonstrate that PdR-Tree surpasses both the Pyramid-Technique and SPY-TEC in views of search performance.rformance.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.11
• /
• pp.66-78
• /
• 2015

With the development of bio computing technology, DNA watermarking to do as a medium of DNA information has been researched in the latest time. However, DNA information is very important in biologic function unlikely multimedia data. Therefore, the reversible DNA watermarking is required for the host DNA information to be perfectively recovered. This paper presents a reversible DNA watermarking using least square based prediction error expansion for noncodng DNA sequence. Our method has three features. The first thing is to encode the character string (A,T,C,G) of nucleotide bases in noncoding region to integer code values by grouping n nucleotide bases. The second thing is to expand the prediction error based on least square (LS) as much as the expandable bits. The last thing is to prevent the false start codon using the comparison searching of adjacent watermarked code values. Experimental results verified that our method has more high embedding capacity than conventional methods and mean prediction method and also makes the prevention of false start codon and the preservation of amino acids.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.8 no.11
• /
• pp.523-530
• /
• 2018

It has been studied over the long time for the high efficiency and high power density of the power converter. It is possible to obtain higher power conversion efficiency and small volume by increasing switching frequency, however, the switching loss is also increased. The soft switching technique can overcome of the above deficiency. The design and analysis method for ZVS(Zero Voltage Switching) Phase Shifte Full bridge converter is presented in this paper. The power transfer depends on the phase difference between two legs of the power stage and the maximum power conversion efficiency is achieved by the optimum leakage inductance value. The waveform of the current and voltage of the operational mode is analysed and the corresponding switch status is plotted as on/off status. A ZVS full bridge converter for a communication rectifier with 2kW output power is implemented and its performance are verified through PSIM software simulation and experimental results.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.5 no.2
• /
• pp.223-230
• /
• 2015

Due to the conversion from the existing address system to road name address system, the versatility of the road name address from the public and private sectors is increasing gradually. Therefor, the reliability of the road name address basic map, of the default data is also an urgent need, this means the accuracy of the data. But, road name address basic map is production time due to the use of different map accuracy is to fall, so is also the situation insufficient of utilization. This study Construction of identify each attempt by the road name address basic map and analysis the location accuracy of road name address basic map. As a result, the RMSE of cadastral survey results showed that appears lower than the RMSE of digital map survey results. The judgment can be utilized as the basis for the proposed improvements for the road name address basic map.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.6
• /
• pp.1153-1160
• /
• 2021

This paper proposes a routing algorithm that determines the optimal path using deep reinforcement learning in software-defined networks. The deep reinforcement learning model for learning is based on DQN, the inputs are the current network state, source, and destination nodes, and the output returns a list of routes from source to destination. The routing task is defined as a discrete control problem, and the quality of service parameters for routing consider delay, bandwidth, and loss rate. The routing agent classifies the appropriate service class according to the user's quality of service profile, and converts the service class that can be provided for each link from the current network state collected from the SDN. Based on this converted information, it learns to select a route that satisfies the required service level from the source to the destination. The simulation results indicated that if the proposed algorithm proceeds with a certain episode, the correct path is selected and the learning is successfully performed.

• Journal of Broadcast Engineering
• /
• v.8 no.3
• /
• pp.238-249
• /
• 2003

Eureka 147 DAB system based on the orthogonal frequency division multiplexing (OFDM) was adopted as the transmission scheme for terrestrial digital multimedia broadcasting (DMB) system in Korea. The OFDM has several advantages comparing to the single carrier modulation. However, its high Peak-to-average power ratio (PAPR) increases the complexity of the D/A and A/D converters and reduces the efficiency of the high power amplifier To reduce the high PAPR of OFDM, various techniques such as clipping, peak windowing, companding, selected mapping (SLM), Partial transmit sequences (PTS), etc. have been proposed. In this paper, we propose modified configurations of SLM and PTS for effective implementation and evaluate the performance on the PAPR reduction of DMB system. The simulation results show that the modified SLM (MSLM) has merits in reducing the amount of computation and hardware complexity due to the reduction of the number of vector $P^{(U)}$, while satisfying the same performance and maintaining the same required bits (RB) for side information. With the same amount of computation and the same RB, the modified PTS (MPTS) is also shown to be better than PTS in the performance of PAPR reduction.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.6 s.312
• /
• pp.26-33
• /
• 2006

Film restoration is to detect the location and extent of defected regions from a given movie film, and if present, to reconstruct the lost information of each region. It has gained increasing attention by many researchers, to support multimedia service of high quality. In general, an old film is degraded by dust, scratch, flick, and so on. Among these, the most frequent degradation is the scratch. So far techniques for the scratch restoration have been developed, but they have limited applicability when dealing with all kinds of scratches. To fully support the automatic scratch restoration, the system should be developed that can detect all kinds of scratches from a given frame of old films. This paper presents a neurual network (NN)-based texture classifier that automatically detect all kinds of scratches from frames in old films. To facilitate the detection of various scratch sizes, we use a pyramid of images generated from original frames by having the resolution at three levels. The image at each level is scanned by the NN-based classifier, which divides the input image into scratch regions and non-scratch regions. Then, to reduce the computational cost, the NN-based classifier is only applied to the edge pixels. To assess the validity of the proposed method, the experiments have been performed on old films and animations with all kinds of scratches, then the results show the effectiveness of the proposed method.