Earticle

본 논문에서는 위성영상처리 소프트웨어 및 시스템의 재사용성을 높이고, 개발기간 및 유지 관리 비용을 줄일 수 있는 알고리즘컴포넌트화를 통한 위성영상처리 프레임워크 및 시스템에 대한 구조를 제안한다. 기존 위성영상처리 소프트웨어 및 시스템은 특정데이터 및 기능에 국한되어 제한된 구조를 갖고 있다. 또한, 각각의 시스템들은 동일 및 유사한 영상처리 알고리즘이 사용되지만해당 알고리즘을 중복적으로 개발하는 문제점이 있다. 이와 같은 문제점을 해결하기 위해 위성영상처리 소프트웨어 프레임워크의요구사항을 분석하였다. 요구사항을 반영한 프레임워크 및 시스템 구조를 설계하였으며, 위성영상처리 프레임워크의 운영흐름도 함께 도출하였다.

This paper suggest meteorological satellite processing software’s structure that reduces time and efforts of modification/upgrade. This structure’s key feature is “algorithm component” that works within framework and eventually to a completeMeteorological satellite processing system. Most of existing Meteorological satellite system is designed around specificfunction and data sets which limits range of modification and upgrade. In addition, re-use of current algorithms becomedifficult although re-use of similar algorithm is the case in many occasions. This inefficiency can be resolved by designinga new framework as a result of detail analysis of collected requirements. A new framework and system architecture has beendesigned. In addition, operational flow of Satellite image processing framework has been described.

본 논문은 연속적으로 입력되는 동영상에서 시공간 정보를 이용하여 다양한 조명환경에서도 실시간 적용이 가능한 얼굴영역 검출기법을 제안한다. 제안한 알고리즘은 연속된 두개의 연속 영상에서 에지 차영상을 구하고 연속적으로 입력되는 영상과의 차분 누적영상을 통해 초기 얼굴영역을 검출한다. 초기 얼굴영역으로부터 외부 조명의 영향을 없애기 위해, 검출된 초기 얼굴영역의 수평 프로파일을 이용하여 수직 방향으로 객체영역을 이분하며, 각각의 객체영역에 관해 주색상 밝기를 구한다. 배경과 잡음 성분을 제거한 후, 분할된 얼굴영역을 통합한 주색상 밝기 분포를 이용하여 타원으로 근사화 함으로써 정확한 얼굴의 기울기와 영역을 실시간으로 계산한다. 제안된 방법은 다양한 조명조건에서 얻어진 동영상을 이용하여 실험되었으며 얼굴의 좌 우 기울기가 $30^{\circ}$이하에서 우수한 얼굴영역 검출 성능을 보였다.

In this paper we present a facial region detection algorithm for real-time image with complex background and various illumination using spatial and temporal methods. For Detecting Human region It used summation of Edge-Difference Image between continuous image sequences. Then, Detected facial candidate region is vertically divided two objected. Non facial region is reduced using Analysis of Major Color Component. Non facial region has not available Major Color Component. And then, Background is reduced using boundary information. Finally, The Facial region is detected through horizontal, vertical projection of Images. The experiments show that the proposed algorithm can detect robustly facial region with complex background various illumination images.

본 논문은 평균이동방법과 연결요소방법을 이용하여 도로 영역을 추출하는 알고리즘을 제안하였다. 평균 이동 방법은 중심 모드를 찾기 위한 비모수적 통계 방법으로 컬러 영상을 분할하는데 효율적이다. 일반적으로, 영상의 중·하단에 위치하는 정보를 활용하여 도로의 특징점이 추출된다. 이 특징점과 분할된 컬러 영상을 이용하면, 도로의 영역을 추출할 수 있다. 그러나, 도로의 위치정보와 색상정보만으로 도로영역을 추출할 경우, 잡음과 도로 이외의 영역까지 추출되는 단점이 있다. 본 논문에서는 모폴로지 열기·닫기 연산을 이용하여 잡음을 제거하고, 연결요소 방법을 통하여 가장 큰 영역의 부분만을 추출하여 도로 영역으로 결정하는 방법을 제안한다. 제안된 방법은 실험을 통하여 잡음 제거와 보다 정확한 도로 검출됨을 검증한다.

In this paper, we propose a method for extracting a road area by using the mean-shift method and connected-component method. Mean-shift method is very effective to divide the color image by the method of non-parametric statistics to find the center mode. Generally, the feature points of road are extracted by using the information located in the middle and bottom of the road image. And it is possible to extract a road region by using this feature-point and the partitioned color image. However, if a road region is extracted with only the color information and the position information of a road image, it is possible to detect not only noise but also off-road regions. This paper proposes the method to determine the road region by eliminating the noise with the closing / opening operation of the morphology, and by extracting only the portion of the largest area using a connected-components method. The proposed method is simulated and verified by applying the captured road images.

In development of service-oriented software systems based on component technology, dynamic assembling of service components is research issues, but many dynamic assembled algorithms based on keywords have some limits such as low successful rate and so on, it is necessary that research dynamic assembled algorithm. To analyze semantic web service and component technology, some correlative definitions of web service components are given by markup language of web service, the theory of domain ontology is cited, a dynamic assembled algorithm for components of semantic web service based on domain ontology is provided, the dynamic assembled ideal of service component is given according to semantic relationship, the algorithm is realized with pseudo codes. Finally, the feasibility and efficiency about algorithm are demonstrated by experiment and contrast analysis.

In order to get the vehicle' actual driving mode in a different road conditions, the driving data is divided into kinematic sequence for analysis of driving cycle. On the basis of kinematics fragments, the characteristic parameters of kinematic sequence are carried out with the principal component analysis. Then driving cycle are synthesized based on dynamic clustering algorithm analysis to get the vehicle' driving state in different road conditions.

This paper presents a Uyghur text-line separation algorithm based on classified connected components of Uyghur Handwritten scripts. In order to get the location of main text-lines, this paper proposes an adaptive painting and thinning algorithm. To insure the efficiency of text-lines segmentation, the post-processing of text-line detection procedures are introduced. The experimental results show that the algorithm is strongly robust for segmentation of text-lines with having some skewness, touching and overlapping, and small strokes remained.

In ultrasonic nondestructive testing, the presence of noise makes great trouble for defect recognition, so it is very necessary to reduce noise in collected ultrasonic signal. In this paper a de-noising algorithm of ultrasonic echo signal based on wavelet transform and Independent Component Analysis (ICA) was presented. First, wavelet transform was used to decompose original noisy signal, and then ICA was applied to decomposed detail coefficients, separated independent components were evaluated by threshold, noise was filtered, and finally, de-noised ultrasonic signal was obtained by wavelet reconstruction. Simulation and experimental results showed that the proposed algorithm can improve signal-to-noise ratio, meanwhile, overcome some other de-noising algorithms’ shortcoming of losing useful information in de-noising, the performance is superior to wavelet threshold de-noising algorithm.

Maintenance reduces the occurrence of failures of a component (or IT product) and also extends its useful life. This way the time to dispose of such a component may be delayed and this reduces the rate at which greenhouse gases enter into the food chain and the atmosphere. It will be helpful to produce set of maintenance intervals for such component at which its extended useful life and cost are most improved. This set will consist of trade-offs between extended life and cost and is known as optimal set. This paper builds on earlier work to define the optimisation of the maintenance intervals of a given component with respect to its extended useful life and cost. The paper also establishes and uses a new approach of hill-climbing search algorithm.

In this paper, a novel approach to multi-hop range-free localization algorithm in wireless sensor network is proposed using principal component regression. The localization problem in the wireless sensor network is formulated as a multiple regression problem, which is resolved by principal component regression. The proposed methods are simple and efficient that no additional hardware is required for the measurements, and only hop-counts information and location information of the beacons are used for the localization. The proposed method consists of two phases: the offline training phase and the online localization phase. In offline training phase, the real distances and the hop-counts among sensor nodes are collected to build localization model. In online localization phase, each unknown sensor node finds its own location using the localization model. The experimental results show that compared with previous localization methods, the proposed method exhibits excellent and robust performances not only in the isotropic sensor networks but also in the anisotropic sensor networks.

Traditional affinity propagation algorithm has inefficient results when conducting clustering analysis of high dimensional data because "dimension effect" lead to difficult find the proper class structure .In view of this, the author proposes an improved algorithm on the basis of Entropy Weight Method and Principal Component Analysis (EWPCA-AP). EWPCA-AP algorithm empowers the sample data by Entropy Weight Method, eliminate data irrelevant attributes by Principal Component Analysis, and travel with neighbor clustering algorithm, realization of high-dimensional data clustering in low dimension space. The numerical result of simulation experiment shows that the new EWPCA-AP algorithm can effectively eliminate the redundancy and irrelevant attributes of data and improve the performance of clustering. In addition, the proposed algorithm is applied in the area of the economy in our country and the clustering result is consistent with the real one. This algorithm provides a new intelligent evaluation method for Chinese economy.

As a kind of very effective methods of gathering data processing - principal component method, it can be used to determine the variables between the linear combination rule, reduce the dimension of feature space, select the optimal variables instead of the original. In recent years, as in the field of image processing, a wide range of application of principal component inspection technology, its shortcomings are also needless to say, the main components of investigation can only in the presence of one dimensional vector. Plane principal component, but can be on the premise of reducing data transformation between time, directly with two-dimensional vector matrix, which results in better image processing speed operation. On this basis, in the light of the characteristics of the remote sensing images, principal component and on the plane algorithm combining wavelet transform, put forward a kind of based on wavelet transform and principal component of the denoising algorithm. Experimental results show that the proposed method is better than first when some typical denoising method, this method can effectively remove gaussian noise of remote sensing images, made in the image edge details such as information can be more perfect.

Independent Component Analysis (ICA), one of the blind source separation methods, can be applied for extracting unknown source signals only from received signals. This is accomplished by finding statistical independence of signal mixtures and has been successfully applied to myriad fields such as medical science, image processing, and numerous others. Nevertheless, there are inherent problems that have been reported when using this technique: instability and invalid ordering of separated signals, particularly when using a conventional ICA technique in vibratory source signal identification of complex structures. In this study, a simple iterative algorithm of the conventional ICA has been proposed to mitigate these problems. The proposed method to extract more stable source signals having valid order includes an iterative and reordering process of extracted mixing matrix to reconstruct finally converged source signals, referring to the magnitudes of correlation coefficients between the intermediately separated signals and the signals measured on or nearby sources. In order to review the problems of the conventional ICA technique and to validate the proposed method, numerical analyses have been carried out for a virtual response model and a 30 m class submarine model. Moreover, in order to investigate applicability of the proposed method to real problem of complex structure, an experiment has been carried out for a scaled submarine mockup. The results show that the proposed method could resolve the inherent problems of a conventional ICA technique.

Principal component-genetic algorithm-multiparameter linear regression (PC-GA-MLR) and principal component-genetic algorithm-artificial neural network (PC-GA-ANN) models were applied for prediction of melting point for 323 drug-like compounds. A large number of theoretical descriptors were calculated for each compound. The first 234 principal components (PC’s) were found to explain more than 99.9% of variances in the original data matrix. From the pool of these PC’s, the genetic algorithm was employed for selection of the best set of extracted PC’s for PC-MLR and PC-ANN models. The models were generated using fifteen PC’s as variables. For evaluation of the predictive power of the models, melting points of 64 compounds in the prediction set were calculated. Root-mean square errors (RMSE) for PC-GA-MLR and PC-GA-ANN models are 48.18 and $12.77{^{\circ}C}$, respectively. Comparison of the results obtained by the models reveals superiority of the PC-GA-ANN relative to the PC-GA-MLR and the recently proposed models (RMSE = $40.7{^{\circ}C}$). The improvements are due to the fact that the melting point of the compounds demonstrates non-linear correlations with the principal components.

This paper deals with the PCB assembly time minimization problem that the PAP (pick-and-placement) machine pickup the K-weighted group of N-components, loading, and place into the PCB placement location. This problem considers the rotational turret velocity according to component weight group and moving velocity of distance in two component placement locations in PCB. This paper suggest heavy-weight component group first pick-and-place strategy that the feeder sequence fit to the placement location Hamiltonean cycle sequence. This algorithm applies the quadratic assignment problem (QAP) that considers feeder sequence and location sequence, and the linear assignment problem (LAP) that considers only feeder sequence. The proposed algorithm shorten the assembly time than iATMA for QAP, and same result as iATMA that shorten the assembly time than ATMA.

A unified procedure for principal component regression (PCR), partial least squares (PLS) and ordinary least squares (OLS) is proposed. The process gives solutions for PCR, PLS and OLS in a unified and non-iterative way. This enables us to see the interrelationships among the three regression coefficient vectors, and it is seen that the so-called E-matrix in the solution expression plays the key role in differentiating the methods. In addition to setting out the procedure, the paper also supplies a robust numerical algorithm for its implementation, which is used to show how the procedure performs on a real world data set.

This paper addresses nonnegative independent component analysis (NICA), with the aim to realize the blind separation of nonnegative well-grounded independent source signals, which arises in many practical applications but is hardly ever explored. Recently, Bertrand and Moonen presented a multiplicative NICA (M-NICA) algorithm using multiplicative update and subspace projection. Based on the principle of the mutual correlation minimization, we propose another novel cost function to evaluate the diagonalization level of the correlation matrix, and apply the multiplicative exponentiated gradient (EG) descent update to it to maintain nonnegativity. An efficient approach referred to as the EG-NICA algorithm is derived and its validity is confirmed by numerous simulations conducted on different types of source signals. Results show that the separation performance of the proposed EG-NICA algorithm is superior to that of the previous M-NICA algorithm, with a better unmixing accuracy. In addition, its convergence speed is adjustable by an appropriate user-defined learning rate.

In this paper we compare parameter estimation by Grassmann manifold optimization and sequential candidate set algorithm in a structured principal fitted component (PFC) model. The structured PFC model extends the form of the covariance matrix of a random error to relieve the limits that occur due to too simple form of the matrix. However, unlike other PFC models, structured PFC model does not have a closed form for parameter estimation in dimension reduction which signals the need of numerical computation. The numerical computation can be done through Grassmann manifold optimization and sequential candidate set algorithm. We conducted numerical studies to compare the two methods by computing the results of sequential dimension testing and trace correlation values where we can compare the performance in determining dimension and estimating the basis. We could conclude that Grassmann manifold optimization outperforms sequential candidate set algorithm in dimension determination, while sequential candidate set algorithm is better in basis estimation when conducting dimension reduction. We also applied the methods in real data which derived the same result.