• Title/Summary/Keyword: Exhaustive search method

Search Result 74, Processing Time 0.033 seconds

Speeding Up Neural Network-Based Face Detection Using Swarm Search

  • Sugisaka, Masanori;Fan, Xinjian
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.1334-1337
    • /
    • 2004
  • This paper presents a novel method to speed up neural network (NN) based face detection systems. NN-based face detection can be viewed as a classification and search problem. The proposed method formulates the search problem as an integer nonlinear optimization problem (INLP) and expands the basic particle swarm optimization (PSO) to solve it. PSO works with a population of particles, each representing a subwindow in an input image. The subwindows are evaluated by how well they match a NN-based face filter. A face is indicated when the filter response of the best particle is above a given threshold. To achieve better performance, the influence of PSO parameter settings on the search performance was investigated. Experiments show that with fine-adjusted parameters, the proposed method leads to a speedup of 94 on 320${\times}$240 images compared to the traditional exhaustive search method.

  • PDF

A study of Implementation of Motion Estimation with ADSP-21020 (ADSP-21020을 이용한 Motion Estimation의 구현에 관한 연구)

  • Kim, Sang-Ki;Kim, Jae-Young;Byun, Chae-Ung;Chung, Chin-Hyun
    • Proceedings of the KIEE Conference
    • /
    • 1996.07b
    • /
    • pp.1380-1382
    • /
    • 1996
  • In this paper, a motion estimation module is made with ADSP-21020 based on MPEG-2 which is an international standard for moving picture compression. And, the block matching algorithm used as motion estimation method is easy for an hardware implementation. The ADSP-21020 of Analog Device is used for a main control processor. We used three block matching method (exhaustive search method, 2D-logarithmic search method, three step search method) for software simulation and implemented the three step search method to hardware. For the test of the estimation module, we used ping pong image sequences and mobile and calendar image sequences.

  • PDF

3D Shape Descriptor with Interatomic Distance for Screening the Molecular Database (분자 데이터베이스 스크리닝을 위한 원자간 거리 기반의 3차원 형상 기술자)

  • Lee, Jae-Ho;Park, Joon-Young
    • Korean Journal of Computational Design and Engineering
    • /
    • v.14 no.6
    • /
    • pp.404-414
    • /
    • 2009
  • In the computational molecular analysis, 3D structural comparison for protein searching plays a very important role. As protein databases have been grown rapidly in size, exhaustive search methods cannot provide satisfactory performance. Because exhaustive search methods try to handle the structure of protein by using sphere set which is converted from atoms set, the similarity calculation about two sphere sets is very expensive. Instead, the filter-and-refine paradigm offers an efficient alternative to database search without compromising the accuracy of the answers. In recent, a very fast algorithm based on the inter-atomic distance has been suggested by Ballester and Richard. Since they adopted the moments of distribution with inter-atomic distance between atoms which are rotational invariant, they can eliminate the structure alignment and orientation fix process and perform the searching faster than previous methods. In this paper, we propose a new 3D shape descriptor. It has properties of the general shape distribution and useful property in screening the molecular database. We show some experimental results for the validity of our method.

Atom Number and Bounding Sphere Based Search Speedup Technique for Similar Proteins Screening (원자개수와 경계구에 기반한 유사 단백질 스크리닝을 위한 검색 가속 기법)

  • Lee, Jaeho;Park, JoonYoung
    • Korean Journal of Computational Design and Engineering
    • /
    • v.20 no.4
    • /
    • pp.321-327
    • /
    • 2015
  • In the protein database search, 3D structural shape comparison for protein screening plays a important role. Protein databases have big size and have been grown rapidly. Exhaustive search methods cannot provide a satisfactory performance. As protein is composed of a set of spheres, the similarity calculation of two set of spheres is very expensive. Thus, a reasonable filtering method could be an answer for the speedup of protein screening. In this paper, we suggest a speedup method for protein screening with atom number and bounding sphere. We also show some experimental results for the validity of our method.

Optimization of the Number of Antennas for Energy Efficiency in Massive MIMO WPCN (Massive MIMO WPCN에서 에너지 효율 향상을 위한 안테나 수 최적화 기법)

  • Han, Yonggue;Sim, Dongkyu;Lee, Chungyong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.3
    • /
    • pp.19-24
    • /
    • 2015
  • We introduce an optimization of the number of base station antennas in massive multiple-input multiple-output (MIMO) wireless powered communication network (WPCN). We use channel hardening property of massive MIMO system to approximate channel gain in terms of the number of base station antennas. Then, we find an optimal solution by partial differential and obtain a closed form solution by using Lambert-W function. The simulation results show that the approximation and the method of solving the optimization problem are reasonable, and the optimal solution of proposed scheme is almost identical to the optimal number of base station antennas by the exhaustive search method.

An Improved Genetic Algorithm for Fast Face Detection Using Neural Network as Classifier

  • Sugisaka, Masanori;Fan, Xinjian
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2005.06a
    • /
    • pp.1034-1038
    • /
    • 2005
  • This paper presents a novel method to speed up neural network (NN) based face detection systems. NN-based face detection can be viewed as a classification and search problem. The proposed method formulates the search problem as an integer nonlinear optimization problem (INLP) and develops an improved genetic algorithm (IGA) to solve it. Each individual in the IGA represents a subwindow in an input image. The subwindows are evaluated by how well they match a NN-based face filter. A face is indicated when the filter response of the best particle is above a given threshold. Experimental results show that the proposed method leads to a speedup of 83 on $320{\times}240$ images compared to the traditional exhaustive search method.

  • PDF

Combined Image Retrieval System using Clustering and Condensation Method (클러스터링과 차원축약 기법을 통합한 영상 검색 시스템)

  • Lee Se-Han;Cho Jungwon;Choi Byung-Uk
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.1 s.307
    • /
    • pp.53-66
    • /
    • 2006
  • This paper proposes the combined image retrieval system that gives the same relevance as exhaustive search method while its performance can be considerably improved. This system is combined with two different retrieval methods and each gives the same results that full exhaustive search method does. Both of them are two-stage method. One uses condensation of feature vectors, and the other uses binary-tree clustering. These two methods extract the candidate images that always include correct answers at the first stage, and then filter out the incorrect images at the second stage. Inasmuch as these methods use equal algorithm, they can get the same result as full exhaustive search. The first method condenses the dimension of feature vectors, and it uses these condensed feature vectors to compute similarity of query and images in database. It can be found that there is an optimal condensation ratio which minimizes the overall retrieval time. The optimal ratio is applied to first stage of this method. Binary-tree clustering method, searching with recursive 2-means clustering, classifies each cluster dynamically with the same radius. For preserving relevance, its range of query has to be compensated at first stage. After candidate clusters were selected, final results are retrieved by computing similarities again at second stage. The proposed method is combined with above two methods. Because they are not dependent on each other, combined retrieval system can make a remarkable progress in performance.

Optimization of Condensation Ratio for Fast Image Retrieval (영상 검색의 속도 향상을 위한 차원 축소율 최적화)

  • 이세한;이주호;조정원;최병욱
    • Proceedings of the IEEK Conference
    • /
    • 2003.07d
    • /
    • pp.1515-1518
    • /
    • 2003
  • This paper suggests the condensed two-stage retrieval method for fast image retrieval in the content-based image retrieval system, and proves the validity of the performance. The condensed two-stage retrieval method reduces the overall response time remarkably while it maintains relevance with the conventional exhaustive search method. It is explained by properties of the Cauchy-Schwartz inequality. In experimental result, it turns out that there is an optimal value of condensation ratio which minimizes the overall response time. We analyze the optimal condensation ratio by modeling a similarity computation time mathematically.

  • PDF

Comparison of neural network algorithms for the optimal routing in a Multistage Interconnection Network (MIN의 최적경로 배정을 위한 신경회로망 알고리즘의 비교)

  • Kim, Seong-Su;Gong, Seong-Gon
    • Proceedings of the KIEE Conference
    • /
    • 1995.11a
    • /
    • pp.569-571
    • /
    • 1995
  • This paper compares the simulated annealing and the Hopfield neural network method for an optimal routing in a multistage interconnection network(MIN). The MIN provides a multiple number of paths for ATM cells to avoid cell conflict. Exhaustive search always finds the optimal path, but with heavy computation. Although greedy method sets up a path quickly, the path found need not be optimal. The simulated annealing can find an sub optimal path in time comparable with the greedy method.

  • PDF

Optimum Design of RC Frames Based on the Principle of Divid Parameters (변수분리의 원리를 이용한 RC구조물의 최적설계)

  • 정영식;정석준;김봉익
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 1994.10a
    • /
    • pp.267-272
    • /
    • 1994
  • This work presents a method of optimum design for reinforced concrete building frames with rectangular cross sections. The optimization techniques used is based on the principle of divided parameters. The design variable parameters are divided into two groups, external and internal, and the optimization is also divided into external and internal procedure. This principle overcomes difficulties arising from the presence of two materials in one element, the property peculiar to reinforced concrete. Several search algorithms are tested to verify their accuracy for the external optimization. Among them pattern search algorithms has been found consistent. This work proposes a new method, modified pattern search, and a number of sample problems prove its accuracy and usefulness. Exhaustive search for all local minima in the design spaces for two sample problems has been carried out to understand the nature of the problem. The number of local minima identified is quite more than expected and it has become understood that the researcher's task in this field is to find a better local minimum if not global. The designs produced by the method preposed have been found better than those from other method, and they are in full accord with ACI Building Code Requirments(ACI 318-89).

  • PDF