• Title/Summary/Keyword: Search Window

Search Result 207, Processing Time 0.027 seconds

Design of HEVC Motion Estimation Engine with Search Window Data Reuse and Early Termination (탐색 영역 데이터의 재사용 및 조기중단이 가능한 HEVC 움직임 추정 엔진 설계)

  • Hur, Ahrum;Park, Taewook;Lee, Seongsoo
    • Journal of IKEEE
    • /
    • v.20 no.3
    • /
    • pp.273-278
    • /
    • 2016
  • In HEVC variable block size motion estimation, same search window data are duplicatedly used in each block size. It increases memory bandwidth, and it is difficult to exploit early termination. In this paper, largest block size and its corresponding smaller block sizes with same positions are performed at the same time. It reduces memory bandwidth and computation by reusing search window data and computation results. In the early termination, image quality can be degraded when it determines early termination by observing largest block size only, since smaller block sizes cannot be equally terminated due to their relative positions. So, in this paper, processing order of early termination is changed to perform smaller block sizes in turns. The designed motion estimation engine was described in Verilog HDL and it was synthesized and verified in 0.18um process technology. Its gate count and maximum operating frequency are 36,101 gates and 263.15 MHz, respectively.

An Expanded Small Diamond Search Algorithm for Fast Block Motion Estimation (확장된 작은 다이아몬드 패턴을 이용한 고효율의 움직임 추정 알고리즘)

  • Jeong, Chang-Uk;Choi, Jin-Ku
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2006.10d
    • /
    • pp.586-590
    • /
    • 2006
  • 본 논문에서는 다이아몬드 탐색(diamond search, DS)과 효율적인 3 단계 탐색(efficient three-step search, E3SS) 등의 블록 정합 기법(block matching algorithm, BMA)들에서 이용된 작은 다이아몬드(small diamond) 패턴을 광역 탐색에 적합하도록 확장시킨 고속의 움직임 추정 알고리즘을 제안한다. 제안된 알고리즘에서는 탐색 윈도우(search window)의 중앙으로부터 설치된 정사각형 패턴의 크기가 내부에서 대수적으로 감소되며 작은 다이아몬드 탐색(small diamond search, SDS) 기법에 의해 탐색이 완료된다. 실험 결과는 제안된 알고리즘이 DS 보다 평균 3개의 탐색 점을 더 적게 사용하고 E3SS에 비하여 약 5개 정도의 탐색 점 수에 대한 이득을 보이지만 움직임 추정상의 정확도는 다른 고속 BMA들과 거의 동일한 수준을 유지하는 것으로 확인된다.

  • PDF

Comparison of Viable Rates of Chick Embryos by Different Eggshell Window Positioning (닭 배자 조작을 위한 난각 주입부위별 생존율 비교)

  • J. Y. Han;D. S. Seo;Y. H. Hong;D. K. Jeong;Y. S. Shin
    • Korean Journal of Poultry Science
    • /
    • v.23 no.1
    • /
    • pp.9-17
    • /
    • 1996
  • This study was conducted to compare the survival rate of chick embryos among different eggshell window positions and to search for the most appropriate injection position. The eggshells were punctured at blunt-end, sharp-end and side-up with a sterilized fine forceps, respectively. The survival rate of sharp-end window was higher than the other window positions. Injection of Dulbecco’s modified eagle’s medium (DMEM) through blunt-end window (BE1) was impossible because inner cell membrane was obscure. The 2 ${\mu}$L DMEM was injected into 2.5 d-old embryo blood vessel through sharp end window. To prevent hemorrhages at the point of injection, the air bubbles were injected into the embryo blood vessel. The survival rate of chicks embryo in sharp end window was about 17.0%. Therefore, this sharp-end window system will be helpful for the production of germline chimera or transgenic chicken using primordial germ cells ( PGCs ).

  • PDF

Development of Walk Score Application GUI in Smart Device for Improvement of User Convenience (사용자 편의성 향상을 위한 스마트 단말에서의 워크스코어 어플리케이션 GUI 개발)

  • An, Donghyeok;Kim, Eun Jung
    • Smart Media Journal
    • /
    • v.8 no.2
    • /
    • pp.86-93
    • /
    • 2019
  • The purpose of this study is to develop walk score application GUI in a smart device for improving user convenience. This study uses the walk score dataset of Seoul City developed in previous studies. Application GUI consists of five parts: address input window and search button, detail information (address, latitude, longitude, walk score), window switching and input window for a number of data, data input window, and menu button. For verifying application GUI, this study uses 12 locations (sets of address, latitude, longitude, and walk score) near Gangnam Station and Myungdong Station in Seoul in several scenarios. First, this study checks if the application has been implemented with address and keyword search options. Then, new data insertion and file output operations are evaluated. The application system developed in this study operated properly in all scenarios. This walk score application can be a useful device in our daily lives.

Study on an Enhanced Manufacturing Process for Mobile Camera Window Glass (Mobile용 Camera Window의 공정 개선에 관한 연구)

  • Ahn, Hae Won;Shin, Ki Hoon;Oh, Jae Ho;Kim, Hak Chul;Kwon, Soo Kun;Choi, Seong Dae
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.14 no.5
    • /
    • pp.15-21
    • /
    • 2015
  • The glass used for Mobile Camera Window is required to have high strength. Cell type manufacturing by means of CNC is widely used for camera window. Individual loading and unloading is needed for each process, such as painting and PVD, in cell type manufacturing. The purpose of this study is to search the enhanced manufacturing process with sheet type throughout bulk unit production in painting and PVD. This study includes sheet type manufacturing processes such as laser cutting, wet etching, 2nd tempering, printing, and AF/AR coating.

A New Cross and Hexagonal Search Algorithm for Fast Block Matching Motion Estimation (십자와 육각패턴을 이용한 고속 블록 정합 동작 예측 기법)

  • Park, In-Young;Nam, Hyeon-Woo;Wee, Young-Cheul;Kim, Ha-Jine
    • The KIPS Transactions:PartB
    • /
    • v.10B no.7
    • /
    • pp.811-814
    • /
    • 2003
  • In this paper, we propose a fast block-matching motion estimation method using the cross pattern and the hexagonal pattern. For the block-matching motion estimation method, full search finds the best motion estimation, but it requires huge search time because it has to check every search point within the search window. The proposed method makes use of the fact that most of motion vectors lie near the center of block. The proposed method first uses the cross pattern to search near the center of block, and then uses the hexagonal pattern to search larger motion vectors. Experimental results show that our method is better than recently proposed search algorithms in terms of mean-square error performance and required search time.

A Rapid Signal Acquisition Scheme for Noncoherent UWB Systems (비동기식 초광대역 시스템을 위한 고속 신호 동기획득 기법)

  • Kim Jae-Woon;Yang Suck-Chel;Choi Sung-Soo;Shin Yo-An
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4C
    • /
    • pp.331-340
    • /
    • 2006
  • In this Paper, we propose to extend the TSS-LS(Two-Step Search scheme with Linear search based Second step) scheme which was already proposed by the authors for coherent UWB(Ultra Wide Band) systems, to rapid and reliable acquisition of noncoherent UWB systems in multipath channels. The proposed noncoherent TSS-LS employing simple energy window banks utilizes two different thresholds and search windows to achieve fast acquisition. Furthermore, the linear search is adopted for the second step in the proposed scheme to correctly find the starting point in the range of effective delay spread of the multipath channels, and to obtain reliable BER(Bit Error Rate) performance of the noncoherent UWB systems. Simulation results with multipath channel models by IEEE 802.15.3a show that the proposed two-step search scheme can achieve significant reduction of the required mean acquisition time as compared to general search schemes. ]n addition, the proposed scheme achieves quite good BER performance for large signal-to-noise ratios, which is favorably comparable to the case of ideal perfect timing.

Mobile Robot Driving using Moving Window

  • Choi, Sung-Yug;Kang, Jin-Gu;Hur, Hwa-Ra;Ju, Jin-Hwa
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.758-761
    • /
    • 2003
  • This paper introduces a method that can detect obstacles and corridor environments from the images captured by a CCD camera in an automobile or mobile robot is proposed. Processing the input dynamic images in real time requires high performance hardware as well as efficient software. In order to relieve these requirements for detecting the useful information from the images in real time, a "Moving Window" scheme is proposed. Therefore, detecting the useful information, it becomes possible to search the obstacles within the driving corridor of an automobile or mobile robot. The feasibility of the proposed algorithm is demonstrated through the simulated experiments of the corridor driving.

  • PDF

A Study on the Automatic Document Segmentation using Stochastic Method (확률기법을 이용한 자동 문서 분할에 관한 연구)

  • 음호식;이명호
    • Journal of the Korea Society of Computer and Information
    • /
    • v.6 no.1
    • /
    • pp.82-89
    • /
    • 2001
  • It is a document segmentation to set a boundary in the documents by the contents. It is essential for the accurate and efficient information search. In this paper we want to make an automatic document segmentation system with the method of probability analysis which uses the mutual information between the words. Proposed system can move the boundary of window and compute the similarity or the two window. In this system the more words are shared and the more important the words are, the higher the cohesive force of the two window systems goes. The result of experience with the document segmentation is that despite the differences of block unit the division point at which we expected to divide was normally divided.

  • PDF

Ant Colony System for Vehicle Routing Problem with Time Window (시간제약이 있는 차량경로문제에 대한 개미군집 시스템 해법)

  • Lee, Sang-Heon;Lee, Seung-Won
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.34 no.1
    • /
    • pp.153-165
    • /
    • 2009
  • This paper apollos an ant colony system (ACS) for the vehicle routing problem with time window (VRPTW). The VRPTW is a generalization of the VRP where the service of a customer can begin within the time windows defined by the earliest and latest times when the customer will permit the start of service. The ACS has been applied effectively in geographical environment such as TSP or VRP by meta-heuristic that imitate an ant's biologic special duality in route construction, 3 saving based ACS (SB-ACS) is introduced and its solution is improved by local search. Through iterative precesses, the SB-ACS is shown to drive the best solution. The algorithm has been tested on 56 Solomon benchmarking problems and compared to the best-known solutions on literature. Experimental results shows that SB-ACS algorithm could obtain food solution in total travel distance minimization.