• Korean Chemical Engineering Research
• /
• v.50 no.1
• /
• pp.149-154
• /
• 2012

The adsorption and desorption behavior of biofilter-medium was investigated on the performance of an adsorption column. Continuous flow-isothermal adsorption experiments were performed to treat waste air containing such a VOC as ethanol under the same condition of > 90% relative humidity as the condition of the feed to a biofilter process. In case of feeding waste air containing ethanol of 1,000 ppmv (or 2,050 mg ethanol/$m^3$) to the adsorption system at the rate of 2 L/min, the onsets of its breakthrough and reaching the state of dynamic equilibrium at the exit had been delayed 10 and 3 times, respectively, later than those at the 1st stage sampling port. Moreover, in case of 2,000 ppmv (or 4,100 mg ethanol/$m^3$), they had been delayed 9 and 3 times, respectively. Thus, regardless of feeding concentration, the ratios of delaying period were observed to be quite consistent each other at the exit of the adsorption column. With regard to the period of desorption, the ratios of delaying period were consistent each other to be 1.5 for both cases. In addition, the effect of microbial activity and sterilization-process was studied on adsorption equilibrium. The ethanol concentration in the vapor phase of vials packed with sterilized granular activated carbon (GAC) was quite consistent to that with unsterilized GAC. However, the ethanol concentrations in the vapor phase of vials packed with unsterilized compost and the unsterilized mixture of GAC and compost were higher than those with sterilized compost and the sterilized mixture of GAC and compost, respectively.

• Journal of Biomedical Engineering Research
• /
• v.32 no.3
• /
• pp.237-244
• /
• 2011

In this paper, a feature-based registration technique is proposed for pre-contrast and post-contrast lung CT images. It utilizes three dimensional(3-D) features with their descriptors and estimates feature correspondences by nearest neighborhood matching in the feature space. We design a transformation model between the input image pairs using a free form deformation(FFD) which is based on B-splines. Registration is achieved by minimizing an energy function incorporating the smoothness of FFD and the correspondence information through a non-linear gradient conjugate method. To deal with outliers in feature matching, our energy model integrates a robust estimator which discards outliers effectively by iteratively reducing a radius of confidence in the minimization process. Performance evaluation was carried out in terms of accuracy and efficiency using seven pairs of lung CT images of clinical practice. For a quantitative assessment, a radiologist specialized in thorax manually placed landmarks on each CT image pair. In comparative evaluation to a conventional feature-based registration method, our algorithm showed improved performances in both accuracy and efficiency.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.74-86
• /
• 2006

This paper proposes a robust and computationally efficient algorithm for automatic video object segmentation. For implementing the spatio-temporal segmentation, which aims for efficient combination of the motion segmentation and the color segmentation, an SOM-based hierarchical clustering method in which the segmentation process is regarded as clustering of feature vectors is employed. As results, problems of high computational complexity which required for obtaining exact segmentation results in conventional video object segmentation methods, and the performance degradation due to noise are significantly reduced. A measure of motion vector reliability which employs MRF-based MAP estimation scheme has been introduced to minimize the influence from the motion estimation error. In addition, a noise elimination scheme based on the motion reliability histogram and a clustering validity index for automatically identifying the number of objects in the scene have been applied. A cross projection method for effective object tracking and a dynamic memory to maintain temporal coherency have been introduced as well. A set of experiments has been conducted over several video sequences to evaluate the proposed algorithm, and the efficiency in terms of computational complexity, robustness from noise, and higher segmentation accuracy of the proposed algorithm have been proved.

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

A widely used 3D face reconstruction method, structure from motion(SfM), shows robust performance when frontal, left, and right face images are used. However, this method cannot reconstruct a self-occluded facial part correctly when only one side view face images are used because only partial facial feature points can be used in this case. In order to solve the problem, the proposed method exploit a constrain that is bilateral symmetry of human faces in order to generate bilateral facial feature points and use both input facial feature points and generated facial feature points to reconstruct a 3D face. For quantitative evaluation of the proposed method, 3D faces were obtained from a 3D face scanner and compared with the reconstructed 3D faces. The experimental results show that the proposed 3D face reconstruction method based on both facial feature points outperforms the previous 3D face reconstruction method based on only partial facial feature points.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.97-107
• /
• 2009

In image-based gait recognition systems, physical factors, such as the camera angle and the lens distortion, and environmental factors such as illumination determines the performance of recognition. In this paper we present a robust gait recognition method by compensating various types of image distortions. The proposed method is compared with existing gait recognition algorithm with consideration of both physical and environmental distortion factors in the input image. More specifically, we first present an efficient compensation algorithm of image distortion by using the projective transform, and test the feasibility of the proposed algorithm by comparing the recognition performances with and without the compensation process. Proposed method gives universal gait data which is invariant to both distance and environment. Gained data improved gait recognition rate about 41.5% in indoor image and about 55.5% in outdoor image. Proposed method can be used effectively in database(DB) construction, searching and tracking of specific objects.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.5
• /
• pp.1-8
• /
• 2008

The belief propagation method that has been studied recently yields good performance in disparity extraction. The method in which a target function is modeled as an energy function based on Markov random field(MRF), solves the stereo matching problem by finding the disparity to minimize the energy function. MRF models provide robust and unified framework for vision problem such as stereo and image restoration. the belief propagation method produces quite correct results, but it has difficulty in real time implementation because of higher computational complexity than other stereo methods. To relieve this problem, in this paper, we propose a fast algorithm of the belief propagation method. Energy function consists of a data term and a smoothness tern. The data term usually corresponds to the difference in brightness between correspondences, and smoothness term indicates the continuity of adjacent pixels. Smoothness information is created from messages, which are assigned using four different message arrays for the pixel positions adjacent in four directions. The processing time for four message arrays dominates 80 percent of the whole program execution time. In the proposed method, we propose an algorithm that dramatically reduces the processing time require in message calculation, since the message.; are not produced in four arrays but in a single array. Tn the last step of disparity extraction process, the messages are called in the single integrated array and this algorithm requires 1/4 computational complexity of the conventional method. Our method is evaluated by comparing the disparity error rates of our method and the conventional method. Experimental results show that the proposed method remarkably reduces the execution time while it rarely increases disparity error.

• Journal of IKEEE
• /
• v.5 no.1 s.8
• /
• pp.8-15
• /
• 2001

This paper remarks IETF based requirements for IP/UDP/RTP header compression issued in 3GPP2 All IP Ad Hoc Meeting and protocol stacks of the next generation mobile station. All IP Network, for real time application such as Voice over IP (VoIP) multimedia services based on 3GPP2 3G cdma2000. Frames for various protocols expected in the All IP network Mobile Station (MS) are explained with several figures including the bit-for-bit notation of header format based on IETF draft of Robust Header Compression Working Group (ROHC). Especially, this paper includes problems of IS-707 Radio Link Protocol (RLP) for header compression which will be expected to modify in All IP network MS's medium access layer to accommodate real time packet data service[1]. And also, since PPP has also many problems in header compression and mobility aspects in MS protocol stacks for 3G cdma2000 packet data network based on Mobile IP (PN-4286)[2], we introduce the problem of solution for header compression of PPP. Finally. we suggest the guidelines for All IP network MS header compression about expected protocol stacks, radio resource efficiency and performance.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.3
• /
• pp.127-135
• /
• 2015

Universal design is defined as the design process of products and environments usable by all people to the greatest extent possible, without the need for adaptation or specialized design. The benefits of universal design have been promoted primarily through illustrative 'success stories' of public, residential and occupational environments and products. While case examples may be informative, they may unfortunately be limited in terms of generality to other designs or tasks. Therefore, design methods and criteria that can be applied systematically in a range of situations to encourage universal design are needed. In addition, the seven principles of universal design are intended to guide the design process. The principles provide a framework that allows a systematic evaluation of new or existing designs and assists in educating both designers and consumers about the characteristics of more usable products and environments. However, exactly how these principles are incorporated into the design process has beenleft up to the designer. Since the introduction of universal design, designers have become familiar with the principles of universal design, and they have developed many products based on universal design. However, the principles of universal design are qualitative, which means designers cannot quantitatively evaluate their designs. Some have worked to develop more systematic ways to evaluate products and environments by providing design guidelines for each of the principles. However, recommendations have not yet been made regarding how to integrate performance measures of universal design into the product design process before the product is mass produced. Furthermore, there are sets of requirements regarding each user group that has different age and ability. Consequently, there is an urgent need for design methods, based on a better understanding of age and ability related factors, which will lead to a universally designed product or environment. The authors have proposed the PSD (Preference Set-Based Design) method that can generate a ranged set of feasible solutions (i.e., robust and flexible solution set) instead of single point solution that satisfies changing sets of design targets. The objective of this paper is to develop a general method for systematically supporting the universal design process. This paper proposes the applicability of PSD method to universal design. Here, the proposed method is successfully illustrated with a universal design problem.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.1
• /
• pp.19-29
• /
• 2003

This paper presents a novel hybrid classifier for face recognition with artificially generated virtual training samples. We utilize both the nearest neighbor approach in feature angle space and a connectionist model to obtain a synergy effect by combining the results of two heterogeneous classifiers. First, a classifier called the nearest feature angle (NFA), based on angular information, finds the most similar feature to the query from a given training set. Second, a classifier has been developed based on the recall of stored frontal projection of the query feature. It uses a frontal recall network (FRN) that finds the most similar frontal one among the stored frontal feature set. For FRN, we used an ensemble neural network consisting of multiple multiplayer perceptrons (MLPs), each of which is trained independently to enhance generalization capability. Further, both classifiers used the virtual training set generated adaptively, according to the spatial distribution of each person's training samples. Finally, the results of the two classifiers are combined to comprise the best matching class, and a corresponding similarit measure is used to make the final decision. The proposed classifier achieved an average classification rate of 96.33% against a large group of different test sets of images, and its average error rate is 61.5% that of the nearest feature line (NFL) method, and achieves a more robust classification performance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.4
• /
• pp.11-17
• /
• 2001

In this paper, we propose a polarity decision carrier recovery algorithm for high order QAM(Quadrature Amplitude Modulation), which has robust and large frequency acquisition performance in the high order QAM modem. The proposed polarity decision PD(Phase Detector) output and its variance characteristic are mathematically derived and the simulation results are compared with conventional DD(Decision-Directed) method. While the conventional DD algorithm has linear range of $3.5^{\circ}{\sim}3.5^{\circ}$, the proposed polarity decision PD algorithm has linear range as large as $-36^{\circ}{\sim}36^{\circ}$ at ${\gamma}-17.9$. The conventional DD algorithm can only acquire offsets less than ${\pm}10\;KHz$ in the case of the 256 QAM while an analog front-end circuit generally can reduce the carrier-frequency offset down to only ${\pm}100\;KHz$. Thus, in this case additional AFC or phase detection circuit for carrier recovery is required. But by adopting the proposed polarity decision algorithm, we can find the system can acquire up to ${\pm}300\;KHz$at SNR = 30dB without aided circuit.