• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.15 no.3 s.96
• /
• pp.266-271
• /
• 2005

Although time-frequency analysis is useful for dispersive wave analysis, conventional methods such as the short-time Fourier transform do not take the dispersion phenomenon into consideration in the tiling of the time-frequency domain. The objective of this paper is to develop an adaptive time-frequency analysis method whose time-frequency tiling is determined with the consideration of signal dispersion characteristics. To achieve the adaptive time-frequency tiling, each of time-frequency atoms is rotated in the time-frequency plane depending on the local wave dispersion. To carry out this adaptive time-frequency transform, dispersion characteristics hidden in a signal are first estimated by an iterative scheme. To examine the effectiveness of the present method, the flexural wave signals measured in a plate were analyzed.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2004.11a
• /
• pp.606-610
• /
• 2004

Although time-frequency analysis is useful for dispersive wave analysis, conventional methods such as the short-time Fourier transform do not take the dispersion phenomenon into consideration in the tiling of the time-frequency domain. The objective of this paper is to develop an adaptive time-frequency analysis method whose time-frequency tiling is determined with the consideration of signal dispersion characteristics. To achieve the adaptive time-frequency tiling, each of time-frequency atoms is rotated in the time-frequency plane depending on the local wave dispersion. To carry out this adaptive time-frequency transform, dispersion characteristics hidden in a signal are first estimated by an iterative scheme. To examine the effectiveness of the proposed method, the flexural wave signals measured in a plate were analyzed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1627-1648
• /
• 2012

We propose an adaptive method for detecting plagiarized pairs from a large set of source code. This method is adaptive in that it uses an adaptive algorithm and it provides an adaptive threshold for determining plagiarism. Conventional algorithms are based on greedy string tiling or on local alignments of two code strings. However, most of them are not adaptive; they do not consider the characteristics of the program set, thereby causing a problem for a program set in which all the programs are inherently similar. We propose adaptive local alignment-a variant of local alignment that uses an adaptive similarity matrix. Each entry of this matrix is the logarithm of the probabilities of the keywords based on their frequency in a given program set. We also propose an adaptive threshold based on the local outlier factor (LOF), which represents the likelihood of an entity being an outlier. Experimental results indicate that our method is more sensitive than JPlag, which uses greedy string tiling for detecting plagiarism-suspected code pairs. Further, the adaptive threshold based on the LOF is shown to be effective, and the detection performance shows high sensitivity with negligible loss of specificity, compared with that using a fixed threshold.

• The KIPS Transactions:PartB
• /
• v.19B no.1
• /
• pp.1-8
• /
• 2012

Mosaic is to make a big image by gathering lots of small materials having various colors. With advance of digital imaging techniques, photomosaic techniques using photos are widely used. In this paper, we presents an automatic photomosaic algorithm based on adaptive tiling and block matching. The proposed algorithm is composed of two processes: photo database generation and photomosaic generation. Photo database is a set of photos (or tiles) used for mosaic, where a tile is divided into $4{\times}4$ regions and the average RGB value of each region is the feature of the tile. Photomosaic generation is composed of 4 steps: feature extraction, adaptive tiling, block matching, and intensity adjustment. In feature extraction, the feature of each block is calculated after the image is splitted into the preset size of blocks. In adaptive tiling, the blocks having similar similarities are merged. Then, the blocks are compared with tiles in photo database by comparing euclidean distance as a similarity measure in block matching. Finally, in intensity adjustment, the intensity of the matched tile is replaced as that of the block to increase the similarity between the tile and the block. Also, a tile redundancy minimization scheme of adjacent blocks is applied to enhance the quality of mosaic photos. In comparison with Andrea mosaic software, the proposed algorithm outperforms in quantitative and qualitative analysis.

• Journal of Mechanical Science and Technology
• /
• v.20 no.12
• /
• pp.2147-2158
• /
• 2006

The continuous wavelet transform (CWT) has a frequency-adaptive time-frequency tiling property, which makes it popular for the analysis of dispersive elastic wave signals. However, because the time-frequency tiling of CWT is not signal-dependent, it still has some limitations in the analysis of elastic waves with spectral components that are dispersed rapidly in time. The objective of this paper is to introduce an advanced time-frequency analysis method, called the dispersion-based continuous wavelet transform (D-CWT) whose time-frequency tiling is adaptively varied according to the dispersion relation of the waves to be analyzed. In the D-CWT method, time-frequency tiling can have frequency-adaptive characteristics like CWT and adaptively rotate in the time-frequency plane depending on the local wave dispersion. Therefore, D-CWT provides higher time-frequency localization than the conventional CWT. In this work, D-CWT method is applied to the analysis of dispersive elastic waves measured in waveguide experiments and an efficient procedure to extract information on the dispersion relation hidden in a wave signal is presented. In addition, the ridge property of the present transform is investigated theoretically to show its effectiveness in analyzing highly time-varying signals. Numerical simulations and experimental results are presented to show the effectiveness of the present method.

• Journal of KIISE:Software and Applications
• /
• v.33 no.12
• /
• pp.1090-1102
• /
• 2006

This paper suggests a new algorithm for detecting the plagiarism among a set of source codes, constrained to be functionally equivalent, such are submitted for a programming assignment or for a programming contest problem. The typical algorithms largely exploited up to now are based on Greedy-String Tiling, which seeks for a perfect match of substrings, and analysis of similarity between strings based on the local alignment of the two strings. This paper introduces a new method for detecting the similar interval of the given programs based on an adaptive similarity matrix, each entry of which is the logarithm of the probabilities of the keywords based on the frequencies of them in the given set of programs. We experimented this method using a set of programs submitted for more than 10 real programming contests. According to the experimental results, we can find several advantages of this method compared to the previous one which uses fixed similarity matrix(+1 for match, -1 for mismatch, -2 for gap) and also can find that the adaptive similarity matrix can be used for detecting various plagiarism cases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.801-814
• /
• 2004

In this paper, we propose a block adaptive binarization (BAB) using a modified quadratic filter (MQF) to binarize business card images acquired by personal digital assistant (PDA) cameras effectively. In the proposed method, a business card image is first partitioned into blocks of 8${\times}$8 and the blocks are then classified into character Hocks (CBs) and background blocks (BBs). Each classified CB is windowed with a 24${\times}$24 rectangular window centering around the CB and the windowed blocks are improved by the pre-processing filter MQF, in which the scheme of threshold selection in QF is modified. The 8${\times}$8 center block of the improved block is barbarized with the threshold selected in the MQF. A binary image is obtained tiling each binarized block in its original position. Experimental results show that the MQF and the BAB have much better effects on the performance of binarization compared to the QF and the global binarization (GB), respectively, for the test business card images acquired in a PDA. Also the proposed BAB using MQF gives binary images of much better quality, in which the characters appear much better clearly, over the conventional GB using QF. In addition, the binary images by the proposed BAB using MQF yields about 87.7% of character recognition rate so that about 32.0% performance improvement over those by the GB using QF yielding about 55.7% of character recognition rate using a commercial character recognition software.

• Journal of KIISE:Software and Applications
• /
• v.36 no.6
• /
• pp.451-461
• /
• 2009

The Adaptive Random Testing(ART) aims to improve the performance of traditional Random Testing(RT) by reducing the number of test cases to find the failure region which is located in the input domain. Such enhancement can be obtained by efficient selection algorithms of test cases. The ART through Iterative Partitioning(IP-ART) is one of ART techniques and it uses an iterative input domain partitioning method to improve the performance of early-versions of ART which have significant drawbacks in computation time. And the IP-ART with Enlarged Input Domain(EIP-ART), an improved version of IP-ART, is known to make additional performance improvement with scalability by expanding to virtual test space beyond real input domain of IP-ART. The EIP-ART algorithm, however, have the drawback of heavy cost of computation time to generate test cases mainly due to the virtual input domain enlargement. For this reason, two algorithms are proposed in this paper to mitigate the computation overhead of the EIP-ART. In the experiments by simulations, the tiling technique of input domain, one of two proposed algorithms, showed significant improvements in terms of computation time and testing performance.