• Title/Summary/Keyword: Adaptive Search

Search Result 474, Processing Time 0.023 seconds

A Kinematic Approach to Answering Similarity Queries on Complex Human Motion Data (운동학적 접근 방법을 사용한 복잡한 인간 동작 질의 시스템)

  • Han, Hyuck;Kim, Shin-Gyu;Jung, Hyung-Soo;Yeom, Heon-Y.
    • Journal of Internet Computing and Services
    • /
    • v.10 no.4
    • /
    • pp.1-11
    • /
    • 2009
  • Recently there has arisen concern in both the database community and the graphics society about data retrieval from large motion databases because the high dimensionality of motion data implies high costs. In this circumstance, finding an effective distance measure and an efficient query processing method for such data is a challenging problem. This paper presents an elaborate motion query processing system, SMoFinder (Similar Motion Finder), which incorporates a novel kinematic distance measure and an efficient indexing strategy via adaptive frame segmentation. To this end, we regard human motions as multi-linkage kinematics and propose the weighted Minkowski distance metric. For efficient indexing, we devise a new adaptive segmentation method that chooses representative frames among similar frames and stores chosen frames instead of all frames. For efficient search, we propose a new search method that processes k-nearest neighbors queries over only representative frames. Our experimental results show that the size of motion databases is reduced greatly (${\times}1/25$) but the search capability of SMoFinder is equal to or superior to that of other systems.

  • PDF

A hybrid identification method on butterfly optimization and differential evolution algorithm

  • Zhou, Hongyuan;Zhang, Guangcai;Wang, Xiaojuan;Ni, Pinghe;Zhang, Jian
    • Smart Structures and Systems
    • /
    • v.26 no.3
    • /
    • pp.345-360
    • /
    • 2020
  • Modern swarm intelligence heuristic search methods are widely applied in the field of structural health monitoring due to their advantages of excellent global search capacity, loose requirement of initial guess and ease of computational implementation etc. To this end, a hybrid strategy is proposed based on butterfly optimization algorithm (BOA) and differential evolution (DE) with purpose of effective combination of their merits. In the proposed identification strategy, two improvements including mutation and crossover operations of DE, and dynamic adaptive operators are introduced into original BOA to reduce the risk to be trapped in local optimum and increase global search capability. The performance of the proposed algorithm, hybrid butterfly optimization and differential evolution algorithm (HBODEA) is evaluated by two numerical examples of a simply supported beam and a 37-bar truss structure, as well as an experimental test of 8-story shear-type steel frame structure in the laboratory. Compared with BOA and DE, the numerical and experimental results show that the proposed HBODEA is more robust to detect the reduction of stiffness with limited sensors and contaminated measurements. In addition, the effect of search space, two dynamic operators, population size on identification accuracy and efficiency of the proposed identification strategy are further investigated.

Low Complexity QRD-M Detection Algorithm Based on Adaptive Search Area for MIMO Systems (MIMO 시스템을 위한 적응형 검색범위 기반 저복잡도 QRD-M 검출기법)

  • Kim, Bong-Seok;Choi, Kwonhue
    • Journal of Satellite, Information and Communications
    • /
    • v.7 no.2
    • /
    • pp.97-103
    • /
    • 2012
  • A very low complexity QRD-M algorithm based on limited search area is proposed for MIMO systems. The conventional QRD-M algorithm calculates Euclidean distance between all constellation symbols and the temporary detection symbol at each layer. We found that performance will not be degraded even if we adaptively restrict the search area of the candidate symbols only to the neighboring points of temporary detection symbol according to the channel condition at each layer. As a channel condition indicator, we employ the channel gain ratio among the layers without necessity of SNR estimation. The simulation results show that the proposed scheme effectively achieves near optimal performance while maintaining the overall average computation complexity much smaller than the conventional QRD-M algorithm.

Adaptive relay node search scheme for reducing network fragmentation (네트워크 단절 개선을 위한 적응적 전달자 노드검색 기법)

  • Hong, Won-Kee;Byun, Jeong-Sik
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.14 no.3
    • /
    • pp.50-57
    • /
    • 2009
  • We propose a network node search scheme to address the network fragmentation due to high node mobility in the VANET. VANET is very similar to MANET in that a multi-hop ad-hoc network is configured by wireless communication between vehicles without any network infrastructure. However, high speed mobility, high node density, and frequent topology change induce frequent network fragmentation so that overall network traffic can be increased. In this paper, new broadcasting protocol called an adaptive relay node search protocol is proposed to decrease the network fragmentation. It reduces the network fragmentation and network traffic by researching nodes outside the dangerous area only in case of network fragmentation. Simulation results show that the proposed protocol decreases network fragmentation by up to 39.9% and increase informed rate by up to 41.9% compared to the existing broadcasting protocol.

Design and Development of Terrain-adaptive and User-friendly Remote Controller for Wheel-Track Hybrid Mobile Robot Platform (휠-트랙 하이브리드 모바일 로봇 플랫폼의 지형 적응성 및 사용자 친화성 향상을 위한 원격 조종기 설계와 개발)

  • Kim, Yoon-Gu;An, Jin-Ung;Kwak, Jeong-Hwan;Moon, Jeon-Il
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.6
    • /
    • pp.558-565
    • /
    • 2011
  • Various robot platforms have been designed and developed to perform given tasks in a hazardous environment for surveillance, reconnaissance, search and rescue, etc. We considered a terrain-adaptive and transformable hybrid robot platform that is equipped with rapid navigation capability on flat floors and good performance in overcoming stairs or obstacles. The navigation mode transition is determined and implemented by adaptive driving mode control of the mobile robot. In order to maximize the usability of wheel-track hybrid robot platform, we propose a terrain-adaptive and user-friendly remote controller and verify the efficiency and performance through its navigation performance experiments in real and test-bed environments.

A Study on the Indoor Sound-field Analysis by Adaptive Triangular Beam Method (적응 삼각형 빔 방법에 의한 실내음장 해석)

  • 조대승;성상경;김진형;최재호;박일권
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.13 no.3
    • /
    • pp.217-224
    • /
    • 2003
  • In this study, the adaptive triangular beam method(ATBM) considering different sound reflection coefficients and angles of a triangular beam on two or more planes as well as diffraction effect is suggested. The ATBM, subdividing a tracing triangular beam into multiple triangular beams on reflection planes, gives reliable and convergent sound-field analysis results without the dependancy on the number of initial triangular beam segmentation to search sound propagation paths from source to receiver. The validity of the method is verified by the comparison of numerical and experimental results for energy decay curve and steady-state sound pressure level of rooms having direct, reflective and diffractive sound paths.

Dynamic Adaptive Model for WebMedia Educational Systems based on Discrete Probability Techniques (이산 확률 기법에 기반한 웹미디어 교육 시스템을 위한 동적 적응 모델)

  • Lee, Yoon-Soo
    • Journal of the Korea Computer Industry Society
    • /
    • v.5 no.9
    • /
    • pp.921-928
    • /
    • 2004
  • This paper proposed dynamic adaptive model based on discrete probability distribution function and user profile in web based HyperMedia educational systems. This modelsrepresents application domain to weighted direction graph of dynamic adaptive objects andmodeling user actions using dynamically approach method structured on discrete probability function. Proposed probabilitic analysis can use that presenting potential attribute to useractions that are tracing search actions of user in WebMedia structure. This approach methodscan allocate dynamically appropriate profiles to user.

  • PDF

Discrete optimal sizing of truss using adaptive directional differential evolution

  • Pham, Anh H.
    • Advances in Computational Design
    • /
    • v.1 no.3
    • /
    • pp.275-296
    • /
    • 2016
  • This article presents an adaptive directional differential evolution (ADDE) algorithm and its application in solving discrete sizing truss optimization problems. The algorithm is featured by a new self-adaptation approach and a simple directional strategy. In the adaptation approach, the mutation operator is adjusted in accordance with the change of population diversity, which can well balance between global exploration and local exploitation as well as locate the promising solutions. The directional strategy is based on the order relation between two difference solutions chosen for mutation and can bias the search direction for increasing the possibility of finding improved solutions. In addition, a new scaling factor is introduced as a vector of uniform random variables to maintain the diversity without crossover operation. Numerical results show that the optimal solutions of ADDE are as good as or better than those from some modern metaheuristics in the literature, while ADDE often uses fewer structural analyses.

Design of Adaptive Population-size on Bias in Genetic Algorithms (유전자 알고리즘에서 bias에 의한 adaptive한 개체군 크기의 설정)

  • 김용범;오충환
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.18 no.36
    • /
    • pp.133-141
    • /
    • 1995
  • One of the problems brought up in the effective execution of genetic algorithms is that if they come under any influences according as the population size is large or small. In the case of small population size the opportunities of premature convergence are increased when the greatly powerful or no good individual is generated during search of the solution space. And searching the solution space in the case of large population size, the difficulties under the execution cause to searching all for one by one individual in every generation applied is limited, this gives the many interruptions to the convergence of final solution. Now this paper gives a suggestion to set up the adaptive population size which could compute the more correct solution and simplify the development of computation performance.

  • PDF

Fast Iterative Image Restoration Algorithm

  • Moon, J.I.;Paik, J.K.
    • Journal of Electrical Engineering and information Science
    • /
    • v.1 no.2
    • /
    • pp.67-76
    • /
    • 1996
  • In the present paper we propose two new improved iterative restoration algorithms. One is to accelerate convergence of the steepest descent method using the improved search directions, while the other accelerates convergence by using preconditioners. It is also shown that the proposed preconditioned algorithm can accelerate iteration-adaptive iterative image restoration algorithm. The preconditioner in the proposed algorithm can be implemented by using the FIR filter structure, so it can be applied to practical application with manageable amount of computation. Experimental results of the proposed methods show good perfomance improvement in the sense of both convergence speed and quality of the restored image. Although the proposed methods cannot be directly included in spatially-adaptive restoration, they can be used as pre-processing for iteration-adaptive algorithms.

  • PDF