@conference {12516,
	title = {Locally time-invariant models of human activities using trajectories on the grassmannian},
	booktitle = {Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on},
	year = {2009},
	month = {2009/06//},
	pages = {2435 - 2441},
	abstract = {Human activity analysis is an important problem in computer vision with applications in surveillance and summarization and indexing of consumer content. Complex human activities are characterized by non-linear dynamics that make learning, inference and recognition hard. In this paper, we consider the problem of modeling and recognizing complex activities which exhibit time-varying dynamics. To this end, we describe activities as outputs of linear dynamic systems (LDS) whose parameters vary with time, or a time-varying linear dynamic system (TV-LDS). We discuss parameter estimation methods for this class of models by assuming that the parameters are locally time-invariant. Then, we represent the space of LDS models as a Grassmann manifold. Then, the TV-LDS model is defined as a trajectory on the Grassmann manifold. We show how trajectories on the Grassmannian can be characterized using appropriate distance metrics and statistical methods that reflect the underlying geometry of the manifold. This results in more expressive and powerful models for complex human activities. We demonstrate the strength of the framework for activity-based summarization of long videos and recognition of complex human actions on two datasets.},
	keywords = {action, activity, analysis;local, analysis;video, content, dynamic, Estimation, estimation;statistical, Grassmann, indexing;distance, linear, manifold;activity-based, method;statistical, method;surveillance;time-varying, metrics;human, model;parameter, recognition;human, recognition;indexing;parameter, summarization;computer, surveillance;, system;computer, time-invariant, vision;consumer, vision;image},
	doi = {10.1109/CVPR.2009.5206710},
	author = {Turaga,P. and Chellapa, Rama}
}
@article {18205,
	title = {Dynamic Resource Allocation for Robust Distributed Multi-Point Video Conferencing},
	journal = {Multimedia, IEEE Transactions on},
	volume = {10},
	year = {2008},
	month = {2008/08//},
	pages = {910 - 925},
	abstract = {This paper proposes a distributed multi-point video conferencing system over packet erasure channels, where the aggregation of multiple video streams and resource allocation are performed in a distributed manner. Video stream combiners, which are located in different geographical areas and serve as portals for conferees, aggregate incoming streams supplied by local users with other streams aggregated from nearby video stream combiners. A packet-division multiple-access (PDMA)-based error protection scheme is proposed to be performed at each video stream combiner to minimize the maximal expected video distortion among aggregated streams. The proposed error protection scheme for multi-stream aggregation also supports user preference. In order to deliver video streams to end users with different preferred quality, a consensus algorithm is proposed to adaptively perform resource allocation based on user preference. Simulation results show that the proposed multi-stream aggregation and error protection scheme has significant gains over traditional multi-stream error protection schemes for a multi-point video conferencing system.},
	keywords = {allocation;error, channels;packet-division, communication;, conferencing, conferencing;multi-access, distributed, dynamic, erasure, error, multiple-access-based, multipoint, Protection, resource, scheme;multi-point, scheme;robust, schemes;packet, streams;multistream, system;multiple, systems;teleconferencing;video, video},
	isbn = {1520-9210},
	doi = {10.1109/TMM.2008.922846},
	author = {Chen,Meng and Su,Guan-Ming and M. Wu}
}
@conference {18177,
	title = {Collusion-Resistant Dynamic Fingerprinting for Multimedia},
	booktitle = {Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on},
	volume = {2},
	year = {2007},
	month = {2007/04//},
	pages = {II-289 -II-292 - II-289 -II-292},
	abstract = {This paper considers protecting multimedia content from unauthorized redistribution in subscription based services, where adversaries work together to pirate multiple multimedia programs during a subscription period. Collusion-resistant fingerprinting is an emerging tool for traitor tracing. However, most of the existing fingerprinting works did not consider multiple rounds of interaction between collusion and detection. In this paper, we exploit the temporal dimension and propose a dynamic fingerprinting scheme that adjusts the fingerprint design based on the detection result of previously pirated signal. We also examine colluders{\textquoteright} strategies to combat the tracing by dynamic fingerprinting. Both analytical and simulation results show that the proposed dynamic fingerprinting provides better collusion resistance than conventional static fingerprinting},
	keywords = {based, collusion-resistant, communication;security, data;, dimension;traitor, dynamic, fingerprinting;multiple, multimedia, of, piracy;subscription, program, redistribution;multimedia, services;temporal, tracing;unauthorized},
	doi = {10.1109/ICASSP.2007.366229},
	author = {He,Shan and M. Wu}
}
@article {18208,
	title = {Efficient bandwidth resource allocation for low-delay multiuser video streaming},
	journal = {Circuits and Systems for Video Technology, IEEE Transactions on},
	volume = {15},
	year = {2005},
	month = {2005/09//},
	pages = {1124 - 1137},
	abstract = {This paper studies efficient bandwidth resource allocation for streaming multiple MPEG-4 fine granularity scalability (FGS) video programs to multiple users. We begin with a simple single-user scenario and propose a rate-control algorithm that has low delay and achieves an excellent tradeoff between the average visual distortion and the quality fluctuation. The proposed algorithm employs two weight factors for adjusting the tradeoff, and the optimal choice of these factors is derived. We then extend to the multiuser case and propose a dynamic resource allocation algorithm with low delay and low computational complexity. By exploring the variations in the scene complexity of video programs as well as dynamically and jointly distributing the available system resources among users, our proposed algorithm provides low fluctuation of quality for each user, and can support consistent or differentiated quality among all users to meet applications{\textquoteright} needs. Experimental results show that compared to traditional look-ahead sliding-window approaches, our algorithm can achieve comparable visual quality and channel utilization at a much lower cost of delay, computation, and storage.},
	keywords = {algorithm;, allocation, allocation;, approaches;, average, Bandwidth, channel, channels;, coding;, complexity;, computational, control;, distortion;, dynamic, efficient, fine, fluctuation;, granularity, look-ahead, low-delay, MPEG-4, multiple, multiuser, QUALITY, quality;, rate-control, resource, scalability, scenario;, single-user, sliding-window, streaming;, Telecommunication, utilization;, video, visual},
	isbn = {1051-8215},
	doi = {10.1109/TCSVT.2005.852626},
	author = {Su,Guan-Ming and M. Wu}
}
@conference {12665,
	title = {Moving Object Segmentation and Dynamic Scene Reconstruction Using Two Frames},
	booktitle = {Acoustics, Speech, and Signal Processing, 2005. Proceedings. (ICASSP {\textquoteright}05). IEEE International Conference on},
	volume = {2},
	year = {2005},
	month = {2005//18/23},
	pages = {705 - 708},
	keywords = {3D, analysis;, constraints;, dynamic, ego-motion, estimation;, flow, image, images;, independent, INTENSITY, least, mean, median, method;, methods;, model;, MOTION, motion;, moving, object, of, parallax, parallax;, parametric, processing;, reconstruction;, scene, segmentation;, signal, squares, squares;, static, structure;, subspace, surface, translational, two-frame, unconstrained, video},
	doi = {10.1109/ICASSP.2005.1415502},
	author = {Agrawala, Ashok K. and Chellapa, Rama}
}
@conference {14845,
	title = {Using the inner-distance for classification of articulated shapes},
	booktitle = {Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on},
	volume = {2},
	year = {2005},
	month = {2005/06//},
	pages = {719 - 726 vol. 2 - 719 - 726 vol. 2},
	abstract = {We propose using the inner-distance between landmark points to build shape descriptors. The inner-distance is defined as the length of the shortest path between landmark points within the shape silhouette. We show that the inner-distance is articulation insensitive and more effective at capturing complex shapes with part structures than Euclidean distance. To demonstrate this idea, it is used to build a new shape descriptor based on shape contexts. After that, we design a dynamic programming based method for shape matching and comparison. We have tested our approach on a variety of shape databases including an articulated shape dataset, MPEG7 CE-Shape-1, Kimia silhouettes, a Swedish leaf database and a human motion silhouette dataset. In all the experiments, our method demonstrates effective performance compared with other algorithms.},
	keywords = {articulated, CE-Shape-1, classification;, database;, databases;, dataset;, descriptor;, dynamic, human, image, inner-distance;, Kimia, landmark, leaf, matching;, MOTION, MPEG7, points;, programming;, SHAPE, silhouette, silhouette;, Swedish, visual},
	doi = {10.1109/CVPR.2005.362},
	author = {Ling,H. and Jacobs, David W.}
}
@conference {18201,
	title = {Dynamic distortion control for 3-D embedded wavelet video over multiuser OFDM networks},
	booktitle = {Global Telecommunications Conference, 2004. GLOBECOM {\textquoteright}04. IEEE},
	volume = {2},
	year = {2004},
	month = {2004/12/03/nov},
	pages = {650 - 654 Vol.2 - 650 - 654 Vol.2},
	abstract = {In this paper, we propose a system to transmit multiple 3D embedded wavelet video programs over downlink multiuser OFDM. We consider the fairness among users and formulate the problem as minimizing the users{\textquoteright} maximal distortion subject to power, rate, and subcarrier constraints. By exploring frequency, time, and multiuser diversity in OFDM and flexibility of the 3D embedded wavelet video codec, the proposed algorithm can achieve fair video qualities among all users. Compared to a scheme similar to the current multiuser OFDM standard (IEEE 802.11a), the proposed scheme outperforms it by 1-5 dB on the worst received PSNR among all users and has much smaller PSNR deviation.},
	keywords = {3D, 802.11a;, channels;, codec;, codecs;, communication;, control;, deviation;, distortion, diversity, diversity;, downlink, dynamic, embedded, fairness;, Frequency, IEEE, LAN;, maximal, minimax, minimization;, modulation;, multimedia, multiuser, OFDM, OFDM;, PSNR, rate, reception;, streaming;, systems;, techniques;, theory;, TIME, transforms;, video, video;, wavelet, wireless},
	doi = {10.1109/GLOCOM.2004.1378042},
	author = {Su,Guan-Ming and Han,Zhu and M. Wu and Liu,K. J.R}
}
@conference {18202,
	title = {Dynamic join-exit amortization and scheduling for time-efficient group key agreement},
	booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies},
	volume = {4},
	year = {2004},
	month = {2004/03//},
	pages = {2617 - 2627 vol.4 - 2617 - 2627 vol.4},
	abstract = {We propose a time-efficient contributory key agreement framework for secure communications in dynamic groups. The proposed scheme employs a special join-tree/exit-tree topology in the logical key tree and effectively exploits the efficiency of amortized operations. We derive the optimal parameters and design an activation algorithm for the join and exit trees. We also show that the asymptotic average time cost per user join and leave event is theta;(log (log n)), where n is the group size. Our experiment results on both simulated user activities and the real MBone data have shown that the proposed scheme outperforms the existing tree-based schemes.},
	keywords = {agreement;, asymptotic, average, communication;, complexity;, computational, cost;, cryptography;, dynamic, group, join-tree/exit-tree, key, logical, Multicast, network, secure, security;, special, Telecommunication, TIME, time-efficient, topology;, tree;},
	doi = {10.1109/INFCOM.2004.1354681},
	author = {Mao,Yinian and Sun,Yan and M. Wu and Liu,K. J.R}
}
@conference {12734,
	title = {Combining multiple evidences for gait recognition},
	booktitle = {Acoustics, Speech, and Signal Processing, 2003. Proceedings. (ICASSP {\textquoteright}03). 2003 IEEE International Conference on},
	volume = {3},
	year = {2003},
	month = {2003/04//},
	pages = {III - 33-6 vol.3 - III - 33-6 vol.3},
	abstract = {In this paper, we systematically analyze different components of human gait, for the purpose of human identification. We investigate dynamic features such as the swing of the hands/legs, the sway of the upper body and static features like height, in both frontal and side views. Both probabilistic and non-probabilistic techniques are used for matching the features. Various combination strategies may be used depending upon the gait features being combined. We discuss three simple rules: the Sum, Product and MIN rules that are relevant to our feature sets. Experiments using four different datasets demonstrate that fusion can be used as an effective strategy in recognition.},
	keywords = {analysis;, dynamic, evidences;, extraction;, feature, features;, frontal, Gait, height;, human, identification;, image, MIN, multiple, nonprobabilistic, probabilistic, Product, recognition;, rules;, sets;, side, static, Sum, sway;, swing;, techniques;, views;},
	doi = {10.1109/ICASSP.2003.1199100},
	author = {Cuntoor, N. and Kale, A. and Chellapa, Rama}
}
@conference {12299,
	title = {On the use of flow migration for handling short-term overloads},
	booktitle = {Global Telecommunications Conference, 2003. GLOBECOM {\textquoteright}03. IEEE},
	volume = {6},
	year = {2003},
	month = {2003/12//},
	pages = {3108 - 3112 vol.6 - 3108 - 3112 vol.6},
	abstract = {In this work, we investigate flow migration as a mechanism to sustain QoS to network users during short-term overloads in the context of an MPLS IP network. We experiment with three different control techniques: static long-term optimal mapping of flows to LSPs; on-line locally optimal mapping of flows to LSPs at flow set-up time; and dynamic flow migration in response to transient congestion. These techniques are applicable over different timescales, have different run-time overheads, and require different levels of monitoring and control software inside the network. We present results both from detailed simulations and a complete implementation using software IP routers. We use voice-over-IP as our test application, and show that if end-to-end quality is to be maintained during short unpredictable bursts of high load, then a fast-timescale control such as migration is required.},
	keywords = {computing;, CONGESTION, congestion;, CONTROL, control;, dynamic, end-to-end, engineering, fast-timescale, flow, Internet, IP, label, long-term, mapping;, migration;, MPLS, multiprotocol, network, network;, networks;, of, optimal, overloads;, protocol;, QoS;, QUALITY, quality;, routers;, routing;, service;, set-up, short-term, software, software;, static, switching;, Telecommunication, telephony;, time;, transient, voice-over-IP;},
	doi = {10.1109/GLOCOM.2003.1258807},
	author = {Kuo,Kuo-Tung and Phuvoravan,S. and Bhattacharjee, Bobby and Jun La,R. and Shayman,M. and Chang,Hyeong Soo}
}
@conference {12727,
	title = {Video based rendering of planar dynamic scenes},
	booktitle = {Multimedia and Expo, 2003. ICME {\textquoteright}03. Proceedings. 2003 International Conference on},
	volume = {1},
	year = {2003},
	month = {2003/07//},
	pages = {I - 477-80 vol.1 - I - 477-80 vol.1},
	abstract = {In this paper, we propose a method to synthesize arbitrary views of a planar scene from a monocular video sequence of it. The 3-D direction of motion of the object is robustly estimated from the video sequence. Given this direction any other view of the object can be synthesized through a perspective projection approach, under assumptions of planarity. If the distance of the object from the camera is large, a planar approximation is reasonable even for non-planar scenes. Such a method has many important applications, one of them being gait recognition where a side view of the person is required. Our method can be used to synthesize the side-view of the person in case he/she does not present a side view to the camera. Since the planarity assumption is often an approximation, the effects of non-planarity can lead to inaccuracies in rendering and needs to be corrected for. Regions where this happens are examined and a simple technique based on weak perspective approximation is proposed to offset rendering inaccuracies. Examples of synthesized views using our method and performance evaluation are presented.},
	keywords = {(computer, 3D, analysis;, approximation;, based, camera;, cameras;, direction;, dynamic, graphics);, image, monocular, MOTION, perspective, planar, processing;, rendering, rendering;, scenes;, sequence;, sequences;, signal, video, weak},
	doi = {10.1109/ICME.2003.1220958},
	author = {Kale, A. and Chowdhury, A.K.R. and Chellapa, Rama}
}
@conference {16150,
	title = {SpaceTree: supporting exploration in large node link tree, design evolution and empirical evaluation},
	booktitle = {Information Visualization, 2002. INFOVIS 2002. IEEE Symposium on},
	year = {2002},
	month = {2002///},
	pages = {57 - 64},
	abstract = {We present a novel tree browser that builds on the conventional node link tree diagrams. It adds dynamic rescaling of branches of the tree to best fit the available screen space, optimized camera movement, and the use of preview icons summarizing the topology of the branches that cannot be expanded. In addition, it includes integrated search and filter functions. This paper reflects on the evolution of the design and highlights the principles that emerged from it. A controlled experiment showed benefits for navigation to already previously visited nodes and estimation of overall tree topology.},
	keywords = {browser;, camera, data, design, diagrams;, dynamic, evolution;, experiment;, exploration;, filter, functions;, graphical, icons;, integrated, interfaces;, large, link, movement;, node, novel, optimized, rescaling;, search;, SpaceTree;, structures;, topology;, tree, user, visualisation;, visualization;},
	doi = {10.1109/INFVIS.2002.1173148},
	author = {Plaisant, Catherine and Grosjean,J. and Bederson, Benjamin B.}
}
@conference {17960,
	title = {Dynamic view-dependent simplification for polygonal models},
	booktitle = {Visualization {\textquoteright}96. Proceedings.},
	year = {1996},
	month = {1996///},
	pages = {327 - 334},
	abstract = {Presents an algorithm for performing view-dependent simplifications of a triangulated polygonal model in real-time. The simplifications are dependent on viewing direction, lighting and visibility, and are performed by taking advantage of image-space, object-space and frame-to-frame coherences. A continuous level-of-detail representation for an object is first constructed off-line. This representation is then used at run-time to guide the selection of appropriate triangles for display. The list of displayed triangles is updated incrementally from one frame to the next. Our approach is more effective than the current level-of-detail-based rendering approaches for most scientific visualization applications where there are a limited number of highly complex objects that stay relatively close to the viewer.},
	keywords = {coherence;image-space, coherence;incremental, coherence;real-time, continuous, direction;visibility;data, dynamic, level-of-detail, list, model;viewing, polygonal, representation;displayed, selection;triangulated, simplification;scientific, triangle, updating;frame-to-frame, updating;lighting;object-space, view-dependent, visualisation;, visualization;triangle},
	doi = {10.1109/VISUAL.1996.568126},
	author = {Xia,J. C and Varshney, Amitabh}
}
@conference {18038,
	title = {Efficient approximate and dynamic matching of patterns using a labeling paradigm},
	booktitle = {Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on},
	year = {1996},
	month = {1996/10//},
	pages = {320 - 328},
	abstract = {A key approach in string processing algorithmics has been the labeling paradigm which is based on assigning labels to some of the substrings of a given string. If these labels are chosen consistently, they can enable fast comparisons of substrings. Until the first optimal parallel algorithm for suffix tree construction was given by the authors in 1994 the labeling paradigm was considered not to be competitive with other approaches. They show that this general method is also useful for several central problems in the area of string processing: approximate string matching, dynamic dictionary matching, and dynamic text indexing. The approximate string matching problem deals with finding all substrings of a text which match a pattern ldquo;approximately rdquo;, i.e., with at most m differences. The differences can be in the form of inserted, deleted, or replaced characters. The text indexing problem deals with finding all occurrences of a pattern in a text, after the text is preprocessed. In the dynamic text indexing problem, updates to the text in the form of insertions and deletions of substrings are permitted. The dictionary matching problem deals with finding all occurrences of each pattern set of a set of patterns in a text, after the pattern set is preprocessed. In the dynamic dictionary matching problem, insertions and deletions of patterns to the pattern set are permitted},
	keywords = {algorithm;replaced, algorithmics;substrings;suffix, algorithms;pattern, approximate, characters;dynamic, characters;labeling, characters;string, complexity;indexing;parallel, construction;computational, data, dictionary, dynamic, indexing;efficient, matching;deleted, matching;dynamic, matching;efficient, matching;inserted, matching;string, matching;tree, paradigm;optimal, Parallel, pattern, PROCESSING, string, structures;, text, tree},
	doi = {10.1109/SFCS.1996.548491},
	author = {Sahinalp,S. C and Vishkin, Uzi}
}
