• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.301-304
• /
• 2007

A realization for image searching engine with moving objects identification and classification is presented in this paper. The identification algorithm is applied to extract difference image between input image and the reference image, and the classification is used the region segmentation. That is made the database for the searching engine. The experimental result of the realized system enables to search for human and animal at time intervals to use a surveillant system at inside environment.

• Journal of the Society of Disaster Information
• /
• v.1 no.1
• /
• pp.121-136
• /
• 2005

Most human-error case of accident database is written by various description and expression because accident database is produced by two or more person. And extracted information by searching of database varies in researcher's judgment criteria and the capability. Furthermore, much time and effort are required to examine manually information related to the human error from each accident case. Accordingly, it is difficult to explore objectively the accidents relevant to the human-error from the accident data base which is accumulated enormously. In this study, to solve these problems, it was developed an searchig method which is not influenced by researcher's judgment criteria and capability. For this, human-error keywords were extracted from a Japanese-English dictionary to examine objectively the accident case related to human-error in data base. This searching method by the human-error keywords can be applicable in most accident databases, although a database will be accumulated in future. Also, using the searching technique of this research, knowledge obtained by searching result can be compared with other research's results by the same method. Although the number of accident case increasese, searching results from database have the objectivity because it is not necessary to modify the based searching method or change the human-error keywords. However, as subject of future investigation, it would be necessary that the extension and investigation on human-error keywords improve and the technique to enhance searching accuracy would be modified.

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

The most widely used method for searching contents of mot ion picture compares contents by extracted cuts. The cut extract ion methods, such as CHD(Color Histogram Difference) or ECR(Edge Change Ratio), are very weak at modifications such as cropping, resizing and low bit rate. The suggested method uses audio contents for indexing and searching to make search be robust against these modification. Scenes of audio contents are extracted for modification-robust search. And based on these scenes, make spectral powers binary on each frequency bin. in the time-frequency domain. The suggested method shows failure rate less than 1% on the false positive error and the true negative error to the modified(using cropping, clipping, row bit rate, addtive frame) contents.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.5
• /
• pp.681-687
• /
• 2003

Terrain surfaces have to be modeled in very detail and wheel-surface contacting geometry must be well defined in order to obtain proper ground-reaction and friction forces fur realistic simulation of off-road vehicles. Delaunay triangulation is one of the most widely used methods in modeling 3-dimensional terrain surfaces, and the T-search is a relevant algorithm for searching resulting triangular polygons. The T-search method searches polygons in a successive order and may not allow real-time computation of off-road vehicle dynamics if the terrain is modeled with many polygons, depending on the computer performance used in the simulation. The dynamic T-search, which is proposed in this paper, combines conventional T-search and the concept of the dynmaic-window search which uses reduced searching windows or sets of triangular surface polygons at each frame by taking advantage of the information regarding dynamic charactereistics of a simulated vehicle. Numerical tests show improvement of searching speeds by about 5% for randomly distributed triangles. For continuous search following a vehicle path, which occurs in actual vehicle simulation, the searching speed becomes 4 times faster.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.11
• /
• pp.532-540
• /
• 2001

In this paper, we propose a probabilistic tabu search strategy for function optimization. It is composed of two procedures, one is Basic search procedure that plays a role in local search, and the other is Restarting procedure that enables to diversify search region. In basic search procedure, we use Belief space and Near region to create neighbors. Belief space is made of high-rank neighbors to effectively restrict searching space, so it can improve searching time and local or global searching capability. When a solution is converged in a local area, Restarting procedure works to search other regions. In this time, we use Probabilistic Tabu Strategy(PTS) to adjust parameters such as a reducing rate, initial searching region etc., which makes enhance the performance of searching ability in various problems. In order to show the usefulness of the proposed method, the PTS is applied to the minimization problems such as De Jong functions, Ackley function, and Griewank functions etc., the results are compared with those of GA or EP.

• Journal of the Korean Home Economics Association
• /
• v.30 no.1
• /
• pp.149-161
• /
• 1992

The purpose of this study is to analyze information search activity in purchasing behavior of household electric goods. Qusetionare survey method was used in this research. The sample was taken from 302 housewives living in Seoul, from 9th of Nov. to 20th of Nov, in 1991. Used statical methods were Frequency, Percentage, Crosstab, Anova, and Regression Analysis. The major findings are summarized as follows : 1) Component elements of information search : The means of acquiring information is that friends, neighbors, sales are most. A cause of choosing information is the sequence of satisfaction after using, easiness of interaction. The time in choosing goods is more month. 2) Component element of information search as social economic status housewife : children numbers and means of acquiring information(P<.01), education and a cause of choosing information(P<.05), life cost per month and a cause of choosing information(P<.05), social economic status and a time information search are significant. 3) A perception of risk as searching information : Among searching content of information a price influence a perception of risk. 4) Content of searching information and satisfaction of purchasing experience : Best choice is significant as quality of goods, difference of quality is significant as safety and degree of offering information is significant as a brand. 5) Satisfaction of purchasing experience following practical use of information : Best choice is significant as viewing of an exhibit and opinion of user. Difference of quality is not significant as any vairable. Degree of offer information influence searching pamphlet, searching an advertisement and opinion of user. 6) A perception of risk following source of an information : A perception of risk is most influenced by pamphlet.

• Journal of Korea Multimedia Society
• /
• v.7 no.2
• /
• pp.145-155
• /
• 2004

It is very important for Internet searching systems to have user-friendly and rapid searching functions at the managers'point of view. The former finds optimized input parameters to support the various searching requirements of user. The latter has fast searching results which are effectively normalized to various input parameters having different attributes. In this paper we basically focus on optimized database construction not only to have searching functions with multiple attributes to support maximal various input requirements of the user but also to have more rapid searching functions. For this research, we suggest a modified association algorithm that takes into consideration to the support and confidence that is the criteria of the association mining rule in order to reflect the searching characteristics of internet shopping malls. We also propose the model management systems for rapid searching functions. The following results are from a processed simulation: the more the number of searching transactions of the users increase, the less the total relative average searching time becomes.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.537-540
• /
• 2000

The Distribution System consist of many tie-line switches and sectionalizing switches, operated a radial type. When an outage occurs in Distribution System, outage areas are isolated by system switches, has to restored as soon as possible. At this time, system operator have to get a information about network topology for service restoration of outage areas. Therefore, the searching result of restorative topology has to fast computation time and reliable result topology for to restore a electric service to outage areas, equal to optimal switching operation problem. So, the problem can be defined as combinatorial optimization problem. The service restoration problem is so important problem which have outage area minimization, outage loss minimization. Many researcher is applying to the service restoration problem with various techniques. In this paper, advanced Dijkstra algorithm is applied to searching a restoration topology, is so efficient to searching a shortest path in graph type network. Additionally, fuzzy rules and operator are applied to overcome a fuzziness of correlation with input data. The present technique has superior results which are fast computation time and searching results than previous researches, demonstrated by example distribution model system which has 3 feeders, 26 buses. For a application capability to real distribution system, additionally demonstrated by real distribution system of KEPCO(Korea Electric Power Corporation) which has 8 feeders and 140 buses.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.11
• /
• pp.1209-1216
• /
• 2009

This paper presents an efficient Quantized Equal Gain Transmission(QEGT) codebook index searching technique for MISO beamforming system in a Rayleigh flat fading channel. The searching time for the optimum weight vector among the codebook vectors increases exponentially when the codebook size increases linearly, although the bit error rate decreases. So, newly defined simple metric is proposed for fast searching, which determines a few candidates. Then the conventional method combined with accurate search algorithm selects the optimal index. This strategy significantly reduces the overall search time, while maintaining almost the same bit error rate performance. Furthermore, as the codebook size increases, the search time is considerably decreased compared to that of the conventional approach.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.1
• /
• pp.105-111
• /
• 1990

In this paper, fast algorithms to generate the codebook of vector quantization in image coding, are proposed. And an efficient algorithm to guess a initial codebook, namely, binary splitting method, is proposed. We generated the initial codebook by binary splitting method and then reduced the searching time using Iterative Optimization algorithm as an alternate to the generalized Lloyd algorithm and several information from binary splitting method. And the searching time and performance can be traded off by varying the searching range. With this proposed algorithm, the computation time can be reduced by a factor of 60 Without any degradation of image quality.