@conference {13609,
	title = {No-reference image quality assessment based on visual codebook},
	booktitle = {Image Processing (ICIP), 2011 18th IEEE International Conference on},
	year = {2011},
	month = {2011/09//},
	pages = {3089 - 3092},
	abstract = {In this paper, we propose a new learning based No-Reference Image Quality Assessment (NR-IQA) algorithm, which uses a visual codebook consisting of robust appearance descriptors extracted from local image patches to capture complex statistics of natural image for quality estimation. We use Gabor filter based local features as appearance descriptors and the codebook method encodes the statistics of natural image classes by vector quantizing the feature space and accumulating histograms of patch appearances based on this coding. This method does not assume any specific types of distortion and experimental results on the LIVE image quality assessment database show that this method provides consistent and reliable performance in quality estimation that exceeds other state-of-the-art NR-IQA approaches and is competitive with the full reference measure PSNR.},
	keywords = {assessment;quality, codebook;Gabor, descriptors;complex, estimation;visual, extraction;image, filter;appearance, filters;feature, gabor, image, image;no-reference, patches;natural, QUALITY, statistics;local, texture;},
	doi = {10.1109/ICIP.2011.6116318},
	author = {Ye,Peng and David Doermann}
}
@article {15324,
	title = {How Do Users Find Things with PubMed? Towards Automatic Utility Evaluation with User Simulations},
	year = {2008},
	month = {2008/02//},
	institution = {Human-Computer Interaction Lab, University of Maryland, College Park},
	abstract = {In the context of document retrieval in the biomedical domain, this paper explores the complex relationship between the quality of initial query results and the overall utility of an interactive system. We demonstrate that a content-similarity browsing tool can compensate for poor retrieval results, and that the relationship between retrieval performance and overall utility is non-linear. Arguments are advanced with user simulations, which characterize the relevance of documents that a user might encounter with different browsing strategies. With broader implications to IR, this work provides a case study of how user simulations can be exploited as a formative tool for automatic utility evaluation. Simulation-based studies provide researchers with an additional evaluation tool to complement interactive and Cranfield-style experiments.},
	keywords = {*BIOMEDICAL INFORMATION SYSTEMS, *BROWSING, *INFORMATION RETRIEVAL, *PUBMED, *SIMILARITY, *SIMULATION, *USER NEEDS, DOCUMENTS, FIND-SIMILAR, HUMAN FACTORS ENGINEERING \& MAN MACHINE SYSTEM, INFORMATION SCIENCE, MAN COMPUTER INTERFACE, QUALITY, queries, searching, TEST AND EVALUATION, UTILITY},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA478703},
	author = {Jimmy Lin and Smucker,Mark D.}
}
@conference {14498,
	title = {D-Dupe: An Interactive Tool for Entity Resolution in Social Networks},
	booktitle = {Visual Analytics Science And Technology, 2006 IEEE Symposium On},
	year = {2006},
	month = {2006/11/31/2},
	pages = {43 - 50},
	abstract = {Visualizing and analyzing social networks is a challenging problem that has been receiving growing attention. An important first step, before analysis can begin, is ensuring that the data is accurate. A common data quality problem is that the data may inadvertently contain several distinct references to the same underlying entity; the process of reconciling these references is called entity-resolution. D-Dupe is an interactive tool that combines data mining algorithms for entity resolution with a task-specific network visualization. Users cope with complexity of cleaning large networks by focusing on a small subnetwork containing a potential duplicate pair. The subnetwork highlights relationships in the social network, making the common relationships easy to visually identify. D-Dupe users resolve ambiguities either by merging nodes or by marking them distinct. The entity resolution process is iterative: as pairs of nodes are resolved, additional duplicates may be revealed; therefore, resolution decisions are often chained together. We give examples of how users can flexibly apply sequences of actions to produce a high quality entity resolution result. We illustrate and evaluate the benefits of D-Dupe on three bibliographic collections. Two of the datasets had already been cleaned, and therefore should not have contained duplicates; despite this fact, many duplicates were rapidly identified using D-Dupe{\textquoteright}s unique combination of entity resolution algorithms within a task-specific visual interface},
	keywords = {algorithm;data, analysis;social, computing;user, D-Dupe, interactive, interface;data, interfaces;, mining, mining;interactive, network, problem;entity, QUALITY, resolution;entity-resolution;social, sciences, systems;social, tool;data, visual, visualization;task-specific},
	doi = {10.1109/VAST.2006.261429},
	author = {Bilgic,M. and Licamele,L. and Getoor, Lise and Shneiderman, Ben}
}
@article {18159,
	title = {A Scalable Multiuser Framework for Video Over OFDM Networks: Fairness and Efficiency},
	journal = {Circuits and Systems for Video Technology, IEEE Transactions on},
	volume = {16},
	year = {2006},
	month = {2006/10//},
	pages = {1217 - 1231},
	abstract = {In this paper, we propose a framework to transmit multiple scalable video programs over downlink multiuser orthogonal frequency division multiplex (OFDM) networks in real time. The framework explores the scalability of the video codec and multidimensional diversity of multiuser OFDM systems to achieve the optimal service objectives subject to constraints on delay and limited system resources. We consider two essential service objectives, namely, the fairness and efficiency. Fairness concerns the video quality deviation among users who subscribe the same quality of service, and efficiency relates to how to attain the highest overall video quality using the available system resources. We formulate the fairness problem as minimizing the maximal end-to-end distortion received among all users and the efficiency problem as minimizing total end-to-end distortion of all users. Fast suboptimal algorithms are proposed to solve the above two optimization problems. The simulation results demonstrated that the proposed fairness algorithm outperforms a time division multiple (TDM) algorithm by 0.5 3 dB in terms of the worst received video quality among all users. In addition, the proposed framework can achieve a desired tradeoff between fairness and efficiency. For achieving the same average video quality among all users, the proposed framework can provide fairer video quality with 1 1.8 dB lower PSNR deviation than a TDM algorithm},
	keywords = {algorithm;video, codec;video, coding;video, communication;, deviation;downlink, deviation;OFDM, distortion;multidimensional, diversity;multiple, division, end-to-end, framework;time, Frequency, modulation;diversity, multiple, multiplex, multiuser, network;efficiency, networks;video, objectives;optimization, of, OFDM, orthogonal, over, problem;fairness, problem;maximal, problems;quality, programs;multiuser, PSNR, QUALITY, reception;image, resolution;optimisation;quality, scalable, service, service;scalable, service;video, systems;optimal, video},
	isbn = {1051-8215},
	doi = {10.1109/TCSVT.2006.883513},
	author = {Su,Guan-Ming and Han,Zhu and M. Wu and Liu,K. J.R}
}
@conference {12279,
	title = {Differentiated traffic engineering for QoS provisioning},
	booktitle = {INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE},
	volume = {4},
	year = {2005},
	month = {2005/03//},
	pages = {2349 - 2359 vol. 4 - 2349 - 2359 vol. 4},
	abstract = {We introduce a new approach for QoS provisioning in packet networks based on the notion of differentiated traffic engineering (DTE). We consider a single AS network capable of source based multi-path routing. We do not require sophisticated queuing or per-class scheduling at individual routers; instead, if a link is used to forward QoS sensitive packets, we maintain its utilization below a threshold. As a consequence, DTE eliminates the need for per-flow (IntServ) or per-class (DiffServ) packet processing tasks such as traffic classification, queueing, shaping, policing and scheduling in the core and hence poses a lower burden on the network management unit. Conversely, DTE utilizes network bandwidth much more efficiently than simple over-provisioning. In this paper, we propose a complete architecture and an algorithmic structure for DTE. We show that our scheme can be formulated as a non-convex optimization problem, and we present an optimal solution framework based on simulated annealing. We present a simulation-based performance evaluation of DTE, and compare our scheme to existing (gradient projection) methods.},
	keywords = {based, Computer, differentiated, DiffServ, DTE;, engineering;, evaluation;, link;, links;, management;, multipath, network, networks;, nonconvex, of, optimisation;, OPTIMIZATION, packet, performance, problem;, provisioning;, QoS, QUALITY, routing;, service;, simulation-based, source, Telecommunication, traffic, traffic;},
	doi = {10.1109/INFCOM.2005.1498521},
	author = {Tabatabaee,V. and Bhattacharjee, Bobby and La,R.J. and Shayman,M.A.}
}
@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 {15600,
	title = {A new approach to image fusion based on cokriging},
	booktitle = {Information Fusion, 2005 8th International Conference on},
	volume = {1},
	year = {2005},
	month = {2005/07//},
	pages = {8 pp. - 8 pp.},
	abstract = {We consider the image fusion problem involving remotely sensed data. We introduce cokriging as a method to perform fusion. We investigate the advantages of fusing Hyperion with ALI. This evaluation is performed by comparing the classification of the fused data with that of input images and by calculating well-chosen quantitative fusion quality metrics. We consider the invasive species forecasting system (ISFS) project as our fusion application. The fusion of ALI with Hyperion data is studied using PCA and wavelet-based fusion. We then propose utilizing a geostatistical based interpolation method called cokriging as a new approach for image fusion.},
	keywords = {ALI;, analysis;, based, cokriging;, component, data;, forecasting, fusion, fusion;, geophysical, geostatistical, Hyperion, image, Interpolation, interpolation;, invasive, ISFS, method;, metrics;, PCA;, principal, processing;, project;, QUALITY, quantitative, remote, remotely, sensed, sensing;, sensor, sensors;, signal, species, system;, techniques;, transforms;, wavelet, wavelet-based},
	doi = {10.1109/ICIF.2005.1591912},
	author = {Memarsadeghi,N. and Le Moigne,J. and Mount, Dave and Morisette,J.}
}
@conference {18207,
	title = {Efficient bandwidth resource allocation for low-delay multiuser MPEG-4 video transmission},
	booktitle = {Communications, 2004 IEEE International Conference on},
	volume = {3},
	year = {2004},
	month = {2004/06//},
	pages = {1308 - 1312 Vol.3 - 1308 - 1312 Vol.3},
	abstract = {An efficient bandwidth resource allocation algorithm with low delay and low fluctuation of quality to transmit multiple MPEG-4 fine granularity scalability (FGS) video programs to multiple users is proposed in this paper. By exploring the variation in the scene complexity of each video program and jointly redistributing available system resources among users, our proposed algorithm provides low fluctuation of quality for each user and consistent quality among all users. Experimental results show that compared to a traditional look-ahead sliding-window approach, our scheme can achieve comparable perceptual quality and channel utilization at a much lower cost of delay, computation, and storage.},
	keywords = {algorithm;, allocation, allocation;, approach;, Bandwidth, broadband, channel, channels;, coding;, delays;, expert, FGS;, fine, granularity, group;, look-ahead, moving, MPEG-4, multiuser, networks;, of, picture, program;, QUALITY, resource, scalability;, service;, sliding-window, transmission;, utilization;, video},
	doi = {10.1109/ICC.2004.1312724},
	author = {Su,Guan-Ming and M. Wu}
}
@conference {13212,
	title = {A fine-structure image/video quality measure using local statistics},
	booktitle = {Image Processing, 2004. ICIP {\textquoteright}04. 2004 International Conference on},
	volume = {5},
	year = {2004},
	month = {2004/10//},
	pages = {3535 - 3538 Vol. 5 - 3535 - 3538 Vol. 5},
	abstract = {An objective no-reference measure is presented to assess line-structure image/video quality. It was designed to measure image/video quality for video surveillance applications, especially for background modeling and foreground object detection. The proposed measure using local statistics reflects image degradation well in terms of noise and blur. The experimental results on a background subtraction algorithm validate the usefulness of the proposed measure, by showing its correlation with the algorithm{\textquoteright}s performance.},
	keywords = {algorithm;, background, degradation;, detection;, foreground, image, line-structure, local, measure;, modeling;, no-reference, object, objective, processing;, QUALITY, signal, statistics;, subtraction, surveillance;, video},
	doi = {10.1109/ICIP.2004.1421879},
	author = {Kim,Kyungnam and Davis, Larry S.}
}
@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 {13514,
	title = {Binarization of low quality text using a Markov random field model},
	booktitle = {Pattern Recognition, 2002. Proceedings. 16th International Conference on},
	volume = {3},
	year = {2002},
	month = {2002///},
	pages = {160 - 163 vol.3 - 160 - 163 vol.3},
	abstract = {Binarization techniques have been developed in the document analysis community for over 30 years and many algorithms have been used successfully. On the other hand, document analysis tasks are more and more frequently being applied to multimedia documents such as video sequences. Due to low resolution and lossy compression, the binarization of text included in the frames is a non-trivial task. Existing techniques work without a model of the spatial relationships in the image, which makes them less powerful. We introduce a new technique based on a Markov random field model of the document. The model parameters (clique potentials) are learned from training data and the binary image is estimated in a Bayesian framework. The performance is evaluated using commercial OCR software.},
	keywords = {analysis;, annealing;, Bayes, Bayesian, binarization;, computing;, distributions;, document, documents;, field;, Gibbs, image, low, Markov, method;, methods;, multimedia, optimization;, probability;, processes;, processing;, QUALITY, random, simulated, text},
	doi = {10.1109/ICPR.2002.1047819},
	author = {Wolf,C. and David Doermann}
}
@article {13761,
	title = {Efficient Language Independent Generation from Lexical Conceptual Structure},
	year = {2001},
	month = {2001/09//},
	institution = {Instititue for Advanced Computer Studies, Univ of Maryland, College Park},
	abstract = {This paper describes a system for generating natural-language sentences from an interlingual representation, Lexical Conceptual Structure (LCS). The system has been developed as part of a Chinese-English Machine Translation system; however, it is designed to be used for many other MT language pairs and Natural Language applications. The contributions of this work include: (1) Development of a language-independent generation system that maximizes efficiency through the use of a hybrid rule-based/statistical module; (2) Enhancements to an interlingual representation and associated algorithms for interpretation of multiply ambiguous input sentences; (3) Development of an efficient reusable language-independent linearization module with a grammar description language that can be used with other systems; (4) Improvements to an earlier algorithm for hierarchically mapping thematic roles to surface positions; (5) Development of a diagnostic tool for lexicon coverage and correctness and use of the tool for verification of English, Spanish, and Chinese lexicons. An evaluation of translation quality shows comparable performance with commercial translation system. The generation system can also be straightforwardly extended to their languages and this is demonstrated and evaluated for Spanish.},
	keywords = {*LEXICAL CONCEPTUAL STRUCTURE, *LEXICOGRAPHY, *MACHINE TRANSLATION, *VOCABULARY, *WORDS(LANGUAGE), algorithms, CHINA, COMMERCE, DIAGNOSTIC EQUIPMENT, efficiency, English language, grammars, INPUT, INTERLINGUAL, LANGUAGE, LANGUAGE-INDEPENDENT NLP., linguistics, MAPPING, natural language, QUALITY, SPANISH LANGUAGE, verification},
	url = {http://stinet.dtic.mil/oai/oai?\&verb=getRecord\&metadataPrefix=html\&identifier=ADA458756},
	author = {Habash,Nizar and Dorr, Bonnie J and Traum,David}
}
@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}
}
