• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.11
• /
• pp.2271-2283
• /
• 2015

In this paper, we propose a method which infers an accurate disparity map for radiometrically varying stereo images. For this end, firstly, we transform the input color images to the log-chromaticity color space from which a linear relationship can be established during constructing a joint pdf between input stereo images. Based on this linear property, we present a new stereo matching cost by combining weighted mutual information and the SIFT (Scale Invariant Feature Transform) descriptor with segment-based plane-fitting constraints to robustly find correspondences for stereo image pairs which undergo radiometric variations. Experimental results show that our method outperforms previous methods and produces accurate disparity maps even for stereo images with severe radiometric differences.

• Journal of Information Processing Systems
• /
• v.14 no.4
• /
• pp.961-979
• /
• 2018

For many years, matching in a bipartite graph has been widely used in various assignment problems, such as stable marriage problem (SMP). As an application of bipartite matching, the problem of stable marriage is defined over equally sized sets of men and women to identify a stable matching in which each person is assigned a partner of opposite gender according to their preferences. The classical SMP proposed by Gale and Shapley uses preference lists for each individual (men and women) which are infeasible in real world applications for a large populace of men and women such as matrimonial websites. In this paper, we have proposed an enhancement to the SMP by computing a weighted score for the users registered at matrimonial websites. The proposed enhancement has been formulated into profit maximization of matrimonial websites in terms of their ability to provide a suitable match for the users. The proposed formulation to maximize the profits of matrimonial websites leads to a combinatorial optimization problem. We have proposed greedy and genetic algorithm based approaches to solve the proposed optimization problem. We have shown that the proposed genetic algorithm based approaches outperform the existing Gale-Shapley algorithm on the dataset crawled from matrimonial websites.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.08a
• /
• pp.73-76
• /
• 2008

We present a area-based method for stereo matching using varying weights. A central problem in a area-based stereo matching is different result from selecting a window size. Most of the previous window-based methods iteratively update windows. However, the iterative methods very sensitive the initial disparity estimation and are computationally expensive. To resolve this problem, we proposed a new function to assign weights to pixels using features. To begin with, we extract features in a given stereo images based on edge. We adjust the weights of the pixels in a given window based on correlation of the stereo images. Then, we match pixels in a given window between the reference and target images of a stereo pair. The proposed method is compared to existing matching strategies using both synthetic and real images. The experimental results show the improved accuracy of the proposed method.

• The Journal of the Acoustical Society of Korea
• /
• v.15 no.2E
• /
• pp.60-68
• /
• 1996

In this paper, we implement the door lock system based on pattern matching technique for speaker recognition using DTW. In this study, major features of our system are summarized as follows:(1) Make the average reference pattern using DTW. This method keeps the high recognition rate compared with the other systems whose performances degrade rapidly as time goes on. (2) Use F-ratio values of the cepstral coefficients. We find that the weighted cepstral reveals an effect on intensifying the difference between th customer and the imposter. The system hardware is composed of two parts : the door lock part and the speaker recognition processing part. We use an 8051 microprocessor in the door lock park for serial communication with host processor to open or close the lock. Using our system, we obtain speaker recognition rate of about 99.5%.

• ETRI Journal
• /
• v.34 no.5
• /
• pp.795-798
• /
• 2012

This letter proposes a new low-complexity motion estimation method. The proposed method classifies various nonmatching pixel pairs into several categories and assigns an appropriate weight for each category in the matching stage. As a result, it can significantly improve performance compared to that of the conventional methods by adding only one 1-bit addition and two Boolean operations per pixel.

• Asian Pacific Journal of Cancer Prevention
• /
• v.15 no.11
• /
• pp.4487-4491
• /
• 2014

Objective: To explore the clinical manifestations and imaging characteristics of gliomatosis cerebri to raise the awareness and improve its diagnostic accuracy for patients. Materials and Methods: Clinical data, imaging characteristics and pathological examination of 12 patients with GC from Jan., 2008 to Jan., 2012 were analyzed retrospectively. Results: Patients with GC were clinically manifested with headache, vomiting, repeated seizures, fatigue and unstable walking, most of whom had more than 2 lesions involving in parietal lobe, followed by temporal lobe, frontal lobe, periventricular white matter and corpus callosum. Magnetic resonance imaging (MRI) showed diffuse distribution, T1-weighted images (T1WI) with equal and low signals and T2-weighted images (T2WI) with bilateral symmetrical high diffuse signals. There was no reinforcement by enhancement scanning and signals were different in diffusion-weighted images (DWI). The higher the tumor staging, the stronger the signals. Pathological examination showed neuroastrocytoma in which tumor tissues were manifested by infiltrative growth in blood vessels and around neurons. Conclusions: In clinical diagnosis of GC, much attention should be paid to the diffuse distribution of imaging characteristics, incomplete matching between clinical and imaging characteristics and confirmation by combining with histopathological examination.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.1
• /
• pp.43-54
• /
• 2000

Character-based trademarks constitute 90% of registered trademarks at the Korean Patent Office. This paper proposes a method to improve the precision rate when for similar trademarks in such systems. The proposed method first calculates the similarity measure by an image processing. The method has been implemented and merged with the existing device-mark retrieval system to improve precision rate by 16.2% compared to other approximate matching methods.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.59 no.4
• /
• pp.401-404
• /
• 2010

In multibit Sigma-Delta Modulator, DWA(Data Weighted Averaging) among the DEM(Dynamic Element Matching) techniques was widely used to get rid of non-linearity that caused by mismatching of unit capacitor in feedback DAC path. this paper proposed the improved DWA architecture by adjusting clock timing of the 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. In order to confirm characteristics, DWA for the 3-bit output with the proposed DWA architecture was designed on 0.18um process under 1.8V supply. Compared with the existing architecture. It was able to reduce the number of 222 MOS Tr.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2514-2526
• /
• 2013

This paper presents a detection method for least significant bit matching revisited (LSBMR) steganography. Previous research shows that the adjacent pixels of natural images are highly correlated and the value 0 appears most frequently in pixel difference. Considering that the message embedding process of LSBMR steganography has a weighted-smoothing effect on the distribution of pixel difference, the frequency of the occurrence of value 0 in pixel difference changes most significantly whereas other values approximately remain unchanged during message embedding. By analyzing the effect of LSBMR steganography on pixel difference distribution, an equation is deduced to estimate the frequency of difference value 0 using the frequencies of difference values 1 and 2. The sum of the ratio of the estimated value to the actual value as well as the ratio of the frequency of difference value 1 to difference value 0 is used as the steganalytic detector. Experimental results show that the proposed method can effectively detect LSBMR steganography and can outperform previous proposed methods.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.11
• /
• pp.68-78
• /
• 1999

A new algorithm for tracking feature points in an image sequence is presented. Most existing feature tracking algorithms often produce false trajectories, because the matching measures do not precisely reflect motion characteristics. In this paper, three attributes including spatial coordinate, motion direction and motion magnitude are used to calculate the feature point correspondence. The trajectories of feature points are determined by calculation the matching measure, which is defined as the minimum weighted Euclidean distance between two feature points. The weights of the attributes are updated reflecting the motion characteristics, so that the robust tracking of feature points is achieved. The proposed algorithm can find the trajectories correctly which has been shown by experimental results.