• The Journal of the Acoustical Society of Korea
• /
• v.38 no.6
• /
• pp.716-723
• /
• 2019

Fingerprint matching accuracy is essential in deploying a music search service. This paper deals with a method to improve fingerprint matching accuracy by utilizing an auxiliary information which is called power weight. Power weight is an expected robustness of each hash bit. While the previous power mask binarizes the expected robustness into strong and weak bits, the proposed method utilizes a real-valued function of the expected robustness as weights for fingerprint matching. As a countermeasure to the increased storage cost, we propose a compression method for the power weight which has strong temporal correlation. Experiments on the publicly-available music datasets confirmed that the proposed power weight is effective in improving fingerprint matching performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.840-855
• /
• 2011

In the context of additive noise steganography model, we propose a method to detect least significant bit (LSB) matching steganography in grayscale images. Images are decomposed into detail sub-bands with local linear transform (LLT) masks which are sensitive to embedding. Novel normalized characteristic function features weighted by a bank of band-pass filters are extracted from the detail sub-bands. A suboptimal feature set is searched by using a threshold selection algorithm. Extensive experiments are performed on four diverse uncompressed image databases. In comparison with other well-known feature sets, the proposed feature set performs the best under most circumstances.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.8
• /
• pp.1913-1925
• /
• 2012

In order to efficiently utilize limited radio resources, resource allocation schemes in OFDMA-based wireless networks have gained intensive attention recently. Instead of improving the throughput performance, the utility is adopted as the metric for resource allocation, which provides reasonable methods to build up the relationship between user experience and various quality-of-service (QoS) metrics. After formulating the optimization problem by using a weighted bipartite graph, a modified bipartite matching method is proposed to find a suboptimal solution for the resource allocation problem in OFDMA-based wireless systems with feasible computational complexity. Finally, simulation results are presented to validate the effectiveness of the proposed method.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.4
• /
• pp.127-135
• /
• 1994

In this paper we propose an EWLD(Enhanced Weighted Levenshtein Distance) algorithm to organize code-string pattern matching linear array processor based on the mappting to an one-dimensional array from a two-dimensional matching matrix, and design a processing element(PE) of the processor, N PEs are required instead of NS02T in the processor because of the mapping. Data input and output between PEs and all internal operations of each PE are performed in bit-serial fashion. The bit-serial operation consists of the computing of word distance (WD) by comparison and the selection of optimal code transformation path, and takes 22 clocks as a cycle. The layout of a PE is designed based on the double metal $1.5\mu$m CMOS rule. About 1,800 transistors consistute a processing element and 2 PEs are integrated on a 3mm$\times$3mm sized chip.

• The Journal of Engineering Research
• /
• v.2 no.1
• /
• pp.63-71
• /
• 1997

In this paper, we describe an approach that determines the identity of surfaces of an object with planar and curved surfaces from range data of the object in the scene. The proposed matching scheme presents that surface correspondence of an object is achieved by simple comparison of values for representing surfaces of the object with model in order to avoid unnecessary matching procedures. We use uniquely assigned Surface Representing Value(SRV) for representing surfaces of the object, which are sums of all weighted view-point independent features. And, the proposed method is simple, quite effective and insensitive to occlusion and noise in sensor data.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.2941-2943
• /
• 1999

The application of the aerial images are to find the 3-D elevations. Image matching techniques such as Multi-resolution techniques, WCC (Weighted Cross-Correlation), NSSR (Narrow Search Sub-pixel Registration) that we know robustly apply to images which have enough features. But the method is not adaptive in images which have not enough features due to increasing of disparity errors. In this paper, we propose Disparity Interpolation that decrease disparity errors occurring in the area where images have not enough features. By using real aerial images we compare the result from existing image matching techniques to the result from proposed method.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.536-543
• /
• 2011

The heterogeneous postal delivery model assumes that each intermediate node in the multicasting tree incurs a constant switching time for each message that is sent. We have proposed a new model where we assume a more generalized switching time at intermediate nodes. In our model, a child node v of a parent u has a switching delay vector, where the ith element of the vector indicates the switching delay incurred by u for sending the message to v after sending the message to i-1 other children of u. Given a multicast tree and switching delay vectors at each non-root node 5 in the tree, we provide an O(n$^{\frac{5}{2}}$) optimal algorithm that will decide the order in which the internal (non-leaf) nodes have to send the multicast message to its children in order to minimize the maximum end-to-end delay due to multicasting. We also show an important lower bound result that optimal multicast switching delay problem is as hard as min-max matching problem on weighted bipartite graphs and hence O(n$^{\frac{5}{2}}$) running time is tight.

• Journal of Korea Multimedia Society
• /
• v.7 no.4
• /
• pp.474-483
• /
• 2004

In this paper, we present a new Practical implementation of a person verification system using the profile of 3-dimensional(3D) face images based on weighted Hausdorff distance(WHD) used depth information. The approach works on finding the nose tip have protrusion shape on the face using iterative selection method to use a fiducial feint and extract the profile image from vertical 3D data for the nose tip. Hausdorff distance(HD) is one of usually used measures for object matching. This works analyze the conventional HD and WHD, which the weighted factor is depth information. The Ll measure for comparing two feature vectors were used, because it is simple and robust. In the experimental results, the WHD method achieves recognition rate of 94.3% when the ranked threshold is 5.

• Journal of Biomedical Engineering Research
• /
• v.28 no.5
• /
• pp.601-608
• /
• 2007

2 Dimensional Gel Electrophoresis(2DGE) is an essentialmethodology for analysis on the expression of various proteins. For example, information for the location, mass, expression, size and shape of the proteins obtained by 2DGE can be used for diagnosis, prognosis and biological progress by comparison of patients with the normal persons. Protein spot matching for this purpose is comparative analysis of protein expression pattern for the 2DGE images generated under different conditions. However, visual analysis of protein spots which are more than several hundreds included in a 2DGE image requires long time and heavy effort. Furthermore, geometrical distortion makes the spot matching for the same protein harder. In this paper, an iterative algorithm is introduced for more efficient spot matching. Proposed method is first performing global matching step, which reduces the geometrical difference between the landmarks and the spot to be matched. Thus, movement for a spot is defined by a weighted sum of the movement of the landmark spots. Weight for the summation is defined by the inverse of the distance from the spots to the landmarks. This movement is iteratively performed until the total sum of the difference between the corresponding landmarks is larger than a pre-selected value. Due to local distortion generally occurred in 2DGE images, there are many regions in whichmany spot pairs are miss-matched. In the second stage, the same spot matching algorithm is applied to such local regions with the additional landmarks for those regions. In other words, the same method is applied with the expanded landmark set to which additional landmarks are added. Our proposed algorithm for spot matching empirically proved reliable analysis of protein separation image by producing higher accuracy.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.48 no.5
• /
• pp.18-24
• /
• 2011

In multibit Sigma-Delta Modulator, one of the DEM(Dynamic Element Matching) techniques which is DWA(Data Weighted Averaging) is widely used to get rid of non-linearity caused by mismatching of capacitor that is unit element of feedback DAC. In this paper, by adjusting clock timing used in existing DWA architecture, 2n Register block used for output was replaced with 2n S-R latch block. As a result of this, MOS Tr. can be reduced and extra clock can also be removed. Moreover, two n-bit Register block used to delay n-bit data code is decreased to one n-bit Register. After designing the 3rd 3-bit SC(Switched Capacitor) Sigma-Delta Modulator by using the proposed DWA architecture, 0.1% of mismatching into unit element in input frequency 20 kHz and sampling frequency 2.56 MHz. As a consequence of the simulation, It was able to get the same resolution as the existing architecture and was able to reduce the number of MOS Tr. by 222.