• Journal of the Korean Mathematical Society
• /
• v.49 no.2
• /
• pp.235-249
• /
• 2012

In the paper by Liu and Lin (Statist. Probab. Lett. 76 (2006), no. 16, 1787-1799), a new kind of precise asymptotics in the law of large numbers for the sequence of i.i.d. random variables, which includes complete convergence as a special case, was studied. This paper is devoted to the study of this new kind of precise asymptotics in the law of large numbers for moving average process under $\phi$-mixing assumption and some results of Liu and Lin [6] are extended to such moving average process.

• Journal of the Korea Society for Simulation
• /
• v.25 no.3
• /
• pp.133-146
• /
• 2016

To engage multiple missiles in single launcher against multiple targets, launcher system has to operate for optimized launch angle to each target sequentially. If the launch angle sequence is simply defined according to the target assignment order only, overall engagement time would be increased, and even in some engagement scenarios, it could be possible to miss some moving targets being out of proper engagement area. Therefore, the study on methodology for a real-time decision of optimized launch angle sequence is necessary. In this paper, the automatic decision model of launch angle sequence was suggested to minimize total engagement time by analyzing the simulation results of all engagement sequence set for multiple moving target scenario. Performance of proposed methodology for decision of optimal launch angle sequence was verified by comparing with the optimal or suboptimal sequence obtained from simulation results.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.49-63
• /
• 2009

The performance of spatio-temporal moving pattern mining depends on how to analyze and process the huge set of spatio-temporal data due to the nature of it. The several method was presented in order to solve the problems in which existing spatio-temporal moving pattern mining methods[1-10] have, such as increasing execution time and required memory size during the pattern mining, but they did not solve properly yet. Thus, we proposed the STMP/MST method[11] as a preceding research in order to extract effectively sequential and/or periodical frequent occurrence moving patterns from the huge set of spatio-temporal moving data. The proposed method reduces patterns mining execution time, using the moving sequence tree based on hash tree. And also, to minimize the required memory space, it generalizes detailed historical data including spatio-temporal attributes into the real world scopes of space and time by using spatio-temporal concept hierarchy. In this paper, in order to verify the effectiveness of the STMP/MST method, we compared and analyzed performance with existing spatio-temporal moving pattern mining methods based on the quantity of mining data and minimum support factor.

• Communications for Statistical Applications and Methods
• /
• v.17 no.4
• /
• pp.507-513
• /
• 2010

Let {$X_i,-{\infty}$ < 1 < $\infty$} be a doubly infinite sequence of identically distributed and negatively associated random variables with mean zero and finite variance and {$a_i,\;-{\infty}$ < i < ${\infty}$} be an absolutely summable sequence of real numbers. Define a moving average process as $Y_n={\sum}_{i=-\infty}^{\infty}a_{i+n}X_i$, n $\geq$ 1 and $S_n=Y_1+{\cdots}+Y_n$. In this paper we prove that E|$X_1$|$^rh$($|X_1|^p$) < $\infty$ implies ${\sum}_{n=1}^{\infty}n^{r/p-2-q/p}h(n)E{max_{1{\leq}k{\leq}n}|S_k|-{\epsilon}n^{1/p}}{_+^q}<{\infty}$ and ${\sum}_{n=1}^{\infty}n^{r/p-2}h(n)E{sup_{k{\leq}n}|k^{-1/p}S_k|-{\epsilon}}{_+^q}<{\infty}$ for all ${\epsilon}$ > 0 and all q > 0, where h(x) > 0 (x > 0) is a slowly varying function, 1 ${\leq}$ p < 2 and r > 1 + p/2.

• Communications of the Korean Mathematical Society
• /
• v.23 no.4
• /
• pp.597-606
• /
• 2008

Let {$Y_{ij}-{\infty}\;<\;i\;<\;{\infty}$} be a doubly infinite sequence of identically distributed and ${\rho}^*$-mixing random variables with zero means and finite variances and {$a_{ij}-{\infty}\;<\;i\;<\;{\infty}$} an absolutely summable sequence of real numbers. In this paper, we prove the complete moment convergence of {${\sum}^n_{k=1}\;{\sum}^{\infty}_{i=-{\infty}}\;a_{i+k}Y_i/n^{1/p}$; $n\;{\geq}\;1$} under some suitable conditions. We extend Theorem 1.1 of Li and Zhang [Y. X. Li and L. X. Zhang, Complete moment convergence of moving average processes under dependence assumptions, Statist. Probab. Lett. 70 (2004), 191.197.] to the ${\rho}^*$-mixing case.

• ETRI Journal
• /
• v.28 no.3
• /
• pp.367-370
• /
• 2006

This letter presents a multi-modal approach to tracking geographic objects such as buildings and road signs in a video sequence recorded from a moving vehicle. In the proposed approach, photogrammetric techniques are successfully combined with conventional tracking methods. More specifically, photogrammetry combined with positioning technologies is used to obtain 3-D coordinates of chosen geographic objects, providing a search area for conventional feature trackers. In addition, we present an adaptive window decision scheme based on the distance between chosen objects and a moving vehicle. Experimental results are provided to show the robustness of the proposed approach.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8A
• /
• pp.822-828
• /
• 2002

Optical flow estimation based on multi constraint approaches is frequently used for recognition of moving objects. However, the use have been confined because of OF estimation time as well as error problem. This paper shows a new method form effectively extracting movement information using the multi-constraint base approaches with sobel edge detection. The moving objects anr extraced in the input image sequence using edge detection and segmentation. Edge detection and difference of the two input image sequence gives us the moving objects in the images. The process of thresholding removes the moving objects detected due to noise. After thresholding the real moving objects, we applied the Combinatorial Hough Transform (CHT) and voting accumulation to find the optimal constraint lines for optical flow estimation. The moving objects found in the two consecutive images by using edge detection and segmentation greatly reduces the time for comutation of CHT. The voting based CHT avoids the errors associated with least squares methods. Calculation of a large number of points along the constraint line is also avoided by using the transformed slope-intercept parameter domain. The simulation results show that the proposed method is very effective for extracting optical flow vectors and hence recognizing moving objects in the images.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.219-222
• /
• 2001

Moving objects in video data are main elements for video analysis and retrieval. In this paper, we propose a new algorithm for tracking and segmenting moving objects in color image sequences that include complex camera motion such as zoom, pan and rotating. The Proposed algorithm is based on the Mean-shift color segmentation and stochastic region matching method. For segmenting moving objects, each sequence is divided into a set of similar color regions using Mean-shift color segmentation algorithm. Each segmented region is matched to the corresponding region in the subsequent frame. The motion vector of each matched region is then estimated and these motion vectors are summed to estimate global motion. Once motion vectors are estimated for all frame of video sequences, independently moving regions can be segmented by comparing their trajectories with that of global motion. Finally, segmented regions are merged into the independently moving object by comparing the similarities of trajectories, positions and emerging period. The experimental results show that the proposed algorithm is capable of segmenting independently moving objects in the video sequences including complex camera motion.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.11
• /
• pp.1405-1416
• /
• 1995

An effective algorithm for implementation of unmanned surveillance system which detects moving object from image sequences, predicts the direction of it, and drives the camera in real time is proposed. Outputs of proposed algorithm are coordinates of location of moving object, and they are converted to the values according to camera model. As a pre- processing, extraction of moving object and shape discrimination are performed. Existence of the moving object or scene change is detected by computing the temporal derivatives of consecutive two or more images in a sequence, and this result of derivatives is combined with the edge map from one original gray level image to obtain the position of moving object. Shape discri-mination(Target identification) is performed by analysis of distribution of projection profiles in x and y directions. To reduce the prediction error due to the fact that the motion cha- racteristic of walking man may have an abrupt change of moving direction, an order adaptive lattice structured linear predictor is proposed.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.23 no.2
• /
• pp.206-216
• /
• 1986

In this paper, the moving distance and velocity of a single moving object are measured by sampling three frames in a two-dimensional line sequence image. The brightness of each frame is analyzed, and the bit data of their pixel are rearranged so that the difference image may be extracted. The parameters for recognition of the object are the gray level of the object, the number of vertex points and the distance between the vertex points. The moving distance obtained from the coordinate which is constructed by the bit processing of the data in the memory map of a microcomputer, and the moving velocity is obtained from the moving distance and the time interval between the first and second sampled frames.