• Title/Summary/Keyword: Information Filling

Search Result 359, Processing Time 0.028 seconds

An algorithm for segmenting gaseous object images (기체의 영상 분할을 위한 알고리즘 구현)

  • 정봉철;김원하
    • Proceedings of the IEEK Conference
    • /
    • 2002.06d
    • /
    • pp.73-76
    • /
    • 2002
  • This paper has been studied an algorithm for segmenting gaseous object images. A new methodology for segmenting gaseous object images is introduced. Proposed method consists offuzzy-based boundary detector applicable to gaseous as well as rigid objects and concave region filling to recover object regions.

  • PDF

Optimal Power and Spectrum Allocation Scheme in Multicell WRAN (Multicell WRAN에서의 최적 전력 및 주파수 할당 기법)

  • Hwang, In-Kwan;Lim, Yeon-Jun;Cho, Hae-Keun;Song, Myoung-Sun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.6A
    • /
    • pp.666-675
    • /
    • 2008
  • The IEEE 802.22 standard is being developed with the target of improving the efficiency of spectrum utilization and importing the new wireless communication service. The WRAN standard based on Cognitive Radio is being processed for sharing TV bands. In this paper, the efficient spectrum allocation scheme and the optimal power allocation scheme, Partial Constant Power Water Filling (PCPWF), are proposed to maximize the channel capacity and spectrum efficiency and minimize the interference between adjacent cells. And we maximize the system throughput and fairness by using proposed dynamic cell plan that efficiently allocates channel. The results of the simulations are presented to verify the utilization of our proposed scheme.

Image Restoration and Object Removal Using Prioritized Adaptive Patch-Based Inpainting in a Wavelet Domain

  • Borole, Rajesh P.;Bonde, Sanjiv V.
    • Journal of Information Processing Systems
    • /
    • v.13 no.5
    • /
    • pp.1183-1202
    • /
    • 2017
  • Image restoration has been carried out by texture synthesis mostly for large regions and inpainting algorithms for small cracks in images. In this paper, we propose a new approach that allows for the simultaneous fill-in of different structures and textures by processing in a wavelet domain. A combination of structure inpainting and patch-based texture synthesis is carried out, which is known as patch-based inpainting, for filling and updating the target region. The wavelet transform is used for its very good multiresolution capabilities. The proposed algorithm uses the wavelet domain subbands to resolve the structure and texture components in smooth approximation and high frequency structural details. The subbands are processed separately by the prioritized patch-based inpainting with isophote energy driven texture synthesis at the core. The algorithm automatically estimates the wavelet coefficients of the target regions of various subbands using optimized patches from the surrounding DWT coefficients. The suggested performance improvement drastically improves execution speed over the existing algorithm. The proposed patch optimization strategy improves the quality of the fill. The fill-in is done with higher priority to structures and isophotes arriving at target boundaries. The effectiveness of the algorithm is demonstrated with natural and textured images with varying textural complexions.

License Plate Extraction Using Gray Labeling and fuzzy Membership Function (그레이 레이블링 및 퍼지 추론 규칙을 이용한 흰색 자동차 번호판 추출 기법)

  • Kim, Do-Hyeon;Cha, Eui-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.8
    • /
    • pp.1495-1504
    • /
    • 2008
  • New license plates have been used since 2007. This paper proposes a new license plate extraction method using a gray labeling and a fuzzy reasoning method. First, the proposed method extracts the candidate plates by the gray labeling which is the enhanced version of a non-recursive flood-filling algorithm. By newly designed fuzzy inference system. fitness of each candidate plates are calculated. Finally, the area of the license plate in a image is extracted as a region of the candidate label which has the highest fitness. In the experiments, various license plate images took from indoor/outdoor parking lot, street, etc. by digital camera or cellular phone were used and the proposed extraction method was showed remarkable results of a 94 percent success.

Study on the Methods of Enhancing the Quality of DIBR-based Multiview Intermediate Images using Depth Expansion and Mesh Construction (깊이 정보 확장과 메쉬 구성을 이용한 DIBR 기반 다시점 중간 영상 화질 향상 방법에 관한 연구)

  • Park, Kyoung Shin;Kim, Jiseong;Cho, Yongjoo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.1
    • /
    • pp.127-135
    • /
    • 2015
  • In this research, we conducted an experiment on evaluating the extending depth information method and surface reconstruction method and the interaction of these two methods in order to enhance the final intermediate view images, which are acquired using DIBR (Depth-Image-Based Rendering) method. We evaluated the experimental control groups using the Microsoft's "Ballet" and "Break Dancer" data sets with three different hole-filling algorithms. The result revealed that the quality was improved the most by applying both extending depth information and surface reconstruction method as compared to the previous point clouds only. In addition, it found that the quality of the intermediate images was improved vastly by only applying extending depth information when using no hole-filling algorithm.

An Efficient Spatial Join Method Using DOT Index (DOT 색인을 이용한 효율적인 공간 조인 기법)

  • Back, Hyun;Yoon, Jee-Hee;Won, Jung-Im;Park, Sang-Hyun
    • Journal of KIISE:Databases
    • /
    • v.34 no.5
    • /
    • pp.420-436
    • /
    • 2007
  • The choice of an effective indexing method is crucial to guarantee the performance of the spatial join operator which is heavily used in geographical information systems. The $R^*$-tree based method is renowned as one of the most representative indexing methods. In this paper, we propose an efficient spatial join technique based on the DOT(Double Transformation) index, and compare it with the spatial Join technique based on the $R^*$-tree index. The DOT index transforms the MBR of an spatial object into a single numeric value using a space filling curve, and builds the $B^+$-tree from a set of numeric values transformed as such. The DOT index is possible to be employed as a primary index for spatial objects. The proposed spatial join technique exploits the regularities in the moving patterns of space filling curves to divide a query region into a set of maximal sub-regions within which space filling curves traverse without interruption. Such division reduces the number of spatial transformations required to perform the spatial join and thus improves the performance of join processing. The experiments with the data sets of various distributions and sizes revealed that the proposed join technique is up to three times faster than the spatial join method based on the $R^*$-tree index.

Double-Gate MOSFET Filled with Dielectric to Reduce Sub-threshold Leakage Current

  • Hur, Jae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.10a
    • /
    • pp.283-284
    • /
    • 2012
  • In this work, a special technique called dielectric filling was carried out in order to reduce sub-threshold leakage current inside double-gated n-channel MOSFET. This calibration was done by using SILVACO Atlas(TCAD), and the result showed quite a good performance compared to the conventional double-gate MOSFET.

  • PDF

Extraction of open-caption from video (비디오 자막 추출 기법에 관한 연구)

  • 김성섭;문영식
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.04b
    • /
    • pp.481-483
    • /
    • 2001
  • 본 논문에서는 동영상으로부터 색상, 서체, 크기와 같은 사전 지식 없이도 글자/자막을 효율적으로 추출하는 방법을 제안한다. 해상도가 낮고 복잡한 배경을 포함할 수 있는 비디오에서 글자 인식률 향상을 위해 먼저 동일한 텍스트 영역의 존재하는 프레임들을 자동적으로 추출한 후 이들의 시간적 평균영상을 만들어 향상된 영상을 얻는다. 평균영상의 외각선 영상의 투영 값을 통해 문자영역을 찾고 각 텍스트 영역에 대해 1차 배경제거 과정인 region filling을 적용하여 글자의 배경들을 제거 함으로써 글자를 추출한다. 1차 배경제거의 결과를 검증하고 추가적으로 k-means를 이용한 color clustering을 적용하여 남아있는 배경들을 효율적으로 제거 함으로써 최종 글자영상을 추출한다.

  • PDF

Multiuser Bit-Interleaved Coded OFDM with Limited Feedback Infonnation (제한된 궤환정보를 이용한 다중사용자 BIC-OFDM)

  • Sung, Chang-Kyung;Kim, Ji-Hoon;Lee, In-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.2A
    • /
    • pp.107-114
    • /
    • 2008
  • In wireless access systems, there has been much interest in enhancing the performance of orthogonal frequency division multiplexing OFDM) in a frequency selective fading channel. If the channel is static and is perfectly known to both the transmitter and the receiver, the water-filling technique with adaptive modulation is known to be optimal. However, for OFDM systems, this requires intensive traffic overheads for reporting channel side information on all subcarriers to the transmitter In this paper, we propose an adaptive modulation and coding scheme for bit-interleaved coded OFDM (BIC-OFDM) for downlink packet transmissions with reduced feedback information. To minimize the feedback information, we employ a rate adaptation method based on the OFDM symbol rather than on each subcarrier. To illustrate the performance gap between the optimal water-filling and the proposed scheme, we will compare cutoff rates for both schemes. It is shown that the loss is less than 2dB while the proposed scheme significantly reduces the feedback payloads. Also, the OFDM system in multiuser environment with subcarrier grouping is considered. It is shown that by exploiting multiuser diversity the throughput of the proposed scheme approaches the channel outage capacity as the number of users and the number of subcarrier groups increase.

A Novel Image Completion Algorithm Based on Planar Features

  • Xiao, Mang;Liu, Yunxiang;Xie, Li;Chen, Qiaochuan;Li, Guangyao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.8
    • /
    • pp.3842-3855
    • /
    • 2018
  • A novel image completion method is proposed that uses the advantage of planar structural information to fill corrupted portions of an image. First, in estimating parameters of the projection plane, the image is divided into several planes, and their planar structural information is analyzed. Second, in calculating the a priori probability of patch and patch offset regularity, this information is converted into a constraint condition to guide the process of filling the hole. Experimental results show that the proposed algorithm is fast and effective, and ensures the structure continuity of the damaged region and smoothness of the texture.