• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.219-222
• /
• 2011

There are number of methods that track the movement of an object or the change of state, such as Kalman filter, particle filter, dynamic clustering, and so on. Amongst these method, dynamic clustering method is an useful way to track cluster across multiple data frames and analyze their trend. In this paper we suggest the similarity-based dynamic clustering method, and verifies it's performance by simulation. Proposed dynamic clustering method is how to determine the same clusters for each continuative frame. The same clusters have similar characteristics across adjacent frames. The change pattern of cluster's characteristics in each time frame is throughly studied. Clusters in each time frames are matched against each others to see their similarity. Mamdani fuzzy model is used to determine similarity based matching algorithm. The proposed algorithm is applied to radar reflectivity data over time domain. We were able to observe time dependent characteristic of the clusters.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.12
• /
• pp.2662-2670
• /
• 2009

The effect of the reflector type for the SAW filter on the characteristics of the slanted finger IDT filter have been studied by computer simulation. The IDT was evaporated by Aluminum-Copper alloy. The design condition was optimized by the phase shift of the SAWfilter for WCDMA. We have employed that the number of pairs of the input and output IDT are 50 pairs and the thickness are $5,000{\AA}$, and the width and the space of reflector are $3.6{\mu}m$ and $2.0{\mu}m$, respectively. Frequency response of the fabricated SFIT filter has the property that the center frequency is about 190MHz and bandwidth at the 3dB is probably 8.2MHz. And we could obtain that the return loss is less then 16dB, the ripple characteristics is probably 4dB and the triple transit echo is less then 18dB after when we have matched impedance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.11
• /
• pp.7855-7862
• /
• 2015

Cadastral map information is created by registering parcel information such as location, lot number, land category and boundary through the cadastral survey. However, with regard to boundary point coordinate, computerized cadastral information data was registered to either two decimal places (unit in centimeter) or three decimal places (unit in millimeter) so that a confusion in cadastral administration and cadastral survey has been caused. Therefore, the purpose of this study is to look for a method of matching two different coordinate systems through the consideration of registration of cadastral information data and area calculation. In conclusion, the result of the investigation not only shows that areal change and the creation of minute polygons resulted from land alteration could be solved by changing boundary point coordinate from two decimal places to three decimal places, but also suggests that the related laws and regulations to register boundary point coordinate to three decimal places should be institutionally corrected and applied.

• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.84-98
• /
• 2009

Various algorithms and architectures for IP address lookup have been studied to improve forwarding performance in the Internet routers. Previous IP address lookup architecture using Bloom filter requires a separate Bloom filter as well as a separate hash table in each prefix length, and hence it is not efficient in implementation complexity. To reduce the number of hash tables, it applies controlled prefix expansion, but prefix duplication is inevitable in the controlled prefix expansion. Previous parallel multiple-hashing architecture shows very good search performance since it performs parallel search on tables constructed in each prefix length. However, it also has high implementation complexity because of the parallel search structure. In this paper, we propose a new IP address lookup architecture using all-length Bloom filter and all-length multiple hash table, in which various length prefixes are accomodated in a single Bloom filter and a single multiple hash table. Hence the proposed architecture is very good in terms of implementation complexity as well as search performance. Simulation results using actual backbone routing tables which have $15000{\sim}220000$ prefixes show that the proposed architecture requires 1.04-1.17 memory accesses in average for an IP address lookup.

• Journal of KIISE:Databases
• /
• v.36 no.6
• /
• pp.455-465
• /
• 2009

Suffix trees are widely used in similar sequence matching for DNA. They have several problems such as time consuming, large space usages of disks and memories and data skew, since DNA sequences are very large and do not fit in the main memory. Thus, in the paper, we present a space efficient indexing method called SENoM, allowing us to build trees without merging phases for the partitioned sub trees. The proposed method is constructed in two phases. In the first phase, we partition the suffixes of the input string based on a common variable-length prefix till the number of suffixes is smaller than a threshold. In the second phase, we construct a sub tree based on the disk using the suffix sets, and then write it to the disk. The proposed method, SENoM eliminates complex merging phases. We show experimentally that proposed method is effective as bellows. SENoM reduces the disk usage less than 35% and reduces the memory usage less than 20% compared with TRELLIS algorithm. SENoM is available to query efficiently using the prefix tree even when the length of query sequence is large.

• Journal of Korea Multimedia Society
• /
• v.6 no.2
• /
• pp.247-258
• /
• 2003

Principal component analysis (PCA) based algorithms form the basis of numerous algorithms and studies in the face recognition literature. PCA is a statistical technique and its incorporation into a face recognition system requires numerous design decisions. We explicitly take the design decisions by in-troducing a generic modular PCA-algorithm since some of these decision ate not documented in the literature We experiment with different implementations of each module, and evaluate the different im-plementations using the September 1996 FERET evaluation protocol (the do facto standard method for evaluating face recognition algorithms). We experiment with (1) changing the illumination normalization procedure; (2) studying effects on algorithm performance of compressing images using JPEG and wavelet compression algorithms; (3) varying the number of eigenvectors in the representation; and (4) changing the similarity measure in classification process. We perform two experiments. In the first experiment, we report performance results on the standard September 1996 FERET large gallery image sets. The result shows that empirical analysis of preprocessing, feature extraction, and matching performance is extremely important in order to produce optimized performance. In the second experiment, we examine variations in algorithm performance based on 100 randomly generated image sets (galleries) of the same size. The result shows that a reasonable threshold for measuring significant difference in performance for the classifiers is 0.10.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.403-418
• /
• 2009

IP version 6 (IPv6) is a new If addressing scheme that has 128-bit address space. IPv6 is proposed to solve the address space problem of IP version 4 (IPv4) which has 32-bit address space. For a given IPv6 routing set, if a forwarding table is built using a trio structure, the trio has a lot more levels than that for IPv4. Hence, for IPv6 address lookup, the binary search on trio levels would be more appropriate and give better search performance than linear search on trio levels. This paper proposes a new IPv6 address lookup algorithm performing binary search on trio levels. The proposed algorithm uses a Bloom filter in pre-filtering levels which do not have matching nodes, and hence it reduces the number of off-chip memory accesses. Simulation has been performed using actual IPv6 routing sets, and the result shows that an IPv6 address lookup can be performed with 1-3 memory accesses in average for a routing data set with 1096 prefixes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.12
• /
• pp.2374-2381
• /
• 2007

.We have studied to obtain the properly conditions about impedance matching of the SAW filter for the SPUDT type and the bidirectional transducer type later. And we have studied to obtain the SAW filter for the Slanted Finger Interdigital Transducer(SFIT), was formed on the Langasite substrate and was evaporated by Aluminum-Copper alloy and then we performed computer-simulated by simulator In case the SPUDT, we have employed that the number of pairs of the input and output IDT are 50 pairs and the thickness and the width of reflector are $5000{\AA}$ and $3.6{\mu}m$, respectively. And the of the bidirectional transducer, the width of IDT' fingers and the space between IDT' finger and reflector is $1.8{\mu}m$, respectively. Also, we have performed to series connected the SPUDT type with the bidirectional transducer type filter. The frequency response of the fabricated SAW filter has the property that the center frequency is about 190MHz and bahdwidth at the 3dB is probably 5.3MHz after when we have matched impedance. Also, we could obtain that ripple characteristics is less than 0.3dB and insert loss is probably -20dB after when we have matched impedance.

• Journal of Communication Design
• /
• v.63
• /
• pp.336-347
• /
• 2018

Nowadays, in Korea, the number of campers is increased over 5 million. Many Korean camping brands have excellent qualities however, a lot of times weak brand identities to be globally known. The purpose of this study is to provide helpful sources to have strong brand identities, add more values based on related word research from big data and market research. The data is to be analysed by sensible & cognitive approaches. The keywords for the sensible research are 'camping, camp, camping brand, and camping design'. Then 17 representative oversea brands and 10 Korean brands were analysed for the market researches. From related word research from big data, we can find out the thinking process of potential consumers, how people communicates to exchange information, and what can be the sources to add brand values. Also from the market researches, we were able to find that successful brands have distinctive brand identities, stories, logos with representable colors and they continuous produce signature designs and own way of color matching.

• Journal of the Korea Convergence Society
• /
• v.10 no.11
• /
• pp.79-84
• /
• 2019

Video image based technology is being used in various fields with continuous development. The demand for vision system technology that analyzes and discriminates image objects acquired through cameras is rapidly increasing. Image processing is one of the core technologies of vision systems, and is used for defect inspection in the semiconductor manufacturing field, object recognition inspection such as the number of tire surfaces and symbols. In addition, research into license plate recognition is ongoing, and it is necessary to recognize objects quickly and accurately. In this paper, propose a recognition model through the rotational alignment of objects after checking the angle value of the tilt of the object in the input video image for the recognition of inclined objects such as numbers or symbols marked on the surface. The proposed model can perform object recognition of the rotationally sorted image after extracting the object region and calculating the angle of the object based on the contour algorithm. The proposed model extracts the object region based on the contour algorithm, calculates the angle of the object, and then performs object recognition on the rotationally aligned image. In future research, it is necessary to study template matching through machine learning.