• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.10
• /
• pp.2188-2194
• /
• 2011

With the development of wireless network technology, Storing the location information of a spatiotemporal object was very necessary. Each spatiotemporal object has many unnecessariness location information, hence it is inefficient to search all trajectory information of spatiotemporal objects. In this paper, we propose an efficient method which increase searching efficiency. Using EMBR(Extend Minimun Bounding Rectangle), an LinearMarge split algorithm that minimizes the volume of MBRs is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.324-332
• /
• 2004

In image communications related to web browsing, image database, and telemedicine, image data processing on the region of interest (ROI) for providing the primary information is needed in the view of saying search time and bandwidth. In this paper, an enhanced algorithm for processing image data that involves multiple ROIs is presented in order to increase PSNR vs. compression ratio performance above the previous JPEG2000 Part1 Maxshift method. Since the wavelet transform enables us to a progressive transmission mechanism, Multiple-ROI coding is possible to compress, transmit, and reconstruct the image data with a better quality than those of non-ROI method while the required transmission bandwidth is kept relatively low.

• Korean Journal of Remote Sensing
• /
• v.34 no.1
• /
• pp.89-99
• /
• 2018

Spatial downscaling is often applied to coarse scale satellite products with high temporal resolution for environmental monitoring at a finer scale. An area-to-point regression kriging (ATPRK) algorithm is regarded as effective in that it combines regression modeling and residual correction with area-to-point kriging. However, an open source tool or package for ATPRK has not yet been developed. This paper describes the development and code organization of an R-based spatial downscaling tool, named R4ATPRK, for the implementation of ATPRK. R4ATPRK was developed using the R language and several R packages. A look-up table search and batch processing for computation of ATP kriging weights are employed to improve computational efficiency. An experiment on spatial downscaling of coarse scale land surface temperature products demonstrated that this tool could generate downscaling results in which overall variations in input coarse scale data were preserved and local details were also well captured. If computational efficiency can be further improved, and the tool is extended to include certain advanced procedures, R4ATPRK would be an effective tool for spatial downscaling of coarse scale satellite products.

• Journal of the Society of Naval Architects of Korea
• /
• v.42 no.6 s.144
• /
• pp.654-665
• /
• 2005

In this paper, we present a non-linear integer programming by genetic algorithm (GA) for available sizes of stiffener or thickness of plate in a job site. GA can rapidly search for the approximate global optimum under complicated design environment such as ship. Meanwhile it can handle the optimization problem involving discrete design variable. However, there are many parameters have to be set for GA, which greatly affect the accuracy and calculation time of optimum solution. The setting process is hard for users, and there are no rules to decide these parameters. In order to overcome these demerits, the optimization for these parameters has been also conducted using GA itself. Also it is proved that the parameters are optimal values by the trial function. Finally, we applied this method to compass deck of ship where the vibration problem is frequently occurred to verify the validity and usefulness of nonlinear integer programming.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.4
• /
• pp.1411-1417
• /
• 2014

An MPEG-2 AAC Huffman decoding method based on the fixed length compacted codeword tables, where each codeword can contain multiple number of Huffman codes, was proposed. The proposed method enhances the searching efficiency by finding multiple symbols in a single search, i.e., a direct memory reading of the compacted codeword table. The memory usage is significantly saved by separately handling the Huffman codes that exceed the length of the compacted codewords. The trade-off relation between the computational complexity and the amount of memory usage was analytically derived to find the proper codeword length of the compacted codewords for the design of MPEG-2 AAC decoder. To validate the proposed algorithm, its performance was experimentally evaluated with an implemented MPEG-2 AAC decoder. The results showed that the computational complexity of the proposed method is reduced to 54% of that of the most up-to-date method.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.5
• /
• pp.1821-1830
• /
• 2018

With the wide application of intelligent household appliances, the optimization of electricity behavior has become an important component of home-based intelligent electricity. In this study, a multi-objective optimization model in an intelligent electricity environment is proposed based on economy and comfort. Firstly, the domestic consumer's load characteristics are analyzed, and the operating constraints of interruptible and transferable electrical appliances are defined. Then, constraints such as household electrical load, electricity habits, the correlation minimization electricity expenditure model of household appliances, and the comfort model of electricity use are integrated into multi-objective optimization. Finally, a continuous search multi-objective particle swarm algorithm is proposed to solve the optimization problem. The analysis of the corresponding example shows that the multi-objective optimization model can effectively reduce electricity costs and improve electricity use comfort.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.4
• /
• pp.363-375
• /
• 2000

In this paper we propose a content-based image retrieval method that can search large image databases efficiently by color, texture, and shape content. Quantized RGB histograms and the dominant triple (hue, saturation, and value), which are extracted from quantized HSV joint histogram in the local image region, are used for representing global/local color information in the image. Entropy and maximum entry from co-occurrence matrices are used for texture information and edge angle histogram is used for representing shape information. Relevance feedback approach, which has coupled proposed features, is used for obtaining better retrieval accuracy. Simulation results illustrate the above method provides 77.5 percent precision rate without relevance feedback and increased precision rate using relevance feedback for overall queries. We also present a new indexing method that supports fast retrieval in large image databases. Tree structures constructed by k-means algorithm, along with the idea of triangle inequality, eliminate candidate images for similarity calculation between query image and each database image. We find that the proposed method reduces calculation up to average 92.9 percent of the images from direct comparison.

• Proceedings of the KIEE Conference
• /
• 1993.07b
• /
• pp.923-928
• /
• 1993

Genetic algorithms are powerful optimization methods based on the mechanism of natural genetics and natural selection. Genetic algorithms reduce chance of searching local optima unlike most conventional search algorithms and especially show good performances in complex nonlinear optimization problems because they do not require any information except objective function value. This paper presents a new model based on sexual reproduction in nature. In the proposed Sexual Reproduction model(SR model), individuals consist of the diploid of chromosomes, which are artificially coded as binary string in computer program. The meiosis is modeled to produce the sexual cell(gamete). In the artificial meiosis, crossover between homologous chromosomes plays an essential role for exchanging genetic informations. We apply proposed SR model to optimization of the design parameters of Single-sided Linear Induction Motor(SLIM). Sequential Unconstrained Minimization Technique(SUMT) is used to transform the nonlinear optimization problem with many constraints of SLIM to a simple unconstrained problem, We perform optimal design of SLIM available to FA conveyer systems and discuss its results.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1564-1573
• /
• 2016

With the spread of social media and mobile devices, people spend more time on online than ever before. As more people participate in various online activities, much research has been conducted on how to make use of the time effectively and productively. In this paper, we propose two methods which can be used to extract highlights and make searchable media indexes using online social data. For highlight extraction, we collected the comments from the online baseball broadcasting website. We adopted peak-finding algorithm to analyze the frequency of comments uploaded on the comments section of the website. For each indexes, we collected postings from soap opera forums provided by a popular web service called DCInside. We extracted all the instances when a character's name is mentioned in postings users upload after watching TV, which can be used to create indexes when the character appears on screen for the given episode of the soap opera The evaluation results shows the possibility of the crowdsourcing-based media interaction for both highlight extraction and index building.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.5
• /
• pp.679-683
• /
• 2007

Statistical learning theory by Vapnik consists of support vector machine(SVM), support vector regression(SVR), and support vector clustering(SVC) for classification, regression, and clustering respectively. In this algorithms, SVC is good clustering algorithm using support vectors based on Gaussian kernel function. But, similar to SVM and SVR, SVC needs to determine kernel parameters and regularization constant optimally. In general, the parameters have been determined by the arts of researchers and grid search which is demanded computing time heavily. In this paper, we propose a differential evolution based SVC(DESVC) which combines differential evolution into SVC for efficient selection of kernel parameters and regularization constant. To verify improved performance of our DESVC, we make experiments using the data sets from UCI machine learning repository and simulation.