• Journal of the Korea Society of Computer and Information
• /
• v.15 no.11
• /
• pp.75-82
• /
• 2010

The paper proposed CBIRS/EFI with contents based search technique using edge feature information of the object from image information of the object which is uncertain. In order to search specially efficiently case of partial image information of the object, we used the search technique which extracts outline information and color information in feature information of object. In order to experiment this, we extracted side edge feature information of the vehicle for feature information of the object after capture the car image of the underground garage. This is the system which applies a contents base search by the result which analyzes the image which extracts a feature, an original image to search and a last similar measurement result. This system compared in FE-CBIRS systems which are an existing feature extraction contents base image retrieval system and the function which improves the accuracy and an effectiveness of search rate was complemented. The performance appraisal of CBIRS/EFI systems applied edge extraction feature information and color information of the cars. And we compared a color feature search time, a shape characteristic search time and a search rate from the process which searches area feature information. We extracted the case 91.84% of car edge feature extraction rate. And a average search time of CBIRS/EFI is showing a difference of average 0.4-0.9 seconds than FE-CBIRS from vehicle. color search time, shape characteristic search time and similar search time. So, it was proven with the fact that is excellent.

• Architectural research
• /
• v.15 no.4
• /
• pp.207-214
• /
• 2013

A form-finding technique is proposed for three-dimensional spatial structures. Two-step discrete finite element (FE) mesh generator based on computer aided geometric design (CAGD) is introduced and used to control the shape of three-dimensional spatial structures. Mathematical programming technique is adopted to search new forms (or shapes) of spatial structures. For this purpose, the strain energy is introduced as the objective function to be minimized and the initial volume (or the initial weight) is considered as constraint function. Numerical examples are carried out to test the capability of the proposed form-finding techniques and provided as benchmark tests.

• Journal of information and communication convergence engineering
• /
• v.9 no.3
• /
• pp.282-286
• /
• 2011

Recently, a name retrieval function is widely used on navigation systems. In this paper, we propose the new dynamic hashing algorithm for a name retrieval function on it. The proposed dynamic hashing algorithm by constructing an index using the variance information of character is the better than existing methods in terms of storage capacity and retrieval speed. The algorithm proposed in this paper can be useful on systems that have limited resources as well as navigation systems.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.10
• /
• pp.1-7
• /
• 1995

In this paper, the properties of autocorrelation function of binary sequences are investigated. From these properties, the binary sequences which can be used for measurement of impulse response on fading channel are found by computer search. A receiver which can measure impulse response by use of these binary sequences is devised. This devised measurement system produces zero values of autocorrelation function for the all delays except zero sight.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.04a
• /
• pp.133-136
• /
• 2004

This paper proposes a stability condition in affine Takagi-Sugeno (T-S) fuzzy systems with parametric uncertainties and then, introduces the design method of a fuzzy-model-based controller which guarantees the stability. The analysis is based on Lyapunov functions that are continuous and piecewise quadratic. The search for a piecewise quadratic Lyapunov function can be represented in terms of linear matrix inequalities (LMIs).

• 제어로봇시스템학회:학술대회논문집
• /
• 1999.10a
• /
• pp.214-217
• /
• 1999

In this paper, genetic algorithm (GA) is implemented to search for the optimal structures (i.e. the kind of neural networks, the number of inputs and hidden neurons) of neural networks which are used approximating a given nonlinear function. Two kinds of neural networks, i.e. the multilayer feedforward [1] and time delay neural networks (TDNN) [2] are involved in this paper. The synapse weights of each neural network in each generation are obtained by associated training algorithms. The simulation results of nonlinear function approximation are given out and some improvements in the future are outlined.

• Journal of the military operations research society of Korea
• /
• v.3 no.1
• /
• pp.123-136
• /
• 1977

This thesis presents a modification and extension to the Burgess and Killebrew heuristic resource leveling procedure for project networks. In contrast to previous algorithms appearing in the literature, the objective function of this algorithm. is the minimization of the sum of the squared errors in each time period (deviations around the mean usage) of all resources over the duration of the project. This objective function continues the search for an improved schedule beyond that of previous algorithms with their associated objective functions. One important feature is that the algorithm tends to reduce the number of periods that a resource is idle during its duration on the project.

• Journal of Power System Engineering
• /
• v.2 no.3
• /
• pp.60-67
• /
• 1998

Edge detection is the first step and very important step in image analysis. We cast edge detection as a problem in cost minimization. This is achieved by the formulation of a cost function that evaluates the quality of edge configurations. The cost function can be used as a basis for comparing the performances of different detectors. This cost function is made of desirable characteristics of edges such as thickness, continuity, length, region dissimilarity. And we use a simulated annealing algorithm for minimum of cost function. Simulated annealing are a class of adaptive search techniques that have been intensively studied in recent years. We present five strategies for generating candidate states. Experimental results(building image and test image) which verify the usefulness of our simulated annealing approach to edge detection are better than other operator.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.95-98
• /
• 1996

Universal Learning Network(U.L.N.), which can model and control the large scale complicated systems naturally, consists of nonlinearly operated nodes and multi-branches that may have arbitrary time delays including zero or minus ones. Therefore, U.L.N. can be applied to many kinds of systems which are difficult to be expressed by ordinary first order difference equations with one sampling time delay. It has been already reported that learning algorithm of parameter variables in U.L.N. by forward and backward propagation is useful for modeling, managing and controlling of the large scale complicated systems such as industrial plants, economic, social and life phenomena. But, in the previous learning algorithm of U.L.N., time delays between the nodes were fixed, in other words, criterion function of U.L.N. was improved by adjusting only parameter variables. In this paper, a new learning algorithm is proposed, where not only parameter variables but also time delays between the nodes can be adjusted. Because time delays are integral numbers, adjustment of time delays can be carried out by a kind of random search procedure which executes intensified and diversified search in a single framework.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.9
• /
• pp.1521-1526
• /
• 2007

This paper presents the application of Adaptive Evolutionary Algorithm (AEA) to search an optimal setting of overcurrent relay coordination to protect ring distribution systems. The AEA takes the merits of both a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner to use the global search capability of GA and the local search capability of ES. The overcurrent relay settings and coordination requirements are formulated into a set of constraint equations and an objective function is developed to manage the overcurrent relay settings by the Time Coordination Method. The domain of overcurrent relays coordination for the ring-fed distribution systems is a non-linear system with a lot of local optimum points and a highly constrained optimization problem. Thus conventional methods fail in searching for the global optimum. AEA is employed to search for the optimum relay settings with maximum satisfaction of coordination constraints. The simulation results show that the proposed method can optimize the overcurrent relay settings, reduce relay mis-coordinated operations, and find better optimal overcurrent relay settings than the present available methods.