• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.2
• /
• pp.133-145
• /
• 2003

Web applications based on J2EE($Java^{TM}$ 2 Platform, Enterprise Edition) were occurred for solution to overcome the limitations in time and space that the former applications had. Recently, lots of solutions using frameworks are being suggested to develope applications more quickly and efficiently. In this paper, we propose the template for several processes and types, which should be taken in presentation layer of web applications. This idea was based on the fact that web applications developers can concentrate on their specific tasks with independent manner in layered architecture. This template is XML-typed document that shows information about presentation layer of Web applications, which the user wants to compose. This template is inputted to the code generator. After then, the code generator generates skeleton code in presentation layer automatically after parsing information of XML documents. It means that we can develope Web applications more efficiently, by constructing skeleton code which inherits from hot spot classes of framework. Using this template and code generator, developer can develop Web applications with little practice and also is easy to cooperate with other developers to develop them just in time with distributing the standard development process.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.529-542
• /
• 2000

Recent years, the use of multimedia information is rapidly increasing, and the video media is the most rising one than any others, and this field Integrates all the media into a single data stream. Though the availability of digital video is raised largely, it is very difficult for users to make the effective video access, due to its length and unstructured video format. Thus, the minimal interaction of users and the explicit definition of video structure is a key requirement in the lately developing image and video management systems. This paper defines the terms and hierarchical video structure, and presents the system, which construct the clustering-based video hierarchy, which facilitate users by browsing the summary and do a random access to the video content. Instead of using a single feature and domain-specific thresholds, we use multiple features that have complementary relationship for each other and clustering-based methods that use normalization so as to interact with users minimally. The stage of shot boundary detection extracts multiple features, performs the adaptive filtering process for each features to enhance the performance by eliminating the false factors, and does k-means clustering with two classes. The shot list of a result after the proposed procedure is represented as the video hierarchy by the intelligent unsupervised clustering technique. We experimented the static and the dynamic movie videos that represent characteristics of various video types. In the result of shot boundary detection, we had almost more than 95% good performance, and had also rood result in the video hierarchy.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.4
• /
• pp.35-43
• /
• 2013

As texture images have become prevalent throughout a variety of industrial applications, copyright protection of these images has become important issues. For this reason, this paper proposes a color-texture image watermarking algorithm utilizing texture properties inherent in the image. The proposed algorithm selects suitable blocks to embed a watermark using the energy and homogeneity properties of the grey level co-occurrence matrices as inputs for the fuzzy c-means clustering algorithm. To embed the watermark, we first perform a discrete wavelet transform (DWT) on the selected blocks and choose one of DWT subbands. Then, we embed the watermark into discrete cosine transformed blocks with a gain factor. In this study, we also explore the effects of the DWT subbands and gain factors with respect to the imperceptibility and robustness against various watermarking attacks. Experimental results show that the proposed algorithm achieves higher peak signal-to-noise ratio values (47.66 dB to 48.04 dB) and lower M-SVD values (8.84 to 15.6) when we embedded a watermark into the HH band with a gain factor of 42, which means the proposed algorithm is good enough in terms of imperceptibility. In addition, the proposed algorithm guarantees robustness against various image processing attacks, such as noise addition, filtering, cropping, and JPEG compression yielding higher normalized correlation values (0.7193 to 1).

• Journal of Advanced Navigation Technology
• /
• v.9 no.1
• /
• pp.48-55
• /
• 2005

In this paper, we propose an efficient moving object tracking technique for multi-camera surveillance system. Color CCD cameras used in this system are network cameras with their own IP addresses. Input image is transmitted to the media server through wireless connection among server, bridge, and Access Point (AP). The tracking system sends the received images through the network to the tracking module, and it tracks moving objects in real-time using color matching method. We compose two sets of cameras, and when the object is out of field of view (FOV), we accomplish hand-over to be able to continue tracking the object. When hand-over is performed, we use MHI(Motion History Information) based on color information and M-bin histogram for an exact tracking. By utilizing MHI, we can calculate direction and velocity of the object, and those information helps to predict next location of the object. Therefore, we obtain a better result in speed and stability than using template matching based on only M-bin histogram, and we verified this result by an experiment.

• Journal of rehabilitation welfare engineering & assistive technology
• /
• v.3 no.1
• /
• pp.27-34
• /
• 2009

Hearing impaired person's hearing loss has personally various shape, so existing symmetrical auditory filter of frequency band method wasn't properly simulated the hearing impaired person's various hearing loss shape. The shapes of auditory filter are asymmetrical different with each center frequency and each input level. Hearing impaired person which has hearing loss was differently changed with that of normal hearing people and it has different value for speech of quality through auditory filter. In this study, the asymmetrical auditory filter was simulated and then some tests to estimate the filter's performance objectively were performed. The experiment as simulated auditory filter's performance evaluation method used perceptual evaluation of speech quality (PESQ) and log likelihood ratio (LLR) for speech through auditory filter. In the test, processed speech was evaluated objective speech quality and distortion using PESQ and LLR value. When hearing loss processed, PESQ and LLR value have big difference between symmetrical and asymmetrical auditory filter. It means that the difference of the shape auditory filter may affect to speech quality. Especially, when hearing loss existed, auditory filter changing according to asymmetrical shape for each center frequency affected to perceive speech quality of the hearing impaired.

• Journal of the Korea Computer Graphics Society
• /
• v.22 no.3
• /
• pp.21-29
• /
• 2016

Cell segmentation is an important but time-consuming and laborious task in biological image analysis. An automated, robust, and fast method is required to overcome such burdensome processes. These needs are, however, challenging due to various cell shapes, intensity, and incomplete boundaries. A precise cell segmentation will allow to making a pathological diagnosis of tissue samples. A vast body of literature exists on cell segmentation in microscopy images [1]. The majority of existing work is based on input images and predefined feature models only - for example, using a deformable model to extract edge boundaries in the image. Only a handful of recent methods employ data-driven approaches, such as supervised learning. In this paper, we propose a novel data-driven cell segmentation algorithm for bright-field microscopy images. The proposed method minimizes an energy formula defined by two dictionaries - one is for input images and the other is for their manual segmentation results - and a common sparse code, which aims to find the pixel-level classification by deploying the learned dictionaries on new images. In contrast to deformable models, we do not need to know a prior knowledge of objects. We also employed convolutional sparse coding and Alternating Direction of Multiplier Method (ADMM) for fast dictionary learning and energy minimization. Unlike an existing method [1], our method trains both dictionaries concurrently, and is implemented using the GPU device for faster performance.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.5
• /
• pp.51-57
• /
• 2015

In this paper, in order to design the A / D converter with a high resolution of 14 bits or more for the biological signal processing, CMOS delta sigma modulator that is a 1.8V power supply voltage - were designed. we propose a new structure of The fourth order delta-sigma modulator that needs four op amps but we use only two op amps. By using a time -interleaving technique, we can re-construct the circuit and reuse the op amps. Also, we proposed a KT/C noise reduction circuit to reduce the thermal noise from a noisy resistor. We adjust the size of sampling capacitor between sampling time and integrating time, so we can reduce almost a half of KT/C noise. The measurement results of the chip is fabricated using a Magna 0.18um CMOS n-well1 poly 6 metal process. Power consumption is $828{\mu}W$ from a 1.8V supply voltage. The peak SNDR is measured as a 75.7dB and 81.3dB of DR at 1kHz input frequency and 256kHz sampling frequency. Measurement results show that KT/C noise reduction circuit enhance the 3dB of SNDR. FOM of the circuit is calculated to be 142dB and 41pJ / step.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.97-106
• /
• 2010

In this paper, lane and curvature detection algorithm based on the curve template matching method is proposed. To eliminate the perspective effect of the original image, the input image is transformed to a top view image. From this top view image, its edge image is created. To increase the accuracy of detection, a novel edge detection method, which shows a strength in lane detection, is proposed. In the first step, straight lanes are detected from the edge image, and then the Curve Template Matching(CTM) method is applied to detect the curved lanes and to find their curvatures. Since the proposed CTM method uses only the simple equations, such as line and circle equations, to detect the curved lane, the algorithm is simple. Moreover, we used the detected lane information in the previous frames to detect the current frame's lanes, the detection results become more reliable. The proposed algorithm has been tested in various road conditions (highway, urban street, night time highway, etc.). Experimental results show that the proposed algorithm can process about 70 frames per second with the successful lane detection rate over 95% and curvature detection rate about 90%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.7
• /
• pp.1296-1302
• /
• 2016

A hardware implementation of ultra-lightweight block cipher algorithm PRESENT that was specified as a block cipher standard for lightweight cryptography ISO/IEC 29192-2 is described in this paper. Two types of crypto-core that support master key size of 80-bit are designed, one is for encryption-only function, and the other is for encryption and decryption functions. The designed PR80 crypto-cores implement the basic cipher mode of operation ECB (electronic code book), and it can process consecutive blocks of plaintext/ciphertext without reloading master key. The PR80 crypto-cores were designed in soft IP with Verilog HDL, and they were verified using Virtex5 FPGA device. The synthesis results using $0.18{\mu}m$ CMOS cell library show that the encryption-only core has 2,990 GE and the encryption/decryption core has 3,687 GE, so they are very suitable for IoT security applications requiring small gate count. The estimated maximum clock frequency is 500 MHz for the encryption-only core and 444 MHz for the encryption/decryption core.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.7
• /
• pp.650-664
• /
• 2000

NOW(Network of Workstations) is considered as a platform for running parallel programs by many people. One of the fundamental problems that must be addressed to achieve good performance for parallel programs on NOW is the determination of efficient job scheduling policies. Currently most research on NOW assumes that all the workstations in the NOW have the same processing power. In this paper we consider a NOW in which workstations may have different computing power. We introduce 10 classes of space sharing-based scheduling policies that can be applied to the NOW with heterogeneous computing power. We compare the performance of these scheduling policies by using the simulator which accepts synthetically generated sequential and parallel workloads and generates the response time and waiting time of parallel jobs as performance indices of various scheduling strategies. Through the experiments the case when a parallel program is partitioned heterogeneously in proportion to the computing power of workstations is shown to have better performance than when a parallel program is partitioned into parallel processes of the same size. When the owner returns to the workstation which is executing a parallel process, the policy which just lowers the priority of the parallel process shows better performance than the one which migrates the parallel process to a new idle workstation. Among the policies which use heterogeneous partitioning and process priority lowering, the adaptive policy performed best across the wide range of inter-arrival time of parallel programs but when the load imbalance among parallel processes becomes very high, the modified adaptive policy performed better.