42871030
An Efficient Method for Detection of Key Objects in Video Shots with Camera Motions
��� ���� ����������� ���� �� ����� ���������� �� �� ��������� ���� ����� ��������� ���� � ������ �� ����� ��� ��� � ��� ����� �� ���� ���� ��� �������� ��� ��������� �� ���� ������ �� ������� ��� ������� ������� �� ��� ������� �� ����� �� ���������� ���� �������� �� ������ ��� �������� ��������� ��� ���� �������� ��������� ����� �� ������ ��� ��������� ������ ��� �� ���� ����� ���� ������� � ��� ��������� �� ������� ��� ������� ���� ����� �������� ������ ����� ����� ������������ ��� ���������� ����������� �� ���� ��� ������ ������������� ��� ��������� �� �������� ��������� ������������� ��� �������� ������ ����������� ������ ����� ������� ���� ���� ��� �������� ������ �� ���� ����������
11550445
Multimedia Data Mining Framework for Raw Video Sequences
In this paper, we propose a general framework for real time video data mining to be applied to the raw videos (traffic videos, surveillance videos, etc.). We investigate whether the existing techniques would be applicable to this type of videos. Then, we introduce new techniques which are essential to process them in real time. The first step of our frame work for mining raw video data is grouping input frames to a set of basic units which are relevant to the structure of the video. We call this unit as segment. This is one of the most important tasks since it is the step to construct the building blocks for video database and video data mining. The second step is characterizing each segment to cluster into similar groups, to discover unknown knowledge, and to detect interesting patterns. To do this, we extract some features (motion, object, colors, etc.) from each segment. In our framework, we focus on motion as a feature, and study how to compute and represent it for further processes. The third step of our framework is to cluster the decomposed segments into similar groups. In our clustering, we employ a multi-level hierarchical clustering approach to group segments using category and motion. Our preliminary experimental studies indicate that the proposed framework is promising.
12522566
Real Time Video Data Mining for Surveillance Video Streams
We extend our previous work [1] of the general framework for video data mining to further address the issue such as how to mine video data using motions in video streams. To extract and characterize these motions, we use an accumulation of quantized pixel differences among all frames in a video segment. As a result, the accumulated motions of segment are represented as a two dimensional matrix. Further, we develop how to capture the location of motions occurring in a segment using the same matrix generated for the calculation of the amount. We study how to cluster those segmented pieces using the features (the amount and the location of motions) we extract by the matrix above. We investigate an algorithm to find whether a segment has normal or abnormal events by clustering and modeling normal events, which occur mostly. In addition to deciding normal or abnormal, the algorithm computes Degree of Abnormality of a segment, which represents to what extent a segment is distant to the existing segments in relation with normal events. Our experimental studies indicate that the proposed techniques are promising.
17811625
A Graph-Based Approach for Modeling and Indexing Video Data
In this work, we propose new graph-based data model and indexing to organize and manage video data. To consider spatial and temporal characteristics of video, we introduce a new graph-based data model called spatio-temporal region graph (STRG). Unlike existing graph-based data structures which provide only spatial features, the proposed STRG further provides temporal features, which represent temporal relationships among spatial objects. The STRG is decomposed into its subgraphs object graphs (OGs) and background graphs (BGs). In addition, a new distance measure, called extended graph edit distance (EGED), is introduced in metric space for matching and indexing. Based on clustering and EGED, we propose a new indexing method STRG-index, which is faster and more accurate. We compare the STRG-Index with the M-tree, which is a popular tree-based indexing method for multimedia data. The STRG-index outperforms the M-tree in terms of cost and speed
223678
Automatic classification of digestive organs in wireless capsule endoscopy videos
Wireless Capsule Endoscopy (WCE) allows a physician to examine the entire small intestine without any surgical operation. With the miniaturization of wireless and camera technologies the ability comes to view the entire gestational track with little effort. Although WCE is a technical break-through that allows us to access the entire intestine without surgery, it is reported that a medical clinician spends one or two hours to assess a WCE video, It limits the number of examinations possible, and incur considerable amount of costs. To reduce the assessment time, it is critical to develop a technique to automatically discriminate digestive organs such as esophagus, stomach, small intestinal (i.e., duodenum, jejunum, and ileum) and colon. In this paper, we propose a novel technique to segment a WCE video into these anatomic parts based on color change pattern analysis. The basic idea is that the each digestive organ has different patterns of intestinal contractions that are quantified as the features. We present the experimental results that demonstrate the effectiveness of the proposed method.
13494624
Security policies
A security policy is a high-level specification of the security properties that a given system should possess. It is a means for designers, domain experts and implementers to communicate with each other, and a blueprint that drives a project from design through implementation and validation. We offer a survey of the most significant security policy models in the literature, showing how “security” may mean very different things in different contexts, and we review some of the mechanisms typically used to implement a given security policy.
3161617
Isomorphism Classes of Concrete Graph Coverings
Hofmeister introduced the notion of a concrete (resp., concrete regular) covering of a graph G and gave formulas for enumerating the isomorphism classes of concrete (resp., concrete regular) coverings of G [Ars Combin., 32 (1991), pp. 121--127; SIAM J. Discrete Math., 8 (1995), pp. 51--61]. In this paper, we show that the number of the isomorphism classes of n-fold concrete (resp., concrete regular) coverings of G is equal to that of the isomorphism classes of n-fold (resp., regular) coverings of a new graph, the join $G+\infty$ of G and an extra vertex $\infty$. As a consequence, we can enumerate the isomorphism classes of concrete (resp., concrete regular) coverings of a graph by using known formulas for enumerating the isomorphism classes of coverings (resp., regular coverings) of a graph.
18044188
Optimal moving windows for real-time road image processing
A moving window scheme for detecting lanes and obstacles from the images captured by a CCD camera in an automobile is proposed. Processing the input dynamic images in real time requires high performance hardware as well as efficient software. The proposed moving window scheme relieves the requirements for detecting lanes and obstacles from the images in real time. The size of the moving window is optimally determined based upon road and automobile conditions to be big enough to detect the lanes and obstacles and to be small enough to process the detection procedure in real time. For each image frame, the moving window is newly defined and it is moved in a certain direction that is predicted by the Kalman filtering technique. By detecting the left and right lane marks of the driving lane, it becomes possible to search for obstacles within the lane. The obstacle can be verified through the correlation between the stochastic characteristics of the suspected obstacle and the actual obstacle in the database. The feasibility of the proposed algorithm is demonstrated through the simulated experiments of freeway driving.
40201784
Case-based modification for optimization agents: AGENT-OPT
For the effective implementation of an inter-organizational supply chain on the Web, many optimization model agents need to be embedded in the distributed software agents. For instance, many suppliers make requests to a delivery scheduler who manages a model warehouse at the e-hub. The scheduler deals with the scheduling of many truckers and each trucker's agent must have its own routing optimization models. Since the formulations in the model warehouse vary depending upon the requirements, it is impossible to formulate all combinations in advance. Therefore, we need a case-based model modification scheme that can generate the required formulation from the semantically specified requirement in the agent communication language.This research deals with the issues of the architecture of an optimization model agent system AGENT-OPT, modeling request language in XML, optimization model representation in semantic-level objects using UNIK-OPT, a method of selecting a base model, an optimization model modification language (OMML), and rule-based modification reasoning. The approach is applied to the delivery scheduling to study the effect of base model selection policies on the modification effort. To determine whether to start with a primitive model, full model, or the most similar model, we experimented with the sensitivity of proximity to the primitive model on 24 cases and discovered the threshold for choosing the most efficient base model.
10209884
Downlink power allocation for multi-class wireless systems
In this paper we consider a power allocation problem in multi-class wireless systems. We focus on the downlink of the system. Each mobile has a utility function that characterizes its degree of satisfaction for the received service. The objective is to obtain a power allocation that maximizes the total system utility. Typically, natural utility functions for each mobile are nonconcave. Hence, we cannot use existing convex optimization techniques to derive a global optimal solution. We develop a simple (distributed) algorithm to obtain a power allocation that is asymptotically optimal in the number of mobiles. The algorithm is based on dynamic pricing and consists of two stages. At the mobile selection stage, the base station selects mobiles to which power is allocated. At the power allocation stage, the base station allocates power to the selected mobiles. We provide numerical results that illustrate the performance of our scheme. In particular, we show that our algorithm results in system performance that is close to the performance of a global optimal solution in most cases.
12271296
Efficient Buffer Allocation for Asynchronous Linear Pipelines by Design Space Localization
Asynchronous circuit design is very attractive as a high performance design method since it can achieve average-case delay. However, it is hard to make use of such an advantage in a pipelined architecture due to the blocking/starvation effects between stages. In most of current solutions, buffers are allocated to reduce the blocking/starvation effects but it is difficult to find a distribution of buffers over an asynchronous linear pipeline(ALP) that is optimal in terms of ‘time*area’ cost.