Earticle

현재 위치 Home

Improvement Cat Swarm Optimization for Efficient Motion Estimation

첫 페이지 보기
  • 발행기관
    보안공학연구지원센터(IJHIT) 바로가기
  • 간행물
    International Journal of Hybrid Information Technology 바로가기
  • 통권
    Vol.8 No.1 (2015.01)바로가기
  • 페이지
    pp.279-294
  • 저자
    Prof. Dr. Israa Hadi, Mustafa Sabah
  • 언어
    영어(ENG)
  • URL
    https://www.earticle.net/Article/A239253

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

원문정보

초록

영어
Cat swarm optimization (CSO) is a novel meta-heuristic for evolutionary optimization algorithms based on swarm intelligence. CSO imitates the behavior of cats through two sub-modes: seeking and tracing. Previous studies have indicated that CSO algorithms outperform other well-known meta-heuristics, such as genetic algorithms and particle swarm optimization, because of complexity, sometimes the pure CSO takes a long time to converge to reach to optimal solution. For improving the convergence of CSO with better accuracy and less computational time, this study presents an improvement structure of cat swarm optimization (ICSO), capable of improving search efficiency within the problem space under the conditions of a small population size and a few iteration numbers. In this paper, an improved algorithm is presented by mixing two concepts, first concept found in parallel cat swarm optimization (PCSO) method for solving numerical optimization problems. The parallel cat swarm optimization (PCSO) method is an optimization algorithm designed to solve optimization problems Based on cats’ cooperation and competition for improving the convergence of Cat Swarm Optimization,, the second concept found in Average-Inertia Weighted CSO (AICSO) by adding a new parameter to the velocity update equation as an inertia weight and used a new form of the position update equation in the tracing mode of algorithm. The performance of ICSO is sensitive to the control parameters selection. The experimental results show that the proposed algorithm gets higher accuracy than the existing methods and requires less computational time and has much better convergence than pure CSO, and the proposed effective algorithm can provide the optimum block matching in a very short time, finding the best solution in less iteration and suitable for video tracking applications.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Cat Swarm Optimization (CSO)
  3.1. Seeking Mode: Resting and Observing
  3.2. Tracing Mode: Running After a Target
 4. CSO Movement = Seeking Mode + Tracing Mode
 5. Parallel Cat Swarm Optimization (PCSO)
  5.1. Parallel Tracing Mode Process
  5.2. Information Exchanging Process
 6. Average-Inertia Weighted Cat Swarm Optimization (AICSO)
 7. Proposed Algorithm
 8. Simulation Results
 9. Conclusion
 References

키워드

Optimization Block matching algorithms Cat swarm optimization Average-Inertia Weighted CSO parallel cat swarm optimization (PCSO) improvement structure of cat swarm optimization (ICSO)

저자

  • Prof. Dr. Israa Hadi [ Professor College of Information Technology University of Babylon ]
  • Mustafa Sabah [ Ph.D. Student, College of Information Technology University of Babylon ]

참고문헌

자료제공 : 네이버학술정보

간행물 정보

발행기관

  • 발행기관명
    보안공학연구지원센터(IJHIT) [Science & Engineering Research Support Center, Republic of Korea(IJHIT)]
  • 설립연도
    2006
  • 분야
    공학>컴퓨터학
  • 소개
    1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업

간행물

  • 간행물명
    International Journal of Hybrid Information Technology
  • 간기
    격월간
  • pISSN
    1738-9968
  • 수록기간
    2008~2016
  • 십진분류
    KDC 505 DDC 605

이 권호 내 다른 논문 / International Journal of Hybrid Information Technology Vol.8 No.1

    피인용수 : 0(자료제공 : 네이버학술정보)

    함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.

      페이지 저장