• Title/Summary/Keyword: Shifting Algorithm

Search Result 178, Processing Time 0.024 seconds

Group Building Based Power Consumption Scheduling for the Electricity Cost Minimization with Peak Load Reduction

  • Oh, Eunsung;Park, Jong-Bae;Son, Sung-Yong
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.6
    • /
    • pp.1843-1850
    • /
    • 2014
  • In this paper, we investigate a group building based power consumption scheduling to minimize the electricity cost. We consider the demand shift to reduce the peak load and suggest the compensation function reflecting the relationship between the change of the building demand and the occupants' comfort. Using that, the electricity cost minimization problem satisfied the convexity is formulated, and the optimal power consumption scheduling algorithm is proposed based on the iterative method. Extensive simulations show that the proposed algorithm achieves the group management gain compared to the individual building operation by increasing the degree of freedom for the operation.

Face Detection Using Color Information (색상 정보를 이용한 얼굴 영역 추출)

  • 장선아;유지상
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.6B
    • /
    • pp.1012-1020
    • /
    • 2000
  • In this paper, This paper presents a new algorithm which is used for detecting and extracting human masks from a color still image. The regions where each pixel has a value of skin-color were extracted from the Cb and Cr images, after the tone of the color image is converted to YCbCr from. A morphological filter is used to eliminate noise in the resulting image. By scanning it in horizontal and vertical ways under ways under threshold value, first candidate section is chosen. If it is not a face, secondary candidate section is taken and is divided into two candidate sections. The proposed algorithm is not affected by the variation of illuminations, because it uses only Cb and Cr components in YCbCr color format. Moreover, the face recognition was possible regardless of the degree of shifting face, changed shape, various sizes of the face, and the quality of image.

  • PDF

Cancellation of MRI Motion Artifact in Image Plane (촬상단면내의 MRI 체동 아티팩트의 제거)

  • 김응규;권영도
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.631-634
    • /
    • 1999
  • In this work, a new algorithm for canceling MRI artifact in the image plane is presented. In the conventional approach, the motions in the X(readout) direction and Y(the phase encoding) direction are estimated simultaneously. However, the feature of each X and Y directional motion is different. First, we notice that the X directional motion corresponds to a shift of the X directional spectrum of the MRI signal, and the non zero area of the spectrum just corresponds to X axis projected area of the density function. So the motion is estimated by tracing the edges of the spectrum, and the X directional motion is canceled by shifting the spectrum in inverse direction. Next, the Y directional motion is canceled using a new constraint, with which the motion component and the true image component can be separated. This algorithm is shown to be effective by simulations.

  • PDF

Cancellation of Motion Artifact in MRI Image Plane (MRI 촬상단면내의 체동 아티팩트의 제거)

  • 김응규;권영도
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.1075-1078
    • /
    • 1999
  • In this study, a new algorithm for canceling MRI artifacts through the translational motion of image plane is presented. Bloating is often makes problems in a clinical diagnosis. Assuming that the head moves up and down due to breathing, rigid translational motions in only y(phase encoding axis) direction is treated. First, we notice that the x directional motion corresponds to a shift of the x directional spectrum of the MRI signal, and the non zero area of the spectrum just corresponds to x axis projected area of the density function. So the motion is estimated by tracing the edges of the spectrum, and the x directional motion is canceled by shifting the spectrum in inverse direction. Next, the y directional motion is canceled using a new constraint, with which the motion component and the true image component can be separated. Finally, the effectiveness of this algorithm is shown by using a phantom with simulated motions.

  • PDF

ESPI Simulation for the Vibration Modes of the Thin Right-Angled Plate (얇은 직각판의 진동 모드에 대한 ESPI 시뮬레이션)

  • 장순석
    • Journal of KSNVE
    • /
    • v.9 no.3
    • /
    • pp.509-516
    • /
    • 1999
  • The ESPI (Electronic Speckle Pattern Interferometry) algorithm has been simulated to calculate vibrational modes of a thin right-angled STS304 plate. The phase transformation of the reference wave of the ESPI is carried out only one time during vibration in order to clarify ESPI speckle patterns. Two dimensional vibrational modes are calculated from one ESPI pattern before vibration onset and two ESPI patterns during vibrations but with and without the phase transformation. The ESPI harmonic results are compared with those derived from the finite element method (FEM), and they agree very well. Additionally a phase unwrapping algorithm has been newly developed to derive a displacement map from an ESPI phase map.

  • PDF

Phase Error Reduction for Multi-frequency Fringe Projection Profilometry Using Adaptive Compensation

  • Cho, Choon Sik;Han, Junghee
    • Current Optics and Photonics
    • /
    • v.2 no.4
    • /
    • pp.332-339
    • /
    • 2018
  • A new multi-frequency fringe projection method is proposed to reduce the nonlinear phase error in 3-D shape measurements using an adaptive compensation method. The phase error of the traditional fringe projection technique originates from various sources such as lens distortion, the nonlinear imaging system and a nonsinusoidal fringe pattern that can be very difficult to model. Inherent possibility of phase error appearing hinders one from accurate 3-D reconstruction. In this work, an adaptive compensation algorithm is introduced to reduce adaptively the phase error resulting from the fringe projection profilometry. Three different frequencies are used for generating the gratings of projector and conveyed to the four-step phase-shifting procedure to measure the objects of very discontinuous surfaces. The 3-D shape results show that this proposed technique succeeds in reconstructing the 3-D shape of any type of objects.

Outlier rejection in automobile-mounted NFOV camera (지능화 차량을 위한 오정합점 제거 방법)

  • Suhr, Jae-Kyu;Bea, Kwang-Hyuk;Jung, Ho-Gi;Kim, Jai-Hie
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.375-376
    • /
    • 2007
  • This paper proposes an algorithm for rejecting mismatched points (known as outliers). The proposed algorithm identifies and rejects outliers in image pairs obtained under automobile-like motions which consist of two translations and one rotation. The camera rotation is approximated to the image shift by assuming that the narrow field of lens is used. The voting method estimates the focus of expansion (FOE) while shifting one of the images. Using the properties of the FOE, the outliers are rejected while most of the inliers are retained.

  • PDF

A Study on the Optimization of Stowage Planning for Container Terminal Considered by Hatch (Hatch를 고려한 컨테이너 터미널 적재순서 최적화 연구)

  • Lee, Sang-Heon;Kim, Moon-Gyu;Ahn, Tae-Ho
    • IE interfaces
    • /
    • v.19 no.4
    • /
    • pp.270-280
    • /
    • 2006
  • The shipping plan for an efficient augmentation of terminal is NP-hard problem which is subordinate to a shipping quantity. The load location problem and stowage planning problem are two important tactical problems for the efficient operations of container terminals. This paper is concerned with reduction of feasible region in constraints for stowage planning. After designing model which minimizes the number of shifting and the travel distance of the transfer crane, the simulated annealing algorithm is employed to search optimal solution quickly and accurately. In order to apply more realistic approach, the partial restriction through adding hatch is complemented to stowage planning decision problem applied in cluster. A variety of numerical experiments demonstrated that solutions by simulated annealing algorithm are useful and applicable in practice.

Timing Window Shifting by Gate Sizing for Crosstalk Avoidance (크로스톡 회피를 위한 게이트 사이징을 이용한 타이밍 윈도우 이동)

  • Zang, Na-Eun;Kim, Ju-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.11
    • /
    • pp.119-126
    • /
    • 2007
  • This paper presents an efficient heuristic algorithm to avoid crosstalk which effects to delay of CMOS digital circuit by downsizing and upsizing of Gate. The proposed algorithm divide into two step, step1 performs downsizing of gate, step2 performs upsizing, so that avoid adjacent aggressor to critical path in series. The proposed algorithm has been verified on LGSynth91 benchmark circuits and Experimental results show an average 8.64% Crosstalk Avoidance effect. This result proved new potential of proposed algorithm.

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.