• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 Ⅳ
• /
• pp.2108-2111
• /
• 2003

This paper introduces a new local feature extraction method and image matching method for the localization and classification of targets. Proposed method is based on the block-by-block projection associated with directional pattern of blocks. Each pattern has its own eigen-vertors called as CEBs(Classified Eigen-Blocks). Also proposed block-based image matching method is robust to translation and occlusion. Performance of proposed feature extraction and matching method is verified by the face localization and FLIR-vehicle-image classification test.

• 디지털산업정보학회논문지
• /
• 제14권4호
• /
• pp.169-176
• /
• 2018

In this study, we propose a new Fire Flame Region Extraction using Block Homogeneity Segmentation method of the Fire Image with irregular texture and various colors. It is generally assumed that fire flame extraction plays a very important role. The Color Image with fire flame is divided into blocks and edge strength for each block is computed by using modified color histogram intersection method that has been developed to differentiate object boundaries from irregular texture boundaries effectively. The block homogeneity is designed to have the higher value in the center of region with the homeogenous colors or texture while to have lower value near region boundaries. The image represented by the block homogeneity is gray scale image and watershed transformation technique is used to generate closed boundary for each region. As the watershed transform generally results in over-segmentation, region merging based on common boundary strength is followed. The proposed method can be applied quickly and effectively to the initial response of fire.

• 정보관리학회지
• /
• 제26권1호
• /
• pp.305-320
• /
• 2009

웹을 통해 제공되는 뉴스 페이지의 경우 필요한 정보 뿐 아니라 많은 불필요한 정보를 담고 있다. 이러한 불필요한 정보는 뉴스를 처리하는 시스템의 성능 저하와 비효율성을 가져온다. 이 연구에서는 웹 페이지로부터 뉴스 콘텐츠를 추출하기 위해 문장과 블록에 기반한 뉴스 기사 추출 방법을 제시하였다. 또한 이들을 결합하여 최적의 성능을 가져올 수 있는 방안을 모색하였다. 실험 결과, 웹 페이지에 대해 하이퍼링크 텍스트를 제거한 후 문장을 이용한 추출 방법을 적용하였을 때 효과적이었으며, 여기에 블록을 이용한 추출 방법과 결합하였을 때 더 좋은 결과를 가져왔다. 문장을 이용한 추출 방법은 추출 재현율을 높여주는 효과가 있는 것으로 나타났다.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2008년도 International Symposium on Remote Sensing
• /
• pp.104-106
• /
• 2008

This paper proposes an image based method for arranging ship blocks in a dockyard. The problem of appropriately arranging numerous blocks has to be carefully planned because it has close relation to the effectiveness of the whole working process. To implement the system, the block shape and feature points have to be obtained from block image. The block arrangement system can be implemented by the fusion of the block shape extraction and image matching technology.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.325-327
• /
• 2004

ECG limb lead II signal widely used to diagnosis heart diseases and it is essential to detect ECG events (onsets, offsets and peaks of the QRS complex P wave and T wave) and extract them from ECG signal for heart diseases diagnoses. However, it is very difficult to develop standardized feature extraction formulas since ECG signals are varying on patients and disease types. In this paper, simple feature extraction method from normal and abnormal types of ECG signals is proposed. As a signal features, heart rate, PR interval, QRS interval, QT interval, interval between S wave and baseline, and T wave types are extracted. To show the validity of proposed method, Right Bundle Branch Block (RBBB), Left Bundle Branch Block (LBBB), Sinus Bradycardia, and Sinus Tachycardia data from MIT-BIH arrhythmia database are used for feature extraction and the extraction results showed higher extraction capability compare to conventional formula based extraction method.

• 한국정보통신학회논문지
• /
• 제10권8호
• /
• pp.1373-1379
• /
• 2006

움직임 객체의 추출은 비디오 서비스 등에서 주요한 연구목적 중의 하나이다. 본 논문은 블록 움직임 벡터를 이용하여 움직임 객체를 추출하는 새로운 기법을 제시한다. 이를 위하여, 1) 사후 확률 밀도와 Gibbs 랜덤필드의 이용하여 블록 움직임 벡터를 결정하고, 2) 2-D 히스토그램을 바탕으로 전역 움직임을 구하고, 3) 경계 블록 분할 단계를 통해 객체 추출을 달성한다. 제안된 알고리듬은 특히 압축된 비디오 신호의 움직임 객체에 특히 유용하게 이용될 수 있다. 제안된 알고리듬을 여러 가지 영상에 적용한 결과 양호한 결과를 얻을 수 있었다.

• 한국정보전자통신기술학회논문지
• /
• 제12권3호
• /
• pp.186-191
• /
• 2019

본 논문은 고속 특징추출 알고리즘의 구현 방법을 제안한다. 제안하는 방법은 블록 유형 분류 알고리즘을 기반으로, 블록 유형 분류 알고리즘 적용 시, 영상 특징 정보가 발생하지 않는 스무스 블록에서 연산을 생략하여 영상 특징 검출에 필요한 연산시간을 감소시킬 수 있다. 200장의 표준 테스트 이미지를 활용해 매크로 블록의 크기를 $64{\times}64$로 나누어 스무스 블록의 발생 빈도를 측정한 결과 전체의 29.5%만큼 발생하는 것을 정량적으로 확인했다. 이 의미는 다양한 영상 정보를 포함하고 있는 표준 테스트 이미지 내에서는 29.5%에 해당하는 만큼 연산의 복잡도를 감소시킬 수 있다는 의미를 나타낸다. 제안된 방법을 케니 윤곽선 검출 알고리즘에 적용하면 이차원 미분 필터, 그라디언트 크기 및 방향 연산, 비최대 억제, 적응형 임계값 연산, 히스테리시스 임계 처리와 같은 총 다섯 단계의 영상처리에 필요한 지연시간을 완전히 제거할 수 있다. 이와 같은 방법으로 다양한 특징 검출 알고리즘에 블록 유형 구분 알고리즘을 적용해, 연산에 필요한 시간을 감소할 수 있을 것을 기대한다.

• Journal of information and communication convergence engineering
• /
• 제13권3호
• /
• pp.145-151
• /
• 2015

We describe in this paper a hardware-based improvement scheme of a real-time automatic speech recognition (ASR) system with respect to speed by designing a parallel feature extraction algorithm on a Field-Programmable Gate Array (FPGA). A computationally intensive block in the algorithm is identified implemented in hardware logic on the FPGA. One such block is mel-frequency cepstrum coefficient (MFCC) algorithm used for feature extraction process. We demonstrate that the FPGA platform may perform efficient feature extraction computation in the speech recognition system as compared to the generalpurpose CPU including the ARM processor. The Xilinx Zynq-7000 System on Chip (SoC) platform is used for the MFCC implementation. From this implementation described in this paper, we confirmed that the FPGA platform is approximately 500× faster than a sequential CPU implementation and 60× faster than a sequential ARM implementation. We thus verified that a parallelized and optimized MFCC architecture on the FPGA platform may significantly improve the execution time of an ASR system, compared to the CPU and ARM platforms.

• ETRI Journal
• /
• 제29권3호
• /
• pp.353-362
• /
• 2007

In this paper, we propose a novel unsupervised video object extraction algorithm for individual images or image sequences with low depth of field (DOF). Low DOF is a popular photographic technique which enables the representation of the photographer's intention by giving a clear focus only on an object of interest (OOI). We first describe a fast and efficient scheme for extracting OOIs from individual low-DOF images and then extend it to deal with image sequences with low DOF in the next part. The basic algorithm unfolds into three modules. In the first module, a higher-order statistics map, which represents the spatial distribution of the high-frequency components, is obtained from an input low-DOF image. The second module locates the block-based OOI for further processing. Using the block-based OOI, the final OOI is obtained with pixel-level accuracy. We also present an algorithm to extend the extraction scheme to image sequences with low DOF. The proposed system does not require any user assistance to determine the initial OOI. This is possible due to the use of low-DOF images. The experimental results indicate that the proposed algorithm can serve as an effective tool for applications, such as 2D to 3D and photo-realistic video scene generation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권4호
• /
• pp.1499-1513
• /
• 2014

This paper proposes a novel blind image watermarking scheme exploiting Block Truncation Coding (BTC). Most of existing BTC-based watermarking or data hiding methods embed information in BTC compressed images by modifying the BTC encoding stage or BTC-compressed data, resulting in watermarked images with bad quality. Other than existing BTC-based watermarking schemes, our scheme does not really perform the BTC compression on images during the embedding process but uses the parity of BTC quantization data to guide the watermark embedding and extraction processes. In our scheme, we use a binary image as the original watermark. During the embedding process, the original cover image is first partitioned into non-overlapping $4{\times}4$ blocks. Then, BTC is performed on each block to obtain its BTC quantized high mean and low mean. According to the parity of high mean and the parity of low mean, two watermark bits are embedded in each block by modifying the pixel values in the block to make sure that the parity of high mean and the parity of low mean in the modified block are equal to the two watermark bits. During the extraction process, BTC is first performed on each block to obtain its high mean and low mean. By checking the parity of high mean and the parity of low mean, we can extract the two watermark bits in each block. The experimental results show that the proposed watermarking method is fragile to most image processing operations and various kinds of attacks while preserving the invisibility very well, thus the proposed scheme can be used for image authentication.