Earticle

Aiming at the problems of low image enhancement accuracy, long enhancement time and poor image quality in the traditional robot sequence motion image enhancement methods, an adaptive enhancement method for robot sequence motion image is proposed. The feature representation of the image was obtained by Karhunen-Loeve (K-L) transformation, and the nonlinear relationship between the robot joint angle and the image feature was established. The trajectory planning was carried out in the robot joint space to generate the robot sequence motion image, and an adaptive homomorphic filter was constructed to process the noise of the robot sequence motion image. According to the noise processing results, the brightness of robot sequence motion image was enhanced by using the multi-scale Retinex algorithm. The simulation results showed that the proposed method had higher accuracy and consumed shorter time for enhancement of robot sequence motion images. The simulation results showed that the image enhancement accuracy of the proposed method could reach 100%. The proposed method has important research significance and economic value in intelligent monitoring, automatic driving, and military fields.

Most conventional instruments measuring disability rely on total score by simply adding individual item responses, which is dependent on the items chosen to represent the underlying construct (test-dependent) and a test statistic, such as coefficient alpha for the estimate of reliability, varying from sample to sample (sample-dependent). By contrast, item response theory (IRT) method focuses on the psychometric properties of the test items instead of the instrument as a whole. By estimating probability that a respondent will select a particular rating for an item, item difficulty and person ability (or disability) can be placed on same linear continuum. These estimates are invariant regardless of the item used (test-free measurement) and the ability of sample applied (sample-free measurement). These advantages of IRT allow the creation of invariantly calibrated large item banks that precisely discriminate the disability levels of individuals. Computer adaptive testing (CAT) method often requiring a testing algorithm promise a means for administering items in a way that is both efficient and precise. This method permits selectively administering items that are closely matched to the ability level of individuals (measurement precision) and measuring the ability without the loss of precision provided by the full item bank (measurement efficiency). These measurement properties can reasonably be achieved using IRT and CAT method. This article aims to investigate comprehensive overview of the existing disability instrument for back pain and to inform physical therapists of an alternative innovative way overcoming the shortcomings of conventional disability instruments. An understanding of IRT and CAT method will equip physical therapist with skills in interpreting the measurement properties of disability instruments developed using the methods.

Image denoising is a lively research field. Today the researches are focus on the wavelet domain especially using wavelet threshold method. We proposed an adaptive threshold method which considering the characteristic of different sub-band, the method is adaptive to each sub-band. Experiment results show that the proposed method extracts white Gaussian noise from original signals in each step scale and eliminates the noise effectively. In addition, the method also preserves the detail information of the original image, obtaining superior quality image with higher peak signal to noise ratio(PSNR).

A nodeless variables finite element method for analysis of two-dimensional, steady-state viscous incompressible flow is presented. The finite element equations are derived from the governing Navier-Stokes differential equations and a corresponding computer program is developed. The proposed method is evaluated by solving the examples of the lubricant flow in journal bearing and the flow in the lid-driven cavity. An adaptive meshing technique is incorporated to improve the solution accuracy and, at the same time, to reduce the analysis computational time. The efficiency of the combined adaptive meshing technique and the nodeless variables finite element method is illustrated by using the example of the flow past two fences in a channel.

Thedenoising of a natural image corrupted by Gaussian noise is a long established problem in signal or image processing. Today the research is focus on the wavelet domain, especially using the wavelet threshold method. In this paper, a waveletbased image denoising modified adaptive thresholding method is proposed. The proposed method computes thethreshold adaptively based on the scale level and adaptively estimates wavelet coefficients by using a modified thresholding function that considers the dependency between the parent coefficient and child coefficient and the soft thresholding function at different scales. Experimental results show that the proposed method provides high peak signal-to-noise ratio results and preserves the detailed information of the original image well, resulting in a superior quality image.

In this paper, the feedforward control with least mean square (LMS) adaptive algorithm is proposed and examined to reduce rotating error by runout of an active magnetic bearing system. Using eddy-current type gap sensors for control, the electrical runout caused by non-uniform material properties of sensor target produces rotational error amplified in feedback control loop, so this runout should be eliminated to increase rotating accuracy. The adaptive feedforward controller is designed and examined its tracking performances and stability numerically with established frequency response function. The designed feedforward controller was applied to a grinding spindle system which is manufactured with a 5.5 kW internal motor and 5-axis active magnetic bearing system including 5 eddy current gap sensors which have approximately 15∼30㎛ of electrical runout. According to the experimental results, the error signal in radial bearings is reduced to less than 5 ,Urn when it is rotating up to 50,000 rpm due to applying the feedforward control for first order harmonic frequency, and corresponding vibration of the spindle is also removed.

Although huge progress has been made in current image segmentation work, there are still no efficient segmentation strategies for tree image which is taken from natural environment and contains complex background. To improve those problems, we propose a method for tree image segmentation combining adaptive mean shifting with image abstraction. Our approach perform better than others because it focuses mainly on the background of image and characteristics of the tree itself. First, we abstract the original tree image using bilateral filtering and image pyramid from multiple perspectives, which can reduce the influence of the background and tree canopy gaps on clustering. Spatial location and gray scale features are obtained by step detection and the insertion rule method, respectively. Bandwidths calculated by spatial location and gray scale features are then used to determine the size of the Gaussian kernel function and in the mean shift clustering. Furthermore, the flood fill method is employed to fill the results of clustering and highlight the region of interest. To prove the effectiveness of tree image abstractions on image clustering, we compared different abstraction levels and achieved the optimal clustering results. For our algorithm, the average segmentation accuracy (SA), over-segmentation rate (OR), and under-segmentation rate (UR) of the crown are 91.21%, 3.54%, and 9.85%, respectively. The average values of the trunk are 92.78%, 8.16%, and 7.93%, respectively. Comparing the results of our method experimentally with other popular tree image segmentation methods, our segmentation method get rid of human interaction and shows higher SA. Meanwhile, this work shows a promising application prospect on visual reconstruction and factors measurement of tree.

Images are unavoidably contaminated with different types of noise during the processes of image acquisition and transmission. The main forms of noise are impulse noise (is also called salt and pepper noise) and Gaussian noise. In this paper, an effective method of removing mixed noise from images is proposed. In general, different types of denoising methods are designed for different types of noise; for example, the median filter displays good performance in removing impulse noise, and the wavelet denoising algorithm displays good performance in removing Gaussian noise. However, images are affected by more than one type of noise in many cases. To reduce both impulse noise and Gaussian noise, this paper proposes a denoising method that combines adaptive median filtering (AMF) based on impulse noise detection with the wavelet threshold denoising method based on a Gaussian mixture model (GMM). The simulation results show that the proposed method achieves much better denoising performance than the median filter or the wavelet denoising method for images contaminated with mixed noise.

Due to the influence of noise in the received signal in non-cooperative communication, it is difficult for existing Automatic modulation classification methods to balance classification accuracy and model complexity. This paper proposes a novel Convolutional Adaptive Noise Reduction (CANR) network, which consists of an Adaptive Noise Reduction (ANR) module and a Convolutional Feature Extraction (CFE) module. The ANR and CFE modules denoise the combined input and capture the spatiotemporal features in the time series. Experiments on benchmark datasets show that the proposed network has the fewest training parameters and state-of-the-art recognition accuracy under the same conditions.

Supplier evaluation is of great significance in green supply chain management. Influenced by factors such as economic globalization, sustainable development, a holistic index framework is difficult to establish in green supply chain. Furthermore, the initial index values of candidate suppliers are often characterized by uncertainty and incompleteness and the index weight is variable. To solve these problems, an index framework is established after comprehensive consideration of the major factors. Then an adaptive weight D-S theory model is put forward, and a fuzzy-rough-sets-AHP method is proposed to solve the adaptive weight in the index framework. The case study and the comparison with TOPSIS show that the adaptive weight D-S theory model in this paper is feasible and effective.

This paper presents an adaptive recursive least squares algorithm (ARLS) for detecting voltage sag and voltage swell events in power systems. Different methods have been developed to detect voltage sag and voltage swell. Some of them use window techniques, which are too slow when voltage sag or swell mitigation is required. Others depend on the extraction of a single non-stationary sinusoidal signal out of a given multi-components input signal, and therefore they don’t consider the harmonic components in calculating the voltage root mean square value (rms). The method, proposed in this paper, is capable of estimating the voltage rms taking into account all harmonic components. The method is tested by applying it to different, simulated signals using ATP program, and compared with voltage sag detection algorithms.

LCD 수요 증가에 따라 LCD 생산 효율성 개선을 위한 검사장비의 중요성이 지속적으로 부각되고 있다. 패턴 검사기는 라인 스캔 카메라와 같은 광학 장비를 통해 미세한 패턴 결함을 빠른 속도로 검출하는 장비이다. 이러한 패턴 검사기는 실시간 검사를 위해 패턴 내에서 단일 기준값을 사용하여 픽셀 단위의 결함 여부를 판단하고 있다. 하지만 패턴 내 각 영역별 특징을 반영하여 서로 다른 기준값을 적용하는 적응적 이진화를 이용하는 경우 결함 검출 성능을 크게 향상시킬 수 있다. 이러한 적응적 이진화를 적용하기 위해서는 특정 검사 대상 픽셀이 어떠한 영역에 속하는지에 대한 정보를 필요로 한다. 이를 위해 본 논문에서는 각각의 검사 대상 픽셀이 어떠한 영역에 속하는지를 판단하는 영역 매칭 알고리즘을 제안한다. 제안된 알고리즘은 머신 비전의 실시간성을 고려한 패턴 정합에 기반을 둔 알고리즘으로 실제 시스템에 적용될 수 있도록 GPGPU를 이용하여 구현된다. 모의실험을 통해 제안된 방법이 실제 시스템이 요구하는 처리 속도를 만족시킬 수 있을 뿐만 아니라 결함 검출의 성능을 개선할 수 있음을 보인다.

As the demand for LCD increases, the importance of inspection equipment for improving the efficiency of LCD production is continuously emphasized. The pattern inspection apparatus is one that detects minute defects of pattern quickly using optical equipment such as line scan camera. This pattern inspection apparatus makes a decision on whether a pixel is a defect or not using a single threshold value in order to meet constraint of real time inspection. However, a method that uses an adaptive thresholding scheme with different threshold values according to characteristics of each region in a pattern can greatly improve the performance of defect detection. To apply this adaptive thresholding scheme it has to be known that a certain pixel to be inspected belongs to which region. Therefore, this paper proposes a region matching algorithm that recognizes the region of each pixel to be inspected. The proposed algorithm is based on the pattern matching scheme with the consideration of real time constraint of machine vision and implemented through GPGPU in order to be applied to a practical system. Simulation results show that the proposed method not only satisfies the requirement for processing time of practical system but also improves the performance of defect detection.

Adaptive neural network approach is presented for determining Electrical Discharge Machining (EDM) parameters. Electrical Discharge Machining has been widely used with its capability of machining hard metals and tough shapes. In the past few years, EDM has been established in tool-room and large-scale production. However. in spite of it's wide application, an universal selection method of EDM parameters has not been established yet. No attempt has been tried before to suggest a logical method in determining essential machine parameters considering the machining rate and resulting surface roughness integrity. The paper presents a method, which is focusing on determining appropriate machining parameters. Depending on the electrode wear and surface roughness, an adaptive neural network is designed for providing suitable machining guideline.

본 논문에서는 적응적 가중치를 사용한 Least Mean Square Error(LMSE) 최적화 기반의 심전도 개인 인식 방법을 제안하다. 제안하는 방법은 잡음 제거를 위한 전처리과정, 평균 심전도 신호 및 표준편차를 추출한다. 그리고 추출된 정보들을 DB에 저장하고 이를 적응적 가중치로 사용하여 개인 인식에 사용한다. 적응적 가중치는 두 가지를 사용하는데 첫 번째 적응적 가중치는 입력 신호의 표준편차의 역수이고, 두번째 적응적 가중치는 DB에 저장된 사람들의 평균 심전도 신호간의 표준편차에 비례한 것이다. 제안한 방법으로 실험한 결과 32명에 대해서 100%의 인식률을 보였다.

This paper presents a Electrocardiogram(ECG) identification method using adaptive weight based on Least Mean Square Error(LMSE) optimization. With a preprocessing for noise suppression, we extracts the average ECG signal and its standard deviation at every time instant. Then the extracted information is stored in database. ECG identification is achieved by matching an input ECG signal with the information in database. In computing the matching scores, the standard deviation is used. The scores are computed by applying adaptive weights to the values of the input signal over all time instants. The adaptive weight consists of two terms. The first term is the inverse of the standard deviation of an input signal. The second term is the proportional one to the standard deviation between user SAECGs stored in the DB. Experimental results show up to 100% recognition rate for 32 registered people.

몰입 가상현실 환경에서 사용자들은 다양한 가상객체들을 선택하여 목표로 하는 일을 수행할 수 있다. 사용자가 원하는 가상객체를 선택하기 위해서는 일반적으로 사용자의 시야에서 가상의 선분을 발사하여 그 선분과 객체가 일치되었을 때 객체를 선택하게 하는 Ray-Casting이나 여러 객체들을 동시에 선택해서 원하는 객체를 선택하는 Cone-Casting 기반의 객체선택 방법들이 널리 사용된다. 하지만 CAD에서 사용되는 가상객체들은 그 자체적으로 세부적인 작은 객체들로 구성되고 결합이 되어 있어서 사용자의 시야에서 원하는 객체를 기존 방법들로 선택하는 경우 사용자가 원하는 객체가 아니라 다른 객체가 선택되는 모호성 문제가 발생하여 원하는 객체를 선택하는데 문제가 발생하며, 그룹으로 객체를 선택하더라도 원하는 객체를 선택하기 위해서 결국 가상객체들의 위치 및 구조 등을 변경해야 하는 추가 작업을 해야 하는 문제가 발생한다. 본 논문에서는 가상객체가 여러 작은 세부적인 가상객체들로 구성이 되어 있더라도 이들이 가지고 있는 공간적인 연관 관계를 계산하고 이 연관 관계에 따라서 세부적인 가상객체들을 펼치거나 줄여서 사용자가 선택을 원하는 객체를 빠르고 정확하게 선택하는 방법을 제공한다. 본 논문에서는 본 논문에서 제안한 Adaptive-Casting 선택 방법과 기존의 Ray-Casting 과 Cone-Casting 방법들과 성능비교 실험을 하였다. 실험 결과 본 논문에서 제안한 방법이 사용자가 원하는 객체를 선택할 때 걸리는 속도가 가장 빠르면서 정확하다는 결과를 보여주었다.

In the immersive virtual reality environment, we can select and manipulate various virtual objects. in order to select a virtual object, we generally use Ray-casting method that fires a virtual line in user's view and selects an object when the line and the object match, or Cone-casting method that is widely used to select multiple objects at the same time. However, since the virtual objects used in CAD are composed of small and complex objects in detail, when selecting an object in the user's view by existing methods, there occurs a ambiguity problem that needs additional realignment operation even though an object is selected as a group. in this paper, even if a virtual object is composed of several small virtual objects, it calculates the spatial and logical relationship among objects and expands or shrinks desired objects, so that the user can quickly and accurately select a desired object. in order to evaluate the proposed method, performance comparison were performed using Our and Ray-Casting and Cone-Casting methods. Experimental results show that the proposed method has the fastest speed and the highest accuracy when selecting the desired objects.

본 논문에서는 관심영역 분리에 따른 적응적인 움직임 보정에 기초한 효과적인 프레임 율 증가 기법을 제안한다. 기존에 가장 많이 알려진 방법인 확장 양방향 움직임 추정 방법(EBME)의 단점을 극복하기 위해, 제안된 알고리즘은 상호 보완적인 비대칭 영역에 대해 양방향 움직임 추정을 수행한다. 그런 후에, 블록 단위로 움직임이나 변화가 있는 영역을 관심영역으로 분류하고 관심영역의 블록 특성에 따라 움직임 벡터를 세부적으로 보정한다. 제안하는 알고리즘은 기존의 선형적인 움직임에 기초하는 확장 양방향 움직임 추정보다 특히 폐색영역에 대해 효율적인 움직임 추정을 한다. 다양한 테스트 비디오 시퀀스들에 대하여 실험한 결과에 따르면, 제안한 방식은 기존 EBME 대비 평균 0.59dB의 화질 개선을 달성하였음을 보인다.

This paper proposes an effective FRUC (Frame Rate Up-Conversion) technique, which is based on ROI (Region Of Interest) separations and adaptive motion vector refinement. In this paper, in order to overcome the weakness of the EBME (Extended Bi-lateral Motion Estimation) algorithm, which is widely known in FRUC techniques, first, the proposed algorithm performs a bi-directional motion estimation for the complementary asymmetric region. Then, the proposed algorithm classifies each block into ROI or non-ROI block and refine motion vectors in accordance with their block characteristics to have a higher accuracy than the conventional EBME algorithm, specially, for the occlusion regions. The experimental results show that the proposed algorithm can improves 0.59dB on average PSNR as compared to the conventional method.

In this paper, the feedforward control with least mean square (LMS) adaptive algorithm is proposed and examined to reduce rotating error by runout of an active magnetic bearing system. Using eddy-current type gap sensor fur control, the electrical runout caused by non-uniform material properties of sensor target produces rotational error amplified in feedback control loop, so this runout should be eliminated to increase rotating accuracy. The adaptive feedforward controller is designed and examined its tracking and stability performances numerically with established frequency response function. The tested grinding spindle system is manufactured with a 5.5 ㎾ internal motor and 5-axis active magnetic bearing system including 5 eddy current gap sensors which have approximately 15 ~ 30 ${\mu}{\textrm}{m}$ of electrical runout. According to the experimental analysis, the error signal in radial bearings is reduced to less than 5 ${\mu}{\textrm}{m}$ when it is rotating up to 50,000 rpm due to applying the feedforward control for first order harmonic frequency, and vibration of the spindle base is also reduced about same frequency.

This paper presents a new method for hi-objective optimization. Ordinary weighted sum method is easy to implement, but it has two significant drawbacks: (1) the solution distribution by the weighted sum method is not uniform, and (2) the method cannot determine any solutions that reside in non-convex regions of a Pareto front. The proposed adaptive weighted sum method does not solve a multiobjective optimization in a predetermined way, but it focuses on the regions that need more refinement by imposing additional inequality constraints. It is demonstrated that the adaptive weighted sum method produces uniformly distributed solutions and finds solutions on non-convex regions. Two numerical examples and a simple structural problem are presented to verify the performance of the proposed method.

최근에 무선 비디오 감사, 무선 비디오 센서 네트워크 그리고 무선 모바일 비디오와 같은 다시점 비디오 서비스에 대한 연구가 활발히 진행되고 있다. 다시점 비디오 신호처리에서 다수 개의 다른 카메라에서 획득되는 영상 사이에 존재하는 높은 상관성을 이용하는 것은 매우 핵심적인 기술이다. 본 논문에서는 카메라들 사이에 상호작용을 요구하지 않고, 다시점 분산 비디오 부호화에 효과적으로 사용할 수 있는 적응적인 다시점 보간 기법을 제안한다. 제안한 방법은 비선형적인 블록 예측, 시차 보상 시점 예측 그리고 비신뢰 블록에 대한 채우기 기법 등으로 구성된다. 모의실험을 통하여 제안한 방식은 기존의 방식에 비해 우수한 성능을 보인다.

Recently, many researches have been focused on multi-view video applications and services such as wireless video surveillance networks, wireless video sensor networks and wireless mobile video. In multi-view video signal processing, to exploit the strong correlation between images acquired by different cameras plays great role in developing a core technique of multi-view video coding. This paper proposes an adaptive multi-view video interpolation technique which is applicable for multi-view distributed video coding without requiring any cooperation amongst the cameras. The proposed algorithm estimates the non-linear moving blocks and employs disparity compensated view prediction, and then fills in the unreliable blocks. Through computer simulations, it is shown that the proposed method outperforms the conventional methods.