• Title/Summary/Keyword: Region Filling

Search Result 150, Processing Time 0.025 seconds

A New Interior-Filling Algorithm Based on Binary Boundary Coding (이진 경계 코드를 이용한 새로운 영역채움 알고리듬)

  • 심재창;조석제;하영호
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.11
    • /
    • pp.1867-1871
    • /
    • 1989
  • One of the most common problems in pattern recognition and image processing is filling the interior of a region when its contour is given. The existing algorithms of the filling are parity check technique, seeding technique, and technique based on chain coding the boundaries. In this paper, a very simple but effective technique for filling the interior of bounded region is proposed. This algorithm is based on the information of binary-coded boundary direction and covers some of the drawbacks reported in the earlier relevant works.

  • PDF

Efficient Signal Filling Method Using Watershed Algorithm for MRC-based Image Compression (MRC 기반의 영상 부호화를 위한 분수령 알고리즘을 이용한 효과적인 신호 채움 기법)

  • Park, Sang-Hyo;Lee, Si-Woong
    • The Journal of the Korea Contents Association
    • /
    • v.15 no.2
    • /
    • pp.21-30
    • /
    • 2015
  • Image coding based on mixed raster content model generates don't care regions (DCR) in foreground and background layers, and its overall coding performance is greatly affected by region filling methods for DCRs. Most conventional methods for DCR filling fail in utilizing the local signal properties in hole regions and thus the high frequency components in non-DCR regions are reflected into DCR after signal filling. In addition, further high frequency components are induced to the filled signal because of signal discontinuities in the boundary of DCR. To solve this problem, a new DCR filling algorithm using the priority-based adaptive region growing is proposed in this paper. The proposed method uses the watershed algorithm and the flooding priority of each pixel for region filling is determined from the degree of smoothness in the neighborhood area. By growing the filled region into DCR based on the computed priority, the expansion of high-textured area can be minimized which can improve the overall coding performance. Experimental results show that the proposed method outperforms conventional algorithms.

Effects of Region and Sowing Date on Grain- filling and Quality in Wheat (지역 및 파종기 차이가 소맥의 등숙 및 품질에 미치는 영향)

  • 류용환;하용웅;최창열
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.28 no.3
    • /
    • pp.368-373
    • /
    • 1983
  • To study the grain development and quality during wheat grain-filling under different sowing date and region, the experiments were conducted from 1978 to 1979. The grain weight at the early grain-filling stage in Suweon was heavier than in Gwangju, but the weight at the late grain-filling stage was reversed. The ranges of the physiological maturing period in the optimal sowing for 2 years were from 43 to 49 days in Suweon and from 44 to 51 days in Gwangju. These showed the tendency of lengthened grain-filling periods in southern region, and the periods were 1-4 days longer in optimal sowing than those in late sowing. Wheat grain quality was affected significantly by environmental conditions. The milling rates were increased in southern region where the plumpness of grain was better, the protein content and sedimentation value were higher in northern region where the temperature during grain-filling was high.

  • PDF

Consider the directional hole filling method for virtual view point synthesis (가상 시점 영상 합성을 위한 방향성 고려 홀 채움 방법)

  • Mun, Ji Hun;Ho, Yo Sung
    • Smart Media Journal
    • /
    • v.3 no.4
    • /
    • pp.28-34
    • /
    • 2014
  • Recently the depth-image-based rendering (DIBR) method is usually used in 3D image application filed. Virtual view image is created by using a known view with associated depth map to make a virtual view point which did not taken by the camera. But, disocclusion area occur because the virtual view point is created using a depth image based image 3D warping. To remove those kind of disocclusion region, many hole filling methods are proposed until now. Constant color region searching, horizontal interpolation, horizontal extrapolation, and variational inpainting techniques are proposed as a hole filling methods. But when using those hole filling method some problem occurred. The different types of annoying artifacts are appear in texture region hole filling procedure. In this paper to solve those problem, the multi-directional extrapolation method is newly proposed for efficiency of expanded hole filling performance. The proposed method is efficient when performing hole filling which complex texture background region. Consideration of directionality for hole filling method use the hole neighbor texture pixel value when estimate the hole pixel value. We can check the proposed hole filling method can more efficiently fill the hole region which generated by virtual view synthesis result.

A Modified REDP Aggregate Marker for improving TCP Fairness of Assured Services

  • Hur Kyeong;Eom Doo-Seop;Tchah Kyun-Hyon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.1B
    • /
    • pp.86-100
    • /
    • 2004
  • To provide the end-to-end service differentiation for assured services, the random early demotion and promotion (REDP) marker in the edge router at each domain boundary monitors the aggregate flow of the incoming in-profile packets and demotes in-profile packets or promotes the previously demoted in-profile packets at the aggregate flow level according to the negotiated interdomain service level agreement (SLA). The REDP marker achieves UDP fairness in demoting and promoting packets through random and early marking decisions on packets. But, TCP fairness of the REDP marker is not obvious as for UDP sources. In this paper, to improve TCP fairness of the REDP marker, we propose a modified REDP marker where we combine a dropper, meters and a token filling rate configuration component with the REDP marker. To make packet transmission rates of TCP flows more fair, at the aggregate flow level the combined dropper drops incoming excessive in-profile packets randomly with a constant probability when the token level in the leaky bucket stays in demotion region without incoming demoted in-profile packets. Considering the case where the token level cannot stay in demotion region without the prior demotion, we propose a token filling rate configuration method using traffic meters. By using the token filling rate configuration method, the modified REDP marker newly configures a token filling rate which is less than the negotiated rate determined by interdomain SLA and larger than the current input aggregate in-profile traffic rate. Then, with the newly configured token filling rate, the token level in the modified REDP marker can stay in demotion region pertinently fir the operation of the dropper to improve TCP fairness. We experiment with the modified REDP marker using ns2 simulator fur TCP sources at the general case where the token level cannot stay in demotion region without the prior demotion at the negotiated rate set as the bottleneck link bandwidth. The simulation results demonstrate that through the combined dropper with the newly configured token filling rate, the modified REDP marker also increases both aggregate in-profile throughput and link utilization in addition to TCP fairness improvement compared to the REDP marker.

A STEADY FLOW MODEL OF A MAGNETIC FLUX TUBE CONSTRAINED TO OBSERVED DIFFERENTIAL EMISSION MEASURE

  • BONG SU-CHAN;CHAE JONGCHUL;YUN HONG SIK
    • Journal of The Korean Astronomical Society
    • /
    • v.33 no.3
    • /
    • pp.159-163
    • /
    • 2000
  • We have investigated one dimensional steady flow model of a typical magnetic flux tube in the solar transition region constrained to observed Differential Emission Measure (DEM) for the average quiet-Sun deduced by Raymond & Doyle (1981) with a flux tube geometry conforming to Doppler shifts of UV lines measured by Chae, Yun & Poland (1998). Because local heating and filling factor in the transition region are not well known, we considered two extreme cases, one characterized by the filling factor= 1 ('filled-up model') and the other set by local heating=0 ('not-heated model'). We examined how much the heating is required for the flux tube by recomputing a model through adjustment of the filling factor in such a way that 'not-heated model' accounts for the observed DEM.

  • PDF

Determination of Initial Billet using The Artificial Neural Networks and The Finite Element Method for The Forged Products (신경망과 유한요소법을 이용한 단조품의 초기 소재 결정)

  • 김동진;고대철;김병민;강범수;최재찬
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 1994.10a
    • /
    • pp.133-140
    • /
    • 1994
  • In this paper, we have proposed a new method to determine the initial billet for the forged products using a function approximation in neural networks. the architecture of neural network is a three-layer neural network and the back propagation algorithm is employed to train the network. By utilizing the ability of function approximation of neural network, an optimal billet is determined by applying nonlinear mathematical relationship between shape ratio in the initial billet and the final products. A volume of incomplete filling in the die is measured by the rigid-plastic finite element method. The neural network is trained with the initial billet shape ratio and that of the un-filled volume. After learning, the system is able to predict the filling region which are exactly the same or slightly different to results of finite element method. It is found that the prediction of the filling shape ratio region can be made successfully and the finite element method results are represented better by the neural network.

  • PDF

Study on video character extraction and recognition (비디오 자막 추출 및 인식 기법에 관한 연구)

  • 김종렬;김성섭;문영식
    • Proceedings of the IEEK Conference
    • /
    • 2001.06c
    • /
    • pp.141-144
    • /
    • 2001
  • In this paper, a new algorithm for extracting and recognizing characters from video, without pre-knowledge such as font, color, size of character, is proposed. To improve the recognition rate for videos with complex background at low resolution, continuous frames with identical text region are automatically detected to compose an average frame. Using boundary pixels of a text region as seeds, we apply region filling to remove background from the character Then color clustering is applied to remove remaining backgrounds according to the verification of region filling process. Features such as white run and zero-one transition from the center, are extracted from unknown characters. These feature are compared with a pre-composed character feature set to recognize the characters.

  • PDF

A Filling Analysis on Forging Process of Semi-Solid Aluminum Materials Considering Solidification Phenomena (응고현상을 고려한 반용융 알루미늄재료의 단조공정에 관한 충전해석)

  • 강충길;최진석;강동우
    • Transactions of Materials Processing
    • /
    • v.5 no.3
    • /
    • pp.239-255
    • /
    • 1996
  • A new forming technology has been developed to fabricate near-net shape products using light metal. A semi-solid forming technology has some advantages compared with the conventional forming processes such as die casting squeeze casting and hot/cold forging. In this study the numerical analysis of semi-solid filling for a straight die shape and orifice die shape in gate pattern is studied on semi-solid materials(SSM) of solid fraction fs =30% in A356 aluminum alloy. The finite difference program of Navier-Stokes equation coupled with heat transfer and solidification has been developed to predict a filling pattern and the temperature distribution of SSM. The programdeveloped in this study gives die filling patterns of SSM and final solidifica-tion region.

  • PDF

Filling and Labelling Algorithm Using Directional Information of Chain-code (체인코드의 방향정보를 이용한 Filling과 Labelling)

  • 심재창;하금숙;현기호;하영호
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.9
    • /
    • pp.50-58
    • /
    • 1992
  • A new algorithm for filling the interior of contours and labelling each filled region concurrently is presented. Filling is simply accomplished by inversion method. The labelling information in every scan lines is extracted directly from current direction of chain code so that the proposed algorithm needs less comparision and is more efficient. The contours are followed by two different directions, clockwise for the outer contour and counterclockwise for the inner contour to get filling and labelling information. This algorithm can be applied in case that contours are nested or regions are continous. Simulataneously the proposed algorithm can find the structure tree of object without additional post processing.

  • PDF