• Title/Summary/Keyword: Region Filling

Search Result 150, Processing Time 0.023 seconds

Three Dimensional Finite Element Analysis of Free Surface Flow Using Filling Pattern Technique and Adaptive Grid Refinement (형상 충전 및 격자 세분화를 이용한 삼차원 자유 표면 유동의 유한 요소 해석)

  • Kim, Ki-Don;Yang, Dong-Yol;Jeong, Jun-Ho
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.28 no.11
    • /
    • pp.1348-1358
    • /
    • 2004
  • The filling pattern and an adaptive grid refinement based on the finite element method and Eulerian mesh advancement approach have been developed to analyze incompressible transient viscous flow with free surfaces. The governing equation fur flow analysis is Navier-Stokes equation including inertia and gravity effects. The mixed FE formulation and predictor-corrector method are used effectively for unsteady numerical simulation. The flow front surface and the volume inflow rate are calculated using the filling pattern technique to select an adequate pattern among seven filling patterns at each tetrahedral control volume. By adaptive grid refinement, the new flow field that renders better prediction in flow surface shape is generated and the velocity field at the flow front part is calculated more exactly. In this domain the elements in the surface region are made finer than those in the remaining regions for more efficient computation. The collapse of a water dam and the filling of a fluidity spiral have been analyzed. The numerical results have been in good agreement with the experimental results and the efficiency of the adaptive grid refinement and filling pattern techniques have been verified.

Study on News Video Character Extraction and Recognition (뉴스 비디오 자막 추출 및 인식 기법에 관한 연구)

  • 김종열;김성섭;문영식
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.1
    • /
    • pp.10-19
    • /
    • 2003
  • Caption information in news videos can be useful for video indexing and retrieval since it usually suggests or implies the contents of the video very well. In this paper, a new algorithm for extracting and recognizing characters from news video is proposed, without a priori knowledge such as font type, color, size of character. In the process of text region extraction, in order to improve the recognition rate for videos with complex background at low resolution, continuous frames with identical text regions are automatically detected to compose an average frame. The image of the averaged frame is projected to horizontal and vertical direction, and we apply region filling to remove backgrounds to produce the character. Then, K-means color clustering is applied to remove remaining backgrounds to produce the final text image. In the process of character recognition, simple features such as white run and zero-one transition from the center, are extracted from unknown characters. These feature are compared with the pre-composed character feature set to recognize the characters. Experimental results tested on various news videos show that the proposed method is superior in terms of caption extraction ability and character recognition rate.

Hole-filling Algorithm Based on Extrapolating Spatial-Temporal Background Information for View Synthesis in Free Viewpoint Television (자유 시점 TV에서 시점 합성을 위한 시공간적 배경 정보 추정 기반 홀 채움 방식)

  • Kim, Beomsu;Nguyen, Tien-Dat;Hong, Min-cheol
    • Journal of IKEEE
    • /
    • v.20 no.1
    • /
    • pp.31-44
    • /
    • 2016
  • This paper presents a hole-filling algorithm based on extrapolating spatial-temporal background information used in view synthesis for free-viewpoint television. A new background codebook is constructed and updated in order to extract reliable temporal background information. In addition, an estimation of spatial local background values is conducted to discriminate an adaptive boundary between the background region and the foreground region as well as to update the information about the hole region. The holes then are filled by combining the spatial background information and the temporal background information. In addition, an exemplar-based inpainting technique is used to fill the rest of holes, in which a priority function using background-depth information is defined to determine the order in which the holes are filled. The experimental results demonstrated that the proposed algorithm outperformed the other comparative methods about average 0.3-0.6 dB, and that it synthesized satisfactory views regardless of video characteristics and type of hole region.

Three Dimensional Finite Element Analysis of Filling Stage in Casting Process Using Adaptive Grid Refinement Technique (3차원 적응 격자 세분화를 이용한 주조 공정의 충전 해석)

  • Kim Ki Don;Jeong Jun Ho;Yang Dong Yol
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.29 no.5 s.236
    • /
    • pp.568-576
    • /
    • 2005
  • A 3-D finite element model combined with a volume tracking method is presented in this work to simulate the mold filling for casting processes. Especially, the analysis involves an adaptive grid method that is created under a criterion of element categorization of filling states and locations in the total region at each time step. By using an adaptive grid wherein the elements, finer than those in internal and external regions, are distributed at the surface region through refinement and coarsening procedures, a more efficient analysis of transient fluid flow with free surface is achieved. Adaptive grid based on VOF method is developed in tetrahedral element system. Through a 3-D analysis of the benchmark test of the casting process, the efficiency of the proposed adaptive grid method is verified. Developed FE code is applied to a typical industrial part of the casting process such as aluminum road wheel.

Virtual View Generation by a New Hole Filling Algorithm

  • Ko, Min Soo;Yoo, Jisang
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.3
    • /
    • pp.1023-1033
    • /
    • 2014
  • In this paper, performance improved hole-filling algorithm which includes the boundary noise removing pre-process that can be used for an arbitrary virtual view synthesis has been proposed. Boundary noise occurs due to the boundary mismatch between depth and texture images during the 3D warping process and it usually causes unusual defects in a generated virtual view. Common-hole is impossible to recover by using only a given original view as a reference and most of the conventional algorithms generate unnatural views that include constrained parts of the texture. To remove the boundary noise, we first find occlusion regions and expand these regions to the common-hole region in the synthesized view. Then, we fill the common-hole using the spiral weighted average algorithm and the gradient searching algorithm. The spiral weighted average algorithm keeps the boundary of each object well by using depth information and the gradient searching algorithm preserves the details. We tried to combine strong points of both the spiral weighted average algorithm and the gradient searching algorithm. We also tried to reduce the flickering defect that exists around the filled common-hole region by using a probability mask. The experimental results show that the proposed algorithm performs much better than the conventional algorithms.

Hole-Filling Methods Using Depth and Color Information for Generating Multiview Images

  • Nam, Seung-Woo;Jang, Kyung-Ho;Ban, Yun-Ji;Kim, Hye-Sun;Chien, Sung-Il
    • ETRI Journal
    • /
    • v.38 no.5
    • /
    • pp.996-1007
    • /
    • 2016
  • This paper presents new hole-filling methods for generating multiview images by using depth image based rendering (DIBR). Holes appear in a depth image captured from 3D sensors and in the multiview images rendered by DIBR. The holes are often found around the background regions of the images because the background is prone to occlusions by the foreground objects. Background-oriented priority and gradient-oriented priority are also introduced to find the order of hole-filling after the DIBR process. In addition, to obtain a sample to fill the hole region, we propose the fusing of depth and color information to obtain a weighted sum of two patches for the depth (or rendered depth) images and a new distance measure to find the best-matched patch for the rendered color images. The conventional method produces jagged edges and a blurry phenomenon in the final results, whereas the proposed method can minimize them, which is quite important for high fidelity in stereo imaging. The experimental results show that, by reducing these errors, the proposed methods can significantly improve the hole-filling quality in the multiview images generated.

A Multi-dimensional Range Query Processing using Space Filling Curves (공간 순서화 곡선을 이용한 다차원 영역 질의 처리)

  • Back, Hyun;Won, Jung-Im;Yoon, Jee-Hee
    • Journal of Korea Spatial Information System Society
    • /
    • v.8 no.2 s.17
    • /
    • pp.13-38
    • /
    • 2006
  • Range query is one of the most important operations for spatial objects, it retrieves all spatial objects that overlap a given query region in multi-dimensional space. The DOT(DOuble Transformation) is known as an efficient indexing methods, it transforms the MBR of a spatial object into a single numeric value using a space filling curve, and stores the value in a $B^+$-tree. The DOT index is possible to be employed as a primary index for spatial objects. However, the range query processing based on the DOT index requires much overhead for spatial transformations to get the query region in the final space. Also, the detailed range query processing method for 2-dimensional spatial objects has not been studied yet in this paper, we propose an efficient multi-dimensional range query processing technique based on the DOT index. The proposed technique exploits the regularities in the moving patterns of space filling curves to divide a query region into a set of maximal sub-legions within which space filling curves traverse without interruption. Such division reduces the number of spatial transformations required to perform the range query and thus improves the performance of range query processing. A visual simulator is developed to show the evaluation method and the performance of our technique.

  • PDF

A study on the total power calculation in the CONFORM process (연속압출공정의 동력계산에 대한 연구)

  • 김강수;박근배;김영호;곽인섭
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1996.11a
    • /
    • pp.105-109
    • /
    • 1996
  • The calculation of the total power required at the Continuous Extrusion Forming(CONFORM) has been performed by the theoretical analysis of three transformation regions(primary grip length and extrusion grip length, flashing). In this study, that was performed by five transformation regions(biting, upsetting, filling, extruding, flashing)and four transformation regions(biting, upsetting and filling, extruding, flashing) and then results of theoretical analyses were compared with experimental results. Results of analysis by four and five transformation regions than that of three transformation regions in the CONFORM showed in a good agreement with experimental results.

  • PDF

Hole Filling Algorithm for a Virtual-viewpoint Image by Using a Modified Exemplar Based In-painting

  • Ko, Min Soo;Yoo, Jisang
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.4
    • /
    • pp.1003-1011
    • /
    • 2016
  • In this paper, a new algorithm by using 3D warping technique to effectively fill holes that are produced when creating a virtual-viewpoint image is proposed. A hole is defined as the region that cannot be seen in the reference view when a virtual view is created. In the proposed algorithm, to reduce the blurring effect that occurs on the hole region filled by conventional algorithms and to enhance the texture quality of the generated virtual view, Exemplar Based In-painting algorithm is used. The boundary noise which occurs in the initial virtual view obtained by 3D warping is also removed. After 3D warping, we estimate the relative location of the background to the holes and then pixels adjacent to the background are filled in priority to get better result by not using only adjacent object's information. Also, the temporal inconsistency between frames can be reduced by expanding the search region up to the previous frame when searching for most similar patch. The superiority of the proposed algorithm compared to the existing algorithms can be shown through the experimental results.

Finite Element Analysis of Collapse of a Water Dam Using Filling Pattern Technique and Adaptive Grid Refinement of Triangular Elements (삼각형 요소의 형상 충전 및 격자 세분화를 이용한 붕괴하는 물 댐의 유한 요소 해석)

  • Kim, Ki-Don;Yang, Dong-Yol;Jeong, Jun-Ho
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.28 no.4
    • /
    • pp.395-405
    • /
    • 2004
  • The filling pattern and an adaptive grid refinement based on the finite element method and Eulerian mesh advancement approach have been developed to analyze incompressible transient viscous flow with free surfaces. The governing equation for flow analysis is Navier-Stokes equation including inertia and gravity effects. The mixed FE formulation and predictor-corrector method are used effectively for unsteady numerical simulation. The flow front surface and the volume inflow rate are calculated using the filling pattern technique to select an adequate pattern among four filling patterns at each triangular control volume. By adaptive grid refinement, the new flow field that renders better prediction in flow surface shape is generated and the velocity field at the flow front part is calculated more exactly. In this domain the elements in the surface region are made finer than those in the remaining regions for more efficient computation. Using the proposed numerical technique, the collapse of a water dam has been analyzed to predict flow phenomenon of fluid and the predicted front positions with respect to time have been compared with the reported experimental results.