• Journal of Broadcast Engineering
• /
• v.23 no.5
• /
• pp.628-635
• /
• 2018

In this paper, we propose a fast motion estimation algorithm which is important in video encoding. So many fast motion estimation algorithms have been published for improving prediction quality and computational reduction. In the paper, we propose an algorithm that reduces unnecessary computation, while almost keeping prediction quality compared with the full search algorithm. The proposed algorithm calculates the sum of partial block matching error for each candidate, selects the candidates for the next step, compares the stability of optimal candidates with minimum error, and finds optimal motion vectors by determining the progress of the next step. By doing that, we can find the minimum error point as soon as possible and obtain fast computational speed by reducing unnecessary computations. Additionally, the proposed algorithm can be used with conventional fast motion estimation algorithms and prove it in the experimental results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1154-1163
• /
• 2007

For orthogonal frequency division multiplexing (OFDM), cyclic prefix (CP) should be longer than the length of channel impulse response. In order to prevent a loss of bandwidth efficiency due to the use of a CP, residual intersymbol interference cancellation (RISIC) method has recently been developed. In this paper, we first apply the RISIC algorithm to the space-time block coded (STBC) OFDM and the space-frequency block coded (SFBC) OFDM with insufficient CP. It is shown that in the STBC OFDM, tail cancellation as well as cyclic restoration of the RISIC should be repeated. Second, we propose iterative channel estimation method for the RISIC in the STBC OFDM system with insufficient CP. Based on the expectation-maximization (EM) algorithm, the proposed estimation method exploits the extrinsic probabilities of the channel decoder iteratively. The performance of the proposed method is evaluated by computer simulation in a multipath fading environment.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.2
• /
• pp.77-85
• /
• 2010

Fingerprint image quality checking is one of the most important issues in on-line fingerprint recognition because the recognition performance is largely affected by the quality of fingerprint images. In the past, many related fingerprint quality checking methods have typically considered the local quality of fingerprint. However, It is necessary to estimate the global quality of fingerprint to judge whether the fingerprint can be used or not in on-line recognition systems. Therefore, in this paper, we propose both local and global-based methods to calculate the fingerprint quality. Local fingerprint quality checking algorithm considers both the condition of the input fingerprints and orientation estimation errors. The 2D gradients of the fingerprint images were first separated into two sets of 1D gradients. Then，the shapes of the PDFs(Probability Density Functions) of these gradients were measured in order to determine fingerprint quality. And global fingerprint quality checking method uses neural network to estimate the global fingerprint quality based on local quality values. We also analyze the matching performance using FVC2002 database. Experimental results showed that proposed quality check method has better matching performance than NFIQ(NIST Fingerprint Image Quality) method.

• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.2
• /
• pp.30-36
• /
• 2014

Quality and resolution of camera in mobile device is improved significantly. In this paper, we propose block-based information hide techniques without image distortion for mobile device to solve image degradation in conventional watermarking methods. Information of image is composed with text such as camera maker, model, date, time, etc. Each text is converted to $8{\times}8$ pixel blocks and is added to the bottom of image. Generally image including block based information for image authentication are compressed using JPEG in mobile device. The vertical line value in JPEG header is modified by original size of image sensor. This technique can hide the block based authentication information using general decoder. In the experimental results, JPEG file size is slightly increased within 0.1% for the proposed block based authentication information encoding. Finally proposed methods can be adopted for various embedded systems using medical image, smart phone and DSLR camera.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.3C
• /
• pp.296-306
• /
• 2003

In this paper, algorithm for non-iterative decoding method is proposed and fractal image decoder based on non-iterative fractal decoding algorithm used general purpose digital signal processors is designed and implemented. The algorithm is showed that the attractor image can be obtained analytically whe n the image is encoded using the fractal algorithm proposed by Monro and Dudbridge, in which the corresponding domain block for a range block is fifed. Using the analytical formulas, we can obtain the attractor image without iteration procedure. And we get general formulas of obtained analytical formulas. Computer simulation results for various test images show that we can increase the image decoding speed by more than five times when we use the analytical formulas compared to the previous iteration methods. The fractal image decoder contains two ADSP2181's and perform image decoding by three stage pipeline structure. The performance tests of the implemented decoder is elapsed 31.2ms/frame decoding speed for QCIF data when all the frames are decoded. The results enable us to process the real-time fractal decoding over 30 frames/sec.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.2
• /
• pp.301-307
• /
• 2015

In this paper, we consider wiretap channels in the presence of an eavesdropper assuming spatially correlated MIMO(multiple-input multiple-output) channels, where we analyze a physical layer security performance of orthogonal space-time block code(OSTBC) using one-bit feedback assuming cross polarized antennas at each node. In this paper, we present a method to select a transmit-antenna group for OSTBC using one-bit feedback(O-OSTBC) and compare secrecy outage probabilities of various transmit-antenna grouping methods. Especially, we propose an efficient transmit-antenna grouping method by comparing secrecy outage probabilities of O-OSTBC and conventional OSTBC in highly correlated MIMO channels.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.6
• /
• pp.1157-1169
• /
• 2021

The disaster recovery refers to policies and procedures to ensure continuity of services and minimize loss of resources and finances in case of emergency situations such as natural disasters. In particular, the disaster recovery method by the cloud service provider has advantages such as management flexibility, high availability, and cost effectiveness. However, this method has a dependency on a service provider and has a structural limitation in which a user cannot be involved in personal data. In this paper, we propose a protocol using proxy re-encryption for data confidentiality by removing dependency on service providers by backing up user data using blockchain and distributed storage. The proposed method is implemented in Ethereum and IPFS environments, and presents the performance and cost required for backup and recovery operations.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.25 no.5
• /
• pp.86-93
• /
• 2021

In order to remove particulate matter, functional construction materials are developed. However, there is no evaluation method and infrastructure for particulate matter removal rate. Therefore, the purpose of this study was to build a particulate matter removal rate test chamber and to present a method for particulate matter removal rate. As a result, since construction materials have effectiveness in an environment where particulate matter is generated, the particulate matter injection step was proposed as a comparison target. The evaluation of the particulate removal rate was proposed by relative comparison of the slope values obtained by linear regression analysis for all concentration values measured in the particulate matter injection step. In linear regression method, all measured values can be evaluated, and the variability can be evaluated with the coefficient of determination (R-square), so that the reliability of the particulate matter removal rate can be secured.

• Journal of IKEEE
• /
• v.27 no.4
• /
• pp.472-476
• /
• 2023

Fundamental frequency/pitch period are major characteristics of speech signals. They are used in many speech applications like speech coding, speech recognition, speaker identification, and so on. In this paper, some of inflection points are used to estimate the pitch which is the inverse of the fundamental frequency. The inflection points are defined as points where local maxima, local minima or the slope changes occur. The speech signal is preprocessed to remove unnecessary inflection points due to the high frequency components using a low pass filter. Only the inflection points from local maxima are used to get the pitch period. While the existing pitch estimation methods process speech signals in blockwise, the proposed method detects the inflection points in sample and produces the pitch period/fundamental frequency estimates along the time. Computer simulation shows the usefulness of the proposed method as a fundamental frequency estimator.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.225-236
• /
• 2003

MOLAP systems store data in a multidimensional away called a 'cube' and access them using way indexes. When a cube is placed into disk, it can be Partitioned into a set of chunks of the same side length. Such a cube storage scheme is called the chunk-based MOLAP cube storage scheme. It gives data clustering effect so that all the dimensions are guaranteed to get a fair chance in terms of the query processing speed. In order to achieve high space utilization, sparse chunks are further compressed. Due to data compression, the relative position of chunks cannot be obtained in constant time without using indexes. In this paper, we propose a bitmap index for chunk-based MOLAP cubes. The index can be constructed along with the corresponding cube generation. The relative position of chunks is retained in the index so that chunk retrieval can be done in constant time. We placed in an index block as many chunks as possible so that the number of index searches is minimized for OLAP operations such as range queries. We showed the proposed index is efficient by comparing it with multidimensional indexes such as UB-tree and grid file in terms of time and space.