ppxscal/embedding_network huggingface dataset:
Learn Discriminant Features for Multi-View Face and Eye Detection
Authors: Peng Wang, Qiang Ji
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

In current face detection, mostly often used features are selected from a large set (e.g. Haar wavelets). Generally Haar wavelets only represent the local geometric feature. When applying those features to profile faces and eyes with irregular geometric patterns, the classifier accuracy is low in the later training stages, only near 50%. In this paper, instead of brute-force searching the large feature set, we propose to statistically learn the discriminant features for object detection. Besides applying Fisher discriminant analysis (FDA) in AdaBoost, we further propose the recursive nonparametric discriminant analysis (RNDA) to handle more general cases. Those discriminant analysis features are not constrained with geometric shape and can provide better accuracy. The compact size of feature set allows to select a near optimal subset of features and construct the probabilistic classifiers by greedy searching. The proposed methods are applied to multi-view face and eye detection and achieve good accuracy.
Interface and control manager for parcels sorting
Authors: Atanas Atanassov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The paper presents the development of an Interface and Control Manager (ICM) intended to sort automatically parcels in Swiss POST. The main purpose of the ICM is to replace existing IBM sorting system, providing better sorting quality. ICM uses complete or partial address data provided by SIEMENS Parcel Address Reader (PAR). It verifies the data and sends appropriate control information to all existing IBM servers and sorting machines. For parcels dispatching multithreading and scheduling approaches similar to these used in real-time and parallel systems are applied.
A Low-Complexity, High-Performance Fetch Unit for Simultaneous Multithreading Processors
Authors: Ayose Falcon, Alex Ramirez, Mateo Valero
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

Simultaneous Multithreading (SMT) is an architectural technique that allows for the parallel execution of several threads simultaneously. Fetch performance has been identified as the most important bottleneck for SMT processors. The commonly adopted solution has been fetching from more than one thread each cycle. Recent studies have proposed a plethora of fetch policies to deal with fetch priority among threads, trying to increase fetch performance. In this paper we demonstrate that the simultaneous sharing of the fetch unit, apart from increasing the complexity of the fetch unit, can be counter-productive in terms of performance. We evaluate the use of high-performance fetch units in the context of SMT. Our new fetch architecture proposal allows us to feed an 8-way processor fetching from a single thread each cycle, reducing complexity, and increasing the usefulness of proposed fetch policies. Our results show that using new high-performance fetch units, like the FTB or the stream fetch, provides higher performance than fetching from two threads using common SMT fetch architectures. Furthermore, our results show that our design obtains better average performance for any kind of workloads (both ILP and memory bounded benchmarks), in contrast to previously proposed solutions.
Acknowledgements
Authors: Newton Lee
Venue: Computers in Entertainment (CIE) (2005)

Producer and editor-in-chief Newton Lee Flash homepage design consultants Alex Lieu, Johnny Rodriguez, Michael Borys 3-Pin Media Flash animation consultants Jay Popeski, Jeffrey Blyseth Axis Graphics HTML design consultant Joe Raymond Audio-visual consultant Eric Huff Also thanks to all authors, interviewees, reviewers, editorial board advisors, and the entire ACM staff including Mark Mandelbaum, John White, Roma Simon, Irma Strolia, Edwin Rodriguez, Jono Hardjowirogo, Maida Pacheco, Roxanne Carcaterra, Carol Wierzbicki, Craig Rodkin, Doug Meszler, Virginia Gold, and Lillian Israel for their support.
Approach to Target Detection based on Relevant Metric for Scoring Performance
Authors: James Theiler, Neal Harvey, Nancy A. David, John M. Irvine
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Improved target detection, reduced false alarm rates, and enhanced timeliness are critical to meeting the requirements of current and future military missions. We present a new approach to target detection, based on a suite of image processing and exploitation tools developed under the Intelligent Searching of Images and Signals (ISIS) Program at Los Alamos National Laboratory. Performance assessment of these algorithms relies on a new metric for scoring target detection that is relevant to the analyst's needs. An object-based loss function is defined by the degree to which the automated processing focuses the analyst's attention on the true targets and avoids false positives. For target detection techniques that produce a pixel-by-pixel classification (and thereby produce not just an identification of the target, but a segmentation as well), standard scoring rules are not appropriate because they unduly penalize partial detections. From a practical standpoint, it is not necessary to identify every single pixel that is on the target; all that is required is that the processing draw the analyst's attention to the target. By employing this scoring metric directly into the target detection algorithm, improved performance in this more practical context can be obtained.
A guideline for specifying compliance in multi-fingered operations
Authors: Byoung-Ho Kim, Byung-Ju Yi, Sang-Rok Oh, Il HoNG Suh
Venue: Journal of Robotic Systems (2004)

In this paper, we present a fundamental compliance analysis for multi-fingered hands and also provide a guideline for specifying compliance characteristics in the three-dimensional operational space of multi-fingered hands. Through the analysis of the stiffness relation between the operational space and the fingertip space of multi-fingered hands, it is shown that some of the coupling stiffness elements cannot be planned arbitrarily. Also, an independent finger-based compliance control method to achieve the given compliance characteristics is described. Conclusively, when we specify the operational stiffness matrix, the contents of the operational stiffness matrix cannot be fully achieved by influence of the grasp geometry of multi-fingered hands. The grasp positions of fingers as well as the RCC point, which are shown important factors, should be chosen to achieve the specified operational stiffness matrix for the given task. The cases of a point contact with friction and soft contact are examined as illustrative examples. It is observed that a five-fingered robotic hand is sufficient for implementation of proper three-dimensional compliance characteristics. &copy; 2004 Wiley Periodicals, Inc.
Effort estimation of use cases for incremental large-scale software development
Authors: Parastoo Mohagheghi, Bente Anda, Reidar Conradi
Venue: Proceedings of the 27th international conference on Software engineering (2005)

This paper describes an industrial study of an effort estimation method based on use cases, the Use Case Points method. The original method was adapted to incremental development and evaluated on a large industrial system with modification of software from the previous release. We modified the following elements of the original method: a) complexity assessment of actors and use cases, and b) the handling of non-functional requirements and team factors that may affect effort. For incremental development, we added two elements to the method: c) counting both all and the modified actors and transactions of use cases, and d) effort estimation for secondary changes of software not reflected in use cases. We finally extended the method to: e) cover all development effort in a very large project. The method was calibrated using data from one release and it produced an estimate for the successive release that was only 17% lower than the actual effort. The study identified factors affecting effort on large projects with incremental development. It also showed how these factors can be calibrated for a specific context and produce relatively accurate estimates.
Rank-R Approximation of Tensors: Using Image-as-Matrix Representation
Authors: Hongcheng Wang, Narendra Ahuja
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We present a novel multilinear algebra based approach for reduced dimensionality representation of image ensembles. We treat an image as a matrix, instead of a vector as in traditional dimensionality reduction techniques like PCA, and higher-dimensional data as a tensor. This helps exploit spatio-temporal redundancies with less information loss than image-as-vector methods. The challenges lie in the computational and memory requirements for large ensembles. Currently, there exists a rank-R approximation algorithm which, although applicable to any number of dimensions, isefficient for only low-rank approximations. For larger dimensionality reductions, the memory and time costs of this algorithm become prohibitive. We propose a novel algorithm for rank-R approximations of third-order tensors, which is efficient for arbitrary R but for the important special case of 2D image ensembles, e.g. video. Both of these algorithms reduce redundancies present in all dimensions. Rank-R tensor approximation yields the most compact data representation among all known image-as-matrix methods. We evaluated the performance of our algorithm vs. other approaches on a number of datasets with the following two main results. First, for a fixed compression ratio, the proposed algorithm yields the best representation of image ensembles visually as well as in the least squares sense. Second, proposed representation gives the best performance for object classification.
Shape-From-Silhouette Across Time Part I: Theory and Algorithms
Authors: Kong-Man (German) Cheung, Simon Baker, Takeo Kanade
Venue: International Journal of Computer Vision (2005)

Shape-From-Silhouette (SFS) is a shape reconstruction method which constructs a 3D shape estimate of an object using silhouette images of the object. The output of a SFS algorithm is known as the Visual Hull (VH). Traditionally SFS is either performed on static objects, or separately at each time instant in the case of videos of moving objects. In this paper we develop a theory of performing SFS across time: estimating the shape of a dynamic object (with unknown motion) by combining all of the silhouette images of the object over time. We first introduce a one dimensional element called a Bounding Edge to represent the Visual Hull. We then show that aligning two Visual Hulls using just their silhouettes is in general ambiguous and derive the geometric constraints (in terms of Bounding Edges) that govern the alignment. To break the alignment ambiguity, we combine stereo information with silhouette information and derive a Temporal SFS algorithm which consists of two steps: (1) estimate the motion of the objects over time (Visual Hull Alignment) and (2) combine the silhouette information using the estimated motion (Visual Hull Refinement). The algorithm is first developed for rigid objects and then extended to articulated objects. In the Part II of this paper we apply our temporal SFS algorithm to two human-related applications: (1) the acquisition of detailed human kinematic models and (2) marker-less motion tracking.
Face Detection Using Improved LBP under Bayesian Framework
Authors: Hongliang Jin, Qingshan Liu, Hanqing Lu, Xiaofeng Tong
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

In this paper, we present a novel face detection approach using Improved Local Binary Patterns (ILBP) as facial representation. ILBP feature is an improvement of LBP feature that considers both local shape and texture information instead of raw grayscale information and it is robust to illumination variation. We model the face and non-face class using multivariable Gaussian Model and classify them under Bayesian framework. Extensive experiments show that the proposed method has an encouraging performance.
PPerfGrid: A Grid Services-based Tool for the Exchange of Heterogeneous Parallel Performance Data
Authors: John J. Hoffman, Andrew Byrd, Kathryn M. Mohror, Karen L. Karavanic
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 4 - Volume 05 (2005)

This paper presents PPerfGrid, a tool that addresses the challenges involved in the exchange of heterogeneous parallel computing performance data. Parallel computing performance data exists in a wide variety of different schemas and formats, from basic text files to relational databases to XML, and it is stored on geographically dispersed host systems of various platforms. PPerfGrid uses Grid Services to address these challenges. PPerfGrid exposes Application and Execution semantic objects as Grid services and publishes their location and characteristics in a registry. PPerfGrid clients access this registry, locate the PPerfGrid sites with performance data they are interested in, and bind to a set of Grid services that represent this data. This set of Application and Execution Grid services provides a uniform, virtual view of the data available in a particular PPerfGrid session. PPerfGrid addresses scalability by allowing specific questions to be asked about a data store, thereby narrowing the scope of the data returned to a client. In addition, by using a Grid services approach, the Application and Execution Grid services involved in a particular query can be dynamically distributed across several hosts, thereby taking advantage of parallelism and improving scalability. We describe our PPerfGrid prototype and include data from preliminary prototype performance tests.
Test Problem Generator for the Multidimensional Assignment Problem
Authors: Don A. Grundel, Panos M. Pardalos
Venue: Computational Optimization and Applications (2005)

The multidimensional assignment problem (MAPs) is a higher dimensional version of the standard linear assignment problem. Test problems of known solution are useful in exercising solution methods. A method of generating an axial MAP of controllable size with a known unique solution is presented. Certain characteristics of the generated MAPs that determine realism and difficulty are investigated.
Distributed Unidirectional and Bidirectional Heuristic Search: Algorithm Design and Empirical Assessment
Authors: Abdel-Elah Al-Ayyoub
Venue: The Journal of Supercomputing (2005)

Since its introduction three decades ago, bidirectional heuristic search did not deliver the expected performance improvement over unidirectional search methods. The problem of search frontiers passing each other is a widely accepted conjecture led to amendments to steer the search using computationally demanding heuristics. The computation cost associated with front-to-front evaluations crippled further investigation and hence bidirectional search was long neglected. However, recent findings demonstrate that the initial conjecture is wrong since the major search effort is spent after the frontiers have already met [7]. In this paper we reconsider bidirectional search by proposing a new generic approach based on cluster computing. The proposed approach is then evaluated and compared with its unidirectional counterparts. The obtained results reveal that cluster computing is a viable approach for distributed heuristic search. Particularly, clustered bidirectional search is capable of solving problems beyond unidirectional search capabilities and in the same time outperforms unidirectional approaches in terms of memory space and execution time.
Memory Profiling using Hardware Counters
Authors: Marty Itzkowitz, Brian J. N. Wylie, Christopher Aoki, Nicolai Kosche
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Although memory performance is often a limiting factor in application performance, most tools only show performance data relating to the instructions in the program, not to its data. In this paper, we describe a technique for directly measuring the memory profile of an application. We describe the tools and their user model, and then discuss a particular code, the MCFbenchmark from SPEC CPU 2000. We show performance data for the data structures and elements, and discuss the use of the data to improve program performance. Finally, we discuss extensions to the work to provide feedback to the compiler for prefetching and to generate additional reports from the data.
Integration of the Regional Public Health Resources and Establishment of the Digital Hospital
Authors: Hanping Jiang, Fulin Zhang
Venue: Proceedings of the IDEAS Workshop on Medical Information Systems: The Digital Hospital (2004)

It is generally accepted that digitized hospital is of great significance in reducing medicalerrors, improving the quality of medical care and service, and lowering the costs. In recent years, most of the 17 thousands hospitals in China have made arduous and continuous efforts in establishing hospital information systems, however, the outcome is not promising, even inthe developed countries, the result of their practice in such efforts is not satisfied. In this paper, we proposed a new method for establishment of digital hospital, with emphasis on the integration of the regional health resources, such as human resources, advanced information technologies, funds, experiences, project management, etc. This approach is consisted of three main points, first, sharing the regional human resources and standardization of the professional requirements and technical design; second, adopting the "first experimentation and then promotion" strategy and efficiently utilizing public health resources; third, researching and exploring the advanced methods of project management of the health information system and sharing positive as well as negative experiences. We believed these suggestions among others are useful for efficient establishment of digital hospital in the future.
Palmprint Identification Using PalmCodes
Authors: Ajay Kumar, Helen C. Shen
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper investigates a new approach for the palmprint identification using Real Gabor Function (RGF) filtering. Inkless composite hand images have been used to automatically extract the palmprints from peg-free imaging setup. These palmprints, after normalization, are subjected to selective feature sampling by a bank of RGF. Each of these filtered images has been used to extract significant features (PalmCode) from each of 6 concentric circular bands. Our preliminary experimental results using 400 low-resolution palmprint images achieve the recognition rate of 97.50% and also illustrate the shortcomings of results presented in earlier work. The results show the uniqueness of palmprint texture, even in the two hands of an individual and its possible use in biometrics based personal recognition.
Intuitive manipulation techniques for projected displays of mobile devices
Authors: Kosuke Miyahara, Hiroshi Inoue, Yuji Tsunesada, Masanori Sugimoto
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Mobile devices (cellular phone, PDA, etc.) used by many people in their daily lives have so far been personal tools. Due to their multi-functionality, however, the devices have begun to be used by multiple people in co-located situations. This paper discusses near future technologies: a mobile device with a projector and intuitive manipulation techniques by using a video camera mounted on the device. It is difficult to realize a mobile device with a small and light projector that still retains the feature of mobility, so we have developed a system to project displays of mobile devices by tracking their three-dimensional positions and orientations. The proposed system called Hotaru (a firefly, in English) allows users to annotate, rotate or transfer files between multiple devices by touching their projected displays with fingers.
Physically-based simulation of plant leaf growth: Research Articles
Authors: Iris R. Wang, Justin W. L. Wan, Gladimir V. G. Baranoski
Venue: Computer Animation and Virtual Worlds (2004)

A mathematical model is presented to simulate the growth of a plant leaf. The tissue in the leaf has been regarded as a viscous, incompressible fluid whose 2D expansion comes from the non-zero specific growth rate in area. The resulting system of equations are composed of the modified Navier-Stokes equations. The level set method is used to capture the expanding leaf front. Numerical simulations indicate that different portions of the leaf expand at different rates, which is consistent with the biological observations in the growth of a plant leaf. Numerical results for the case of the Xanthium leaf growth are also presented. A standard ray tracing technique is applied to produce an animation simulating the leaf growth process of three days. The key results with their physical and practical implications are discussed. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Wireless mesh networks: a survey
Authors: Ian F. Akyildiz, Xudong Wang, Weilin Wang
Venue: Computer Networks and ISDN Systems (2005)

Wireless mesh networks (WMNs) consist of mesh routers and mesh clients, where mesh routers have minimal mobility and form the backbone of WMNs. They provide network access for both mesh and conventional clients. The integration of WMNs with other networks such as the Internet, cellular, IEEE 802.11, IEEE 802.15, IEEE 802.16, sensor networks, etc., can be accomplished through the gateway and bridging functions in the mesh routers. Mesh clients can be either stationary or mobile, and can form a client mesh network among themselves and with mesh routers. WMNs are anticipated to resolve the limitations and to significantly improve the performance of ad hoc networks, wireless local area networks (WLANs), wireless personal area networks (WPANs), and wireless metropolitan area networks (WMANs). They are undergoing rapid progress and inspiring numerous deployments. WMNs will deliver wireless services for a large variety of applications in personal, local, campus, and metropolitan areas. Despite recent advances in wireless mesh networking, many research challenges remain in all protocol layers. This paper presents a detailed study on recent advances and open research issues in WMNs. System architectures and applications of WMNs are described, followed by discussing the critical factors influencing protocol design. Theoretical network capacity and the state-of-the-art protocols for WMNs are explored with an objective to point out a number of open research issues. Finally, testbeds, industrial practice, and current standard activities related to WMNs are highlighted.