@article {12494,
	title = {Face Recognition by Computers and Humans},
	journal = {Computer},
	volume = {43},
	year = {2010},
	month = {2010/02//},
	pages = {46 - 55},
	abstract = {This article talks about how the study of how humans perceive faces can be used to help design practical systems for face recognition. Besides applications related to identification and verification-such as access control, law enforcement, ID and licensing, and surveillance-face recognition has also proven useful in applications such as human-computer interaction, virtual reality, database retrieval, multimedia, and computer entertainment. Continuing research into face recognition will provide scientists and engineers with many vital projects, in areas such as homeland security, human-computer interaction, and numerous consumer applications. The areas we are considering pursuing are recognition from unconstrained video sequences, incorporating familiarity into algorithms, modeling effects of aging, and developing biologically plausible models for human face recognition ability.},
	keywords = {access, Computer, control;aging;computer, control;face, entertainment;database, interaction;national, interaction;unconstrained, reality;access, recognition;homeland, recognition;human, retrieval;face, security;, security;human, sequences;virtual, video},
	isbn = {0018-9162},
	doi = {10.1109/MC.2010.37},
	author = {Chellapa, Rama and Sinha, P. and Phillips,P.J.}
}
@conference {12227,
	title = {Channel Access Throttling for Improving WLAN QoS},
	booktitle = {Sensor, Mesh and Ad Hoc Communications and Networks, 2009. SECON {\textquoteright}09. 6th Annual IEEE Communications Society Conference on},
	year = {2009},
	month = {2009/06//},
	pages = {1 - 9},
	abstract = {The de facto QoS channel access method for the IEEE 802.11 Wireless LANs is the Enhanced Distributed Channel Access (EDCA) mechanism, which differentiates transmission treatments for data frames belonging to different traffic categories with four different levels of channel access priority. In this paper, we propose extending EDCA with Channel Access Throttling (CAT) for more flexible and efficient QoS support. By assigning different member stations different channel access parameters, CAT differentiates channel access priorities not between traffic categories but between member stations. Then by dynamically changing the channel access parameters of each member station based on a pre-computed schedule, CAT enables EDCA WLANs the benefits of scheduled access QoS. We also present evaluation results of CAT obtained from both simulations and experiments conducted using off-the-shelf WLAN hardware and open-source device driver. Our results show that CAT can proportionally partition channel capacity, significantly improve performance of multimedia applications, effectively achieve performance protection for admitted flows, and increase per cell VoIP call capacity by up to 41\%.},
	keywords = {802.11, access, area, call, capacity;data, capacity;quality, capacity;WLAN, categories;transmission, channel, device, distributed, driver;quality, facto, frames;de, IEEE, LAN;, LAN;VoIP, local, mechanism;member, method;enhanced, multimedia, network;wireless, networks;channel, of, parameters;channel, priority;channel, QoS, QoS;channel, service;telecommunication, service;traffic, standards;telecommunication, stations;open-source, throttling;channel, traffic;wireless, treatments;wireless, wireless},
	doi = {10.1109/SAHCN.2009.5168915},
	author = {Han,Bo and Ji,Lusheng and Lee,Seungjoon and Miller,R.R. and Bhattacharjee, Bobby}
}
@conference {12226,
	title = {Channel Access Throttling for Overlapping BSS Management},
	booktitle = {Communications, 2009. ICC {\textquoteright}09. IEEE International Conference on},
	year = {2009},
	month = {2009/06//},
	pages = {1 - 6},
	abstract = {Multiple co-channel WLAN BSSes (i.e., WLAN cells) overlapping in coverage are generally considered undesirable because members of the OBSSes compete for channel access, which typically increases the contention level of wireless medium access and reduces overall system performance. In this paper, we propose to use channel access throttling (CAT) for managing Wireless LAN radio resources for overlapping BSSes (OBSSes). CAT provides an access point (AP) of each BSS with a mechanism to control channel access parameters of its member stations on the fly. By coordinating the CAT operations of the OBSS APs, we can enable privileged channel access to an individual BSS at a particular time, for example, by assigning high priority access parameters to member stations associated with the BSS. By controlling how much each BSS may be given the privileged channel access, we can also achieve a proportional partitioning of channel capacity among OBSSes. We present evaluation results obtained from both simulations and experiments using testbed built with commercial off-the-shelf (COTS) WLAN hardware and open-source device driver. Our results show that with CAT, not only can we proportionally partition channel capacity among the OBSSes, but also improve channel utilization efficiency and increase overall capacity.},
	keywords = {access, access;cellular, allocation;channel, BSS, capacity;computer, capacity;proportional, cell;open-source, channel, channels;, co-channel, device, driver;overlapping, efficiency;high-priority, LAN;wireless, management;partition, management;wireless, medium, network, parameters;multiple, partitioning;radio, radio;channel, resources;wireless, throttling;channel, utilization, WLAN},
	doi = {10.1109/ICC.2009.5198815},
	author = {Han,Bo and Ji,Lusheng and Lee,Seungjoon and Miller,R.R. and Bhattacharjee, Bobby}
}
@conference {12290,
	title = {The case for a multi-hop wireless local area network},
	booktitle = {INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies},
	volume = {2},
	year = {2004},
	month = {2004/03//},
	pages = {894 - 905 vol.2 - 894 - 905 vol.2},
	abstract = {We propose a multi-hop wireless LAN architecture and demonstrate its benefits to wireless clients. For this architecture, we define implementation paths that allow interoperation with existing wireless LANs which can lead to an incremental deployment of this system. We quantify the performance benefits of the proposed schemes through measurements in realistic wireless LAN environments. We also examine the performance of such multi-hop wireless LANs through detailed simulation studies. Our results show that these multi-hop extensions can significantly improve the wireless access experience (in terms of data throughput, latency, etc.) for clients who enable such mechanisms. More interestingly, when multi-hop extensions are enabled by some of the clients, it also positively impacts the performance at other clients that are completely unaware of these extensions.},
	keywords = {access, access;, area, benefits;, client-server, clients;, interoperation;, LAN;, local, multihop, network;, networks;, performance, radio, systems;, wireless},
	doi = {10.1109/INFCOM.2004.1356977},
	author = {Lee,Seungjoon and Banerjee,S. and Bhattacharjee, Bobby}
}
@conference {12704,
	title = {Fusion of gait and face for human identification},
	booktitle = {Acoustics, Speech, and Signal Processing, 2004. Proceedings. (ICASSP {\textquoteright}04). IEEE International Conference on},
	volume = {5},
	year = {2004},
	month = {2004/05//},
	pages = {V - 901-4 vol.5 - V - 901-4 vol.5},
	abstract = {Identification of humans from arbitrary view points is an important requirement for different tasks including perceptual interfaces for intelligent environments, covert security and access control etc. For optimal performance, the system must use as many cues as possible and combine them in meaningful ways. In this paper, we discuss fusion of face and gait cues for the single camera case. We present a view invariant gait recognition algorithm for gait recognition. We employ decision fusion to combine the results of our gait recognition algorithm and a face recognition algorithm based on sequential importance sampling. We consider two fusion scenarios: hierarchical and holistic. The first involves using the gait recognition algorithm as a filter to pass on a smaller set of candidates to the face recognition algorithm. The second involves combining the similarity scores obtained individually from the face and gait recognition algorithms. Simple rules like the SUM, MIN and PRODUCT are used for combining the scores. The results of fusion experiments are demonstrated on the NIST database which has outdoor gait and face data of 30 subjects.},
	keywords = {access, algorithm;, analysis;, combining, control;, covert, cues;, data, decision, Environment, Face, fusion;, Gait, hierarchical, holistic, human, identification;, importance, intelligent, interfaces;, invariant, perceptual, recognition, recognition;, rules;, sampling;, score, scores;, security;, sensor, sequential, similarity, view},
	doi = {10.1109/ICASSP.2004.1327257},
	author = {Kale, A. and Roy Chowdhury, A.K. and Chellapa, Rama}
}
@conference {18278,
	title = {Security evaluation for communication-friendly encryption of multimedia},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {1},
	year = {2004},
	month = {2004/10//},
	pages = {569 - 572 Vol. 1 - 569 - 572 Vol. 1},
	abstract = {This paper addresses the access control issues unique to multimedia, by using a joint signal processing and cryptographic approach to multimedia encryption. Based on three atomic encryption primitives, we present a systematic study on how to strategically integrate different atomic operations to build a video encryption system. We also propose a set of multimedia-specific security metrics to quantify the security against approximation attacks and to complement the existing notion of generic data security. The resulting system can provide superior performance to both generic encryption and its simple adaptation to video in terms of a joint consideration of security, bitrate overhead, and communication friendliness.},
	keywords = {access, approximation, atomic, attacks;, bitrate, coding;, communication-friendly, communication;, control;, cryptography;, data, encryption, encryption;, generic, joint, method;, metrics;, multimedia, multimedia-specific, overhead;, primitives;, processing/cryptographic, Security, security;, signal, system;, Telecommunication, video},
	doi = {10.1109/ICIP.2004.1418818},
	author = {Mao,Yinian and M. Wu}
}
@article {18194,
	title = {Data hiding in image and video .II. Designs and applications},
	journal = {Image Processing, IEEE Transactions on},
	volume = {12},
	year = {2003},
	month = {2003/06//},
	pages = {696 - 705},
	abstract = {For pt. I see ibid., vol.12, no.6, p.685-95 (2003). This paper applies the solutions to the fundamental issues addressed in Part I to specific design problems of embedding data in image and video. We apply multilevel embedding to allow the amount of embedded information that can be reliably extracted to be adaptive with respect to the actual noise conditions. When extending the multilevel embedding to video, we propose strategies for handling uneven embedding capacity from region to region within a frame as well as from frame to frame. We also embed control information to facilitate the accurate extraction of the user data payload and to combat such distortions as frame jitter. The proposed algorithm can be used for a variety of applications such as copy control, access control, robust annotation, and content-based authentication.},
	keywords = {access, annotation;, authentication;, capacity;, conditions;, content-based, CONTROL, control;, copy, data, distortions;, EMBEDDING, embedding;, encapsulation;, extraction;, frame, hiding;, image, information;, jitter;, message, multilevel, NOISE, noise;, payload, processing;, robust, signal, uneven, user, video},
	isbn = {1057-7149},
	doi = {10.1109/TIP.2003.810589},
	author = {M. Wu and Yu,H. and Liu,Bede}
}
@article {12307,
	title = {Scalable secure group communication over IP multicast},
	journal = {Selected Areas in Communications, IEEE Journal on},
	volume = {20},
	year = {2002},
	month = {2002/10//},
	pages = {1511 - 1527},
	abstract = {We introduce and analyze a scalable rekeying scheme for implementing secure group communications Internet protocol multicast. We show that our scheme incurs constant processing, message, and storage overhead for a rekey operation when a single member joins or leaves the group, and logarithmic overhead for bulk simultaneous changes to the group membership. These bounds hold even when group dynamics are not known a priori. Our rekeying algorithm requires a particular clustering of the members of the secure multicast group. We describe a protocol to achieve such clustering and show that it is feasible to efficiently cluster members over realistic Internet-like topologies. We evaluate the overhead of our own rekeying scheme and also of previously published schemes via simulation over an Internet topology map containing over 280 000 routers. Through analysis and detailed simulations, we show that this rekeying scheme performs better than previous schemes for a single change to group membership. Further, for bulk group changes, our algorithm outperforms all previously known schemes by several orders of magnitude in terms of actual bandwidth usage, processing costs, and storage requirements.},
	keywords = {access, algorithm;, authentication;, Bandwidth, communication;, CONTROL, costs;, cryptography;, dynamics;, group, group;, Internet, Internet-like, Internet;, IP, logarithmic, map;, membership;, message, Multicast, multicast;, network, overhead;, PROCESSING, protocol, protocols;, rekeying, requirements;, routers;, routing;, scalable, secure, security;, server;, simulation;, storage, Telecommunication, topologies;, Topology, topology;, transport, usage;},
	isbn = {0733-8716},
	doi = {10.1109/JSAC.2002.803986},
	author = {Banerjee,S. and Bhattacharjee, Bobby}
}
@conference {18288,
	title = {Video access control via multi-level data hiding},
	booktitle = {Multimedia and Expo, 2000. ICME 2000. 2000 IEEE International Conference on},
	volume = {1},
	year = {2000},
	month = {2000///},
	pages = {381 -384 vol.1 - 381 -384 vol.1},
	abstract = {The paper proposes novel data hiding algorithms and system design for high quality digital video. Instead of targeting on a single degree of robustness, which results in overestimation and/or underestimation of the noise conditions, we apply multi-level embedding to digital video to achieve more than one level of robustness-capacity tradeoff. In addition, an adaptive technique is proposed to determine how many bits are embedded in each part of the video. Besides user data, control information such as synchronization and the number of hidden user bits are embedded as well. The algorithm can be used for applications such as access control},
	keywords = {access, adaptive, algorithms;hidden, bits;high, conditions;robustness;robustness-capacity, control;adaptive, data, data;video, design;user, digital, embedding;noise, encapsulation;multimedia, hiding, hiding;multi-level, information;data, processing;, QUALITY, signal, systems;authorisation;data, systems;video, technique;control, tradeoff;system, user, video;multi-level},
	doi = {10.1109/ICME.2000.869620},
	author = {M. Wu and Yu,Hong Heather}
}
@conference {15018,
	title = {Prefix computations on symmetric multiprocessors},
	booktitle = {Parallel and Distributed Processing, 1999. 13th International and 10th Symposium on Parallel and Distributed Processing, 1999. 1999 IPPS/SPDP. Proceedings},
	year = {1999},
	month = {1999/04//},
	pages = {7 - 13},
	abstract = {We introduce a new optimal prefix computation algorithm on linked lists which builds upon the sparse ruling set approach of Reid-Miller and Blelloch. Besides being somewhat simpler and requiring nearly half the number of memory accesses, we can bound our complexity with high probability instead of merely on average. Moreover, whereas Reid-Miller and Blelloch (1996) targeted their algorithm for implementation on a vector multiprocessor architecture, we develop our algorithm for implementation on the symmetric multiprocessor architecture (SMP). These symmetric multiprocessors dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Our prefix computation algorithm was implemented in C using POSIX threads and run on four symmetric multiprocessors-the IBM SP-2 (High Node), the HP-Convex Exemplar (S-Class), the DEC AlphaServer; and the Silicon Graphics Power Challenge. We ran our code using a variety of benchmarks which we identified to examine the dependence of our algorithm on memory access patterns. For some problems, our algorithm actually matched or exceeded the performance of the standard sequential solution using only a single thread. Moreover, in spite of the fact that the processors must compete for access to main memory, our algorithm still achieved scalable performance with up to 16 processors, which was the largest platform available to us},
	keywords = {access, algorithms;, AlphaServer;HP-Convex, approach;symmetric, architecture;symmetric, Challenge;high-end, computations;scalable, DEC, Exemplar;IBM, Graphics, market;large, multiprocessor, multiprocessors;Unix;distributed, patterns;prefix, performance;sparse, power, ruling, scale, server, set, SP-2;POSIX, systems;memory, threads;Silicon},
	doi = {10.1109/IPPS.1999.760427},
	author = {Helman,D.R. and JaJa, Joseph F.}
}
@conference {14897,
	title = {Space/time trade-offs for associative memory},
	booktitle = {Pattern Recognition, 1996., Proceedings of the 13th International Conference on},
	volume = {4},
	year = {1996},
	month = {1996/08//},
	pages = {296 -302 vol.4 - 296 -302 vol.4},
	abstract = {In any storage scheme, there is some trade-off between the space used (size of memory) and access time. However, the nature of this trade-off seems to depend on more than just what is being stored-it also depends the types of queries we consider. We justify this claim by considering a particular memory model and contrast recognition (membership queries) with associative recall. We show that the latter task can require exponentially larger memories even when identical information is stored},
	keywords = {access, matching;set, memory;associative, nets;pattern, processing;content-addressable, query;memory, recall;membership, scheme;associative, space;set, storage;neural, theory;, theory;storage, time;associative},
	doi = {10.1109/ICPR.1996.547434},
	author = {GROVE,A. J and Jacobs, David W.}
}
@conference {14939,
	title = {An efficient parallel algorithm for channel routing},
	booktitle = {Computer Design: VLSI in Computers and Processors, 1990. ICCD {\textquoteright}90. Proceedings., 1990 IEEE International Conference on},
	year = {1990},
	month = {1990/09//},
	pages = {400 - 403},
	abstract = {The channel-routing of a set of multiterminal nets in the standard two-layer model is considered. The sequential algorithms based on the greedy strategy do not seem to be easily parallelizable. Proposed is an efficient parallel algorithm for routing channels with cyclic constraints. The algorithm runs in time <e1>O</e1>(<e1>n</e1><sup>2</sup>/<e1>p</e1>+log<sup>2</sup><e1>p</e1>), with <e1>p</e1> processors, on a shared memory parallel random access machine (PRAM) model where 1 les;<e1>p</e1> les;<e1>n</e1><sup>2</sup> radic; and <e1>n</e1> is the size of the input. An efficient adaptation of this algorithm on a Sequent Balance 21000 multiprocessor system is reported},
	keywords = {21000;channel, access, algorithm;sequential, algorithms;, algorithms;shared, balance, CAD;computational, complexity;parallel, Layout, machine;standard, memory, model;circuit, nets;parallel, Parallel, PRAM;Sequent, random, routing;multiprocessor, system;multiterminal, two-layer},
	doi = {10.1109/ICCD.1990.130261},
	author = {Krishnamurthy, S. and JaJa, Joseph F.}
}
