• The KIPS Transactions:PartB
• /
• v.17B no.1
• /
• pp.79-84
• /
• 2010

Matching spots between two sets of 2-dimensional electrophoresis can make it possible to find out the generation, extinction and change of proteins. Generally protein spots are separated by 2-dimensional electrophoresis. This process makes the position of the same protein spot a little different according to the status of the tissue or the experimental environment. Matching the spots shows that the relation of spots is non-uniform and non-linear transformation. However we can also find that the local relation preserves the topology. This study proposes a matching method motivated by the preservation of the topology. To compare the similarity of the topology, we compared the distance and the angle between neighbour spots. Experimental result shows that the proposed method is effective.

• Journal of the Korean Society of Industry Convergence
• /
• v.14 no.3
• /
• pp.105-111
• /
• 2011

Landmark Spots in 2D gel electrophoresis are used in many methods of 2DEG spot matching. Landmark Spots are obtained manually and it is a bottle neck in the entire protein analysis process. Automated landmark spots detection is a very crucial topic in processing a massive amount of 2DGE data. In this paper, Automated landmark spot detection is proposed using point pattern matching and graph theory. Neighbor spots are defined by a graph theory to use and only a centered spot and its neighbor spots are considered for spot matching. Normalized Hausdorff distance is introduced as a criterion for measuring degree of similarity. In the conclusion, the method proposed in this paper can get about 50% of the total spot pairs and the accuracy rate is almost 100%, which the requirements of landmark spots are fully satisfied.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.6
• /
• pp.2118-2126
• /
• 2017

The large-scale power system blackouts have indicated that conventional protection relays that based on local signals cannot fit for modern power grids with complicated setting or heavily loaded-flow transfer. In order to accurately detect various faulted lines and improve the fault-tolerance of wide-area protection, a novel multi-section weighed fault matching and detecting algorithm is proposed. The real protection vector (RPV) and expected section protection vectors (ESPVs) for five fault sections are constructed respectively. The function of multi-section weighed fault matching is established to calculate the section fault matching degrees between RPV and five ESPVs. Then the fault degree of protected line based on five section fault degrees can be obtained. Two fault detecting criterions are given to support the higher accuracy rate of detecting fault. With the enumerating method, the simulation tests illustrate the correctness and fault-tolerance of proposed algorithm. It can reach the target of 100% accuracy rate under 5 bits error of wide-area protections. The influence factors of fault-tolerance are analyzed, which include the choosing of wide-area protections, as well as the topological structures of power grid and fault threshold.

• International Journal of Advanced Culture Technology
• /
• v.5 no.4
• /
• pp.20-25
• /
• 2017

Although the $6^{th}$ industry of agriculture, the subject of this research, is a policy that is implemented nationwide, the result or its performance can vary depending on judgment and basic plan of the local government concerned. To overcome this, support of the central government and provincial governments is important, but each rural family, rural area or management unit also has to grasp the reality fast and overcome it through voluntary participation. In addition, local governments of the nation should operate this project efficiently by implementing required support and policies in each field. Local governments should also promote revitalization of local economy by providing help to rural families and management units that implement the $6^{th}$ industry of agriculture through expert consulting, matching of funding paths, and deregulation.

• Journal of Sensor Science and Technology
• /
• v.19 no.2
• /
• pp.99-111
• /
• 2010

This paper proposes an efficient hardware architecture to estimate disparities between 2D images for generating 3D depth images in a stereo vision system. Stereo matching methods are classified into global and local methods. The local matching method uses the cost functions based on pixel windows such as SAD(sum of absolute difference), SSD(sum of squared difference) and NCC(normalized cross correlation). The NCC-based cost function is less susceptible to differences in noise and lighting condition between left and right images than the subtraction-based functions such as SAD and SSD, and for this reason, the NCC is preferred to the other functions. However, software-based implementations are not adequate for the NCC-based real-time stereo matching, due to its numerous complex operations. Therefore, we propose a fast pipelined hardware architecture suitable for real-time operations of the NCC function. By adopting a block-based box-filtering scheme to perform NCC operations in parallel, the proposed architecture improves processing speed compared with the previous researches. In this architecture, it takes almost the same number of cycles to process all the pixels, irrespective of the window size. Also, the simulation results show that its disparity estimation has low error rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.5
• /
• pp.960-966
• /
• 2017

In this paper, we proposed an algorithm that can extract lesion by inputting a medical image. Feature points are extracted using SIFT algorithm to extract genetic training of medical image. To increase the intensity of the feature points, the input image and that raining image are matched using vector similarity and the lesion is extracted. The vector similarity match can quickly lead to lesions. Since the direction vector is generated from the local feature point pair, the direction itself only shows the local feature, but it has the advantage of comparing the similarity between the other vectors existing between the two images and expanding to the global feature. The experimental results show that the lesion matching error rate is 1.02% and the processing speed is improved by about 40% compared to the case of not using the feature point intensity information.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.7
• /
• pp.807-815
• /
• 2019

In this paper, we design a power amplifier to support quad-band in wireless communication devices using RF CMOS 180-nm process. The proposed power amplifier consists of low-band 0.9, 1.8, and 2.4 GHz and high-band 5 GHz. We proposed a structure that can support each input matching network without using a switch. For maximum linear output power, the output matching network was designed for impedance conversion to the power matching point. The fabricated quad-band power amplifier was verified using modulation signals. The long-term evolution(LTE) 10 MHz modulated signal was used for 0.9 and 1.8 GHz, and the measured output power is 23.55 and 24.23 dBm, respectively. The LTE 20 MHz modulated signal was used for 1.8 GHz, and the measured output power is 22.24 dBm. The wireless local area network(WLAN) 802.11n modulated signal was used for 2.4 GHz and 5.0 GHz. We obtain maximum linear output power of 20.58 dBm at 2.4 GHz and 17.7 dBm at 5.0 GHz.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.4
• /
• pp.62-68
• /
• 2010

This work proposes a 10b 100MS/s DAC based on a segmented local matching technique primarily for small chip area. The proposed DAC employing a segmented current-steering structure shows the required high linearity even with the small number of devices and demonstrates a fast settling behavior at resistive loads. The proposed segmented local matching technique reduces the number of current cells to be matched and the size of MOS transistors while a double-cascode topology of current cells achieves a high output impedance even with minimum sized devices. The prototype DAC implemented in a 0.13um CMOS technology occupies a die area of $0.13mm^2$ and drives a $50{\Omega}$ load resistor with a full-scale single output voltage of $1.0V_{p-p}$ at a 3.3V power supply. The measured DNL and INL are within 0.73LSB and 0.76LSB, respectively. The maximum measured SFDR is 58.6dB at a 100MS/s conversion rate.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.2
• /
• pp.66-77
• /
• 2011

We propose a framework for grouping photographic advertising images that employs a hierarchical indexing scheme based on efficient feature combinations. The study provides one specific application of effective tools for monitoring photographic advertising information through online and offline channels. Specifically, it develops a preprocessor for advertising image information tracking. We consider both global features that contain general information on the overall image and local features that are based on local image characteristics. The developed local features are invariant under image rotation and scale, the addition of noise, and change in illumination. Thus, they successfully achieve reliable matching between different views of a scene across affine transformations and exhibit high accuracy in the search for matched pairs of identical images. The method works with global features in advance to organize coarse clusters that consist of several image groups among the image data and then executes fine matching with local features within each cluster to construct elaborate clusters that are separated by identical image groups. In order to decrease the computational time, we apply a conventional clustering method to group images together that are similar in their global characteristics in order to overcome the drawback of excessive time for fine matching time by using local features between identical images.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.385-396
• /
• 2005

In this paper, a new structural approach to on-line signature verification is presented. A primitive pattern is defined as a part segmented by a local minimal position of speed. And a structural description of signature is composed of subpatterns which are defined as such forms as rotation shape, cusp shape and bell shape, acquired by composition of the primitives regarding the directional changes. As the matching method to find identical parts between two signatures, a modified DP(dynamic programming) matching algorithm is presented. And also, variation and complexity of local parts are computed from the training samples, and reference model and decision boundary are derived from these. Error rate, execution time and memory usage are compared among the functional approach, the parametric approach and the proposed structural approach. It is found that the average error rate can be reduced from 14.2% to 4.05% when the local parts of a signature are weighted and the complexity is used as a factor of decision threshold. Though the error rate is similar to that of functional approaches. time consumption and memory usage of the proposed structural approach are shown to be very effective.