• Title/Summary/Keyword: Shift algorithm

Search Result 680, Processing Time 0.041 seconds

Progress of Edge Detection Using Mean Shift Algorithm (Mean Shift 알고리즘을 활용한 경계선 검출의 발전)

  • Jang, Dai-Hyun;Park, Sang-Joon;Park, Ki-Hong;Chung, Kyung-Taek;Hwang, Jae-Jeong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.137-139
    • /
    • 2011
  • 영상에서의 경계선 추출은 원 영상의 노이즈에 의해 크게 영향을 받는다. 따라서 먼저 그 노이즈들을 제거할만한 어떤 방법들이 필요하다. Mean Shift 알고리즘은 이러한 목적에 부합되는 유연한 함수로서, 별로 중요하지 않은 정보와 민감한 노이즈 부분을 점점 제거하는데 알맞다. 여기서는 Canny 알고리즘을 사용하여 중점으로 하는 영상에서의 윤곽선을 찾아낸다. 그리고 테스트 하고 이전의 유일한 Canny 알고리즘 보다 결과가 좋음을 알아낸다.

  • PDF

Ship Detection Using Visual Saliency Map and Mean Shift Algorithm (시각집중과 평균이동 알고리즘을 이용한 선박 검출)

  • Park, Jang-Sik
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.2
    • /
    • pp.213-218
    • /
    • 2013
  • In this paper, a video based ship detection method is proposed to monitor port efficiently. Visual saliency map algorithm and mean shift algorithm is applied to detect moving ships don't include background information which is difficult to track moving ships. It is easy to detect ships at the port using saliency map algorithm, because it is very effective to extract saliency object from background. To remove background information in the saliency region, image segmentation and clustering using mean shift algorithm is used. As results of detecting simulation with images of a camera installed at the harbor, it is shown that the proposed method is effective to detect ships.

The Intelligent Shift Algorithm for Automatic Transmissions and The Development of Simulators for Its Optimization and Analysis (지능형 자동변속 알고리즘 개발 및 성능 분석과 최적화를 위한 시뮬레이터 개발)

  • Kang, Hyo-Seok;Hyun, Chang-Ho;Park, Mignon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.5
    • /
    • pp.694-700
    • /
    • 2010
  • This paper proposes the intelligent shift algorithm for automatic transmissions and develops the simulator for the its optimization and analysis. It provides the comfortable ride to drivers and improves the driving force efficiency without any loss of the performance. In addition, the developed simulator not only cuts the commercialization cost but provides diverse test conditions. The analysis and optimization of the proposed scheme are verified by the developed simulator. As a simple example, the developed simulator verifies the proposed algorithm and shows the comparative result with the existed automatic transmission shift algorithm.

An Optical CDMA Code Acquisition Algorithm Using Multiple Thresholds (여러 개의 문턱값을 이용한 Optical CDMA 부호 획득 알고리즘)

  • Chong, Da-Hae;Lee, Young-Yoon;Ahn, Sang-Ho;Lee, Seong-Ro;Yoon, Seok-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12C
    • /
    • pp.1075-1081
    • /
    • 2008
  • In this paper, we propose a code acquisition algorithm using optical orthogonal code (OOC) for optical code division multiple access (CDMA) systems. Generally, a good code acquisition algorithm offers short mean acquisition time (MAT). The conventional multiple-shift (MS) algorithm consists of two stages and has shorter MAT than that of well-known serial-search (SS) algorithm. This paper proposes a novel code acquisition algorithm called enhanced multiple-shift (EMS) algorithm. By using multiple thresholds, the proposed EMS algorithm provides shorter MAT compared with that of the MS algorithm. The simulation results show that the EMS algorithm presents shorter MAT compared with the MS algorithm in both single-user and multi-user environments.

Estimation in Mixture of Shifted Poisson Distributions with Known Shift Parameters

  • Lee, Hyun-Jung;Oh, Chang-Hyuck
    • Journal of the Korean Data and Information Science Society
    • /
    • v.17 no.3
    • /
    • pp.785-794
    • /
    • 2006
  • Suggested is an EM algorithm for estimation in mixture of shifted Poisson distributions with known shift parameters. For this type of mixture distribution, we have to utilize values of shift parameters to determine whether each of data belongs to some component distribution. We propose a method of estimating values of component information and then follow typical EM methodology. Simulation results show that the algorithm provides reasonable performance for the distribution.

  • PDF

Feedback Shift Controller Design of Automatic Transmission for Tractors (트랙터 자동변속기 되먹임 변속 제어기 설계)

  • Jung, Gyu Hong;Jung, Chang Do;Park, Se Ha
    • Journal of Drive and Control
    • /
    • v.13 no.1
    • /
    • pp.1-9
    • /
    • 2016
  • Nowadays automatic transmission equipped vehicles prevail in construction and agricultural equipment due to their convenience in driving and operation. Though domestic vehicle manufacturers install imported electronic controlled transmissions at present, overseas products will be replaced by domestic ones in the near future owing to development efforts over the past 10 years. For passenger cars, there are many kinds of shift control algorithms that enhance the shift quality such as feedback and learning control. However, since shift control technologies for heavy duty vehicles are not highly developed, it is possible to improve the shift quality with an organized control method. A feedback control algorithm for neutral-into-gear shift, which is enabled during the inertia phase for the master clutch slip speed to track the slip speed reference, is proposed based on the power transmission structure of TH100. The performance of the feedback shift control is verified by a vehicle test which is implemented with firmware embedded TCU. As the master clutch engages along the predetermined speed trajectory, it can be concluded that the shift quality can be managed by a shift time control parameter. By extending the proposed feedback algorithm for neutral-into-gear shift to gear change and shuttle shift, it is expected that the quality of the shift can be improved.

A Heuristic Approach to the Shift-scheduling Considering the Balance of Work-load in Nuclear Power Plants (호텔 요리사의 인간공학적 작업 위험성 평가)

  • Kim, Dae-Ho;Yun, Young-Su;Lee, Yong-Hee
    • Journal of the Ergonomics Society of Korea
    • /
    • v.25 no.4
    • /
    • pp.1-7
    • /
    • 2006
  • The purpose of this study is to develop an efficient algorithm for the management of the shift schedule in nuclear power plants in consideration with the ergonomic criteria and the regulatory codes. The ergonomic criteria considered are the work hours, overtime-work frequency and working time, start and finishing time of works, allocation of rest times and duty-offs, rotating of shifts, etc. to comply with the regulations such as the Labor Standard Act, the ILO Convention No. 171, 178, "the detailed content of a periodic safety review," enforcement regulations 19-2 of the Atomic Energy Act. The developed algorithm for the shift schedule program adopts a heuristic method to minimize the difference the workload for shift workers in nuclear power plants.

Wavelet Shift Keying System Using a Binary Matching Filter (2진 정합필터를 이용한 웨이브릿 편이변조 시스템)

  • Oh, Hyoung-Jin;Jeong, Tae-Il;Lee, Tae-Oh
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.11
    • /
    • pp.1933-1938
    • /
    • 2008
  • There are the frequency shift keying(FSK), phase shift keying(PSK) and amplitude shift keying(ASK) in the conventional digital communications method. In this parer, We proposed the algorithm for wavelet shift keying system using a binary matching filter in the digital communication. Wavelet shift keying system are used to a scaling function(low frequency) and wavelet(high frequency) coefficients. The binary data is encoded by modulator which assigned the scaling function to 1(one), and wavelet to zero(0). Wavelet shift keying of the conventional method needs to a post-processing for the decoding. In this paper, wavelet shift keying signal is reconstructed by the decoder using a binary matching filter. So, it was able to the decoding without the post-processing. It was demonstrated by the experiment that the proposed algorithm is a validity.

Real-time Recognition and Tracking System of Multiple Moving Objects (다중 이동 객체의 실시간 인식 및 추적 시스템)

  • Park, Ho-Sik;Bae, Cheol-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.7C
    • /
    • pp.421-427
    • /
    • 2011
  • The importance of the real-time object recognition and tracking field has been growing steadily due to rapid advancement in the computer vision applications industry. As is well known, the mean-shift algorithm is widely used in robust real-time object tracking systems. Since the mentioned algorithm is easy to implement and efficient in object tracking computation, many say it is suitable to be applied to real-time object tracking systems. However, one of the major drawbacks of this algorithm is that it always converges to a local mode, failing to perform well in a cluttered environment. In this paper, an Optical Flow-based algorithm which fits for real-time recognition of multiple moving objects is proposed. Also in the tests, the newly proposed method contributed to raising the similarity of multiple moving objects, the similarity was as high as 0.96, up 13.4% over that of the mean-shift algorithm. Meanwhile, the level of pixel errors from using the new method keenly decreased by more than 50% over that from applying the mean-shift algorithm. If the data processing speed in the video surveillance systems can be reduced further, owing to improved algorithms for faster moving object recognition and tracking functions, we will be able to expect much more efficient intelligent systems in this industrial arena.

Efficient Design and Performance Analysis of a Hardware Right-shift Binary Modular Inversion Algorithm in GF(p)

  • Choi, Piljoo;Lee, Mun-Kyu;Kong, Jeong-Taek;Kim, Dong Kyue
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.17 no.3
    • /
    • pp.425-437
    • /
    • 2017
  • For efficient hardware (HW) implementation of elliptic curve cryptography (ECC), various sub-modules for the underlying finite field operations should be implemented efficiently. Among these sub-modules, modular inversion (MI) requires the most computation; therefore, its performance might be a dominant factor of the overall performance of an ECC module. To determine the most efficient MI algorithm for an HW ECC module, we implement various classes of MI algorithms and analyze their performance. In contrast to the common belief in previous research, our results show that the right-shift binary inversion (RS) algorithm performs well when implemented in hardware. In addition, we present optimization methods to reduce the area overhead and improve the speed of the RS algorithm. By applying these methods, we propose a new RS-variant that is both fast and compact. The proposed MI module is more than twice as fast as the other two classes of MI: shifting Euclidean (SE) and left-shift binary inversion (LS) algorithms. It consumes only 15% more area and even 5% less area than SE and LS, respectively. Finally, we show that how our new method can be applied to optimize an HW ECC module.