• Title/Summary/Keyword: Block Match

Search Result 69, Processing Time 0.02 seconds

Design of wide Band Microwave Amplifier with Good Frequncy Characteristics (주파수 특성이 좋은 광대역 마이크로웨이브 증폭기의 설계)

  • Kang, Hee-Chang;park, Il;Chin, Youn-kang
    • The Proceeding of the Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.2 no.2
    • /
    • pp.3-10
    • /
    • 1991
  • The new structure method of GaAs microwave amplifiers using DC block function and impedance transforming property of DC block/transformer(non-symmetrical two - microstrip coupled line and interdigital three - microstrip coupled line), instead of chip capacitor, is presented. The newly structured microwave amplifier showed wideband characteristics(bandwidth, 3.5 GHz) and flat frequency response. Interdigital three - microstrip coupled line which is used for microwave amplifier can be used to match amplifiers as well as DC blocking.

  • PDF

An Adaptive Finite State Vector Quantization Method Using a New Side Match Distortion Function for Image Coding (영상 부호화를 위한 새로운 사이드 매치 왜곡 함수를 이용한 적응 유한상태 벡터 양자화 기법)

  • Lee, Sang-Un;Lee, Doo-Soo;Lim, In-Chil
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.10
    • /
    • pp.118-125
    • /
    • 1998
  • We introduce an adaptive finite state vector quantization using a new side match distortion function. The conventional side match distortion function can make the gray level transition between the block bounddaries as smooth as possible and proper state codebooks in the flat areas where the spatial correlations are high. But it can't make proper codebooks in the edge areas where the spatial correlations are not high. The proposed distortion function adds the variances which represent the image characteristics to the conventional side match distortion function as weighted values. Then it can select better state codebooks than the conventional side match distortion function. Also if it predicts a wrong state, the proposed quantizer can correct the state. As a result, we can obtain the satisfiable image quality.

  • PDF

Analysis on Geo-stress and casing damage based on fluid-solid coupling for Q9G3 block in Jibei oil field

  • Ji, Youjun;Li, Xiaoyu
    • Geomechanics and Engineering
    • /
    • v.15 no.1
    • /
    • pp.677-686
    • /
    • 2018
  • Aimed at serious casing damage problem during the process of oilfield development by injecting water, based on seepage mechanics, fluid mechanics and the theory of rock mechanics, the multi-physics coupling theory was also taken into account, the mathematical model for production of petroleum with water flooding was established, and the method to solve the coupling model was presented by combination of Abaqus and Eclipse software. The Q9G3 block in Jibei oilfield was taken for instance, the well log data and geological survey data were employed to build the numerical model of Q9G3 block, the method established above was applied to simulate the evolution of seepage and stress. The production data was imported into the model to conduct the history match work of the model, and the fitting accuracy of the model was quite good. The main mechanism of casing damage of the block was analyzed, and some wells with probable casing damage problem were pointed out, the displacement of the well wall matched very well with testing data of the filed. Finally, according to the simulation results, some useful measures for preventing casing damage in Jibei oilfield was proposed.

Image Compression Using Edge Map And Multi-Sided Side Match Finite-State Vector Quantization (윤곽선 맵과 다중 면 사이드 매치 유한상태 벡터 양자화를 이용한 영상 압축)

  • Cho, Seong-Hwan;Kim, Eung-Sung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.8 no.6
    • /
    • pp.1419-1427
    • /
    • 2007
  • In this paper, we propose an algorithm which implements a multi-sided side match finite-state vector quantization(MSMVQ). After extracting the edge information from an image and classifying the image into edge blocks or non-edge blocks, we construct an edge map. We subdivide edge blocks into sixteen classes using discrete cosine transform(DCT) AC coefficients. Based on edge map information, a state codebook is made from the master codebook, and side match calculation is done for two-sided or three-sided current block of image. For reducing transmitted bits, a decision is made whether or not to encode the non-edge blocks among the pre-coded blocks by using the master codebook. Also for reducing allocation bits of codeword indices to decoder, a variable length coder is used. Considering the comparison with side match finite-state vector quantization(SMVQ) and two-sided SMVQ(TSMVQ) algorithm about Zelda, Lenna, Bridge and Peppers image, the new algorithm shows better picture quality than SMVQ and TSMVQ respectively.

  • PDF

Study on a Correction of Geometrically Over-Deformed Regions for Deformable Block Match Algorithm (왜곡 블록 정합 방식의 기학학적 오류 보정 방법에 관한 연구)

  • 고기석;이우섭
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2002.11b
    • /
    • pp.339-342
    • /
    • 2002
  • 동화상 압축에서 사용되는 움직임 벡터는 영상을 일정한 크기의 블록으로 나누어 이전 영상과 가장 예측 오류가 적은 곳을 지정하여 예측한다. 블록의 이동 정도는 수직. 수평의 선형적인 움직임(translational displacements)을 가정하여 사용하기 때문에 실제 화상에서 자주 나타나는 물체의 확대 또는 축소에 의한 크기 변화. 회전. 일그러짐 등의 변화에 올바르게 예측하지 못하는 문제를 가지고 있다. 본 논문은 블록의 선형적인 이동은 물론이고 4개 노드를 자유롭게 움직임일 수 있는 왜곡된 블록 정합 방식의 움직임 예측 기법에 대하여 소개하고 왜곡 블록 정합 방식에서 나타날 수 있는 기하학적인 오류를 수정하는 보정 방법에 관해 논의한다.

  • PDF

Face Recognition by Using Zero Mean and Principal Component Anaysis (영 평균과 주요성분분석에 의한 얼굴인식)

  • Cho, Yong-Hyun
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.8 no.4
    • /
    • pp.221-226
    • /
    • 2005
  • This paper presents a hybrid method for recognizing the faces by using zero mean and principal component analysis. Zero mean is applied to reduce the 1st order statistics to data nonlinearities. PCA is also used to derive an orthonormal basis which directly leads to dimensionality reduction, and possibly to feature extraction of face image. The proposed method has been applied to the problems for recognizing the 20 face images(10 persons * 2 scenes) of 324*243 pixels from Yale face database. The 3 distances such as city-block, Euclidean, negative angle are used as measures when match the probe images to the nearest gallery images. The experimental results show that the proposed method has a superior recognition performances(speed, rate). The negative angle has been relatively achieved more an accurate similarity than city-block or Euclidean.

  • PDF

Face Recognition by Using Principal Component Anaysis and Fixed-Point Independent Component Analysis (주요성분분석과 고정점 알고리즘 독립성분분석에 의한 얼굴인식)

  • Cho, Yong-Hyun
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.8 no.3
    • /
    • pp.143-148
    • /
    • 2005
  • This paper presents a hybrid method for recognizing the faces by using principal component analysis(PCA) and fixed-point independent component analysis(FP-ICA). PCA is used to whiten the data, which reduces the effects of second-order statistics to the nonlinearities. FP-ICA is applied to extract the statistically independent features of face image. The proposed method has been applied to the problems for recognizing the 20 face images(10 persons * 2 scenes) of 324*243 pixels from Yale face database. The 3 distances such as city-block, Euclidean, negative angle are used as measures when match the probe images to the nearest gallery images. The experimental results show that the proposed method has a superior recognition performances(speed, rate). The negative angle has been relatively achieved more an accurate similarity than city-block or Euclidean.

  • PDF

Sub-Pixel Motion Estimation by Using Only integ-Pixel (정수-화소만을 이용한 1/4-화소 단위 고속 움직임 추정)

  • Cho, Hyo-Moon;Park, Dong-Kyun;Cho, Snag-Bock
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.383-384
    • /
    • 2007
  • In this paper, we propose the new and simple method for sub-pixel block search algorithm by only using integer-pixel for motion estimation and compensation. In many papers, the fast search block match algorithms based on TSS have been proposed. However, these methods could be achieved a little reduction of the computational complexity. All of searching points by 1/4-pixel have own predicted integer-pixel SAD array. Therefor, if we know initial nine SAD values by integer, which is on the searching area of the reference frame, then we can find optimal searching point by 1/4-pixel, directly.

  • PDF

A novel hardware design for SIFT generation with reduced memory requirement

  • Kim, Eung Sup;Lee, Hyuk-Jae
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.13 no.2
    • /
    • pp.157-169
    • /
    • 2013
  • Scale Invariant Feature Transform (SIFT) generates image features widely used to match objects in different images. Previous work on hardware-based SIFT implementation requires excessive internal memory and hardware logic [1]. In this paper, a new hardware organization is proposed to implement SIFT with less memory and hardware cost than the previous work. To this end, a parallel Gaussian filter bank is adopted to eliminate the buffers that store intermediate results because parallel operations allow all intermediate results available at the same time. Furthermore, the processing order is changed from the raster-scan order to the block-by-block order so that the line buffer size storing the source image is also reduced. These techniques trade the reduction of memory size with a slight increase of the execution time and external memory bandwidth. As a result, the memory size is reduced by 94.4%. The proposed hardware for SIFT implementation includes the Descriptor generation block, which is omitted in the previous work [1]. The addition of the hardwired descriptor generation improves the computation speed by about 30 times when compared with the previous work.

On the block error rate performance of cooperative non-orthogonal multiple access short-packet communications with full-duplex relay and partial relay selection

  • Ha Duy Hung;Hoang Van Toan;Tran Trung Duy;Le The Dung;Quang Sy Vu
    • ETRI Journal
    • /
    • v.46 no.3
    • /
    • pp.446-460
    • /
    • 2024
  • In this paper, we mathematically investigate a downlink non-orthogonal multiple access (NOMA) system for short-packet communications (SPC) in which the near users are used as full-duplex (FD) relays to forward intended signals from the source to a far user. In addition, partial relay selection is employed to enhance the performance of the FD relays under the impact of imperfect interference cancellation. At the far user, selection combining (SC) or maximal ratio combining (MRC) is employed to combine the signals received from the source and the selected FD relay. The analytical expressions for the average block error rate (BLER) of two users over flat Rayleigh fading channels are derived. Furthermore, closed-form asymptotic expressions of the average BLERs at the near and far users in high signal-to-noise ratio (SNR) regimes are obtained. The numerical results show that the analytical BLERs of the near user and far user closely match the simulation results.