• 대한전자공학회논문지SP
• /
• 제42권1호
• /
• pp.25-31
• /
• 2005

본 논문에서는 컬러 영상에서 Support Vector Domain Description (SVDD)를 이용한 얼굴 검출 방법을 제안한다. 기존의 훈련을 통한 얼굴 검출 방법은 얼굴 영상과 얼굴이 아닌 영상을 모두 사용해야 한다. 그러나, SVDD를 이용한 얼굴 검출은 단지 훈련을 위해 얼굴 영상만이 사용된다. SVDD의 훈련을 통해 나오는 값인 반지름과 중심 좌표를 통해 얼굴을 검출한다. 또한, 엔트로피를 이용한 임계값 추출 방법(Entropic Threshold)을 통해 얼굴 특징을 추출하고, 슬라이딩 윈도우(sliding window)기법을 통해 성능을 개선한다. 주성분 분석(Principle Component Analysis) 과 SVDD를 이용한 얼굴 검출 방법의 비교 실험을 통해 본 논문이 제안한 방법의 효율성을 확인한다.

• 한국통신학회논문지
• /
• 제33권4C호
• /
• pp.330-335
• /
• 2008

본 논문은 IEEE802.11n 시스템의 패킷 검출에 필요한 알고리즘을 제안한다. IEEE802.11n 시스템은 다중 송수신 안테나 시스템으로서 IEEE802.11a 시스템에서 적용되는 알고리즘과 달리 다중 수신부에서 적용 가능한 결합 기법을 고려하여 적용하여야 한다. 따라서 본 논문에서는 단일 송수신 안테나 시스템에서 사용하는 이중 슬라이딩 윈도우 알고리즘과 지연 후 상관 알고리즘을 다중 수신 안테나 결합 알고리즘과 하이브리드하게 결합하여 패킷 검출부 알고리즘을 제시하고, 각각의 성능을 11n 환경에서 모의 실험하고 그 결과를 제시하였다.

• Journal of Information Processing Systems
• /
• 제15권4호
• /
• pp.890-903
• /
• 2019

The single carrier frequency domain equalization (SC-FDE) technology is an important part of the broadband wireless access communication system, which can effectively combat the frequency selective fading in the wireless channel. In SC-FDE communication system, the accuracy of timing synchronization directly affects the performance of the SC-FDE system. In this paper, on the basis of Schmidl timing synchronization algorithm a timing synchronization algorithm suitable for FPGA (field programmable gate array) implementation is proposed. In the FPGA implementation of the timing synchronization algorithm, the sliding window accumulation, quantization processing and amplitude reduction techniques are adopted to reduce the complexity in the implementation of FPGA. The simulation results show that the algorithm can effectively realize the timing synchronization function under the condition of reducing computational complexity and hardware overhead.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제11권4호
• /
• pp.267-274
• /
• 2011

Recently, actor-critic methods have drawn significant interests in the area of reinforcement learning, and several algorithms have been studied along the line of the actor-critic strategy. In this paper, we consider a new type of actor-critic algorithms employing the kernel methods, which have recently shown to be very effective tools in the various fields of machine learning, and have performed investigations on combining the actor-critic strategy together with kernel methods. More specifically, this paper studies actor-critic algorithms utilizing the kernel-based least-squares estimation and policy gradient, and in its critic's part, the study uses a sliding-window-based kernel least-squares method, which leads to a fast and efficient value-function-estimation in a nonparametric setting. The applicability of the considered algorithms is illustrated via a robot locomotion problem and a tunnel ventilation control problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.102.3-102
• /
• 2001

In this paper, we propose a novel method that can detect face region effectively with fuzzy theory and neural network We make fuzzy rules and membership functions to describe the face color. In this algorithm, we use a perceptually uniform color space to increase the accuracy and stableness of the nonlinear color information. We use this model to extract the face candidate, and then scan it with the pre-built sliding window by using a neural network-based pattern-matching method to find eye. A neural network examines small windows of face candidate, and decides whether each window contains eye. We can standardize the face candidate geometrically with detected eyes.

• Journal of Electrical Engineering and Technology
• /
• 제13권3호
• /
• pp.1383-1391
• /
• 2018

A new nonlinear filtering algorithm for effectively denoising images corrupted by the random-valued impulse noise, called dual sliding statistics switching median (DSSSM) filter is presented in this paper. The proposed DSSSM filter is made up of two subunits; i.e. Impulse noise detection and noise filtering. Initially, the impulse noise detection stage of DSSSM algorithm begins by processing the statistics of a localized detection window in sorted order and non-sorted order, simultaneously. Next, the median of absolute difference (MAD) obtained from both sorted statistics and non-sorted statistics will be further processed in order to classify any possible noise pixels. Subsequently, the filtering stage will replace the detected noise pixels with the estimated median value of the surrounding pixels. In addition, fuzzy based local information is used in the filtering stage to help the filter preserves the edges and details. Extensive simulations results conducted on gray scale images indicate that the DSSSM filter performs significantly better than a number of well-known impulse noise filters existing in literature in terms of noise suppression and detail preservation; with as much as 30% impulse noise corruption rate. Finally, this DSSSM filter is algorithmically simple and suitable to be implemented for electronic imaging products.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.363-366
• /
• 2005

In this paper, for detecting human faces under variations of lighting condition and facial expression, distance ranking feature and detection algorithm based on the feature are proposed. Distance ranking is the intensity ranking of a distance transformed image. Based on statistically consistent edge information, distance ranking is robust to lighting condition change. The proposed detection algorithm is a matching algorithm based on FFT and a solution of discretization problem in the sliding window methods. In experiments, face detection results in the situation of varying lighting condition, complex background, facial expression change and partial occlusion of face are shown

• 한국컴퓨터정보학회논문지
• /
• 제17권2호
• /
• pp.149-157
• /
• 2012

이 논문은 슬라이딩 윈도우를 사용하는 스트림 데이터에서 모든 조인 연산의 상태를 저장하기에 메모리가 충분하지 않을 경우에, 연속적인 슬라이딩 윈도우 조인 연산의 근사치 답을 구하는 문제에 대한 연구이다. 근사치를 구하는 두 가지 방법으로는 최대 부분집합으로 근사치를 구하는 방법과 조인 결과에서 임의의 결과를 택하는 방법이 있다. 전자는 잃어버리는 튜플의 수를 최소화 하고, 후자는 조인의 결과가 집계로 나타날 때 사용된다. 이 논문에서는 임의의 입력 데이터에 슬라이딩 윈도우가 사용되는 경우 두 가지 방법으로 얻는 근사치 모두 효율적이지 못함을 보여준다. 기존의 최대 부분집합에 의해 근사치를 구하는 모델에서는 빈도-기반 모델을 사용하였는데. 샘플링이 문제가 되었다. 오히려 스트림 도착한 이후의 연령-기반 모델이 많은 응용분야에서 더 적절하게 사용 될 수 있음을 보여주고 있다. 이 논문에서는 최대 부분 집합과 임의의 결과라는 두 가지 근사치 측정법을 분석, 그 효율성을 비교하여 보여 준다. 또한, 메모리가 제한 되어있는 환경에서 다중 조인 연산이 수행 될 경우에, 어떤 경우에도 근사치 측정을 최적화할 수 있도록, 조인 연산 전체에 필요한 메모리를 적절하게 할당하는 알고리즘의 효율성을 분석한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1633-1649
• /
• 2017

In remote sensing image processing, the traditional fusion algorithm is based on the Intensity-Hue-Saturation (IHS) transformation. This method does not take into account the texture or spectrum information, spatial resolution and statistical information of the photos adequately, which leads to spectrum distortion of the image. Although traditional solutions in such application combine manifold methods, the fusion procedure is rather complicated and not suitable for practical operation. In this paper, an improved IHS transformation fusion algorithm based on the local variance weighting scheme is proposed for remote sensing images. In our proposal, firstly, the local variance of the SPOT (which comes from French "Systeme Probatoire d'Observation dela Tarre" and means "earth observing system") image is calculated by using different sliding windows. The optimal window size is then selected with the images being normalized with the optimal window local variance. Secondly, the power exponent is chosen as the mapping function, and the local variance is used to obtain the weight of the I component and match SPOT images. Then we obtain the I' component with the weight, the I component and the matched SPOT images. Finally, the final fusion image is obtained by the inverse Intensity-Hue-Saturation transformation of the I', H and S components. The proposed algorithm has been tested and compared with some other image fusion methods well known in the literature. Simulation result indicates that the proposed algorithm could obtain a superior fused image based on quantitative fusion evaluation indices.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1032-1035
• /
• 1996

While Ethernet and TCP/IP are the most widely used protocol, for Real-time system, it is not applicable because it doesn't guarantee the deterministic transmission time. Furthermore, the TCP acknowledgement scheme and sliding window algorithm enforce to collide packets. Although various Collision-Free CSMA protocol was presented, it is very difficult to implement in well known OS(UNIX, WilidowsNT) because we have to modify network kernel. This paper presents another transmission protocol based on modified UDP. The colliding probability can be minimized by avoiding successive packet transmission and decreasing competition duration. The proposed algorithm can be used for the soft real-time industrial automation network.