• Title/Summary/Keyword: Time-weighted average

Search Result 281, Processing Time 0.026 seconds

Detection and Correction of Noisy Pixels Embedded in NDVI Time Series Based on the Spatio-temporal Continuity (시공간적 연속성을 이용한 오염된 식생지수(GIMMS NDVI) 화소의 탐지 및 보정 기법 개발)

  • Park, Ju-Hee;Cho, A-Ra;Kang, Jeon-Ho;Suh, Myoung-Seok
    • Atmosphere
    • /
    • v.21 no.4
    • /
    • pp.337-347
    • /
    • 2011
  • In this paper, we developed a detection and correction method of noisy pixels embedded in the time series of normalized difference vegetation index (NDVI) data based on the spatio-temporal continuity of vegetation conditions. For the application of the method, 25-year (1982-2006) GIMMS (Global Inventory Modeling and Mapping Study) NDVI dataset over the Korean peninsula were used. The spatial resolution and temporal frequency of this dataset are $8{\times}8km^2$ and 15-day, respectively. Also the land cover map over East Asia is used. The noisy pixels are detected by the temporal continuity check with the reference values and dynamic threshold values according to season and location. In general, the number of noisy pixels are especially larger during summer than other seasons. And the detected noisy pixels are corrected by the iterative method until the noisy pixels are completely corrected. At first, the noisy pixels are replaced by the arithmetic weighted mean of two adjacent NDVIs when the two NDVI are normal. After that the remnant noisy pixels are corrected by the weighted average of NDVI of the same land cover according to the distance. After correction, the NDVI values and their variances are increased and decreased by 5% and 50%, respectively. Comparing to the other correction method, this correction method shows a better result especially when the noisy pixels are occurred more than 2 times consistently and the temporal change rates of NDVI are very high. It means that the correction method developed in this study is superior in the reconstruction of maximum NDVI and NDVI at the starting and falling season.

An Adaptive Moving Average (A-MA) Control Chart with Variable Sampling Intervals (VSI) (가변 샘플링 간격(VSI)을 갖는 적응형 이동평균 (A-MA) 관리도)

  • Lim, Tae-Jin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.33 no.4
    • /
    • pp.457-468
    • /
    • 2007
  • This paper proposes an adaptive moving average (A-MA) control chart with variable sampling intervals (VSI) for detecting shifts in the process mean. The basic idea of the VSI A-MA chart is to adjust sampling intervals as well as to accumulate previous samples selectively in order to increase the sensitivity. The VSI A-MA chart employs a threshold limit to determine whether or not to increase sampling rate as well as to accumulate previous samples. If a standardized control statistic falls outside the threshold limit, the next sample is taken with higher sampling rate and is accumulated to calculate the next control statistic. If the control statistic falls within the threshold limit, the next sample is taken with lower sampling rate and only the sample is used to get the control statistic. The VSI A-MA chart produces an 'out-of-control' signal either when any control statistic falls outside the control limit or when L-consecutive control statistics fall outside the threshold limit. The control length L is introduced to prevent small mean shifts from being undetected for a long period. A Markov chain model is employed to investigate the VSI A-MA sampling process. Formulae related to the steady state average time-to signal (ATS) for an in-control state and out-of-control state are derived in closed forms. A statistical design procedure for the VSI A-MA chart is proposed. Comparative studies show that the proposed VSI A-MA chart is uniformly superior to the adaptive Cumulative sum (CUSUM) chart and to the Exponentially Weighted Moving Average (EWMA) chart, and is comparable to the variable sampling size (VSS) VSI EWMA chart with respect to the ATS performance.

An Economic Design of the Integrated Process Control Procedure with Repeated Adjustments and EWMA Monitoring

  • Park Changsoon;Jeong Yoonjoon
    • Proceedings of the Korean Statistical Society Conference
    • /
    • 2004.11a
    • /
    • pp.179-184
    • /
    • 2004
  • Statistical process control (SPC) and engineering process control (EPC) are based on different strategies for process quality improvement. SPC reduces process variability by detecting and eliminating special causes of process variation, while EPC reduces process variability by adjusting compensatory variables to keep the quality variable close to target. Recently there has been need for an integrated process control (IPC) procedure which combines the two strategies. This article considers a scheme that simultaneously applies SPC and EPC techniques to reduce the variation of a process. The process disturbance model under consideration is an IMA(1,1) model with a location shift. The EPC part of the scheme adjusts the process, while the SPC part of the scheme detects the occurrence of a special cause. For adjusting the process repeated adjustment is applied by compensating the predicted deviation from target. For detecting special causes the two kinds of exponentially weighted moving average (EWMA) control chart are applied to the observed deviations: One for detecting location shift and the other for detecting increment of variability. It was assumed that the adjustment of the process under the presence of a special cause may change any of the process parameters as well as the system gain. The effectiveness of the IPC scheme is evaluated in the context of the average cost per unit time (ACU) during the operation of the scheme. One major objective of this article is to investigate the effects of the process parameters to the ACU. Another major objective is to give a practical guide for the efficient selection of the parameters of the two EWMA control charts.

  • PDF

Rapid Staining Using the Shorr Method for Intraoperative Peritoneal Washing Cytology in Advanced Gastric Cancer: a Pilot Study from a Single Institution

  • Son, Sang-Yong;Choi, Hai-Young;Lee, Yoontaek;Park, Young Suk;Shin, Dong Joon;Oo, Aung Myint;Jung, Do Hyun;Ahn, Sang-Hoon;Park, Do Joong;Lee, Hye Seung;Kim, Hyung-Ho
    • Journal of Gastric Cancer
    • /
    • v.19 no.2
    • /
    • pp.173-182
    • /
    • 2019
  • Purpose: Intraoperative peritoneal washing cytology (PWC) is used to determine treatment strategies for gastric cancer with suspected serosal invasion. However, a standard staining method for intraoperative PWC remains to be established. We evaluated the feasibility of a rapid and simple staining method using Shorr's stain for intraoperative PWC in advanced gastric cancer. Materials and Methods: Between November 2012 and December 2014, 77 patients with clinical T3 or higher gastric cancer were enrolled. The sensitivity, specificity, and concordance between the Shorr staining method and conventional Papanicolaou (Pap) staining with carcinoembryonic antigen (CEA) immunohistochemistry (IHC) were analyzed. Results: Intraoperative PWC was performed laparoscopically in 69 patients (89.6%). The average time of the procedure was 8.3 minutes, and the average amount of aspirated fluids was 83.3 mL. The average time for Shorr staining and pathologic review was 21.0 minutes. Of the 77 patients, 16 (20.7%) had positive cytology and 7 (9.1%) showed atypical findings; sensitivity and specificity were 73.6% and 98.2% for the Shorr method, and 78.9% and 98.2% for the Pap method with CEA IHC, respectively. Concordance of diagnosis between the 2 methods was observed in 90.9% of cases (weighted ${\kappa}$ statistic=0.875) and most disagreements in diagnoses occurred in atypical findings (6/7). In overall survival, there was no significant difference in C-index between the 2 methods (0.459 in Shorr method vs. 0.458 in Pap with CEA IHC method, P=0.987). Conclusions: Shorr staining could be a rapid and reliable method for intraoperative PWC in advanced gastric cancer.

A low-complexity PAPR reduction SLM scheme for STBC MIMO-OFDM systems based on constellation extension

  • Li, Guang;Li, Tianyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.6
    • /
    • pp.2908-2924
    • /
    • 2019
  • Multiple input multiple output orthogonal frequency division multiplexing (MIMO-OFDM) is widely applied in wireless communication by virtue of its excellent properties in data transmission rate and transmission accuracy. However, as a major drawback of MIMO-OFDM systems, the high peak-to-average power ratio (PAPR) complicates the design of the power amplifier at the receiver end. Some available PAPR reduction methods such as selective mapping (SLM) suffer from high computational complexity. In this paper, a low-complexity SLM method based on active constellation extension (ACE) and joint space-time selective mapping (AST-SLM) for reducing PAPR in Alamouti STBC MIMO-OFDM systems is proposed. In SLM scheme, two IFFT operations are required for obtaining each transmission sequence pair, and the selected phase vector is transmitted as side information(SI). However, in the proposed AST-SLM method, only a few IFFT operations are required for generating all the transmission sequence pairs. The complexity of AST-SLM is at least 86% less than SLM. In addition, the SI needed in AST-SLM is at least 92.1% less than SLM by using the presented blind detection scheme to estimate SI. We show, analytically and with simulations, that AST-SLM can achieve significant performance of PAPR reduction and close performance of bit error rate (BER) compared to SLM scheme.

A refinement and abstraction method of the SPZN formal model for intelligent networked vehicles systems

  • Yang Liu;Yingqi Fan;Ling Zhao;Bo Mi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.1
    • /
    • pp.64-88
    • /
    • 2024
  • Security and reliability are the utmost importance facts in intelligent networked vehicles. Stochastic Petri Net and Z (SPZN) as an excellent formal verification tool for modeling concurrent systems, can effectively handles concurrent operations within a system, establishes relationships among components, and conducts verification and reasoning to ensure the system's safety and reliability in practical applications. However, the application of a system with numerous nodes to Petri Net often leads to the issue of state explosion. To tackle these challenges, a refinement and abstraction method based on SPZN is proposed in this paper. This approach can not only refine and abstract the Stochastic Petri Net but also establish a corresponding relationship with the Z language. In determining the implementation rate of transitions in Stochastic Petri Net, we employ the interval average and weighted average method, which significantly reduces the time and space complexity compared to alternative techniques and is suitable for expert systems at various levels. This reduction facilitates subsequent comprehensive system analysis and module analysis. Furthermore, by analyzing the properties of Markov Chain isomorphism in the case study, recommendations for minimizing system risks in the application of intelligent parking within the intelligent networked vehicle system can be put forward.

Volatility Analysis for Multivariate Time Series via Dimension Reduction (차원축소를 통한 다변량 시계열의 변동성 분석 및 응용)

  • Song, Eu-Gine;Choi, Moon-Sun;Hwang, S.Y.
    • Communications for Statistical Applications and Methods
    • /
    • v.15 no.6
    • /
    • pp.825-835
    • /
    • 2008
  • Multivariate GARCH(MGARCH) has been useful in financial studies and econometrics for modeling volatilities and correlations between components of multivariate time series. An obvious drawback lies in that the number of parameters increases rapidly with the number of variables involved. This thesis tries to resolve the problem by using dimension reduction technique. We briefly review both factor models for dimension reduction and the MGARCH models including EWMA (Exponentially weighted moving-average model), DVEC(Diagonal VEC model), BEKK and CCC(Constant conditional correlation model). We create meaningful portfolios obtained after reducing dimension through statistical factor models and fundamental factor models and in turn these portfolios are applied to MGARCH. In addition, we compare portfolios by assessing MSE, MAD(Mean absolute deviation) and VaR(Value at Risk). Various financial time series are analyzed for illustration.

Comparative Study on Nitrogen Dioxide Exposure of Female Teachers from Kindergarten and House Wives (유치원 여교사(女敎師)와 전업주부(主婦)의 이산화질소 노출비교 및 평가)

  • 양원호;김순복;배현주;이영미;정문호;정문식
    • Journal of environmental and Sanitary engineering
    • /
    • v.16 no.1
    • /
    • pp.1-8
    • /
    • 2001
  • Since most people spend over 80% of their time indoor, indoor air quality tends to be the dominant contributor to personal exposure. In this study, indoor and outdoor $NO_2$concentrations were measured and compared with simultaneously personal exposures of 27 house-wives and female workers of kindergarten. Time activity pattern and house characteristics were used to determine the effects of these factors on personal exposure. Since house-wives student spent most their times in indoor with mean of 89.8%, their $NO_2$ exposure was associated with indoor $NO_2$ level(r= 0.92) rather than outdoor $NO_2$ level(r= 0.87). female workers were also associated with indoor $NO_2$ level(r= 0.70) though sample number were small. Using time-weighted average model, $NO_2$ exposures of house-wives were estimated by $NO_2$ measurements in indoor home and outdoor home levels. Estimated $NO_2$ personal exposures were significantly correlated with measured $NO_2$ personal exposures (r= 0.90). These results might mean that air pollutants exposure of old and feeble persons, and infants could be estimated by measuring concentrations of indoor home.

  • PDF

Localization of Mobile Robot Based on Radio Frequency Identification Devices (RFID를 이용한 이동로봇의 위치인식기술)

  • Lee Hyun-Jeong;Choi Kyu-Cheon;Lee Min-Cheol;Lee Jang-Myung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.1
    • /
    • pp.41-46
    • /
    • 2006
  • Ubiquitous location based services, offer helpful services anytime and anywhere by using real-time location information of objects based on ubiquitous network. Particularly, autonomous mobile robots can be a solution for various applications related to ubiquitous location based services, e.g. in hospitals, for cleaning, at airports or railway stations. However, a meaningful and still unsolved problem for most applications is to develop a robust and cheap positioning system. A typical example of position measurements is dead reckoning that is well known for providing a good short-term accuracy, being inexpensive and allowing very high sampling rates. However, the measurement always has some accumulated errors because the fundamental idea of dead reckoning is the integration of incremental motion information over time. The other hand, a localization system using RFID offers absolute position of robots regardless of elapsed time. We construct an absolute positioning system based on RFID and investigate how localization technique can be enhanced by RFID through experiment to measure the location of a mobile robot. Tags are placed on the floor at 5cm intervals in the shape of square in an arbitrary space and the accuracy of position measurement is investigated . To reduce the error and the variation of error, a weighting function based on Gaussian function is used. Different weighting values are applied to position data of tags since weighting values follow Gaussian function.

Robust Construction of Voronoi Diagram of Circles by Region-Expansion Algorithm (영역 확장법을 통한 평면에서 원들의 보로노이 다이어그램의 강건한 계산)

  • Kim, Donguk
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.42 no.3
    • /
    • pp.52-60
    • /
    • 2019
  • This paper presents a numerically robust algorithm to construct a Voronoi diagram of circles in the plane. The circles are allowed to have intersections among them, but one circle cannot fully contain another circle. The Voronoi diagram is a tessellation of the plane into Voronoi regions of given circles. Each circle has its Voronoi region which is defined by a set of points in the plane closer to the circle than any other circles. The distance from a point p to a circle $c_i$ of center $p_i$ and radius $r_i$ is ${\parallel}p-p_i{\parallel}-r_i$, which is the closest Euclidean distance from p to the circle boundary. The proposed algorithm first constructs the point Voronoi diagram of centers of given circles, then it enlarges each point to the circle and expands its Voronoi region accordingly. This region-expansion process is done by local modifications and after completing this process for the whole circles the desired circle Voronoi diagram can be obtained. The proposed algorithm is numerically robust and we provide with a few examples to show its robustness. The algorithm runs in $O(n^2)$ time in the worst case and O(n) time on average where n is the number of the circles. The experiment shows that the region-expansion algorithm is robust and runs fast with strong linear time behavior.