• KIISE Transactions on Computing Practices
• /
• v.22 no.8
• /
• pp.369-374
• /
• 2016

The growing demand of virtual computing and storage resources in the cloud computing environment has led to deduplication of storage system for effective reduction and utilization of storage space. In particular, large reduction in the storage space is made possible by preventing data with identical content as the virtual desktop images from being stored on the virtual desktop infrastructure. However, in order to provide reliable support of virtual desktop services, the storage system must address a variety of workloads by virtual desktop, such as performance overhead due to deduplication, periodic data I/O storms and frequent random I/O operations. In this paper, we designed and implemented a clustered file system to support virtual desktop and storage services in cloud computing environment. The proposed clustered file system provides low storage consumption by means of inline deduplication on virtual desktop images. In addition, it reduces performance overhead by deduplication process in the data server and not the virtual host on which virtual desktops are running.

• Journal of the Society of Cosmetic Scientists of Korea
• /
• v.40 no.2
• /
• pp.195-201
• /
• 2014

Body fluid has been studied for diverse fields like Ringer's solutions, artificial joint fluids, cell growth culture media because it plays a crucial role in controlling body temperature and acts as a solvent for diverse metabolite processes in the body and delivery media of mineral, energy source, hormone, signal and drug from and to cell via blood or lymphatic vessel by osmotic pressure or active uptake. Stratum corneum containing extracellular lipids and NMF (natural moisturizing factor) absorbs atmospheric water residing outside of cells and utilize it to hydrate inside of their own. This process is related to skin barrier function. In this study, we conducted the cell viability test with Cell Bio Fluid $Sync^{TM}$, which mimicks body fluids including amino acids, peptides, and monosaccharides to strengthen skin barrier, and the clinical skin improvement test with cosmetics containing Cell Bio Fluid $Sync^{TM}$. In the cell viability test, HaCaT cell was treated with PBS for 3 hours, followed by the treatment of a cell culture medium (DMEM) and isotonic solution (PBS) and Cell Bio Fluid $Sync^{TM}$ for 3 hours each. Then, MTT assay and image analysis were conducted. In the clinical skin improvement test, twenty-one healthy women participated. Participants applied cosmetics containing Cell Bio Fluid $Sync^{TM}$ on their face for a week and evaluated the skin hydration, skin roughness, brightness and evenness. All measurements were conducted after they washed off their face and took a rest under the constant temperature ($22{\pm}2^{\circ}C$) and constant humidity conditions ($50{\pm}5%$) for 20 minutes. All the data were analyzed by SPSS (version 21) software program. Results showed that Cell Bio Fluid $Sync^{TM}$ improved both the cell viability and in vivo skin conditions such as skin hydration, roughness, brightness and evenness.

• Journal of KIISE:Software and Applications
• /
• v.30 no.9
• /
• pp.876-884
• /
• 2003

It is essential to identify both the pupil and iris boundaries for iris recognition. The circular edge detector proposed by Daugman is the most common and powerful method for the iris region extraction. The method is accurate but requires lots of computational time since it is based on the exhaustive search. Some heuristic methods have been proposed to reduce the computational time, but they are not as accurate as that of Daugman. In this paper, we propose a pupil and iris boundary finding algorithm which is faster than and as accurate as that of Daugman. The proposed algorithm searches the boundaries using the Daugman's circular edge detector, but reduces the search region using the problem domain knowledge. In order to find the pupil boundary, the search region is restricted in the maximum and minimum bounding circles in which the pupil resides. The bounding circles are obtained from the binarized pupil image. Two iris boundary points are obtained from the horizontal line passing through the center of the pupil region obtained above. These initial boundary points, together with the pupil point comprise two bounding circles. The iris boundary is searched in this bounding circles. Experiments show that the proposed algorithm is faster than that of Daugman and more accurate than the conventional heuristic methods.

• Journal of KIISE:Software and Applications
• /
• v.35 no.10
• /
• pp.600-607
• /
• 2008

This paper proposes a robust human detection method irrespective of their pose variation using the multiple oriented 2D elliptical filters (MO2DEFs). The MO2DEFs can detect the humans regardless of their poses unlike existing object oriented scale adaptive filter (OOSAF). To overcome OOSAF's limitation, we introduce the MO2DEFs whose shapes look like the oriented ellipses. We perform human detection by applying four different 2D elliptical filters with specific orientations to the 2D spatial-depth histogram and then by taking the thresholds over the filtered histograms. In addition, we determine the human pose by using convolution results which are computed by using the MO2DEFs. We verify the human candidates by either detecting the face or matching head-shoulder shapes over the estimated rotation. The experimental results showed that the accuracy of pose angle estimation was about 88%, the human detection using the MO2DEFs outperformed that of using the OOSAF by $15{\sim}20%$ especially in case of the posed human.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.99-113
• /
• 2004

A new architecture called SAN(Storage Area Network) was developed in response to the requirements of high availability of data, scalable growth, and system performance. In order to use SAN more efficiently, most of SAN operating softwares support storage virtualization concepts that allow users to view physical storage devices attached to SAN as a large volume virtually h logical volume manager plays a key role in storage virtualization. It realizes the storage virtualization by mapping logical addresses to physical addresses. A logical volume manager also supports a snapshot that preserves a volume image at certain time and on-line reorganization to allow users to add/remove storage devices to/from SAN even while the system is running. To support the snapshot and the on-line reorganization, most logical volume managers have used table based mapping methods. However, it is very difficult to manage mapping table because the mapping table is large in proportion to a storage capacity. In this paper, we design and implement an efficient and flexible hybrid mapping method based on mathematical equations. The mapping method in this paper supports a snapshot and on-line reorganization. The proposed snapshot and on-line reorganization are performed on the reserved area which is separated from data area of a volume. Due to this strategy normal I/O operations are not affected by snapshot and reorganization. Finally, we show the superiority of our proposed mapping method through various experiments.

• Journal of KIISE:Software and Applications
• /
• v.36 no.4
• /
• pp.253-260
• /
• 2009

Many algorithms for computer vision and pattern recognition have recently been implemented on GPU (graphic processing unit) for faster computational times. However, the implementation has two problems. First, the programmer should master the fundamentals of the graphics shading languages that require the prior knowledge on computer graphics. Second, in a job that needs much cooperation between CPU and GPU, which is usual in image processing and pattern recognition contrary to the graphic area, CPU should generate raw feature data for GPU processing as much as possible to effectively utilize GPU performance. This paper proposes more quick and efficient implementation of neural networks on both GPU and multi-core CPU. We use CUDA (compute unified device architecture) that can be easily programmed due to its simple C language-like style instead of GPU to solve the first problem. Moreover, OpenMP (Open Multi-Processing) is used to concurrently process multiple data with single instruction on multi-core CPU, which results in effectively utilizing the memories of GPU. In the experiments, we implemented neural networks-based text extraction system using the proposed architecture, and the computational times showed about 15 times faster than implementation on only GPU without OpenMP.

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

As the computing technique and mobile devices get developed, the demand of multimedia contents for mobile environment has been increased. The multimedia contents provided on PDA has so far been limited to the materials such as video and audio. MPEG-4 is the international standard used for supporting to properly save, communicate multimedia in formation such as video, audio, image, text and two-dimensional object, which can present various, multimedia contents by using adaptation techniques. However, since most MPEG-4 contents are not used for PDA but desktop, it seems not to be played on PDA where needs low power consumption, limited memory capability and GUI, and so on. In this paper, we propose the adaptation techniques, which can present the MPEG-4 contents on PDA, using scene composition with MPEG-4. The proposed scheme consists of three subparts: physical adaptation, variation adaptation and resource adaptation. Physical adaptation adjusts the physical difference of between the authoring environment and playback environment. Event adaptation part transforms events used for desktop to the events used for playback on PDA. The resource adaptation enables efficiency of playback to promote by using the essential information table on BIFS parser. As the proposed scheme is applied to MPEG-4 player, we see that the MPEG-4 contents are efficiently played on PDA.

• Journal of KIISE:Information Networking
• /
• v.37 no.5
• /
• pp.363-373
• /
• 2010

The existing QoS mechanisms for video streaming are short of the consideration for various user environments and the characteristic of streaming applying programs. In order to overwhelm this problem, studies on the video streaming protocols exploiting scalable video coding (SVC), which provide spatial, temporal, and qualitative scalability in video coding, are progressing actively. However, these protocols also have the problem to deepen network congestion situation, and to lower fairness between other traffics, as they are not equipped with congestion control mechanisms. SVC based streaming protocols also have the problem to overlook the property of videos encoded in SVC, as the protocols transmit the streaming simply by extracting the bitstream which has the maximum bit rate within available bandwidth of a network. To solve these problems, this study suggests TCP-friendly network adaptive SVC streaming(T-NASS) protocol which considers both network status and SVC bitstream property. T-NASS protocol extracts the optimal SVC bitstream by calculating TCP-friendly transmission rate, and by perceiving the network status on the basis of packet loss rate and explicit congestion notification(ECN). Through the performance estimation using an ns-2 network simulator, this study identified T-NASS protocol extracts the optimal bitstream as it uses TCP-friendly transmission property and perceives the network status, and also identified the video image quality transmitted through T-NASS protocol is improved.

• Journal of KIISE
• /
• v.44 no.9
• /
• pp.932-945
• /
• 2017

In this paper, a new hardware and software architecture for a stereo vision processing system including rectification, disparity estimation, and visualization was developed. The developed method, named LArge scale stereo matching method using Support Point Interpolation (LASPI), shows excellence in real-time processing for obtaining dense disparity maps from high quality image regions that contain high density support points. In the real-time processing of high definition (HD) images, LASPI does not degrade the quality level of disparity maps compared to existing stereo-matching methods such as Efficient LArge-scale Stereo matching (ELAS). LASPI has been designed to meet a high frame-rate, accurate distance resolution performance, and a low resource usage even in a limited resource environment. These characteristics enable LASPI to be deployed to safety-critical applications such as an obstacle recognition system and distance detection system for autonomous vehicles. A Field Programmable Gate Array (FPGA) for the LASPI algorithm has been implemented in order to support parallel processing and 4-stage pipelining. From various experiments, it was verified that the developed FPGA system (Xilinx Virtex-7 FPGA, 148.5MHz Clock) is capable of processing 30 HD ($1280{\times}720pixels$) frames per second in real-time while it generates disparity maps that are applicable to real vehicles.

• Journal of KIISE:Software and Applications
• /
• v.35 no.10
• /
• pp.616-626
• /
• 2008

The face shape extracted by the depth values has different appearance as the most important facial feature information and the face images decomposed into frequency subband are signified personal features in detail. In this paper, we develop a method for recognizing the range face images by combining the multiple frequency domains for each depth image and depth fusion using fuzzy integral. For the proposed approach, the first step tries to find the nose tip that has a protrusion shape on the face from the extracted face area. It is used as the reference point to normalize for orientated facial pose and extract multiple areas by the depth threshold values. In the second step, we adopt as features for the authentication problem the wavelet coefficient extracted from some wavelet subband to use feature information. The third step of approach concerns the application of eigenface and Linear Discriminant Analysis (LDA) method to reduce the dimension and classify. In the last step, the aggregation of the individual classifiers using the fuzzy integral is explained for extracted coefficient at each resolution level. In the experimental results, using the depth threshold value 60 (DT60) show the highest recognition rate among the regions, and the depth fusion method achieves 98.6% recognition rate, incase of fuzzy integral.