• 제목/요약/키워드: Block variance

검색결과 143건 처리시간 0.028초

훈련 알고리듬을 이용한 변환격자코드에 의한 영상신호 압축 (Transform Trellis Image Coding Using a Training Algorithm)

  • 김동윤
    • 대한의용생체공학회:의공학회지
    • /
    • 제15권1호
    • /
    • pp.83-88
    • /
    • 1994
  • The transform trellis code is an optimal source code as a block size and the constraint length of a shift register go to infinite for stationary Gaussian sources with the squared-error distortion measure. However to implement this code, we have to choose the finite block size and constraint length. Moreover real-world sources are inherently non stationary. To overcome these difficulties, we developed a training algorithm for the transform trellis code. The trained transform trellis code which uses the same rates to each block led to a variation in the resulting distortion from one block to another. To alleviate this non-uniformity in the encoded image, we constructed clusters from the variance of the training data and assigned different rates for each cluster.

  • PDF

움직임 벡터 및 보상 블록의 특성을 이용한 움직임 보상된 차영상 CVQ (Motion Compensated Difference Image CVQ Using the Characteristics of Motion Vectors and Compensated Blocks)

  • 최정현;이경환;이법기;정원식;김경규;김덕규
    • 대한전자공학회논문지SP
    • /
    • 제37권2호
    • /
    • pp.15-20
    • /
    • 2000
  • 본 논문에서는, 움직임 벡터와 보상 블록을 이용한 분류기를 제안하고, 이 분류기로써 MCD(motion compensated difference) 블록을 CVQ(classified vector quantization)하는 새로운 MCDI(motion compensated difference image) 부호화 방법을 제안하였다. MCD 블록의 분산은 움직임 벡터의 크기뿐만 아니라 보상 블록의 분산과도 밀접한 관계가 있으므로, 이 특성들을 이용하여, 새로운 분류기를 제안하였다. 제안한 방법은 서브 코드북(sub-codebook)을 선택하는 분류기에 대한 부가 정보가 필요 없으면서, 모의 실험 결과 분류 비트가 필요한 기존의 방법에 비해 제안한 방법이 좋은 성능을 나타내었다.

  • PDF

웨이브렛 변환을 이용한 블록기반 변환 부호화 영상에서의 반복적 블록화 현상 제거 (Iterative Reduction of Blocking Artifact in Block Transform-Coded Images Using Wavelet Transform)

  • 장익훈;김남철
    • 한국통신학회논문지
    • /
    • 제24권12B호
    • /
    • pp.2369-2381
    • /
    • 1999
  • 본 논문에서는 웨이브렛 변환을 이용하여 블록기반 변환 부호화 영상에서의 블록화 현상을 반복적으로 제거하는 방법을 제안하였다. 제안된 방법에서는 블록화 현상이 수직, 수평 방향의 블록 경계를 따라 수직, 수평으로만 나타나는 점에 착안하여, 블록화 현상이 있는 영상 신호를 수직, 수평 방향의 분리적인 1차원 신호의 집합으로 간주하고 Gaussian 형태 함수의 1차 도함수를 모 웨이브렛으로 하는 1차원 웨이브렛 영역에서의 평균 자승 오차를 최소화시키는 필터로써 첫 번째 스케일 웨이브렛 영역의 블록 경계 위치에서의 분산이 다른 위치에 비하여 유달리 크게 나타나도록 하는 블록화 현상에 의한 신호 성분을 제거하는 과정과 양자화에 관한 블록 집합으로 투영하는 과정을 반복적으로 수행하여 블록화 현상이 제거된 영상을 얻는다. 실험결과, 제안된 방법은 0.56 - 1.07dB의 PSNR 성능 향상뿐만 아니라 에지 몽롱화가 없이 블록화 현상이 거의 제거된 주관적 화질 개선을 보였다.

  • PDF

웨이브렛 영역의 BDIP 및 BVLC 특징과 WPCA 분류기를 이용한 질감 분류 (Texture Classification Using Wavelet-Domain BDIP and BVLC Features With WPCA Classifier)

  • 김남철;김미혜;소현주;장익훈
    • 대한전자공학회논문지SP
    • /
    • 제49권2호
    • /
    • pp.102-112
    • /
    • 2012
  • 본 논문에서는 웨이브렛 영역의 BDIP(block difference of inverse probabilities)와 BVLC(block variance of local correlation coefficients) 특징, 그리고 WPCA(whitened principal component analysis) 분류기를 이용한 질감 분류 방법을 제안한다. 제안된 방법에서는 먼저 질의 영상에 웨이브렛 변환을 적용한다. 그런 다음 웨이브렛 영역의 각 부대역에 BDIP와 BVLC 연산자를 적용한다. 이어서 각 BDIP, BVLC 부대역에 대하여 전역 통계치를 계산하고 그 결과들을 벡터화하여 특징 벡터로 사용한다. 분류 단계에서는 얼굴 인식에 주로 사용되는 WPCA를 분류기로 하여 질의 특징 벡터와 가장 유사한 학습 특징 벡터를 찾는다. 실험 결과 제안된 방법은 3가지의 실험 질감 영상 DB에 대하여 낮은 특징 벡터 차원으로 매우 우수한 질감 분류 성능을 보여준다.

Influence of different universal adhesives on the repair performance of hybrid CAD-CAM materials

  • Demirel, Gulbike;Baltacioglu, Ismail Hakki
    • Restorative Dentistry and Endodontics
    • /
    • 제44권3호
    • /
    • pp.23.1-23.9
    • /
    • 2019
  • Objectives: The aim of this study was to investigate the microshear bond strength (${\mu}SBS$) of different universal adhesive systems applied to hybrid computer-aided design/computer-aided manufacturing (CAD-CAM) restorative materials repaired with a composite resin. Materials and Methods: Four types of CAD-CAM hybrid block materials-Lava Ultimate (LA), Vita Enamic (VE), CeraSmart (CS), and Shofu Block HC (SH)-were used in this study, in combination with the following four adhesive protocols: 1) control: porcelain primer + total etch adhesive (CO), 2) Single Bond Universal (SB), 3) All Bond Universal (AB), and 4) Clearfil Universal Bond (CU). The ${\mu}SBS$ of the composite resin (Clearfil Majesty Esthetic) was measured and the data were analyzed using two-way analysis of variance and the Tukey test, with the level of significance set at p < 0.05. Results: The CAD-CAM block type and block-adhesive combination had significant effects on the bond strength values (p < 0.05). Significant differences were found between the following pairs of groups: VE/CO and VE/AB, CS/CO and CS/AB, VE/CU and CS/CU, and VE/AB and CS/AB (p < 0.05). Conclusions: The ${\mu}SBS$ values were affected by hybrid block type. All tested universal adhesive treatments can be used as an alternative to the control treatment for repair, except the AB system on VE blocks (the VE/AB group). The ${\mu}SBS$ values showed variation across different adhesive treatments on different hybrid CAD-CAM block types.

엔트로피에 기반한 영상분할을 이용한 영상검색 (Image Retrieval Using Entropy-Based Image Segmentation)

  • 장동식;유헌우;강호증
    • 제어로봇시스템학회논문지
    • /
    • 제8권4호
    • /
    • pp.333-337
    • /
    • 2002
  • A content-based image retrieval method using color, texture, and shape features is proposed in this paper. A region segmentation technique using PIM(Picture Information Measure) entropy is used for similarity indexing. For segmentation, a color image is first transformed to a gray image and it is divided into n$\times$n non-overlapping blocks. Entropy using PIM is obtained from each block. Adequate variance to perform good segmentation of images in the database is obtained heuristically. As variance increases up to some bound, objects within the image can be easily segmented from the background. Therefore, variance is a good indication for adequate image segmentation. For high variance image, the image is segmented into two regions-high and low entropy regions. In high entropy region, hue-saturation-intensity and canny edge histograms are used for image similarity calculation. For image having lower variance is well represented by global texture information. Experiments show that the proposed method displayed similar images at the average of 4th rank for top-10 retrieval case.

Blind adaptive receiver for uplink multiuser massive MIMO systems

  • Shin, Joonwoo;Seo, Bangwon
    • ETRI Journal
    • /
    • 제42권1호
    • /
    • pp.26-35
    • /
    • 2020
  • Herein, we consider uplink multiuser massive multiple-input multiple-output systems when multiple users transmit information symbols to a base station (BS) by applying simple space-time block coding (STBC). At the BS receiver, two detection filters for each user are used to detect the STBC information symbols. One of these filters is for odd-indexed symbols and the other for even-indexed symbols. Using constrained output variance metric minimization, we first derive a special relation between the closed-form optimal solutions for the two detection filters. Then, using the derived special relation, we propose a new blind adaptive algorithm for implementing the minimum output variance-based optimal filters. In the proposed adaptive algorithm, filter weight vectors are updated only in the region satisfying the special relation. Through a theoretical analysis of the convergence speed and a computer simulation, we demonstrate that the proposed scheme exhibits faster convergence speed and lower steady-state bit error rate than the conventional scheme.

DCT 및 분산을 이용한 블라인드 워터마킹 (Blind Watermarking Using DCT and Variance)

  • 신용달
    • 한국멀티미디어학회논문지
    • /
    • 제9권10호
    • /
    • pp.1276-1281
    • /
    • 2006
  • 본 논문에서는 DCT를 이용한 강인한 블라인드 워터마킹 알고리즘을 제안하였다. 제안 방법에서는 $8{\times}8$블록 DCT를 행하였으며, $8{\times}8$블록의 분산, 질감영역 및 평탄영역을 이용하여 워터마크 신호들을 DCT의 직류(DC) 영역에 삽입하였다. DCT를 이용한 디지털 워터마킹 알고리즘에서는 AC 성분보다는 DC성분에서 훨씬 큰 지각 능력을 가지고 있기 때문에 DC 성분에 워터마크를 삽입하면 훨씬 강인해 질 수 있다. 제안 방법의 성능을 확인하기 위해서 컴퓨터 시뮬레이션 수행한 결과, 제안 방법이 기존의 워터마킹 방법보다 JPEG 압축율, Scaling 공격에서 매우 강인함을 확인하였다.

  • PDF

차신호 특성을 이용한 효율적인 적응적 BTC 영상 압축 알고리듬 (An Adaptive BTC Algorithm Using the Characteristics of th Error Signals for Efficient Image Compression)

  • 이상운;임인칠
    • 전자공학회논문지S
    • /
    • 제34S권4호
    • /
    • pp.25-32
    • /
    • 1997
  • In this paper, we propose an adaptive BTC algorithm using the characteristics of the error signals. The BTC algorithm has a avantage that it is low computational complexity, but a disadvantage that it produces the ragged edges in the reconstructed images for th esloping regions beause of coding the input with 2-level signals. Firstly, proposed methods classify the input into low, medium, and high activity blocks based on the variance of th einput. Using 1-level quantizer for low activity block, 2-level for medium, and 4-level for high, it is adaptive methods that reduce bit rates and the inherent quantization noises in the 2-level quantizer. Also, in case of processing high activity block, we propose a new quantization level allocation algorithm using the characteristics of the error signals between the original signals and the reconstructed signals used by 2-level quantizer, in oder that reduce bit rates superior to the conventional 4-level quantizer. Especially, considering the characteristics of input block, we reduce the bit rates without incurrng the visual noises.

  • PDF

Hybrid Deinterlacing Algorithm with Motion Vector Smoothing

  • Khvan, Dmitriy;Jeon, Gwanggil;Jeong, Jechang
    • 한국방송∙미디어공학회:학술대회논문집
    • /
    • 한국방송공학회 2012년도 하계학술대회
    • /
    • pp.262-265
    • /
    • 2012
  • In this paper we propose a new deinterlacing method with block classification and motion vector smoothing. The proposed method classifies a block, then depending on the region it belongs to, the motion estimation or line averaging is applied. To classify a block its variance is calculated. Then, for those blocks that belong to simple non-texture region the line averaging is done while motion estimation is applied to complex region. The motion vector field is smoothed using median filter what yields more accurate interpolation. In the experiments for the subjective evaluation, the proposed method bas shown satisfying results in terms of computation time consumption and peak signal-to-noise ratio. Due to the simplicity of the algorithm computation time was drastically decreased.

  • PDF