• Journal of KIISE:Databases
• /
• v.41 no.4
• /
• pp.249-255
• /
• 2014

Copy number variations(CNVs) are a recently recognized class of human structural variations and are associated with a variety of human diseases, including cancer. To find important cancer genes, researchers identify novel CNVs in patients with a particular cancer and analyze large amounts of genomic and clinical data. We present a tool called CNVDAT which is able to detect CNVs from NGS data and systematically analyze the genomic and clinical data associated with variations. CNVDAT consists of two modules, CNV Detection Engine and Sequence Analyser. CNV Detection Engine extracts CNVs by using the multi-resolution system of scale-space filtering, enabling the detection of the types and the exact locations of CNVs of all sizes even when the coverage level of read data is low. Sequence Analyser is a user-friendly program to view and compare variation regions between tumor and matched normal samples. It also provides a complete analysis function of refGene and OMIM data and makes it possible to discover CNV-gene-phenotype relationships. CNVDAT source code is freely available from http://dblab.hallym.ac.kr/CNVDAT/.

• Journal of Internet Computing and Services
• /
• v.12 no.1
• /
• pp.55-70
• /
• 2011

In this paper, we propose a policy-driven RFID data management event definition language, which is possibly applicable as a partial standard for SSI (Software System Infrastructure) Part 4 (Application Interface, 24791-4) defined by ISO/IEC JTC 1/SC 31/WG 4 (RFID for Item Management). The SSI's RFID application interface part is originally defined for providing a unified interface of the RFID middleware functionality―data management, device management, device interface and security functions. However, the current specifications are too circumstantial to be understood by the application developers who used to lack the professional and technological backgrounds of the RFID middleware functionality. As an impeccable solution, we use the concept of event-constraint policy that is not only representing semantic contents of RFID domains but also providing transparencies with higher level abstractions to RFID applications, and that is able to provide a means of specifying event-constraints for filtering a huge number of raw data caught from the associated RF readers. Conclusively, we try to embody the proposed concept by newly defining an XML-based RFID event policy definition language, which is abbreviated to rXPDL. Additionally, we expect that the specification of rXPDL proposed in the paper becomes a technological basis for the domestic as well as the international standards that are able to be extensively applied to RFID and ubiquitous sensor networks.

• Journal of KIISE:Software and Applications
• /
• v.33 no.2
• /
• pp.201-219
• /
• 2006

The key to developing software with the lowest cost and highest quality is to implement or fit the software development process into a given environment. Generally, applying commercial or standard software development processes on a specific project can cause too much overhead if there is no effort to customize the given generic processes. Even though the customizing activities are done before starting the project, these activities are thoroughly dependent on the process engineers who have abundant experience and knowledge with tailoring processes. Owing to this dependence on human knowledge, it has been very difficult to explain the rationale for the results of process tailoring and it takes a long time to get the customized process that is applicable. Hence, we suggest a process tailoring method which adopts the artificial neural network based teaming theory to reduce the time consumed by process tailoring. Furthermore, we suggest the feedback loop mechanism to get higher accuracy in the neural network designed for the process tailoring. It can be done by reusing the process tailoring data results and determining its appropriateness level as sample data to the neural network. We proved the effectiveness of our process tailoring method through case studies using real historical data, which yielded abundant process tailoring results as sample data.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.47 no.4
• /
• pp.30-39
• /
• 2010

Since Diffusion tensor from Diffusion Tensor Magnetic Resonance Imaging(DT-MRI) is so sensitive to noise, the principle eigenvector(PEV) calculated from Diffusion tensor could be erroneous. Tractography obtained from PEV could be deviated from the real fiber tract. Therefore regularization process is needed to eliminate noise. In this paper, to reduce noise in DT-MRI measurements, the Dyadic Sorting(DS) method as regularization of the eigenvalue and the eigenvector is applied in the tractography. To resort the eigenvalues and the eignevectors, the DS method uses the intervoxel overlap function which can measure the overlap between eigenvalue-eigenvector pairs in the $3\times3$ pixel. In this paper, we applied the DS method to the three-dimensional volume. We discuss the error analysis and numerical study to the synthetic and the experimental data. As a result, we have shown that the DS method is more efficient than the median filtering methods as much as 79.97%~83.64%, 85.62%~87.76% in AAE, AFA respectively for the corticospinal tract of the experimental data.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.1
• /
• pp.71-79
• /
• 2011

The objective of the imaging pipeline is to transform the original scene into a display image that appear similar, Generally, gamma adjustment or histogram-based method is modified to improve the contrast and detail. However, this is insufficient as the intensity and the chromaticity of illumination vary with geometric position. Thus, MSR (Multi-Scale Retinex) has been proposed. the MSR is based on a channel-independent logarithm, and it is dependent on the scale of the Gaussian filter, which varies according to input image. Therefore, after correcting the color, image quality degradations, such as halo, graying-out, and dominated color, may occur. Accordingly, this paper presents a novel color correction method using a modified image formation model in which the image is divided into three components such as global illumination, local illumination, and reflectance. The global illumination is obtained through Gaussian filtering of the original image, and the local illumination is estimated by using JND-based adaptive filter. Thereafter, the reflectance is estimated by dividing the original image by the estimated global and the local illumination to remove the influence of the illumination effects. The output image is obtained based on sRGB color representation. The experiment results show that the proposed method yields better performance of color correction over the conventional methods.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.49 no.2
• /
• pp.113-121
• /
• 2012

In this paper, we proposed fast and efficient algorithm for detecting near-duplication based on content based retrieval in large scale video database. For handling large amounts of video easily, we split the video into small segment using scene change detection. In case of video services and copyright related business models, it is need to technology that detect near-duplicates, that longer matched video than to search video containing short part or a frame of original. To detect near-duplicate video, we proposed motion distribution and frame descriptor in a video segment. The motion distribution descriptor is constructed by obtaining motion vector from macro blocks during the video decoding process. When matching between descriptors, we use the motion distribution descriptor as filtering to improving matching speed. However, motion distribution has low discriminability. To improve discrimination, we decide to identification using frame descriptor extracted from selected representative frames within a scene segmentation. The proposed algorithm shows high success rate and low false alarm rate. In addition, the matching speed of this descriptor is very fast, we confirm this algorithm can be useful to practical application.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.1
• /
• pp.64-70
• /
• 2008

The H.264 standard is widely used due to the high compression rate and quality. The deblocking filter of the H.264 standard improves the quality of images by eliminating blocking artifacts of pictures, and it requires a lot of computation. We propose a new hardware architecture for the deblocking filter with pipelined architecture, 1-D filters which support both horizontal and vertical filtering and efficient memory management. Four memory blocks are configured for the efficient storage and access of the current macroblock and adjacent referenced sub-macroblocks, and the pixel data from the motion compensation unit can be transferred without waiting during the computation cycles of the deblocking filter. The number of computation cycles and the hardware area are reduced using the proposed architecture, and the performance of the H.264 decoder is improved. We design the deblocking filter using Verilog-HDL and implement using an FPGA. The designed deblocking filter can be used for decoding HD quality images at 77 MHz.

• The KIPS Transactions:PartA
• /
• v.14A no.1 s.105
• /
• pp.47-54
• /
• 2007

In this paper we present a translation lookaside buffer (TLB) system with low power consumption for imbedded processors. The proposed TLB is constructed as multiple banks, each with an associated block buffer and a corresponding comparator. Either the block buffer or the main bank is selectively accessed on the basis of two bits in the block buffer (tag buffer). Dynamic power savings are achieved by reducing the number of entries accessed in parallel, as a result of using the tag buffer as a filtering mechanism. The performance overhead of the proposed TLB is negligible compared with other hierarchical TLB structures. For example, the two-cycle overhead of the proposed TLB is only about 1%, as compared with 5% overhead for a filter (micro)-TLB and 14% overhead for a same structure without continuos accessing distinction algorithm. We show that the average hit ratios of the block buffers and the main banks of the proposed TLB are 95% and 5% respectively. Dynamic power is reduced by about 95% with respect to with a fully associative TLB, 90% with respect to a filter-TLB, and 40% relative to a same structure without continuos accessing distinction algorithm.

• The KIPS Transactions:PartB
• /
• v.15B no.6
• /
• pp.575-584
• /
• 2008

According to the network condition, the communication network overload could be occurred when media transmitting. Many researches are being carried out to lessen the network overload, such as the filtering, load distributing, frame dropping and many other methods. Among these methods, one of effective method is frame dropping that reduces specified video frames for bandwidth diminution. B frames are dropped and then I, P frames are dropped according to dependency among the frames in frame dropping. This paper proposes a scheme for protecting copyrights by encryption, when we apply frame dropping to reduce bandwidth of media following MPEG-4 file format. We designed two kinds of frame dropping: first one stores and then sends the dropped files and the other drops frames in real-time when transmitting. We designed three kinds of encryption methods in which DES algorithm is used to encrypt MPEG-4 data: macro block encryption in I-VOP, macro block and motion vector encryption in P-VOP, and macro block and motion vector encryption in I, P-VOP. Based on these three methods, we implemented a digital right management solution for MPEG-4 data streaming. We compared the results of dropping, encryption, decryption and quality of video sequences to select an optimal method, and there is no noticeable difference between the video sequences recovered after frame dropping and the ones recovered without frame dropping. The best performance in encryption and decryption of frames was obtained when we apply the macro block and motion vector encryption in I, P-VOP.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.9
• /
• pp.361-368
• /
• 2014

The LPR(License plate recognition) system has been developed to efficient control for complex traffic environment and currently be used in many places. However, because of light, noise, background changes, environmental changes, damaged plate, it only works limited environment, so it is difficult to use in real-time. This paper presents a heuristic segmentation algorithm for robust to noise and illumination changes and introduce a real-time license plate recognition system using it. In first step, We detect the plate utilized Haar-like feature and Adaboost. This method is possible to rapid detection used integral image and cascade structure. Second step, we determine the type of license plate with adaptive histogram equalization, bilateral filtering for denoise and segment accurate character based on adaptive threshold, pixel projection and associated with the prior knowledge. The last step is character recognition that used histogram of oriented gradients (HOG) and multi-layer perceptron(MLP) for number recognition and support vector machine(SVM) for number and Korean character classifier respectively. The experimental results show license plate detection rate of 94.29%, license plate false alarm rate of 2.94%. In character segmentation method, character hit rate is 97.23% and character false alarm rate is 1.37%. And in character recognition, the average character recognition rate is 98.38%. Total average running time in our proposed method is 140ms. It is possible to be real-time system with efficiency and robustness.