• The Journal of Asian Finance, Economics and Business
• /
• 제10권2호
• /
• pp.257-265
• /
• 2023

This paper investigates the determinants of credit accessibility and the effect of credit on the income of farm households borrowing from Vietnam Bank for Agriculture and Rural Development, Giong Rieng District Branch, Kien Giang Province. Based on the primary data of 200 farming households who are the customer of the bank, the study applied the Probit regression model to examine determinant factors of credit accessibility of farm households and employed the Propensity score matching method to investigate the impact of credit on households' income. The findings of the Probit regression shown that three independent variables that significantly influence the access to credit of households are household size, income source, and farm size. Besides that, the Propensity score matching method results showed a difference of 23.799 million VND/year between the income of borrowing households and that of non-borrowing households at the significance level of 1%. The difference in the imcome from the interval and central matching methods are VND 24.700 million VND/year and VND 24.633 million VND/year, respectively. Given empirical findings suggetsted that several recommendations to increase the credit accessibility of farm households, thereby creating favorable conditions for improving their income.

• Journal of information and communication convergence engineering
• /
• 제9권6호
• /
• pp.671-675
• /
• 2011

DVC (Distributed Video Coding) and FRUC (Frame Rate Up Conversion) techniques need to have an efficient motion compensated frame interpolation algorithms. Conventional works of these applications have mainly focused on the performance improvement of overall system. But, in some applications, it is necessary to evaluate how well the MCI (Motion Compensated Interpolation) frame matches the original frame. For this aim, this paper deals with the modeling methods for evaluating the block-based matching cost. First, several matching criteria, which have already been dealt with the motion compensated frame interpolation, are introduced and then combined to make estimate models for the size of MSE (Mean Square Error) noise of the MCI frame to original one. Through computer simulations, it is shown that the block-based matching criteria are evaluated and the proposed model can be effectively used for estimating the MSE noise.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.15-18
• /
• 2003

This paper proposes a color matching 3D look-up table simplifying the complex color matching procedure between a monitor and a mobile display device. In order to perform color matching, it is necessary to process color of image in the device independent color space like CIEXYZ or CIELAB. We improved the S-curve model to have smaller characterization error than tolerance error. Also, as a result of the experiments, we concluded that the color matching look-up table with 64(4$\times$4$\times$4) is the smallest size allowing characterization error to be acceptable.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.474-478
• /
• 1999

Genetic algorithm is an efficient search method using principles of natural selection and population genetics. In conventional genetic algorithms, however, the size of gene pool should be increased to insure a convergency. Therefore, many memory spaces and much computation time were needed. Also, since child chromosomes were generated by chromosome crossover and gene mutation, the algorithms have a complex structure. Thus, in this paper, a compact stereo matching algorithm using a population-based incremental teaming based on probability vector is proposed to reduce these problems. The PBIL method is modified for matching environment. Since the Proposed algorithm uses a probability vector and eliminates gene pool, chromosome crossover, and gene mutation, the matching algorithm is simple and the computation load is considerably reduced. Even if the characteristics of images are changed, stable outputs are obtained without the modification of the matching algorithm.

• 반도체디스플레이기술학회지
• /
• 제8권4호
• /
• pp.95-100
• /
• 2009

This paper presents an efficient disparity matching, using sum of absolute difference (SAD) and dynamic programming (DP) algorithm. This algorithm makes use of one of area-based algorithm which is the absolute sum of the pixel difference corresponding to the window size. We use the information of the right eye brightness (B) and the left eye brightness to get an best matching results and apply the results to the left eye image using the window go by the brightness of the right eye image. This is that we can control the brightness. The major feature of this algorithm called SAD+DP+B is that although Root Mean Square (RMS) performance is slightly less than SAD+DP, due to comparing original image, its visual performance is increased drastically for matching the disparity map on account of its matching compared to SAD+DP. The simulation results demonstrate that the visual performance can be increased and the RMS is competitive with or slightly higher than SAD+DP.

• 전자공학회논문지B
• /
• 제30B권4호
• /
• pp.116-129
• /
• 1993

This paper proposes an on-line Recognition scheme of cursive Korean characters based on the DP matching and fuzzy concept. The proposed algorithm, invariant to rotation and size, reduces greatly the computational requirement of dynamic programming by matching phonemes rather than character patterns, where the angle difference and the ration of lengths between input and reference patterns are adopted as matching features. The correct matching of poorly written cursive characters becomes possible by introducing the fuzzy concept in representing the features of phonemes and the ralative position between adjacent phonemes. Computer simulation results are observed to show the effectiveness of the proposed algorithm.

• 한국콘텐츠학회논문지
• /
• 제3권2호
• /
• pp.11-18
• /
• 2003

본 논문에서는 비트패턴을 기반으로 한 고속의 가변 블록 움직임 예측 알고리즘을 제안한다. 제안된 방법은 블록내의 평균값을 기준으로 8bit 화소값을 0과 1의 비트패턴으로 변환한 후 블록의 움직임 예측을 수행한다. 비트변환을 통한 영상의 단순화는 움직임 추정의 계산적 부담을 감소시켜 빠른 탐색을 가능하게 한다. 그리고 블록 내의 움직임 정도를 미리 판별하여 이를 기반으로 한 적응적 탐색이 불필요한 탐색을 제거하고 움직임이 큰 블록에서는 정합(matching) 과정을 심화시켜 보다 빠르고 정확한 움직임 예측을 수행한다. 본 제안된 방식을 가지고 실험한 결과, 한 프레임(frame)당 적은 수의 블록으로 고정된 크기의 블록을 가진 전역탐색 블록 정합 알고리즘(full search block matching algorithm； FS-BMA)보다 예측 에러를 적게 발생시켜 평균적으로 0.5dB 정도의 PSNR 개선을 가져왔다.

• 신재생에너지
• /
• 제19권3호
• /
• pp.1-12
• /
• 2023

This study aims to evaluate the optimal size of the hydrogen facility to be installed in a zero-energy district in terms of load matching and facility efficiency. A mismatch between energy generation and consumption is a common occurrence in zero-energy districts. This mismatch adversely effects the energy grid. However, using an energy carrier such as hydrogen can solve this problem. To determine the optimal size of hydrogen fuel cells to be used on-site, simulation of hydrogen installation is required at both district-and building- levels. Each case had four operating schedules. Therefore, we evaluated eight scenarios in terms of load matching, heat loss, and facility operational efficiency. The results indicate that district-level installation of hydrogen facilities enables more efficient energy use. Additionally, based on the proposed model, we can calculate the optimal size of the hydrogen facility.

• 정보처리학회논문지C
• /
• 제13C권7호
• /
• pp.821-830
• /
• 2006

전 세계적으로 큰 피해를 주는 웜을 탐지하고 필터링 하는 것은 인터넷 보안에서 큰 이슈중의 하나이다. 웜을 탐지하는 하나의 방법으로서 리눅스 넷필터 커널 모듈이 사용된다. 웜을 탐지하는 기본 동작으로서 스트링 매칭은 네트웍 상으로 들어오는 패킷을 미리 정의된 웜 시그니쳐(Signature, 패턴)와 비교하는 것이다. 웜은 하나의 패킷 혹은 2개(혹은 그 이상의) 연속된 패킷에 나타난다. 이때, 웜의 일부분은 첫 번째 패킷에 있고 나머지 부분은 연속된 패킷 안에 있다. 웜 패턴의 최대 길이가 1024 바이트를 넘지 않는다고 가정하면, 2048 바이트의 길이를 가지는 2개의 연속된 패킷에 대해서 스트링 매칭을 수행해야만 한다. 이렇게 하기 위해, 리눅스 넷필터는 버퍼에 이전 패킷을 저장하고 버퍼링된 패킷과 현재의 패킷을 조합한 2048 바이트 크기의 스트링에 대해 매칭을 수행한다. 웜 탐지 시스템에서 다루어야 하는 동시 연결 개수의 수가 늘어날수록 버퍼(메모리)의 총 크기가 증가하고 스트링 매칭 속도가 감소하게 된다. 이에 본 논문에서는 메모리 버퍼 크기를 줄이고 스트링 매칭의 속도를 증가시키는 버퍼를 이용하지 않는 스트링 매칭 방식을 제안한다. 제안된 방식은 이전 패킷과 시그니쳐(Signature)의 부분 매칭 결과만을 저장하고 이전 패킷을 버퍼링하지 않는다. 부분 매칭 정보는 연속된 패킷에서 웜을 탐지하는데 사용된다. 제안된 방식은 리눅스 넷필터 모듈을 수정하여 구현하였고, 기존 리눅스 넷필터 모듈과 비교하였다. 실험 결과는 기존 방식에 비해 25%의 적은 메모리 사용량 및 54%의 속도 향상을 가짐을 확인하였다.

• 한국전자파학회논문지
• /
• 제14권3호
• /
• pp.290-295
• /
• 2003

Sheet형 전파흡수체를 제작하여 Mn-Zn페라이트의 입자크기에 따른 전파흡수능의 관계를 조사하였다. 입자 크기가 증가함에 따라 정합주파수는 낮은 쪽으로 이동하였으며, 정합주파수에서 전파흡수능은 감소하였다. 하지만 휴대폰의 사용주파수인 0.8 ㎓와 1.8 ㎓에서는 입자의 크기가 큰 것으로 구성되어 있는 전파흡수체자 작은 입자로 구성되어 있는 전파흡수체보다 우수한 전파흡수능을 나타내었다. 따라서 휴대폰용 전파흡수체를 Mn-Zn 페라이트 파우더로 제작할 경우에는 입자의 크기가 큰 것이 바람직하다고 생각된다.