• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1996년도 추계학술대회발표논문집; 고려대학교, 서울; 26 Oct. 1996
• /
• pp.135-138
• /
• 1996

In solving the Travel Salesman Problem(TSP), we easily reach local optimal solutions with the existing methods such as TWO-OPT, THREE-OPT, and Lin-Kernighen. Tabu search, as a meta heuristic, is a good mechanism to get an optimal or a near optimal solution escaping from the local optimal. By utilizing AI concepts, tabu search continues to search for improved solutions. In this study, we focus on developing a new neighborhood structure that maintains the feasibility of the tours created by exchange operations in TSP. Intelligent methods are discussed, which keeps feasible tour routes even after exchanging several edges continuously. An extended tabu search model, performing cycle detection and diversification with memory structure, is applied to TSP. The model uses effectively the information gathered during the search process. Finally, the results of tabu search and simulated annealing are compared based on the TSP problems in the prior literatures.

• Journal of Information Processing Systems
• /
• 제9권2호
• /
• pp.315-332
• /
• 2013

This paper presents an approach for improving the use of VP-tree in video indexing and searching. A vantage-point tree or VP-tree is one of the metric space-based indexing methods used in multimedia database searches and data retrieval. Instead of relying on the Euclidean distance as a measure of search space, the proposed approach focuses on the trigonometric inequality for compressing the search range, which thus, improves the search performance. A test result of using 10,000 video files shows that this method reduced the search time by 5-12%, as compared to the existing method that uses the AESA algorithm.

• 한국컴퓨터정보학회논문지
• /
• 제22권7호
• /
• pp.47-54
• /
• 2017

Recently, correlation filter based trackers have shown excellent tracking performance and computational efficiency. In order to enhance tracking performance in the correlation filter based tracker, search area which is image patch for finding target must include target. In this paper, two methods to discriminatively represent target in the search area are proposed. Firstly, search area location is estimated using pyramidal Lucas-Kanade algorithm. By estimating search area location before filtering, fast motion target can be included in the search area. Secondly, we investigate multi-channel Local Edge Pattern(LEP) which is insensitive to illumination and noise variation. Qualitative and quantitative experiments are performed with eight dataset, which includes ground truth. In comparison with method without search area estimation, our approach retain tracking for the fast motion target. Additionally, the proposed multi-channel LEP improves discriminative performance compare to existing features.

• Journal of information and communication convergence engineering
• /
• 제5권3호
• /
• pp.239-244
• /
• 2007

In the telematics system, a reasonable path search time should be guaranteed from a great number of user's queries, even though the optimal path with minimized travel time might be continuously changed by the traffic flows. Thus, the path search method should consider traffic flows of the roads and the search time as well. However, the existing path search methods are not able to cope efficiently with the change of the traffic flows and to search rapidly paths simultaneously. This paper proposes a new path search method for fast computation. It also reflects the traffic flows efficiently. Especially, in order to simplify the computation of variable heuristic values, it employs a simplification method for estimating values of traffic-adaptable heuristics. The experiments are carried out with the $A^*$ algorithm and the proposed method in terms of the execution time, the number of node accesses and the accuracy. The results obtained from the experiments show that the method achieves very fast execution time and the reasonable accuracy as well.

• 한국문헌정보학회지
• /
• 제44권4호
• /
• pp.395-412
• /
• 2010

본 연구에서는 국내 주요 검색 포털들인 네이버, 네이트, 다음, 야후, 파란, 구글에서 제공하는 멀티미디어 검색 서비스를 메타데이터, 검색 기능, 검색 방법, 부가 기능, 결과 출력 방식 등의 관점에서 비교, 분석하였다. 조사 결과, 모든 포털들이 이미지, 동영상 검색을 제공하는데 비해 음악 검색은 네이버, 네이트, 다음만이 제공하고 있었다. 또한 음악 검색보다는 이미지, 동영상 검색에서 검색 기능이나 부가 서비스의 개발이 보다 활발하게 진행되고 있었다. 네이버, 네이트, 다음은 국외 검색 포털들이 제공하지 않는 다양한 멀티미디어 검색 기능을 개발, 제공하고 있었고, 구글은 다양한 수준의 고급 검색 기능을 제공하고 있었다. 반면, 국내 포털들은 검색 결과에서 매우 제한적인 메타데이터만 제공하고 있었다. 본 연구의 결과는 포털들의 멀티미디어 검색 서비스의 개선에 활용될 수 있을 것으로 기대된다.

• 한국멀티미디어학회논문지
• /
• 제2권3호
• /
• pp.231-242
• /
• 1999

일반적으로 동영상에 대한 정보 검색에는 주석 기반 검색이나 내용 기반 검색을 사용한다. 그러나, 주석 기반 검색은 사용자의 주관이 개입되어 일관성을 잃기 쉽고 내용 기반 검색은 동영상 데이터가 담고 있는 일반적인 의미 추출이 어렵다는 단점을 가지고 있다 그래서, 본 논문에서는 이 두 검색 기법을 상호 보완하여 검색의 효율성과 정확성을 높일 수 있도록 하는 통합 동영상 데이터 모델(IVDM)을 제안한다. 이 모텔은 동영상 데이터를 분석하여 계층적으로 구조화한다. 상위 수준에서는 주제별로 부여된 메타 정보로 주석 기반 검색을 지원하고, 하위 수준에서는 동영상 데이터에서 색깔, 모양, 움직임, 질감 등의 특정 데이터를 추출하여 내용 기반 검색올 지원한다. 그리고 이 IVDM의 타당성을 입증하기 위해 동영상의 대표격인 뉴스 동영상올 객체 지향 데이타베이스 스키마 형태로 설계하고, 이에 맞는 질의 유형 4가지와 그 처리 알고리즘도 제공한다.

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

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2011년도 한국컴퓨터종합학술대회논문집 Vol.38 No.1(C)
• /
• pp.112-114
• /
• 2011

On multimedia databases, in order to realize the fast access method, indexing methods for the multidimension data space are used. However, since it is a premise to use the Euclid distance as the distance measure, this method lacks in flexibility. On the other hand, there are metric indexing methods which require only to satisfy distance axiom. Since metric indexing methods can also apply for distance measures other than the Euclid distance, these methods have high flexibility. This paper proposes an improved method of VP-tree which is one of the metric indexing methods. VP-tree follows the node which suits the search range from a route node at searching. And distances between a query and all objects linked from the leaf node which finally arrived are computed, and it investigates whether each object is contained in the search range. However, search speed will become slow if the number of distance calculations in a leaf node increases. Therefore, we paid attention to the candidates selection method using the triangular inequality in a leaf node. As the improved methods, we propose a method to use the nearest neighbor object point for the query as the datum point of the triangular inequality. It becomes possible to make the search range smaller and to cut down the number of times of distance calculation by these improved methods. From evaluation experiments using 10,000 image data, it was found that our proposed method could cut 5%~12% of search time of the traditional method.

• 한국문헌정보학회지
• /
• 제48권4호
• /
• pp.5-23
• /
• 2014

This study reports the first step in the Classification-based Search and Knowledge Discovery (CSKD) project, which aims to combine information organization and retrieval approaches for building digital library applications. In this study, we explored the generation and application of a faceted vocabulary as a potential mechanism to enhance knowledge discovery. The faceted vocabulary construction process revealed some heuristics that can be refined in follow-up studies to further automate the creation of faceted classification structure, while our concept search application demonstrated the utility and potential of integrating classification-based approach with retrieval-based approach. Integration of text- and classification-based methods as outlined in this paper combines the strengths of two vastly different approaches to information discovery by constructing and utilizing a flexible information organization scheme from an existing classification structure.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.7-10
• /
• 2000

Fast block motion estimation technique is proposed to reduce the computational complexity in video coding. In the conventional methods the size of search region is fixed. For small motion regions like background the small size of sea of search region is enough to find a block motion. But for active motion regions the large size of search region is preferred to figure out the accurate motion vector. Therefore, it is reasonable that a block motion is estimated in the variable search region (both the size and the position of it). That is to say, the search region varies according to the predicted motion characteristics of a block. The block motion in video frames has temporal continuity and then the search region of a current block is predicted using the block motion of previous blocks. The computational complexity of the proposed technique is significantly reduced with a good picture quality compared to the conventional methods.