• Title/Summary/Keyword: Fast Full Search

Search Result 154, Processing Time 0.031 seconds

Fast Disparity Vector Estimation using Motion vector in Stereo Image Coding (스테레오 영상에서 움직임 벡터를 이용한 고속 변이 벡터 추정)

  • Doh, Nam-Keum;Kim, Tae-Yong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.5
    • /
    • pp.56-65
    • /
    • 2009
  • Stereoscopic images consist of the left image and the right image. Thus, stereoscopic images have much amounts of data than single image. Then an efficient image compression technique is needed, the DPCM-based predicted coding compression technique is used in most video coding standards. Motion and disparity estimation are needed to realize the predicted coding compression technique. Their performing algorithm is block matching algorithm used in most video coding standards. Full search algorithm is a base algorithm of block matching algorithm which finds an optimal block to compare the base block with every other block in the search area. This algorithm presents the best efficiency for finding optimal blocks, but it has very large computational loads. In this paper, we have proposed fast disparity estimation algorithm using motion and disparity vector information of the prior frame in stereo image coding. We can realize fast disparity vector estimation in order to reduce search area by taking advantage of global disparity vector and to decrease computational loads by limiting search points using motion vectors and disparity vectors of prior frame. Experimental results show that the proposed algorithm has better performance in the simple image sequence than complex image sequence. We conclude that the fast disparity vector estimation is possible in simple image sequences by reducing computational complexities.

Accelerated compression of sub-images by use of effective motion estimation and difference image methods in integral imaging (집적영상에서 효율적인 물체움직임 추정 및 차 영상 기법을 이용한 서브영상의 고속 압축)

  • Lee, Hyoung-Woo;Kim, Eun-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.12
    • /
    • pp.2762-2770
    • /
    • 2012
  • In this paper, we propose a novel approach to effectively compress the sub-images transformed from the picked-up elemental images in integral imaging, in which motion vectors of the object in each sub-image are fast and accurately estimated and compensated by combined use of MSE(mean square error)-based TSS(tree-step search) and FS(full search) schemes. This is, the possible object areas in each sub-image are searched by using the fast TSS algorithm in advance, then the these selected object areas are fully searched with the accurate FS algorithm. Furthermore, the sub-images in which all object's motion vectors are compensated, are transformed into the residual images by using the difference image method and finally compressed with the MPEG-4 algorithm. Experimental results reveal that the proposed method shows 214% improvement in the compression time per each image frame compared to that of the conventional method while keeping the same compression ratio with the conventional method. These successful results confirm the feasibility of the proposed method in the practical application.

Fast Algorithm for Disparity Estimation in ATSC-M/H based Hybrid 3DTV (ATSC-M/H 기반의 융합형 3DTV를 위한 양안시차 고속 추정 알고리즘)

  • Lee, Dong-Hee;Kim, Sung-Hoon;Lee, Jooyoung;Kang, Dongwook;Jung, Kyeong-Hoon
    • Journal of Broadcast Engineering
    • /
    • v.19 no.4
    • /
    • pp.521-532
    • /
    • 2014
  • ATSC-M/H based hybrid 3DTV, which is one of the service compatible 3DTV system, has considerable quality gap between the left and right views. And CRA(Conditional Replenishment Algorithm) has been proposed to deal with the issue of resolution mismatch and improve the visual quality. In CRA, the disparity vectors of stereoscopic images are estimated. The disparity compensated left view and simply enlarged right view are compared and conditionally selected for generating the enhanced right view. In order to implement CRA, a fast algorithm is strongly required because the disparity vectors need to be obtained at every layer and the complexity of CRA is quite high. In this paper, we adopted SDSP(Small Diamond Search Pattern) instead of full search and predicted the initial position of search pattern by examining the spatio-temporal correlation of disparity vectors and also suggested the SKIP mode to limit the number of processing units. The computer simulation showed that the proposed fast algorithm could greatly reduce the processing time while minimizing the quality degradation of reconstructed right view.

A Research on the Vector Search Algorithm for the PIV Flow Analysis of image data with large dynamic range (입자의 이동거리가 큰 영상데이터의 PIV 유동 해석을 위한 속도벡터 추적 알고리즘의 연구)

  • Kim Sung Kyun
    • 한국전산유체공학회:학술대회논문집
    • /
    • 1998.11a
    • /
    • pp.13-18
    • /
    • 1998
  • The practical use of the particle image velocimetry(PIV), a whole-field velocity measurement method, requires the use of fast, reliable, computer-based methods for tracking velocity vectors. The full search block matching, the most widely studied and applied technique both in area of PIV and Image Coding and Compression, is computationally costly. Many less expensive alternatives have been proposed mostly in the area of Image Coding and Compression. Among others, TSS, NTSS, HPM are introduced for the past PIV analysis, and found to be successful. But, these algorithms are based on small dynamic range, 7 pixels/frame in maximum displacement. To analyze the images with large displacement, Even and Odd field image separation and a simple version of multi-resolution hierarchical procedures are introduced in this paper. Comparison with other algorithms are summarized. A Results of application to the turbulent backward step flow shows the improvement of new algorithm.

  • PDF

A Study on the Application of Database Management Systems to the Design of Structures -Cast of Reinforced Concrete Structure- (구조물 설계에 있어서 데이터베이스 관리 시스템의 응용에 관한 연구 -철근콘크리트 구조물 설계를 중심으로-)

  • 장주흠;윤성수;김한중;이정재
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.40 no.3
    • /
    • pp.103-112
    • /
    • 1998
  • In this study, database schema which is capable of maintaining various design-knowledge and applicable to the structural designs has been presented. Futhermore, by utilizing the database system, RECODSS (REinforced COncrete Design Support System) was developed as well. Knowledge-base that were formulated from the document is constructed by applying the concrete standard specifications of Korea from 1989. The basic drawing was prepared by $AutoCAD^TM$. As an inference in the preliminary design, the certainty function and the interpolation function were presented. The certainty function is made by assuming linear relations between each data while referencing $MYCIN^TM$ (expert systems). Nevertheless, the interpolation function was made by utilizing the linear Lagrange interpolation. For the search of the design-knowledge, fast search algorithm and full-text search algorithm were used, however, the design engine was programmed with C language. RECODSS was applied for designing a slab and a beam member. And the results were compared with the existing results. In conclusion, RECODSS was able to efficiently manage various design knowledge and to introduce stable design results.

  • PDF

A Simple and Fast Pitch Search Algorithm Using a Modified Skipping Technique in CELP Vocoder (개선된 Skipping 기법을 이용한 CELP 보코더에서의 고속피치검색 알고리듬)

  • Lee, Joo-Hun;Bae, Myung-Jin;Kwon, Choon-Woo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.14 no.2E
    • /
    • pp.33-36
    • /
    • 1995
  • Based on the Characteristics of the correlation function of speech signal, the skipping technique can reduced the computation time considerably with a little degradation of speech quality. To improve the speech quality of the skipping technique, we use the reduced form of the correlation function to check the sign of the correlation value before the match score is calculated. The experimental results show that this modified skipping technique can reduce the computation time in pitch search over 35% compared with the traditional full search method without quality degradation.

  • PDF

Development of NASTRAN-based Optimization Framework for Vibration Optimum Design of Ship Structure. (선박 구조물의 진동 최적설계를 위한 NASTRAN 기반 최적화 프레임웍의 제안)

  • Kong, Y.M.;Choi, S.H.;Chae, S.I.;Song, J.D.;Kim, Y.H.;Yang, B.S.
    • Transactions of the Korean Society for Noise and Vibration Engineering
    • /
    • v.15 no.11 s.104
    • /
    • pp.1223-1231
    • /
    • 2005
  • Recently, the issue of ship nitration due to the large scale, high speed and lightweight of ship is emerging. For pleasantness in the cabin, shipbuilders are asked for strict vibration criteria and the degree of nitration level at a deckhouse became an important condition for taking order from customers. This study proposes a new optimization framework that is NASTRAN external call type optimization method (OptShip) and applies to an optimum design to decrease the nitration level of a deckhouse. The merits of this method are capable of using of global searching method and selecting of various objective function and design variables. The global optimization algorithms used here are random tabu search method which has fast converging speed and searches various size domains and genetic algorithm which searches multi-point solutions and has a good search capability in a complex space. By adapting OptShip to full-scale model, the validity of the suggested method was investigated.

A Study on Implementation of the Fast Motion Estimation (고속 움직임 예측기 구현에 관한 연구)

  • Kim, Jin-Yean;Park, Sang-Bong;Jin, Hyun-Jun;Park, Nho-Kyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.1C
    • /
    • pp.69-77
    • /
    • 2002
  • Sine digital signal processing for motion pictures requires huge amount of data computation to store, manipulate and transmit, more effective data compression is necessary. Therefore, the ITU-T recommended H.26x as data compression standards for digital motion pictures. The data compression method that eliminates time redundancies by motion estimation using relationship between picture frames has been widely used. Most video conding systems employ block matching algorithm for the motion estimation and compensation, and the algorithm is based on the minimun value of cast functions. Therefore, fast search algorithm rather than full search algorithm is more effective in real time low data rates encodings such as H.26x. In this paper, motion estimation employing the Nearest-Neighbors algorithm is designed to reduce search time using FPGA, coded in VHDL, and simulated and verified using Xilink Foundation.

Novel IME Instructions and their Hardware Architecture for Fast Search Algorithm (고속 탐색 알고리즘에 적합한 움직임 추정 전용 명령어 및 구조 설계)

  • Bang, Ho-Il;SunWoo, Myung-Hoon
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.48 no.12
    • /
    • pp.58-65
    • /
    • 2011
  • This paper presents an ASIP (Application-specific Instruction Processor) for motion estimation that employs specific IME instructions and its programmable and reconfigurable hardware architecture for various video codecs, such as H.264/AVC, MPEG4, etc. With the proposed specific instructions and variable point 2D SAD hardware accelerator, it can handle the real-time processing requirement of High Definition (HD) video. With the SAD unit and its parallel operations using pattern information, the proposed IME instructions support not only full search algorithms but also other fast search algorithms. The hardware size is 25.5K gates for each Processing Element Group (PEG) which has 128 SAD Processor Elements (PEs). The proposed ASIP has been verified by the Synopsys Processor Designer and implemented by the Design Compiler using the IBM 90nm process technology. The hardware size is 453K gates for the IME unit and the operating frequency is 188MHz for 1080p@30 frame in real time. The proposed ASIP can reduce the hardware size about 26% and the number of operation cycles about 18%.

An Efficient Motion Search Algorithm for a Media Processor (미디어 프로세서에 적합한 효율적인 움직임 탐색 알고리즘)

  • Noh Dae-Young;Kim Seang-Hoon;Sohn Chae-Bong;Oh Seoung-Jun;Ahn Chang-Beam
    • Journal of Broadcast Engineering
    • /
    • v.9 no.4 s.25
    • /
    • pp.434-445
    • /
    • 2004
  • Motion Estimation is an essential module in video encoders based on international standards such as H.263 and MPEG. Many fast motion estimation algorithms have been proposed in order to reduce the computational complexity of a well-known full search algorithms(FS). However, these fast algorithms can not work efficiently in DSP processors recently developed for video processing. To solve for this. we propose an efficient motion estimation scheme optimized in the DSP processor like Philips TM1300. A motion vector predictor is pre-estimated and a small search range is chosen in the proposed scheme using strong motion vector correlation between a current macro block (MB) and its neighboring MB's to reduce computation time. An MPEG-4 SP@L3(Simple Profile at Level 3) encoding system is implemented in Philips TM1300 to verify the effectiveness of the proposed method. In that processor, we can achieve better performance using our method than other conventional ones while keeping visual quality as good as that of the FS.