waashk/dblp huggingface dataset:
support aggregation via non-linear diffusion with disparity-dependent support-weights for stereo matching. in this paper we put forward a method to animate an arbitrary topology facial model (atfm) based on the mpeg-4 standard. this paper deals mainly with the problem of building the facedeftables, which play a very important role in the mpeg-4 based facial animation system. the facedeftables for our predefined standard facial model (sfm) are built using the interpolation method. since the facedeftables depend on facial models, the facedeftables for the sfm can be applied only to those facial models having the same topology as the sfm. for those facial models that have different topology, we have to build the facedeftables accordingly. to acquire the facedeftables for atfm, we first select feature points on atfm, then transform the sfm according to those feature points. finally, we project each vertex on the atfm to the transformed sfm and build the facedeftables for the atfm according to the projection position. with the facedeftables we built, realistic animation results have been acquired.
distance-based multiple paths quantization of vocabulary tree for object and scene retrieval. many media access control (mac) protocols for wireless sensor networks (wsns) such as sensor mac (s-mac) and carrier sense multiple access with minimum preamble sampling (csma-mps) exploit listen/sleep cycles to conserve energy. the cycles of nodes influence the network performances such as energy efficiency, packet latency and throughput in wsns. in this paper, an adaptive schedule medium access control (as-mac) for wsns is presented. as-mac introduces the adaptation of the cycles in mac layer to the data traffic. the effect of the protocol is that it can decrease the latency, improve the throughput and energy efficiency when traffic is dynamic. we also compare as-mac with s-mac and csma-mps through simulations and the results show it has better performances than the former protocols.
from ramp discontinuities to segmentation tree. this study was designed to elucidate the problem-solving skills used by frequent and infrequent chinese video game players to negotiate impasses encountered while playing video game. all participants were instructed to think aloud while playing a video game for 20 consecutive minutes. comments were made with thinking aloud. findings showed that frequent players made significantly greater reference to insight and game strategies than infrequent players. after reaching an impasse, all players also were most likely to comment on their game progress and potential game strategies to use. over the course of game play, there are some cross cultural differences were founded.
fabric defect detection and classification using gabor filters and gaussian mixture model. radar signal sorting is picking-up pulse serial of same radar emitter from dense complex pulse signal flow. the tolerance of radar signal sorting is analyzed in modern electronic warfare. the complex and dense pulses environment makes it become a vital factor to restrict the efficiency of sorting of the conventional multi-parameters signal sorting system. a segment clustering radar signal sorting method is presented based on support vector clustering (svc) according to the idea of statistics learning theory. it prevents tolerance from affecting radar sorting. the accuracy of sorting and the sensitivity of algorithm on parameter variation is analyzed. the experimental results show that the sorting method presented is effective to overcome the tolerance of radar signal sorting.
spectral graph partitioning based on a random walk diffusion similarity measure. fine-grained access controls for xml define access privileges at the granularity of individual xml nodes. in this paper, we present a fine-grained access control mechanism for xml data. this mechanism exploits the structural locality of access rights as well as correlations among the access rights of different users to produce a compact physical encoding of the access control data. this encoding can be constructed using a single pass over a labeled xml database. it is block-oriented and suitable for use in secondary storage. we show how this access control mechanism can be integrated with a next-of-kin (nok) xml query processor to provide efficient, secure query evaluation. the key idea is that the structural information of the nodes and their encoded access controls are stored together so the access privileges can be checked efficiently. our evaluation shows that the access control mechanism introduces little overhead into the query evaluation process.
human action recognition using hdp by integrating motion and location information. this paper presents a rate control scheme for h.264 by introducing the concept of basic unit and a linear prediction model. the basic unit can be a macroblock (mb), a slice, or a frame. it can be used to obtain a trade-off between the overall coding efficiency and the bits fluctuation. the linear model is used to solve the chicken and egg dilemma existing in the rate control of h.264. both constant bit rate (cbr) and variable bit rate (vbr) cases are studied. our scheme has been adopted by h.264.
automated center of radial distortion estimation, using active targets. a new reconfigurable planetary robot system (rprs) is introduced in this paper. the locomotion mechanism, especially the static force analysis and the climbing ability for different configurations of the multiple child-robots are presented in detail. the basic configurations of two child-robots systems were given in three modes: connecting in series with arm in front or back and combining to a loop with grasper. the simulation results of these three configurations based on static analysis demonstrate that the climbing ability is closely correlated to their configurations. compared the results, the conclusion can be obtained that the loop configuration has the best effect than others on slope climbing. the actual experiments of the child-robots system have illustrated the simulating results, and an exciting phenomenon has emerged, which shows that all the configurations can climb bigger gradient than the simulating results. the phenomenon rightly discloses the characteristic of the novel architecture of the child-robot.
an accelerated human motion tracking system based on voxel reconstruction under complex environments. load balancing is a key technique in parallel computer supported collaborative work (cscw) systems, parallel database system and p2p system for instance, to boost performance and improve scalability. in order to reduce total cost of ownership (tco), adaptive/self-tuning administration techniques are gradually and extensively expected in the cyberspace. in parallel database systems, adaptive load balancing techniques are proposed to face the change in data storage patterns and access patterns in a dynamic real environment. the techniques utilized in both shared-nothing and shared-disk parallel database systems are discussed, and a general flexible framework based on collaborative agents is studied to support these techniques in both architectures. the framework supports two kinds of load balancing - one is passively executing query statements balancedly, and the other one is proactively adjusting data placement and task execution scheme, by means of data and task migration, whenever load unbalance is detected. three categories of agents, scheduling agents, monitoring agents and task agents, are identified in the framework. the collaboration protocols and scheduling algorithms to support adaptive load balancing are described. the framework also applies to other parallel systems such as p2p systems and shared file processing systems due to their underlying commonness.
confidence-based color modeling for online video segmentation. an efficient and flexible coding technique is proposed in this paper inspired by the sp frame in the h.26l standard, which can achieve a drift-free bitstream switching at the predicted frame. the proposed scheme improves the coding efficiency of the sp frames in the h.26l standard by limiting the mismatch between the references for the prediction and reconstruction with two dct coefficient coding modes and the rate-distortion optimization. furthermore, the proposed scheme allows independent quantization parameters for up-switching and down-switching bitstreams. it further reduces the switching bitstream size while keeping the coding efficiency of the normal bitstreams. more rapid and frequent down-switching than up-switching and much smaller size of down-switching bitstream can be achieved with the proposed sp technique. these are very desirable features for any tcp-friendly protocols. compared with the original sp method for h.26l, the proposed sp method improves the coding efficiency up to 1.0 db. this sp technique has been officially accepted by the jvt standard.
single-camera multi-baseline stereo using fish-eye lens and mirrors. in this paper, we present a new speaker diarization system that improves the accuracy of traditional hierarchical clustering-based methods with little increase in computational cost. our contributions are mainly two fold. first, we include a preprocessing called "local clustering" before the hierarchical clustering algorithm to merge very similar adjacent speech segments. this local clustering aims to reduce the number of segments to be clustered by the hierarchical clustering, so as to dramatically increase the processing speed. second, we perform a postprocessing called "cross em refinement" to purify the clusters generated by the hierarchical clustering. this algorithm is based on the idea of cross validation and em algorithm. our experimental evaluations show that the proposed cross em refinement approach reduces the speaker diarization error by up to 56%, with an average reduction of 22% compared to the traditional hierarchical clustering method
moving object segmentation in the h.264 compressed domain. we have described the architecture of system r, including the relational data system and the research storage system. the rds supports a flexible spectrum of binding times, ranging from precompilmion of &#x201c;canned transactions&#x201d; to on-line execution of ad hoc queries. the advantages of this approach may be summarized as follows: 1. for repetitive transactions, all the work of parsing, name binding, and access path selection is done once at precompilation time and need not be repeated. 2. ad hoc queries are compiled on line into small machine-language routines that execute more efficiently than an interpreter. 3. users are given a single language, sql, for use in ad hoc queries as well as in writing pl/i and cobol transaction programs. 4. the sql parser, access path selection routines, and machine language code generator are used in common between query processing and precompilation of transaction programs. 5. when an index used by a transaction program is dropped, a new access path is automatically selected for the transaction without user intervention.
semi-supervised feature selection for gender classification. this paper proposes a new survivable algorithm named sub-path protection based on auxiliary virtual topology (spavt) to tolerate the single-link failure in wdm optical networks. according to the protection-switching time constraint, spavt constructs the virtual topology. then, it only needs to run one time of routing algorithm to find the feasible virtual route in virtual topology. simulation results show that spavt has smaller blocking probability and lower time complexity than conventional algorithms.
detecting spatiotemporal structure boundaries: beyond motion discontinuities. this paper proposes a method for matching road vehicles between two non-overlapping cameras. the matching problem is formulated as a same-different classification problem: probability of two observations from two distinct cameras being from the same vehicle or from different vehicles. we employ a measurement vector consists of three independent edge-based measures and their associated robust measures computed from a pair of aligned vehicle edge maps. the weight of each match measure in the final decision is determined by a unsupervised learning process so that the same-different classification can be optimally separated in the combined measurement space. the robustness of the match measures and the use of discriminant analysis in the classification ensure that the proposed method performs better than existing edge-based approaches, especially in the presence of missing/false edges caused by shadows and different illumination conditions, and systematic misalignment caused by different camera configurations. extensive experiments based on real data of over 200 vehicles at different times of day demonstrate promising results.
improved uncalibrated view synthesis by extended positioning of virtual cameras and image quality optimization. in this paper, a model and algorithm of optimum layout is proposed for blank layout of single pattern on single rectangular sheet. the approach arranges the cutting patterns on rectangular sheet in the typical style of double opposite layout (dol). the remains of the sheet, which has been left in one direction after arranging patterns, called as "step leavings" (sl) is considered while the optimum layout is discussed we make full use of material of the sheet, including the a in x-direction and y-direction, and set up a reasonable mathematical model for the two-dimensional optimum layout. a corresponding algorithm is also provided to work out the optimum layout quickly and automatically. in this way, we can get the best layout scheme to arrange the maximum shapes on the sheet.
tracking eye gaze under coordinated head rotations with an ordinary camera. in this paper, we treat multi-core processor design space exploration as an application-driven machine learning problem. we develop two machine learning-based techniques for efficiently exploring the processor design space. we observe that these techniques result in multi-core processors whose performance is comparable (within 1%) to a processor design that requires an exhaustive exploration of the design space. these techniques often take orders of magnitude (a factor of 3800 at the minimum) less time for coming up with these processors. the benefits are up to 13% over intelligent search techniques that have been adapted to do multi-core design space exploration. we leverage the knowledge gained in this research to develop magellan - a framework for accelerating multi-core design space exploration and optimization. magellan can be used to find the highest throughput processors of a given type for a given area, power, or time budget. it can be used to aid even experienced processor designers that prefer to rely on intuition by allowing fast refinements to an input design.
monocular template-based tracking of inextensible deformable surfaces under -norm. we propose a physically-based approach based on anatomical knowledge for real-time facial expression animation. the facial model incorporates a physically-based approximation to facial skin and a set of anatomically-motivated facial muscles. the skin is modeled by a mass-spring system with nonlinear springs which have a biphasic stress-strain relationship to simulate the elastic dynamics of real facial skin. facial muscles are modeled as forces deforming the spring mesh. based on the action units (aus) of the facial action coding system (facs), various expressions can be generated by a combination of contractions of a set of facial muscles. lagrangian mechanics governs the dynamics, dictating the deformation of the facial surface in response to muscle forces. simulation results show real-time facial deformation as well as realistic expression animation
a novel self-created tree structure based multi-view face detection. in this paper, we present an active volumetric model (avm) for 3d reconstruction from multiple calibrated images of a scene. the avm is a physically motivated 3d deformable model which shrinks actively under the influence of multiple simulated forces towards the real scene by throwing away some of its voxels. it provides a computational framework to integrate several constraints in an intelligible way. in the current work, we use three forces derived respectively from the smooth constraint, the compulsory silhouette constraint, and the color consistency constraint. based on the composition of the 3 forces, our algorithm can significantly restrain holes and floating voxels, which plague voxel coloring algorithms, and produce precise and smooth models. we test our algorithm by experiments based on both synthetic and real data.
heavy-tailed model for visual tracking via robust subspace learning. presented in this paper is the thread-associative memory microarchitecture for multicore and multithreaded processor design. memory contention among concurrent threads in chip multithreaded processing has become a limiting factor for performance improvement. the proposed thread-associative memory addresses this challenge by incorporating thread-specific information explicitly into on-chip memory hardware. the proposed technique can be utilized at different levels of memory hierarchy. furthermore, it is not just a technique for performance enhancement but also a solution for energy efficiency. trace-driven simulations on a 32kb l1 data cache demonstrate 36.6% maximum performance improvement and up to 15.1% total energy reduction, with 20.3% dynamic energy reduction and 9.9% leakage energy reduction
crease detection on noisy meshes via probabilistic scale selection. in light of advances in processor and networking technology, especially the emergence of network attached disks, the traditional client-server architecture of file systems has become suboptimal for many computation/data intensive applications. we introduce a revised architecture for file management employing network attached storage: the dynamic file server environment (dynamo). dynamo introduces two main architectural innovations: to provide high scalability, the file management functions are mainly performed cooperatively by the clients in the system. furthermore, data is transferred directly to the client's cache from network-attached disks, thus avoiding copies from a disk to the server buffer and then over the network to the client. secondly, dynamo uses a cooperative cache management which employs a decentralized lottery-based page replacement strategy. we show via performance benchmarks run on the dynamo system and simulation results how this architecture increases the system's adaptability, scalability and cost performance
two-view geometry and reconstruction under quasi-perspective projection. hitherto, the major challenge to sign language recognition is how to develop approaches that scale well with increasing vocabulary size. we present an approach to large vocabulary, continuous chinese sign language (csl) recognition that uses phonemes instead of whole signs as the basic units. since the number of phonemes is limited, hmm-based training and recognition of the csl signal becomes more tractable and has the potential to recognize enlarged vocabularies. furthermore, the proposed method facilitates the csl recognition when the finger-alphabet is blended with gestures. about 2400 phonemes are defined for csl. one hmm is built for each phoneme, and then the signs are encoded based on these phonemes. a decoder that uses a tree-structured network is presented. clustering of the gaussians on the states, the language model and n-best-pass is used to improve the performance of the system. experiments on a 5119 sign vocabulary are carried out, and the result is exciting.
fast depth map compression and meshing with compressed tritree. in this paper, facet analyses are made about the population sizing and sampling of the factorization based on gaussian probability density function in the real- coded ecga (recga) on the univariate and multivariate real-valued deceptive functions (urdf and mrdfi). the dynamics of the recga with single gaussian pdf and mixture gaussian pdf are described statistically. experimental results illustrate that the recga with mixture gaussian pdf has a scalability of sub-quadratic polynomial on the mrdfi, which indicates that it is applicable to large-scale decomposable optimization problems.
scene gist: a holistic generative model of natural image. embedded systems with heterogeneous processors extend the energy/timing trade-off flexibility and provide the opportunity to fine tune resource utilization for particular applications. in this paper, we present a resource model that considers the time and energy costs of run-time mode switching, which considerably improves the accuracy of existing models. given an application, the software partitioning problem then becomes an optimization over energy cost given deadline constraints, which can be formulate as an integer linear programming (ilp) problem. we apply the resource modeling and software partitioning techniques to a multi- module embedded sensing device, the mplatform, and present a case study of configuring the platform for a real-time sound source localization application on a stack of msp430 and arm7 processor based sensing and processing boards.
pedestrian recognition using second-order hog feature. in this report, we first point out and analyse an error in the implementation of the pre-encoding logic in the lop module proposed in [1], and then present a modification method.
transductive segmentation of textured meshes. in this paper, we propose a new model for coherent clustering of gene expression data called reg-cluster. the proposed model allows (1) the expression profiles of genes in a cluster to follow any shifting-and-scaling patterns in subspace, where the scaling can be either positive or negative, and (2) the expression value changes across any two conditions of the cluster to be significant. no previous work measures up to the task that we have set: the density-based subspace clustering algorithms require genes to have similar expression levels to each other in subspace; the pattern-based biclustering algorithms only allow pure shifting or pure scaling patterns; and the tendency-based biclustering algorithms have no coherence guarantees. we also develop a novel patternbased biclustering algorithm for identifying shifting-andscaling co-regulation patterns, satisfying both coherence constraint and regulation constraint. our experimental results show that the reg-cluster algorithm is able to detect a significant amount of clusters missed by previous models, and these clusters are potentially of high biological significance.
multilinear nonparametric feature analysis. this paper proposes a fast close-loop video transcoder with limited drifting error. firstly, similar to the traditional close-loop transcoder, the proposed transcoder still accumulates the re-quantization error of each i or p picture. however, the accumulated errors are not always introduced into the transcoding loop in every block. a triple-threshold algorithm is proposed to adaptively utilize the accumulated errors at block level so as to control drifting error under an acceptable level. secondly, when the accumulated errors are not introduced into the transcoding loop, additional dct transform in the proposed transcoder can be removed. furthermore, the re-quantization process can be simply implemented by looking up table, which significantly reduces the complexity of the re-quantization process. the experimental results show that picture quality of the proposed transcoder is closed to that of the traditional closed-loop one while about 40% blocks are not updated with the accumulated errors. in this case, the transcoding process can be speeded up to 30%.