waashk/dblp huggingface dataset:
part-based object detection using cascades of boosted classifiers. skyline computation has many applications including multi-criteria decision making. in this paper, we study the problem of efficient processing of continuous skyline queries over sliding windows on uncertain data elements regarding given probability thresholds. we first characterize what kind of elements we need to keep in our query computation. then we show the size of dynamically maintained candidate set and the size of skyline. we develop novel, efficient techniques to process a continuous, probabilistic skyline query. finally, we extend our techniques to the applications where multiple probability thresholds are given or we want to retrieve "top-k" skyline data objects. our extensive experiments demonstrate that the proposed techniques are very efficient and handle a high-speed data stream in real time.
bayesian 3d human body pose tracking from depth image sequences. when trying to discover knowledge on a collection of data, one of the first arising tasks is to identify groups of similar objects, that is, to carry out cluster analysis for obtaining data partitions. thus, a decision must be taken for choosing the clustering result that produces the best data partition for a given data collection. in order to support such a decision, indexes for measuring the quality of a data partitioning must be constructed. so far, several cluster validity indexes have been formulated in the literatures. each of those indexes has strengths and drawbacks when compared with the others. in the present study, an alternative cluster validity index is formulated. the proposed validity index not only takes the contribution of each pattern into consideration, but also relies on information of intra-cluster and inter-cluster distance. the main advantage of the presented index is that is insensitive to noise by introducing the gaussian kernel into the proposed validity index. an experimental design was devised in order to determine the comparative performance of the proposed cluster validity index against db index previously formulated in the literature. experimental results show that the proposed index is insensitive to noise and adaptive to produce good clustering solution.
detecting critical configurations for dividing long image sequences for factorization-based 3-d scene reconstruction. clustering is an old research topic in data mining and machine learning. most of the traditional clustering methods can be categorized as local or global ones. in this paper, a novel clustering method that can explore both the local and global information in the data set is proposed. the method, clustering with local and global regularization (clgr), aims to minimize a cost function that properly trades off the local and global costs. we show that such an optimization problem can be solved by the eigenvalue decomposition of a sparse symmetric matrix, which can be done efficiently using iterative methods. finally, the experimental results on several data sets are presented to show the effectiveness of our method.
a dynamic programming approach to maximizing tracks for structure from motion. reconfigurable robots consist of many modules which are able to change the way they are connected. as a result, the robots have the capability of adopting different configurations to match various tasks and suit complex environments. this paper presents a novel field robot named jl-i which consists of three uniform modules. with the docking mechanisms, the modules can connect or disconnect flexibly and automatically. furthermore the active joints formed by serial and parallel mechanisms endow the robot with the ability of changing shape in three dimensions. consequently useful locomotion capabilities, such as crossing high vertical obstacles, getting self-recovery when the robot is upside-down are achieved. after describing the structural principle of the robot, the related kinematics analysis follows. in the end, the successful on-site tests confirm the principles described above and the robot's ability
efficient scale-space spatiotemporal saliency tracking for distortion-free video retargeting. this letter considers the problem of resource sharing between two selfish nodes in cooperative relay networks. in our system, each node can act as a source as well as a potential relay, and both nodes are willing to achieve an optimal signal-to-noise ratio (snr) increase by adjusting their power levels for cooperative relaying. we formulate this problem as a two-person bargaining game, and use the nash bargaining solution (nbs) to achieve a win-win strategy for both nodes. simulation results indicate the nbs resource sharing is fair in that the degree of cooperation of a node only depends on how much contribution its partner can make to its snr increase.
human action recognition using spatio-temporal classification. we present a case study of the use of a software process improvement method which is based on the analysis of defect data. the first step of the method is the classification of software defects using attributes which relate defects to specific process activities. such classification captures the semantics of the defects in a fashion which is useful for process correction. the second step utilizes a machine-assisted approach to data exploration which allows a project team to discover such knowledge from defect data as is useful for process correction. we show that such analysis of defect data can readily lead a project team to improve their process during development
a graph-based feature combination approach to object tracking. this paper proposes an improved immunological surveillance for network danger evaluation model, focusing on intrusion detection and countermeasures with respect to widely-used networks. an improved intrusion detection mechanism based on self-tolerance, clone selection, and immune surveillance is established. a new network security evaluation method using antibody concentration to quantitatively analyze the degree of intrusion danger level is presented. additionally, this new hierarchical management framework of the proposed model adopt to improve the detection efficiency and to overcome the shortcoming of the local optimum. the experimental results show that the proposed model is a good solution for network security evaluation.
iterated graph cuts for image segmentation. future ip networks need to support different quality of service (qos) sensitive services with distinct end-to-end qos requirement. an attractive solution is to use adaptive bandwidth provisioning to provide guaranteed distinctive qos and maintain high network efficiency at the same time. but, previous research on adaptive provisioning assumes dedicated bandwidth and is limited to the single-link case. this paper studies adaptive bandwidth provisioning to provide guaranteed statistical end-to-end qos. the novelty of this study is that our adaptive bandwidth provisioning is performed on multiple links along the end-to-end path to satisfy the end-to-end statistical qos requirement, and it is done in bandwidth sharing generalized processor sharing (gps) networks, in which the received qos of one flow can be interfered by other competing flows. the analysis and simulation results show that by utilizing adaptive bandwidth provisioning, guaranteed end-to-end statistical qos can be achieved, and between the two possible schemes to carry out this multiple-link adaptive bandwidth provisioning, the end-to-end bandwidth provisioning scheme is more efficient than performing local adaptive bandwidth provisioning on each individual link
contour extraction based on surround inhibition and contour grouping. the change in meaning of data over time poses significant challenges for the use of that data. these challenges exist in the use of an individual data source and are further compounded with the integration of multiple sources. in this paper, we identify three types of temporal semantic heterogeneities. we propose a solution based on extensions to the context interchange framework, which has mechanisms for capturing semantics using ontology and temporal context. it also provides a mediation service that automatically resolves semantic conflicts. we show the feasibility of this approach with a prototype that implements a subset of the proposed extensions.
rotation averaging with application to camera-rig calibration. this paper reports on the design, implementation and performance evaluation of a suite of gridrpc programming middleware called ninf-g version 2 (ninf-g2). ninf-g2 is a reference implementation of the gridrpc api, a proposed ggf standard. ninf-g2 has been designed so that it provides 1) high performance in a large-scale computational grid, 2) the rich functionalities which are required to adapt to compensate for the heterogeneity and unreliability of a grid environment, and 3) an api which supports easy development and execution of grid applications. ninf-g2 is implemented to work with basic grid services, such as gsi, gram, and mds in the globus toolkit version 2. the performance ofninf-g2 was evaluated using a weather forecasting system which was developed using ninf-g2. the experimental results indicate that high performance can be attained even in relatively fine-grained task-parallel applications on hundreds of processors in a grid environment.
real-time video matting based on bilayer segmentation. many real-life networks, such as the www, biological realms, and social networks are small-world networks. most previous researches on small-world networks have been based on probabilistic methods. in this paper, we present a general method by using cayley graph to build deterministic small-world networks. we also analyze the cluster topology of the cayley graph with small world properties by constructing its left coset graph. this method has great value in constructing interconnection networks model and analyzing many other real network models.
dynamic kernel-based progressive particle filter for 3d human motion tracking. soldiers possessing of network attack-defense ability are the key factor for future information war. aiming at the problem of lacking daily training and drilling environment, a method of building network attack-defense simulation training system (nadsts) based on hla is put forward. with the method, attack and defense training are designed as different federation member. the system is divided to presentation, application and adapter layer clearly. key technologies involves network attack-defense, network simulation and simulation driving are also presented. software is developed based on plug-in framework. its simulation examples show greatest traits on building similar large-scale simulation system.
multi-view texturing of imprecise mesh. this paper presents an eco-friendly daemon that reduces power and energy consumption while better maintaining high performance via an accurate workload characterization that infers ldquoprocessor stall cycles due to off-chip activities.rdquo the eco-friendly daemon is an interval-based, run-time algorithm that uses the workload characterization to dynamically adjust a processorpsilas frequency and voltage to reduce power and energy consumption with little impact on application performance. using the nas parallel benchmarks as our workload, we then evaluate our eco-friendly daemon on a cluster computer. the results indicate that our workload characterization allows the power-aware daemon to more tightly control performance (5% loss instead of 11%) while delivering substantial energy savings (11% instead of 8%).
visual saliency based object tracking. the security of web services has become one of the important research topics about the application of web services. in this paper, we propose an agent-based policy aware framework for web services security. in this framework, a policy language called reit which is a declarative language based on the rules and ontologies is introduced. the non-structural knowledge is represented by rules and the structural temporal knowledge is represented by ontology. moreover, we propose a mixed reasoning mechanism to evaluate the reit policy. the access control policy including the context of the user and web services is evaluated by the reasoner. in addition, we present a policy aware boid agent to authorize the access control of the web services. and we implement the policy aware boid agent by extending the jade platform.
combining edge and color features for tracking partially occluded humans. based on the amino acid sequence of bhlh-zip motif in srebp-1 and srebp-2 in landes goose obtained by gene cloning, the sequences of hlh family members in poultry genome were screened in the protein databases of ncbi. the classification and evolution of hlh protein family in poultry genome were analyzed. hlh protein family in poultry genome are divided into five groups (a, b, c, d and e) according to the sequence features of bhlh domain. the result of phylogenetic development indicates the sequences of hlh family members in poultry genome also gather into five groups, and this grouping is generally consistent with the classification by sequence features. group b diverges from other groups firstly, and the divergent time of group a is the latest. groups a and d have closer genetic relationship, and groups c and e have closer phylogenetic relationship.
a blind robust watermarking scheme based on ica and image dividing blocks. the interconnection network plays an important role in the performance and energy consumption of a network-on-chip (noc) system. in this paper, we propose a rdt(2,2,1)/&alpha;-based interconnection network for noc designs. rdt(2,2,1)/&alpha; is constructed by recursively overlaying 2d diagonal meshes (torus). the number of layers needed for routing the links in rdt(2,2,1)/&alpha; is shown to be bounded at 6, which is feasible to be implemented with current and future vlsi technologies. with the innovative diagonal structure and its simple rank assignment, rdt(2,2,1)/&alpha; possesses the following features: recursive structure, smaller diameter and average distance, embedded mesh/torus topology, a constant node degree of 8, and robust routing schemes. these features make rdt(2,2,1)/&alpha; a promising solution for the interconnection network of noc designs satisfying the requirements for scalability, energy-efficiency, customizability, and fault-tolerance.
planar scene modeling from quasiconvex subproblems. in multi-site distributed education (msde), video streams from multiple sites are available. to best utilize the limited screen space at each site, we develop a customizable, automated display management system in this paper, i.e., only user-preferred streams will be shown as triggered by events and timers. the configuration of such user preference, however, is challenging because it has to be both human-friendly and machine-friendly. to address this challenge, we propose a three-layer virtual director model. in the user layer, we identify three categories of parameters that can represent a wide range of user preferences yet are easy to use. these preferences are then automatically translated into a machine-friendly timed automaton in the execution layer. the automaton is simulated dynamically, which selects a subset of streams to show on the screen through a display layer. evaluation results demonstrate the correctness and efficiency of the proposed framework
a three-phase approach to photometric calibration for multi-projector display using lcd projectors. negotiation strategy is an important research branch of agent-based automatic negotiation. under the background of bilateral multi-issues negotiation, a novel negotiation skill algorithm by interactive micro-adjustment and multi-rounds approximation is proposed, which classifies both partiespsila proposal issues into two divisions --- interest point set and disinterest point set, and combined with the historical experience data conducts in-depth negotiation process according to the composite relationship of both interest level of consistency proposal issues and difference of issue values. at the same time concern degree of opponent about proposal issues is given and updated by a fuzzy theory-based prediction function, which can realize the purpose of learning negotiation opponent. finally, the application and analysis of the proposed negotiation skill algorithm are demonstrated by a numerical experiment.
crowd flow characterization with optimal control theory. this paper is concerned with cellular systems with rate constraints in fading environments. we consider a simple but asymptotically optimal matched filtering/successive interference cancellation (mf-sic) scheme. we derive several concise and closed-form bounds for the power and spectral efficiencies of various base station cooperation strategies, which provide some useful insights into cellular systems.
levels of details for gaussian mixture models. as the first dht implemented in real applications and involving millions of simultaneous users, all aspects of kad must be analyzed and measured carefully. this paper focuses on measuring the routing table of kad in emule/amule. we present and analyze the availability and stability of routing table by crawling actively. we find the phenomenon of id repetition in kad that many peers use a same id simultaneously, which will decrease the performance of routing and then reduce the availability of routing table. the connection availability of global routing table is relatively low, the average of which is about 64.9%. connection availability influences the efficiency of searching and routing in kad network directly.
detection of vehicle manufacture logos using contextual information. in this paper, an improved spatial scalable wavelet domain distributed video coding (dvc) scheme is proposed. in this scheme, we adaptively apply differential pulse code modulation (dpcm) wyner-ziv (wz) coding and discrete cosine transform (dct) based intra block coding to reduced-resolution layer. due to the low energy nature of high-pass subbands, wz coding can be directly used. at decoder, in full-resolution layer wz frame decoding, an efficient side information (si) generation technique for low-pass subband is proposed, in which motion compensated interpolation (mci) is performed on full-resolution signal. on the other hand, a refined technique is also employed to generate the si for high-pass subbands by taking advantage of inter-band correlation. experimental results show that the proposed scheme provides an efficient wavelet domain dvc coding paradigm.
auto-scaled incremental tensor subspace learning for region based rate control application. fuzzy c-means (fcm) clustering algorithm is a popular model widely used in segmentation of magnetic imaging (mri) data. the conventional fcm does not take into account the spatial information of image and get the unexpected results of segmentation when dealing with some mri contaminated by noise. considering the intensities of ideal mri are piecewise constant, we present an improved model to fuzzy c-means algorithm using membership smoothing constraint. the proposed algorithm can reasonably use the spatial information of image and improve the accuracy of segmentation. simulation mr brain image with different noise levels and real mr brain image are presented in the experiments. the results of experiments show better robustness of our algorithms to noise than other segmentation algorithms.
local spatial co-occurrence for background subtraction via adaptive binned kernel estimation. this paper addresses several questions related to the control of timed continuous petri nets under infinite server semantics. first, some results regarding equilibrium states and control actions are given. in particular, it is shown that the considered systems are piecewise linear, and for every linear subsystem the possible steady states are characterized. second, optimal steady-state control is studied, a problem that surprisingly can be computed in polynomial time, when all transitions are controllable and the objective function is linear. third, an interpretation of some controllability aspects in the framework of linear dynamic systems is presented. an interesting finding is that noncontrollable poles are zero valued.
visual focus of attention recognition in the ambient kitchen. we present a new adaptive and energy-efficient broadcast dissemination model that supports flexible responses to client requests. in current broadcast dissemination models, clients must specify precisely what documents they require, and servers disseminate exactly those documents. this approach can be impractical, since in practice, clients may know the characteristics of the documents, but not the document names or ids. in our model, clients specify the required document using attributes, and servers broadcast documents that match client requests at a prespecified level of similarity. a single document may satisfy several clients, so the server broadcasts a minimal set of documents that achieves a desired level of satisfaction in the client population. we introduce a mechanism for the server to obtain randomized feedback from clients to adapt its broadcast program to client needs. finally, the server integrates a selective tune-in scheme based on approximate index matching to allow clients to conserve energy. our simulation results show that our model captures client interest patterns efficiently and accurately and scales very well with the number of clients, while reducing overall client average waiting times. the selective tune-in scheme can considerably reduce the consumption of client energy with moderate waiting time overhead.
computer vision - accv 2009, 9th asian conference on computer vision, xi'an, china, september 23-27, 2009, revised selected papers, part iii in this paper, two scanning paradigms are presented and compared that may be used for robotic scanning of a harsh environment such as a celestial body or earth poles. the first paradigm, tight scanning, includes three algorithms, which may be used to find small objects or gasses confined to small regions such as the methane gas given off by bacteria in buried hot springs in the canadian arctic. the second paradigm, relaxed scanning, includes four algorithms which may be used to find large objects such as large ice deposits that may be buried just below the surface of mars. the algorithms are compared against their peer algorithms by their quality of performance. such performance quality is determined by the ratio of scanned area to the traveled distance by the two robots