• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.5
• /
• pp.775-783
• /
• 1990

In this paper we implemented the fast thinning unit by modifying the pipeline architecture which was proposed by Stanley R. Sternberg. The unit is useful in preprocessing such as image representation and pattern recognition etc. This unit is composed of interface part, local memory part, address generation part, thinning processing part and control part. In thinning processing part, we shortened the thinning part which performed by means of look up table using window mapping table. Thus we improved the weakness of SAP, in which the number of delay pipeline and window pipeline are equal to image column size. Two independent memorys using tri-state buffer enable the two direction flow of address generated by address generation part. This unit avoids the complexity of architecture and has flexibility of image size by means of simple modification of logic bits.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.661-664
• /
• 1998

Since the region segmentation at high resolution contains most of viable semantic object contours in an image, the bottom-up approach for image segmentation is appropriate for the application such as MPEG-4 which needs to preserve semantic object contours. However, the conventioal region merging methods, that follow the region segmentation, have poor performance in keeping low-contrast semantic object contours. In this paper, we propose an image segmentation algorithm based on classified region merging. The algorithm pre-segments an image with a large number of small regions, and also classifies it into several classes having similar gradient characteristics. Then regions only in the same class are merged according to the boundary weakness or statisticsal similarity. The simulation result shows that the proposed image segmentation preserves semantic object contours very well even with a small number of regions.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.10
• /
• pp.73-80
• /
• 1995

In this paper, a synthesis tool using matrix operations for designing multi-level Reed Muller circuits is described which has been named as MRM (Multi-level Reed Muller Minimizer). The synthesis method which uses matrix operations has advantages in effectively minimizing chip area, delay optimization and fault detection capability. However, it uses only truth-table type maps for inputs, synthesizing only small circuits. To overcome the weakness, our method accepts two-level description of a logic function. Since the number of cubes in the two-level description is small, the input matrix becomes small and large circuits can be synthesized. To convert two-level representations into multi-level ones, different input patterns are extracted to make a map which can be fed to the matrix operation procedure. Experimental results show better performance than previous methods. The matrix operation method presented in this paper is new to the society of Reed Muller circuits synthesis and provides solid mathematical foundations.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.10
• /
• pp.1-10
• /
• 2002

Scheduling technology is one of the most important elements required to support the Qos(quality of service) in the Internet and a lot of scheduling algorithms have been developed. However, most of there algorithms are not flexible in the distribution of the excess bandwidth. In order to improve the weakness of existing algorithms, DGPS(decoupled generalized processor sharing)has suggested recently. But, the DGPS algorithm is complex to implement and difficult to apply to the existing algorithms. In this paper, we propose a scheduling algorithm for distribution of the excess bandwidth which improves the implementation complexity of the DGPS and easy to be applied to ordinary algorithms.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.7
• /
• pp.70-81
• /
• 1997

In this paper, we propose HMCNN(hybrid multiple component neural networks) that enhance performance of MCNN by adapting new pattern partitioning algorithm which can cluster many input patterns efficiently. Added neural network performs similar learning procedure that of kohonen network. But it dynamically determine it's number of output neurons using algorithms that decide self-organized number of clusters and patterns in a cluster. The proposed network can effectively be applied to problems of large data as well as huge networks size. As a sresutl, proposed pattern partitioning network can enhance performance results and solve weakness of MCNN like generalization capability. In addition, we can get more fast speed by performing parallel learning than that of other supervised learning networks.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.237-239
• /
• 2009

The purpose of this research is to propose a system to detect a strip defect on a iron plate using an image processing, one way of finding defects on an iron plate. An existing way of image processing is using a light source which release a light energy in a certain frequency and a light absorbing display which responds to the light source. This research attempts to detect defects by using the image processing which handles an illumination, without depending on characteristics of light frequency. One of the advantages of this method is that it makes up for the weakness of the existing method which was too difficult for users to notice a defect. Also this method makes it possible to realize a real-time monitoring on a plate of iron.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.353-354
• /
• 2008

Security weakness in PLC network can be made up for by authentication and management scheme of PLC modules introduced in this paper. Each PLC module must pass the authentication procedure to work normally in PLC network as soon as being installed in the spot. Based on this scheme, all PLC devices are registered, certified, and managed automatically in central control center - AMR server, authentication server, NMS server, and DB server.

• Journal of applied mathematics & informatics
• /
• v.26 no.5_6
• /
• pp.1139-1147
• /
• 2008

A. Saxena et al. first proposed a two-flow blind identification protocol in 2005. But it has a weakness of the active-intruder attack and uses the pairing operation that causes slow implementation in smart cards. In this paper, we give a method of the active-intruder attack on their identification scheme and propose a new zero- knowledge blind identification protocol for Smart cards. Our protocol consists of only two message flows and does not rely on any underlying signature or encryption scheme. The prover using computationally limited devices such as smart cards has no need of computing the bilinear pairings. It needs only for the verifier. Our protocol is secure assuming the hardness of the Discrete-Logarithm Problem in bilinear groups.

• Proceedings of the KSPS conference
• /
• 2007.05a
• /
• pp.33-36
• /
• 2007

In this paper, we investigate a fast speaker adaptation method based on eigenvoice in several noisy environments. In order to overcome its weakness against noise, we propose a noisy environment clustering method which divides the noisy adaptation utterances into utterance groups with similar environments by the vector quantization based clustering using a cepstral mean as a feature vector. Then each utterance group is used for adaptation to make an environment dependent model. According to our experiment, we obtained 19-37 % relative improvement in error rate compared with the simultaneous speaker adaptation and environmental compensation method

• The Korean Journal of Nuclear Medicine
• /
• v.36 no.1
• /
• pp.80-86
• /
• 2002

Presently, PET is widely used in oncology, but suffers from limitations of poor anatomical information. To compensate for this weakness, a combined PET/CT has been developed by Professor Townsend at the University of Pittsburgh Medical Center. The prototype was designed as PET and CT components combined serially in a gantry. The CT images provide not only accurate anatomical location of the lesions but also transmission map for attenuation correction. More than 300 cancer patients have been studied with the prototype of PET/CT since July, 1998. The PET/CT studies affected the managements in about $20{\sim}30%$ of cancer patients. These changes are a consequence of the more accurate localization of functional abnormalities, and the distinction of pathological from normal physiological uptake. Now a variety of combined PET/CT scanners with high-end PET and high-end CT components are commercially available. With the high speed of multi-slice helical CT, throughput of patient's increases compared to conventional PET. Although some problems (such as a discrepancy in breathing state between the two modalities) still remain, the role of PET/CT in oncology is very promising.