• Title/Summary/Keyword: object search

Search Result 665, Processing Time 0.03 seconds

Study of Improvement of Search Range Compression Method of VP-tree for Video Indexes (영상 색인용 VP-tree의 검색 범위 압축법의 개선에 관한 연구)

  • Park, Gil-Yang;Lee, Samuel Sang-Kon;Hwang, Jea-Jeong
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.2
    • /
    • pp.215-225
    • /
    • 2012
  • In multimedia database, a multidimensional space-based indexing has been used to increase search efficiency. However, this method is inefficient in terms of ubiquity because it uses Euclidean distance as a scale of distance calculation. On the contrary, a metric space-based indexing method, in which metric axiom is prerequisite is widely available because a metric scale other than Euclidean distance could be used. This paper is attempted to propose a way of improving VP-tree, one of the metric space indexing methods. The VP-tree calculates the distance with an object which is ultimately linked to the a leaf node depending on the node fit for the search range from a root node and examines if it is appropriate with the search range. Because search speed decreases as the number of distance calculations at the leaf node increases, however, this paper has proposed a method which uses the latest interface on query object as the base point of trigonometric inequality for improvement after focusing on the trigonometric inequality-based range compression method in a leaf node. This improvement method would be able to narrow the search range and reduce the number of distance calculations. According to a system performance test using 10,000 video data, the new method reduced search time for similar videos by 5-12%, compared to a conventional method.

A Study on Loading and Scheduling of Assembly Block in Shipbuilding (조선산업에서의 블록 배량계획과 일정계획에 관한 연구)

  • Kim, Ki-Dong;Jeon, In-Woo;Kim, Tae-Hyeon
    • Journal of Industrial Technology
    • /
    • v.22 no.B
    • /
    • pp.61-70
    • /
    • 2002
  • The shipbuilding scheduling has many possible alternatives because of its long time horizon and a lot of jobs, so it is required that the scheduling system can generate and search feasible alternatives rapidly. The scheduling in the assembly shop is initiated by allocating, namely loading, the assembly blocks to each shop. In this step, the resource capacities (such as available man/hour, available crane) of each shop must be considered. The result of loading without above consideration can make the scheduling result based on that infeasible or worse one. In this paper, we developed the optimal scheduling system of shipbuilding, specifically for loading and scheduling of assembly block, using ILOG Solver/Scheduler. ILOG Solver/Scheduler is a general-purposed commercial software which supports to find a feasible or optimal solution using object oriented technique and constraints satisfaction programming, given constraints and objectives. Also, in order to enhance the system performance, we conducted various experiments of ILOG search strategies. The experimental results showed that the impact of search strategies is significant.

  • PDF

An Automated Search for Design Database by Shape Pattern Recognition (형상 패턴 인식을 이용한 설계자료의 자동 탐색)

  • 차주헌
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1996.04a
    • /
    • pp.670-674
    • /
    • 1996
  • In automated search of a design database to support mechanical design, it is necessaryto recognize a shape pattern which represents a design object. This paper introduces the concept of a surface relation graph (SRG) for recognizing shape patterns from a 3D boundary representation scheme of a solid model(a B-rep model). In SRG, the nodes and arcs correspond to the faces and edges shared by two adjacent faces, respectively. An attribute assigned to an arc is given by an integer which discriminates the relationship between two adjacent faces. The + sign of the integer represents the geometric convexity of the solid, and the -sign the concivity at the shared edge. The input shape is recognized by comparison with the predefined features which are subgraphs of the SRG. A hierarchyof the database for upporting the design is presented. A search for the design database is also discussed. The usefulness of this method is illustrated by some application results.

  • PDF

A SHIPBOARD MULTISENSOR SOLUTION FOR THE DETECTON OF FAST MOVING SMALL SURFACE OBJECTS

  • Ko, Hanseok
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1995.10a
    • /
    • pp.174-177
    • /
    • 1995
  • Detecting a small threat object either fast moving or floating on shallow water presents a formidable challenge to shipboard sensor systems, which must determine whether or not to launch defensive weapons in a timely manner. An integrated multisensor concept is envisioned wherein the combined use of active and passive sensor is employed for the detection of short duration targets in dense ocean surface clutter to maximize detection range. The objective is to develop multisensor integration techniques that operate on detection data prior to track formation while simultaneously fusing contacts to tracks. In the system concept, detections from a low grazing angle search radar render designations to a sensor-search infrared sensor for target classification which in turn designates an active electro-optical sensor for sector search and target verification.

  • PDF

Fast Object Recognition using Local Energy Propagation from Combination of Saline Line Groups (직선 조합의 에너지 전파를 이용한 고속 물체인식)

  • 강동중
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.311-311
    • /
    • 2000
  • We propose a DP-based formulation for matching line patterns by defining a robust and stable geometric representation that is based on the conceptual organizations. Usually, the endpoint proximity and collinearity of image lines, as two main conceptual organization groups, are useful cues to match the model shape in the scene. As the endpoint proximity, we detect junctions from image lines. We then search for junction groups by using geometric constraint between the junctions. A junction chain similar to the model chain is searched in the scene, based on a local comparison. A Dynamic Programming-based search algorithm reduces the time complexity for the search of the model chain in the scene. Our system can find a reasonable matching, although there exist severely distorted objects in the scene. We demonstrate the feasibility of the DP-based matching method using both synthetic and real images.

  • PDF

Vibration Optimization Design of Ship Structure Using NASTRAN-based R-Tabu Search Method (NASTRAN 기반 R-Tabu 탐색법을 이용한 선박구조물의 진동최적설계)

  • 채상일;송진대;김용한;공영모;최수현;양보석
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2003.11a
    • /
    • pp.672-676
    • /
    • 2003
  • Recently, the importance of ship vibration is emerging due to the large scaling, high speed and lightning of ship. For pleasantness in a cabin, shipbuilders ask for strict vibration criteria and the degree of vibration level at a deckhouse became an important condition for taking order from customers. This study conducted optimum design to attenuate vibration level of a deckhouse to solve above problems. New method was implemented, that is NASTRAN external call type independence optimization method. The merit of this method is global searching after setting various object functions and design variables. The global optimization algorithm used here is R-Tabu search method, which has fast converging time and searching various size domains. By modeling similar type to ship structure, validity of the suggested method was investigated.

  • PDF

Searching River Information using Ontology (온톨로지를 이용한 하천 데이터의 검색)

  • Yoon, Hong-Kyu;Yoo, Sang-Bong
    • Journal of Korea Spatial Information System Society
    • /
    • v.2 no.2 s.4
    • /
    • pp.117-126
    • /
    • 2000
  • As the geographical information changes continuously, it has been difficult to manage it in consistent manner. Especially different terminologies are often used for describing the same object. These characteristics of geographical information make the information search be very unproductive. Recently, it is widely recognized that capturing more knowledge is the next step to overcome the current difficulties on sharing geographical information. In this paper, we utilize the ontology concept in order to facilitate information search for geographical data in the internet environment. A prototype of search system implemented using the ontology for river-related data is presented.

  • PDF

Hierarchical Structured Multi-agent for Distributed Databases in Location Based Services

  • Mateo Romeo Mark A.;Lee Jaewan;Kwon Oh-Hyun
    • The Journal of Information Systems
    • /
    • v.14 no.3
    • /
    • pp.17-22
    • /
    • 2005
  • Location management is very important in location-based services to provide services to the mobile users like banking, city guides and many more. Ubiquitous and mobile devices are the source of data in location management and its significant operations are update and search method. Some studies to improve these were presented by using optimal sequential paging, location area scheme and hierarchical database scheme. In addition, not all location services have the same access methods on data and it lead to difficulties of providing services. A proposed location management of multi-agent architecture is presented in this study. It shows the coordination of the agents on the distributed database of location-based services. The proposal focuses on the location management of the mobile object presented in a hierarchical search and update. Also, it uses a nearest neighbor technique for efficient search method of mobile objects.

  • PDF

aCN-RB-tree: Constrained Network-Based Index for Spatio-Temporal Aggregation of Moving Object Trajectory

  • Lee, Dong-Wook;Baek, Sung-Ha;Bae, Hae-Young
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.5
    • /
    • pp.527-547
    • /
    • 2009
  • Moving object management is widely used in traffic, logistic and data mining applications in ubiquitous environments. It is required to analyze spatio-temporal data and trajectories for moving object management. In this paper, we proposed a novel index structure for spatio-temporal aggregation of trajectory in a constrained network, named aCN-RB-tree. It manages aggregation values of trajectories using a constraint network-based index and it also supports direction of trajectory. An aCN-RB-tree consists of an aR-tree in its center and an extended B-tree. In this structure, an aR-tree is similar to a Min/Max R-tree, which stores the child nodes' max aggregation value in the parent node. Also, the proposed index structure is based on a constrained network structure such as a FNR-tree, so that it can decrease the dead space of index nodes. Each leaf node of an aR-tree has an extended B-tree which can store timestamp-based aggregation values. As it considers the direction of trajectory, the extended B-tree has a structure with direction. So this kind of aCN-RB-tree index can support efficient search for trajectory and traffic zone. The aCN-RB-tree can find a moving object trajectory in a given time interval efficiently. It can support traffic management systems and mining systems in ubiquitous environments.

Real-time Hausdorff Matching Algorithm for Tracking of Moving Object (이동물체 추적을 위한 실시간 Hausdorff 정합 알고리즘)

  • Jeon, Chun;Lee, Ju-Sin
    • The KIPS Transactions:PartB
    • /
    • v.9B no.6
    • /
    • pp.707-714
    • /
    • 2002
  • This paper presents a real-time Hausdorff matching algorithm for tracking of moving object acquired from an active camera. The proposed method uses the edge image of object as its model and uses Hausdorff distance as the cost function to identify hypothesis with the model. To enable real-time processing, a high speed approach to calculate Hausdorff distance and half cross matching method to improve performance of existing search methods are also presented. the experimental results demonstrate that the proposed method can accurately track moving object in real-time.