• Title/Summary/Keyword: moving search block

Search Result 43, Processing Time 0.015 seconds

Wavelet Transform Coding for Image Conference (화상회의를 위한 웨이브렛 변환 부호화)

  • 김정일
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.3
    • /
    • pp.73-77
    • /
    • 1999
  • In this paper. wavelet transform coding for image conference is studied. Original video frames are transformed into hierarchical pyramidal images with multiresolution using the band property of wavelet transform coefficients. Moving information between neighboring frames is obtained from the low-resolution band. Also, to control the video coding procedure. a new picture set filter is proposed. This filter controls the compression ratio of each frame depending on the correlation to the reference frame by selectively eliminating less important high-resolution areas. Consequently. video quality can be preserved and bit rate can be controlled adaptively In the simulation, to test the performance of the proposed coding method, comparisons with the full search block matching algorithm and the differential image coding algorithm are made. Consequently. the proposed method shows a reasonably good performance over existing ones.

A hybrid genetic algorithm for the optimal transporter management plan in a shipyard

  • Jun-Ho Park;Yung-Keun Kwon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.12
    • /
    • pp.49-56
    • /
    • 2023
  • In this study, we propose a genetic algorithm (GA) to optimize the allocation and operation order of transporters. The solution in the GA is represented by a set of lists each of which the operation order of the corresponding transporter. In addition, it was implemented in the form of a hybrid genetic algorithm combining effective local search operations for performance improvement. The local search reduces the number of operating transporters by moving blocks from a transporter with a low workload into that with a high workload. To evaluate the effectiveness of the proposed algorithm, it was compared with Multi-Start and a pure genetic algorithm through a simulation environment similar in scale to an actual shipyard. For the largest problem, compared to them, the number of transporters was reduced by 40% and 34%, and the total task time was reduced by 27% and 17%, respectively.

Planning for Intra-Block Remarshaling to Enhance the Efficiency of Loading Operations in an Automated Container Terminal (자동화 컨테이너 터미널의 적하 작업 효율 향상을 위한 블록 내 재정돈 계획 수립 방안)

  • Park, Ki-Yeok;Park, Tae-Jin;Kim, Min-Jung;Ryu, Kwang-Ryel
    • Journal of Intelligence and Information Systems
    • /
    • v.14 no.4
    • /
    • pp.31-46
    • /
    • 2008
  • A stacking yard of a container terminal is a space for temporarily storing the containers that are carried in or imported until they are carried out or exported. If the containers are stacked in an inappropriate way, the efficiency of operation at the time of loading decreases significantly due to the rehandlings. The remarshaling is the task of rearranging containers during the idle time of transfer crane for the effective loading operations. This paper proposes a method of planning for remarshaling in a yard block of an automated container terminal. Our method conducts a search in two stages. In the first stage, the target stacking configuration is determined in such a way that the throughput of loading is maximized. In the second stage, the crane schedule is determined so that the remarshaling task can be completed as fast as possible in moving the containers from the source configuration to the target configuration. Simulation experiments have been conducted to compare the efficiency of loading operations before and after remarshaling. The results show that our remarshaling plan is really effective in increasing the efficiency of loading operation.

  • PDF