Redundant discrete wavelet transforms based moving object recognition and tracking

A method for moving object recognition and tracking in the intelligent traffic monitoring system is presented. For the shortcomings and deficiencies of the frame-subtraction method, a redundant discrete wavelet transform （RDWT） based moving object recognition algorithm is put forward, which directly detects moving objects in the redundant discrete wavelet transform domain. An improved adaptive mean-shift algorithm is used to track the moving object in the follow up frames. Experimental results show that the algorithm can effectively extract the moving object, even though the object is similar to the background, and the results are better than the traditional frame-subtraction method. The object tracking is accurate without the impact of changes in the size of the object. Therefore the algorithm has a certain practical value and prospect.

Real-time moving object detection for video monitoring systems

Moving object detection is one of the challenging problems in video monitoring systems, especially when the illumination changes and shadow exists. Amethod for real-time moving object detection is described. Anew background model is proposed to handle the illumination varition problem. With optical flow technology and background subtraction, a moving object is extracted quickly and accurately. An effective shadow elimination algorithm based on color features is used to refine the moving obj ects. Experimental results demonstrate that the proposed method can update the background exactly and quickly along with the varition of illumination, and the shadow can be eliminated effectively. The proposed algorithm is a real-time one which the foundation for further object recognition and understanding of video mum＇toting systems.

An efficient compressed domain moving object segmentation algorithm based on motion vector field

In this paper an efficient compressed domain moving object segmentation algorithm is proposed, in which the motion vector （MV） field parsed from the compressed video is the only cue used for moving object segmentation. First the MV field is temporally and spatially normalized, and then accumulated by an iterative backward projection to enhance salient motions and alleviate noisy MVs. The accumulated MV field is then segmented into motion-homogenous regions using a modified statistical region growing approach. Finally, moving object regions are extracted in turn based on minimization of the joint prediction error using the estimated motion models of two region sets containing the candidate object region and other remaining regions, respectively. Experimental results on several H.264 compressed video sequences demonstrate good segmentation performance.

Moving object detection in framework of compressive sampling

Compressive sensing is a revolutionary idea proposed recently to achieve much lower sampling rate for signals.In the image application with limited resources the camera data can be stored and processed in compressed form.An algorithm for moving object and region detection in video using a compressive sampling is developed.The algorithm estimates motion information of the moving object and regions in the video from the compressive measurements of the current image and background scene.The algorithm does not perform inverse compressive operation to obtain the actual pixels of the current image nor the estimated background.This leads to a computationally efficient method and a system compared with the existing motion estimation methods.The experimental results show that the sampling rate can reduce to 25% without sacrificing performance.

Key techniques for predicting the uncertain trajectories of moving objects with dynamic environment awareness

Emerging technologies of wireless and mobile communication enable people to accumulate a large volume of time-stamped locations,which appear in the form of a continuous moving object trajectory.How to accurately predict the uncertain mobility of objects becomes an important and challenging problem.Existing algorithms for trajectory prediction in moving objects databases mainly focus on identifying frequent trajectory patterns,and do not take account of the effect of essential dynamic environmental factors.In this study,a general schema for predicting uncertain trajectories of moving objects with dynamic environment awareness is presented,and the key techniques in trajectory prediction arc addressed in detail.In order to accurately predict the trajectories,a trajectory prediction algorithm based on continuous time Bayesian networks（CTBNs） is improved and applied,which takes dynamic environmental factors into full consideration.Experiments conducted on synthetic trajectory data verify the effectiveness of the improved algorithm,which also guarantees the time performance as well.

An Improved Moving Object Detection Algorithm Based on Gaussian Mixture Models

Aiming at the problems that the classical Gaussian mixture model is unable to detect the complete moving object, and is sensitive to the light mutation scenes and so on, an improved algorithm is proposed for moving object detection based on Gaussian mixture model and three-frame difference method. In the process of extracting the moving region, the improved three-frame difference method uses the dynamic segmentation threshold and edge detection technology, and it is first used to solve the problems such as the illumination mutation and the discontinuity of the target edge. Then, a new adaptive selection strategy of the number of Gaussian distributions is introduced to reduce the processing time and improve accuracy of detection. Finally, HSV color space is used to remove shadow regions, and the whole moving object is detected. Experimental results show that the proposed algorithm can detect moving objects in various situations effectively.

An Algorithm for Mining Gradual Moving Object Clusters Pattern From Trajectory Streams

The discovery of gradual moving object clusters pattern from trajectory streams allows characterizing movement behavior in real time environment,which leverages new applications and services.Since the trajectory streams is rapidly evolving,continuously created and cannot be stored indefinitely in memory,the existing approaches designed on static trajectory datasets are not suitable for discovering gradual moving object clusters pattern from trajectory streams.This paper proposes a novel algorithm of gradual moving object clusters pattern discovery from trajectory streams using sliding window models.By processing the trajectory data in current window,the mining algorithm can capture the trend and evolution of moving object clusters pattern.Firstly,the density peaks clustering algorithm is exploited to identify clusters of different snapshots.The stable relationship between relatively few moving objects is used to improve the clustering efficiency.Then,by intersecting clusters from different snapshots,the gradual moving object clusters pattern is updated.The relationship of clusters between adjacent snapshots and the gradual property are utilized to accelerate updating process.Finally,experiment results on two real datasets demonstrate that our algorithm is effective and efficient.

Fast Moving Object Extraction in H.264/AVC Compressed Domain

This paper presents a novel approach for moving object extraction in the H.264/AVC compressed domain, which based on Ant Colony clustering Algorithm (ACA) and threshold method in macro block layer. Firstly, the Motion Vector (MV) field and the macro block types are extracted from the H.264/AVC compressed video, and then merge MVs with the same characteristic. Secondly, an improved ACA is used to classify the MV field into different motion homogenous regions. At the same time, use macro block types to determine the location of objects. Finally, using the complementarities of macro block template and MVs clustering template to obtain final objects. Experimental results for several video sequences demonstrate that in the case of ensuring accuracy, the proposed approach can extract moving object faster.

Hardware Design of Moving Object Detection on Reconfigurable System

Moving object detection including background subtraction and morphological processing is a critical research topic for video surveillance because of its high computational loading and power consumption. This paper proposes a hardware design to accelerate the computation of background subtraction with low power consumption. A real-time background subtraction method is designed with a frame-buffer scheme and function partition to improve throughput, and implemented using Verilog HDL on FPGA. The design parallelizes the computations of background update and subtraction with a seven-stage pipeline. A stripe-based morphological processing and accounting for the completion of detected objects is devised. Simulation results for videos of VGA resolutions on a low-end FPGA device show 368 fps throughput for only the real-time background subtraction module, and 51 fps for the whole system, including off-chip memory access. Real-time efficiency with low power consumption and low resource utilization is thus demonstrated.

The Application Model of Moving Objects in Cargo Delivery System

The development of spatio-temporal database systems is primarily motivated by applications which track and present mobile objects. In this paper, solutions for establishing the moving object database based on GPS/GIS environment are presented, and a data modeling of moving object is given by using Temporal logical to extent the query language, finally the application model in cargo delivery system is shown.

COLLISION DETECTION AMONG MOVING OBJECTSIN MACHINING PROCESS SIMULATION

This paper describes an algorithm of collision detection between moving objects in machin-ing process simulation. Graphical simulation of machining has been recognized to be useful for NCprogram verification , since the programmer of the machining operator can easily find some faults inthe NC program visually. But it is difficult to visually detect collisions arnong moving objects such ascutting tools , workpieces and fixtures, a data structure to represent moving objects and an algorithmof collision detection between moving objects are proposed. A moving object can be represented by ahierarchical sphere octree and its motion can be described by a quadratic function of time. A collisionoccurs in the case that the distance between any two sphere centers in the respective two moving ob-jects is equal to the sum of the radii of these two spheres, and the radii of these two spheres are lessthan a given precision. By solving the equations that satisfy the conditions of collision between thespheres recursively , we obtain the time and the position of the collision between these two moving ob-Jects.

Deep Learning-based Moving Object Segmentation:Recent Progress and Research Prospects

Moving object segmentation(MOS),aiming at segmenting moving objects from video frames,is an important and challenging task in computer vision and with various applications.With the development of deep learning(DL),MOS has also entered the era of deep models toward spatiotemporal feature learning.This paper aims to provide the latest review of recent DL-based MOS methods proposed during the past three years.Specifically,we present a more up-to-date categorization based on model characteristics,then compare and discuss each category from feature learning(FL),and model training and evaluation perspectives.For FL,the methods reviewed are divided into three types:spatial FL,temporal FL,and spatiotemporal FL,then analyzed from input and model architectures aspects,three input types,and four typical preprocessing subnetworks are summarized.In terms of training,we discuss ideas for enhancing model transferability.In terms of evaluation,based on a previous categorization of scene dependent evaluation and scene independent evaluation,and combined with whether used videos are recorded with static or moving cameras,we further provide four subdivided evaluation setups and analyze that of reviewed methods.We also show performance comparisons of some reviewed MOS methods and analyze the advantages and disadvantages of reviewed MOS methods in terms of technology.Finally,based on the above comparisons and discussions,we present research prospects and future directions.

Event-Related Potentials Analysis on Perception of Moving Object at Different Speeds

For this research,electroencephalography(EEG)was analyzed to investigate the perception ability of the brain for moving objects at different speeds.In this experiment,total six kinds of videos regarding license plates were created,moving at distinct speed of 0.26 m/s,0.36 m/s,0.46 m/s,0.56 m/s,0.66 m/s,and 0.76 m/s,respectively.In the semantic priming paradigm,the N400 effect was analyzed for each speed.The ERP results demonstrated that the N400 amplitude gradually reduced with increasing speed.At the three lower speeds,N400 was evoked evidently and mainly distributed in the centro-posterior region.At the three higher speeds,no significant N400 effect was found.The results concluded that the perception ability of the brain declined with the acceleration of the object’s moving speed and that the brain recognized the detailed information of the moving object when its speed was lower than 0.46 m/s.

A robust RGB-D visual odometry with moving object detection in dynamic indoor scenes

Simultaneous localisation and mapping(SLAM)are the basis for many robotic applications.As the front end of SLAM,visual odometry is mainly used to estimate camera pose.In dynamic scenes,classical methods are deteriorated by dynamic objects and cannot achieve satisfactory results.In order to improve the robustness of visual odometry in dynamic scenes,this paper proposed a dynamic region detection method based on RGBD images.Firstly,all feature points on the RGB image are classified as dynamic and static using a triangle constraint and the epipolar geometric constraint successively.Meanwhile,the depth image is clustered using the K-Means method.The classified feature points are mapped to the clustered depth image,and a dynamic or static label is assigned to each cluster according to the number of dynamic feature points.Subsequently,a dynamic region mask for the RGB image is generated based on the dynamic clusters in the depth image,and the feature points covered by the mask are all removed.The remaining static feature points are applied to estimate the camera pose.Finally,some experimental results are provided to demonstrate the feasibility and performance.

Indexing Future Trajectories of Moving Objects in a Constrained Network

Advances in wireless sensor networks and positioning technologies enable new applications monitoring moving objects. Some of these applications, such as traffic management, require the possibility to query the future trajectories of the objects. In this paper, we propose an original data access method, the ANR-tree, which supports predictive queries. We focus on real life environments, where the objects move within constrained networks, such as vehicles on roads. We introduce a simulation-based prediction model based on graphs of cellular automata, which makes full use of the network constraints and the stochastic traffic behavior. Our technique differs strongly from the linear prediction model, which has low prediction accuracy and requires frequent updates when applied to real traffic with velocity changing frequently. The data structure extends the R-tree with adaptive units which group neighbor objects moving in the similar moving patterns. The predicted movement of the adaptive unit is not given by a single trajectory, but instead by two trajectory bounds based on different assumptions on the traffic conditions and obtained from the simulation. Our experiments, carried on two different datasets, show that the ANR-tree is essentially one order of magnitude more efficient than the TPR-tree, and is much more scalable.

Efficient κ-Nearest-Neighbor Search Algorithms for Historical Moving Object Trajectories

Nearest Neighbor （κNN） search is one of the most important operations in spatial and spatio-temporal databases. Although it has received considerable attention in the database literature, there is little prior work on κNN retrieval for moving object trajectories. Motivated by this observation, this paper studies the problem of efficiently processing κNN （κ≥ 1） search on R-tree-like structures storing historical information about moving object trajectories. Two algorithms are developed based on best-first traversal paradigm, called BFPκNN and BFTκNN, which handle the κNN retrieval with respect to the static query point and the moving query trajectory, respectively. Both algorithms minimize the number of node access, that is, they perform a single access only to those qualifying nodes that may contain the final result. Aiming at saving main-memory consumption and reducing CPU cost further, several effective pruning heuristics are also presented. Extensive experiments with synthetic and real datasets confirm that the proposed algorithms in this paper outperform their competitors significantly in both efficiency and scalability.

Context-Based Moving Object Trajectory Uncertainty Reduction and Ranking in Road Network

To support a large amount of GPS data generated from various moving objects, the back-end servers usually store low-sampling-rate trajectories. Therefore, no precise position information can be obtained directly from the back-end servers and uncertainty is an inherent characteristic of the spatio-temporal data. How to deal with the uncertainty thus becomes a basic and challenging problem. A lot of researches have been rigidly conducted on the uncertainty of a moving object itself and isolated from the context where it is derived. However, we discover that the uncertainty of moving objects can be efficiently reduced and effectively ranked using the context-aware information. In this paper, we focus on context- aware information and propose an integrated framework, Context-Based Uncertainty Reduction and Ranking （CURR）, to reduce and rank the uncertainty of trajectories. Specifically, given two consecutive samplings, we aim to infer and rank the possible trajectories in accordance with the information extracted from context. Since some context-aware information can be used to reduce the uncertainty while some context-aware information can be used to rank the uncertainty, to leverage them accordingly, CURR naturally consists of two stages： reduction stage and ranking stage which complement each other. We also implement a prototype system to validate the effectiveness of our solution. Extensive experiments are conducted and the evaluation results demonstrate the efficiency and high accuracy of CURR.

Adaptive Indexing of Moving Objects with Highly Variable Update Frequencies

In recent years, management of moving objects has emerged as an active topic of spatial access methods. Various data structures （indexes） have been proposed to handle queries of moving points, for example, the well-known B^x-tree uses a novel mapping mechanism to reduce the index update costs. However, almost all the existing indexes for predictive queries are not applicable in certain circumstances when the update frequencies of moving objects become highly variable and when the system needs to balance the performance of updates and queries. In this paper, we introduce two kinds of novel indexes, named B^y-tree and αB^y-tree. By associating a prediction life period with every moving object, the proposed indexes are applicable in the environments with highly variable update frequencies. In addition, the αB^y-tree can balance the performance of updates and queries depending on a balance parameter. Experimental results show that the B^y-tree and αB^y-tree outperform the B^x-tree in various conditions.

A spatiotemporal algebra in Hadoop for moving objects

Spatiotemporal data represent the real-world objects that move in geographic space over time.The enormous numbers of mobile sensors and location tracking devices continuously produce massive amounts of such data.This leads to the need for scalable spatiotemporal data management systems.Such systems shall be capable of representing spatiotemporal data in persistent storage and in memory.They shall also provide a range of query processing operators that may scale out in a cloud setting.Currently,very few researches have been conducted to meet this requirement.This paper proposes a Hadoop extension with a spatiotemporal algebra.The algebra consists of moving object types added as Hadoop native types,and operators on top of them.The Hadoop file system has been extended to support parameter passing for files that contain spatiotemporal data,and for operators that can be unary or binary.Both the types and operators are accessible for the MapReduce jobs.Such an extension allows users to write Hadoop programs that can perform spatiotemporal analysis.Certain queries may call more than one operator for different jobs and keep these operators running in parallel.This paper describes the design and implementation of this algebra,and evaluates it using a benchmark that is specific to moving object databases.

Automatic Segmentation of Moving Objects in Video Sequences for Indoor and Outdoor Applications

Computer vision systems have an impressive spread both for their practicalapplication and for theoretical research . The common approach used in such systems consists of agood segmentation of moving objects from video sequences . This paper presents an automaticalgorithm for segmenting and extracting moving objects suitable for indoor and outdoor videoapplications, where the background scene can be captured beforehand . Since edge detection is oftenused to extract accurate boundaries of the image's objects, the first step in our algorithm isaccomplished by combining two edge maps which are detected from the frame difference in twoconsecutive frames and the background subtraction . After removing edge points that belong to thebackground, the resulting moving edge map is fed to the object extraction step . A fundamental taskin this step is to declare the candidates of the moving object, followed by applying morphologicaloperations. The algorithm is implemented on a real video sequence as well as MPEG- 4 sequence andgood segmentation results are achieved.