• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2007년도 추계종합학술대회
• /
• 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.

• 한국재난정보학회 논문집
• /
• 제1권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학회:학술대회논문집
• /
• 한국HCI학회 2008년도 학술대회 1부
• /
• pp.215-217
• /
• 2008

동영상 내용검색을 위해서 가장 많이 사용되고 있는 기술은 컷 추출에 의한 내용비교 방법이다. 그러나 컷 추출을 위해 사용되는 CHD(Color Histogram Difference)나 ECR(Edge Change Ratio)등은 영상물의 Cropping, Resizing Low bit rate등의 변화에 대해 대단히 취약하다. 본 방법은 이러한 변형에 강인하도록 상대적으로 변형이 적은 오디오정보를 이용하여 Indexing과 Searching을 수행하였다. 특히 변형에 강인한 Searching을 위해 오디오의 장면(Scene)을 검출하였고 장면을 중심으로 Time-frequency domain에서 각각의 Frequency bin. 에 대한 스펙트럴 파워를 파워임계값을 중심으로 이진화(Binary)하였다. 제안된 방법으로 Cropping, clipping, Lowbit rate, Additive Frame 등의 변형본에 대한 검색을 시도한 결과 False posit ive Error 와 True Negative Error 에 대해 각각 1%미만의 오탐지 결과를 얻었다.

• 대한기계학회논문집A
• /
• 제27권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.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제50권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.

• 대한가정학회지
• /
• 제30권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.

• 한국멀티미디어학회논문지
• /
• 제7권2호
• /
• pp.145-155
• /
• 2004

인터넷 쇼핑몰을 구성하는 관리자 입장에서는 사용자 중심의 편리한 검색 기능과 시스템 중심의 빠른 검색 기능을 가지는 것이 매우 중요하다. 전자는 사용자의 다양한 요구를 만족시킬 수 있는 최적화된 입력 매개 변수를 찾아내는 것이며, 후자는 속성이 다른 다양한 입력 변수들을 효과적으로 정규화 하여 빠른 검색 해를 찾아내는 것이다. 본 연구에서는 기본적으로 사용자의 다양한 요구를 최대한 반영하기 위해 다중 속성을 가진 검색 기능은 물론 보다 빠른 검색 기능을 가지기 위한 데이터베이스 최적화 구성에 초점을 두고 있다. 이를 위해 인터넷 쇼핑몰의 검색 특성을 반영할 수 있는 연관 규칙의 척도인 지지도와 신뢰도를 고려한 수정된 연관 알고리즘을 제시하며, 빠른 검색 기능을 가지기 위한 모델관리 시스템을 제안한다. 수행된 시뮬레이션 결과에 의하면 고객의 검색 트랜잭션 수가 증가할수록 전체 평균 검색 시간은 상대적으로 줄어든다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 A
• /
• 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.

• 한국전자파학회논문지
• /
• 제20권11호
• /
• pp.1209-1216
• /
• 2009

본 논문은 Rayleigh 플랫 페이딩 채널에서 MISO 빔포밍 시스템의 효율적인 양자화된 동 이득 전송 코드북 인덱스 탐색 기법을 제안한다. 코드북의 사이즈가 선형적으로 증가함에 따라 비트 오율 성능은 증가하지만, 최적의 가중치 벡터를 찾는 시간은 지수적으로 증가한다. 따라서 본 논문에서 새로운 간단한 메트릭을 이용하여 2개에서 5개의 후보 벡터들만 찾아내는 빠른 탐색 기법을 제안한다. 후보 벡터들에는 기존의 정확한 탐색 기법을 적용하여 최적의 벡터를 찾아낸다. 제안하는 기법은 전반적인 탐색 시간을 줄이면서도 비트 오율에는 거의 영향을 주지 않는다. 더욱이 코드북의 사이즈가 증가함에 따라 탐색 시간도 기존의 기법에 비해 매우 감소된다.

• 대한전자공학회논문지
• /
• 제27권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.