• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.6
• /
• pp.955-961
• /
• 2017

In this paper, we propose a parallel approximate string matching algorithm with k-mismatches for multiple fixed-length patterns (PMASM) in DNA sequences. PMASM is developed from parallel single pattern approximate string matching algorithms to effectively calculate the Hamming distances for multiple patterns with a fixed-length. In the preprocessing phase of PMASM, all target patterns are binary encoded and stored into a look-up memory. With each input character from the input string, the Hamming distances between a substring and all patterns can be updated at the same time based on the binary encoding information in the look-up memory. Moreover, PMASM adopts graphics processing units (GPUs) to process the data computations in parallel. This paper presents three kinds of PMASM implementation methods in GPUs: thread PMASM, block-thread PMASM, and shared-mem PMASM methods. The shared-mem PMASM method gives an example to effectively make use of the GPU parallel capacity. Moreover, it also exploits special features of the CUDA (Compute Unified Device Architecture) memory structure to optimize the performance. In the experiments with DNA sequences, the proposed PMASM on GPU is 385, 77, and 64 times faster than the traditional naive algorithm, the shift-add algorithm and the single thread PMASM implementation on CPU. With the same NVIDIA GPU model, the performance of the proposed approach is enhanced up to 44% and 21%, compared with the naive, and the shift-add algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.3
• /
• pp.1051-1077
• /
• 2021

The secure communication of information is a major concern over the internet. The information must be protected before transmitting over a communication channel to avoid security violations. In this paper, a new hybrid method called compressed encrypted data embedding (CEDE) is proposed. In CEDE, the secret information is first compressed with Lempel Ziv Welch (LZW) compression algorithm. Then, the compressed secret information is encrypted using the Advanced Encryption Standard (AES) symmetric block cipher. In the last step, the encrypted information is embedded into an image of size 512 × 512 pixels by using image steganography. In the steganographic technique, the compressed and encrypted secret data bits are divided into pairs of two bits and pixels of the cover image are also arranged in four pairs. The four pairs of secret data are compared with the respective four pairs of each cover pixel which leads to sixteen possibilities of matching in between secret data pairs and pairs of cover pixels. The least significant bits (LSBs) of current and imminent pixels are modified according to the matching case number. The proposed technique provides double-folded security and the results show that stego image carries a high capacity of secret data with adequate peak signal to noise ratio (PSNR) and lower mean square error (MSE) when compared with existing methods in the literature.

• The Journal of Advanced Prosthodontics
• /
• v.11 no.1
• /
• pp.55-64
• /
• 2019

PURPOSE. The accuracy of denture bases was compared among injection molding, milling, and rapid prototyping (RP) fabricating method. MATERIALS AND METHODS. The maxillary edentulous master cast was fabricated and round shaped four notches were formed. The cast was duplicated to ten casts and scanned. In the injection molding method, designed denture bases were milled from a wax block and fabricated using SR Ivocap injection system. Denture bases were milled from a pre-polymerized block in the milling method. In the RP method, denture bases were printed and post-cured. The intaglio surface of the base was scanned and surface matching software was used to measure inaccuracy. Measurements were performed between four notches and two points in the mid-palatal suture to evaluate inaccuracy. The palatine rugae resolution was evaluated. One-way analysis of variance was used for statistical analysis at ${\alpha}=.05$. RESULTS. No statistically significant differences in distances among four notches (P>.05). The accuracy of the injection molding method was lower than those of the other methods in two points of the mid-palatal suture significantly (P<.05). The degree of palatine rugae resolution was significantly higher in the injection molding method than that in other methods (P<.05). CONCLUSION. The overall accuracy of the denture base is higher in milling and RP method than the injection molding method. The degree of fine reproducibility is higher in the injection molding method than the milling or RP method.

• Spatial Information Research
• /
• v.19 no.2
• /
• pp.37-46
• /
• 2011

Recently in the field of GIS(Geographic Information System), data integration from various sources has become an important topic in order to use spatial data effectively. In general, the integration of spatial data is accomplished by navigating corresponding space object and combining the information interacting with each object. But it is very difficult to navigate an object which has correspondence with one in another dataset. Many matching methods have been studied for navigating spatial object. The purpose of this paper is development of method for searching correspondent spatial object considering local position error which is remained even after coordinate transform ation when two different building data sets integrated. To achieve this goal, we performed coordinate transformation and overlapped two data sets and generated blocks which have similar position error. We matched building objects within each block using similarity and ICP algorithm. Finally, we tested this method in the aspect of applicability.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.17 no.10 s.113
• /
• pp.929-934
• /
• 2006

In the paper, we suggest a simpler synthesis technique for capacitively-coupled match circuit(CCMC) which have a function of DC block and impedance matching simultaneously, and introduce a stability margin analysis technique for designing microwave amplifier under conditionally stable state. Stability margin analysis is used to determine optimum match point that ensure maximum gain under the given stability margin. It can reduce time consuming work for selecting match points in the conditionally stable state. Also, suggested miniaturization scheme of matching network is distinguished from previous work with respect to reducing deterministic parameters for CCMC synthesis. To verify utility of suggested method, 24 GHz gain block is fabricated under conditionally stable state using an internal thin-film fabrication process, Measured results show a stable gain of 10 dB and flatness of 1 dB, which is well coincident with simulated one.

• The Journal of Information Technology
• /
• v.3 no.2
• /
• pp.39-47
• /
• 2000

Among the compression methods of moving picture information, a motion estimation method is used to remove time-repeating. The Block Matching Algorithm in motion estimation methods is the commonest one. In recent days, it is required the more advanced high quality in many image processing fields, for example HDTV, etc. Therefore, we have to accomplish not by means of Partial Search Algorithm, but by means of Full Search Algorithm in Block Matching Algorithm. In this paper, it is suggested a structure that reduce total calculation quantity and size, because the structure using Bit Plane select and use only 3bit of 8bit luminance signal.

• Journal of KIISE:Software and Applications
• /
• v.32 no.1
• /
• pp.22-33
• /
• 2005

In this paper. we propose an image registration algorithm based on variable-sized blocks of ellipsoidal prototype model which is similar in shape to human face. While matching blocks, the existing cylindrical prototype model which only takes into account left and right curvature can accomplish a correct alignment on left and right images. But, registration errors are produced from up and down images because the cylindrical prototype model not reflects characteristics of head shape and jaw structure of human. The proposed method is a block matching algorithm which uses variable-sized blocks with considering left-right and up-down curvature of ellipsoidal face model and can correctly align images by using the correlation between them. We then adapt image mosaic technique to generate a face texture from aligned images. For this purpose, we stitch them with assigning linear weights according to the overlapped region and remove ghost effects to make more realistic facial texture.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.4
• /
• pp.418-428
• /
• 2002

In this paper, we propose a motion-adaptive de-interlacing method using motion compensated interpolation. In a conventional motion compensated method, a simple pre-filter such as line averaging is applied to interpolate missing lines before the motion estimation. However, this method causes interpolation error because of inaccurate motion estimation and compensation. In the proposed method, EBMF(Edge Based Median Filter) as a pre-filter is applied, and new matching method, which uses two same-parity fields and opposite-parity field as references, is proposed. For further improvement, motion correction filter is proposed to reduce the interpolation error caused by incorrect motion. Simulation results show that the proposed method provides better performance than existing methods.

• Journal of Korea Multimedia Society
• /
• v.14 no.4
• /
• pp.494-503
• /
• 2011

In this paper, we propose a recognition application of facial expression for laughter theraphy on smartphone. It detects face region by using AdaBoost face detection algorithm from the front camera image of a smartphone. After detecting the face image, it detects the lip region from the detected face image. From the next frame, it doesn't detect the face image but tracks the lip region which were detected in the previous frame by using the three step block matching algorithm. The size of the detected lip image varies according to the distance between camera and user. So, it scales the detected lip image with a fixed size. After that, it minimizes the effect of illumination variation by applying the bilateral symmetry and histogram matching illumination normalization. After that, it computes lip eigen vector by using PCA(Principal Component Analysis) and recognizes laughter expression by using a multilayer perceptron artificial network. The experiment results show that the proposed method could deal with 16.7 frame/s and the proposed illumination normalization method could reduce the variations of illumination better than the existing methods for better recognition performance.

• Journal of Korea Multimedia Society
• /
• v.11 no.11
• /
• pp.1480-1490
• /
• 2008

Design of a linear predictor and matching of an entropy coder is the art of lossless audio coding. In this paper, we use the covariance method and the Choleskey decomposition for calculating linear prediction coefficients instead of the autocorreation method and the Levinson-Durbin recursion. These results are compared to the polynomial predictor. Both of them, the predictor which has small prediction error is selected. For the entropy coding, we use the Golomb-Rice coder using the block-based parameter estimation method and the sequential adaptation method with LOCO-land RLGR. The proposed predictor and the block-based parameter estimation have $2.2879%{\sim}0.3413%$ improved compression ratios compared to FLAC lossless audio coder which use the autocorrelation method and the Levinson-Durbin recursion. The proposed predictor and the LOCO-I adaptation method could improved by $2.2879%{\sim}0.3413%$. But the proposed predictor and the RLGR adaptation method got better results with specific signals.