• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.14 no.5
• /
• pp.549-560
• /
• 1989

In this paper, the method of determining the initial weighting vlaues fuctioning as a filter under the Directional Constrained Minimization of Power(DCMP) algorithm is presented. By analyzing the sideband beamformer with the Finite Impulse Response (FIR) filter concepts, the constraints of any desired directions are obtained and the initial weighing values with fast adaptation time are formulated from those constraints. By applying this proposed initial weighting values to the DCMP and the spatial averaging processor, the interference of a desired direction and the coherent noises are eliminated at the same time. The improvement of this method compared with the existing algorithm is confirmed by computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9C
• /
• pp.704-711
• /
• 2008

This paper proposes a new de-interlacing method which results in efficient visual improvement. In the proposed algorithm, the distance weight was considered and the previously developed the EDI (Edge Dependent Interpolation) algorithm and the NAL (New Adaptive Linear interpolation) algorithm were used as a basis. The do-interlacing method was divided into two main parts. First, the edge direction was found by using information of closer pixels. Then, missing pixels were interpolated along with the decided edge direction. In this paper, after predicting the edge through the EDI algorithm, missing pixels were interpolated by using the weighted distance based on the NAL algorithm. Experimental results indicate that the proposed algorithm be superior to the conventional algorithms in terms of the objective and subjective criteria.

• 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.

• Survey Research
• /
• v.7 no.2
• /
• pp.53-69
• /
• 2006

Weights can be made and imposed in both sample design stage and analysis stage in a sample survey. While in design stage weights are related with sample data acquisition quantities such as sample selection probability and response rate, in analysis stage weights are connected with external quantities, for instance population quantities and some auxiliary information. The final weight is the product of all weights in both stage. In the present paper, we focus on the weight in analysis stage and investigate the effect of such weights imposed on the weighted mean when estimating the population mean. We consider a finite population with a pair of fixed survey value and weight in each unit, and suppose equal selection probability designs. Under the condition we derive the formulas of the bias as well as mean square error of the weighted mean and show that the weighted mean is biased and the direction and amount of the bias can be explained by the correlation between survey variate and weight: if the correlation coefficient is positive, then the weighted mein over-estimates the population mean, on the other hand, if negative, then under-estimates. Also the magnitude of bias is getting larger when the correlation coefficient is getting greater. In addition to theoretical derivation about the weighted mean, we conduct a simulation study to show quantities of the bias and mean square errors numerically. In the simulation, nine weights having correlation coefficient with survey variate from -0.2 to 0.6 are generated and four sample sizes from 100 to 400 are considered and then biases and mean square errors are calculated in each case. As a result, in the case or 400 sample size and 0.55 correlation coefficient, the amount or squared bias of the weighted mean occupies up to 82% among mean square error, which says the weighted mean might be biased very seriously in some cases.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.10a
• /
• pp.308-309
• /
• 2009

Human vision information processing has many characteristics when image information is transmitted from retina to visual cortex. Among them, we analyze the sensibility of the orientation on an image and compare the recognition rates by the response_weight of the vertical, horizontal and diagonal orientation. In statistics analysis, we show that a particular simple cell responds best to a bar with a vertical orientation. After then, we will apply the characteristics to Human visual system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.159-171
• /
• 2011

This paper suggests an algorithm that obtains the Minimum Spanning Tree for directed graph (DMST). The existing Chu-Liu/Edmonds DMST algorithm has chances of the algorithm not being able to find DMST or of the sum of ST not being the least. The suggested algorithm is made in such a way that it always finds DMST, rectifying the disadvantage of Chu-Liu/Edmonds DMST algorithm. Firstly, it chooses the Minimum-Weight Arc (MWA) from all the nodes including a root node, and gets rid of the nodes in which cycle occurs after sorting them in an ascending order. In this process, Minimum Spanning Forest (MST) is obtained. If there is only one MSF, DMST is obtained. And if there are more than 2 MSFs, to determine MWA among all MST nodes, it chooses a method of directly calculating the sum of all the weights, and hence simplifies the emendation process for solving a cycle problem of Chu-Liu/Edmonds DMST algorithm. The suggested Sulee DMST algorithm can always obtain DMST that minimizes the weight of the arcs no matter if the root node is set or not, and it is also capable to find the root node of a graph with minimized weight.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.34 no.12
• /
• pp.1793-1803
• /
• 2010

The weighting method and goal programming require weighting factors or target values to obtain a Pareto optimal solution. However, it is difficult to define these parameters, and a Pareto solution is not guaranteed when the choice of the parameters is incorrect. Recently, the Mahalanobis Taguchi System (MTS) has been introduced to minimize the Mahalanobis distance (MD). However, the MTS method cannot obtain a Pareto optimal solution. We propose a function called the skewed Mahalanobis distance (SMD) to obtain a Pareto optimal solution while retaining the advantages of the MD. The SMD is a new distance scale that multiplies the skewed value of a design point by the MD. The weighting factors are automatically reflected when the SMD is calculated. The SMD always gives a unique Pareto optimal solution. To verify the efficiency of the SMD, we present two numerical examples and show that the SMD can obtain a unique Pareto optimal solution without any additional information.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.20 no.11
• /
• pp.1217-1224
• /
• 2009

This paper newly proposes a methodology towards computing antenna element weights which are satisfying asymmetric sidelobe levels(SLLs) specified arbitrarily on both sides of the main beam pattern, in the linear phased array antenna pattern synthesis problem. Opposite to the conventional methods in which the element weights are directly optimized from the array factor, this method is based on the optimum perturbations of complex roots inherent to the Schelkunoff's polynomial form which is described for the array factor. From the proposed methodology, the capability of nulling the directions of multiple jammers is also possible by independently perturbing only the complex roots corresponding to each jamming direction, hence allowing an enhancement of the simplicity of the numerical procedure by means of a proper reduction of the dimension of the solution space. The complex weights over the array are then easily computed by substituting the optimally perturbed complex roots to the Schelkunoff's polynomial. Some examples are examined and numerically verified by substituting the extracted weights into the array factor equation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.11
• /
• pp.2717-2723
• /
• 2015

Recently, digital image processing is being applied in various areas of broadcasting, communication, computer graphic and medical science. But, degradation of images occurs in the process of digital image acquisition, processing and transmission. Therefore, in order to remove the mixed noise, this paper suggested the image restoration algorithm to process salt and pepper noise with weighted filters according to 4 direction pixel changes after judging the noise and to process AWGN with weighted filters which have individually different characteristics. Regarding the processed results by applying Boat images which were corrupted by salt and pepper noise(P=40%), suggested algorithm showed the improvement by 1.33[dB], 1.41[dB], 0.51[dB] respectively compared with the existing CWMF, AWMF, MMF.

• Journal of Advanced Navigation Technology
• /
• v.12 no.5
• /
• pp.494-501
• /
• 2008

In this paper, to merge whole 3D information of an occluded body from view point, the new image merging algorithm is introduced after obtaining images of body on the turn table from 4 directions. The two images represented by polygon meshes are merged using weight bipartite matching method with different weights according to coordinates and axes based on minimum distance since two images merged don't present abrupt variation of 3D coordinates and scan direction is one direction. To obtain entire 3D information of body, these steps are repeated 3 times since the obtained images are 4. This proposed method has advantage 200 - 300% searching time reduction rather than conventional branch and bound, dynamic programming, and hungarian method though the matching accuracy rate is a little bit less than these methods.