ppxscal/embedding_network huggingface dataset:
Robust object matching for persistent tracking with heterogeneous features
Authors: Yanlin Guo, H. Sawhney, R. Kumar, S. Hsu
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

Tracking objects over a long period of time in realistic environments remains a challenging problem for ground and aerial video surveillance. Matching objects and verifying their identities across multiple spatial and temporal gaps proves to be an effective way to extend tracking range. When an object track is lost due to occlusion or other reasons, we need to learn the object signature and use it to confirm the object's identity against a set of active objects when it appears again. In order to deal with poor image quality and large variations in aerial video tracking, we present in this paper a unified framework that employs a heterogeneous collection of features such as lines, points and regions for robust vehicle matching under variations in illumination, aspect and camera poses. Our approach fully utilizes the characteristics of vehicular objects that consist of relatively large textureless areas delimited by line like features, and demonstrates the important usage of heterogeneous features for different stages of vehicle matching. Experiments demonstrate the enhancement in performance of vehicle identification across multiple sightings using the heterogeneous feature set.
Buyer agent to enhance consumer awareness: SAATHI
Authors: Sandip Sen, Sabyasachi Saha, Karina Hernandez
Venue: Electronic Commerce Research and Applications (2007)

Personal agents have been developed that assist a user with information processing needs by generating, filtering, collecting, or transforming information. On the other hand, internet stores are providing services customized by the needs and interests of individual customers. Such services can be viewed as ''seller's agents'' whose goal is to push merchandise and/or services on to the users. This leads us to believe that there is a growing need for deploying ''buyer's agents'' whose goal is to best serve the consumer's interests. The Internet contains a huge volume of information which can overwhelm a buyer. The buyers may often make misinformed decisions based on partial, outdated, irrelevant or incorrect information. We have identified several key functionalities of buyer's agents whose goal is to reduce information overload and improve relevancy and accuracy of information for consumers. In particular, such agents can make consumers aware of complex interactions between specified preferences and prevailing market conditions, provide differential analysis for decision support, and use domain ontologies to help the user reformulate queries to improve satisfaction with query results. We present SAATHI, a prototype buyer's agent that demonstrate some of these functionalities in an apartment locator domain.
Simple weighting to enhance sparse periodic arrays
Authors: A. Austeng
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

One of the most promising approaches to construct sparse arrays is sparse periodic arrays. The transmitter, Tx, and receiver, Rx, are constructed with different element spacing, both having grating lobes in the radiation pattern occurring at different angles. These are only partially suppressed in the two-way radiation pattern. We present a simple approach to suppress the grating lobes even further. The enhancement is obtained by forcing zeros in the Tx radiation pattern at the occurrence of the Rx grating lobes and vice versa. Weighting of a few of the outer elements has proven sufficient. Enhancement of 30 dB is found for an array with 64 elements aperture with half the elements active. Only the outer group of elements had non-unity weights. The result is comparable to or better than a dense unity weighted array. If desired, additional weighting can be applied.
Convergence analysis of the subspace tracking algorithms PAST and PASTd
Authors: Bin Yang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

We prove the asymptotic convergence of the subspace tracking (stochastic approximation) algorithms PAST and PASTd. We also present new results about their asymptotic convergence rate. First we review the algorithms. Then we derive the corresponding ordinary differential equation (ODE). The convergence behaviour established by studying the asymptotically stable equilibrium states of the ODE, and the computer simulation results are shown.
Sampling strategies and resolution in limited data cone-beam tomography
Authors: F. Noo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

This paper addresses the prediction of tomographic capabilities of limited-data cone-beam tomographic systems. We introduce the notion of "local directional resolution" to predict these capabilities and illustrate its usefulness in a simulation of SPECT breast imaging. The paper considers cone-beam tomography from limited data. Cone-beam tomography is a technique used to visualize the interior of a three-dimensional (3-D) object in a non-invasive way. This technique involves two steps. In the first step, measurements called cone-beam projections are taken. In the second step, digital signal processing techniques are used to process the measurements to form a 3-D image. The 3-D image represents a function f (x_) which associates each voxel x_ in the object with the value of a physical quantity. In X-ray imaging, this quantity is the X-ray attenuation factor which roughly corresponds to the density of the object. In single photon emission computed tomography (SPECT), the physical quantity is the concentration of a radioactive tracer injected into the 3-D object (the patient).
Dependence Analysis and Architecture Design for Bit-Level Algorithms
Authors: Weijia Shang, Benjamin W. Wah
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

In designing application-specific bit-level architectures and in programming existing bit-level processor arrays, it is necessary to expand a word-level algorithm into its bit-level form before dependence analysis can be performed. In this paper, we consider dependence structures of bit-level algorithms as functions of three componentsdependence structures of word-level algorithms, dependence structures of the arithmetic algorithms implementing word-wise operations, and algorithm expansions. Based on these components, we can derive dependence structures of bit-level algorithms without using time consuming general dependence analysis methods. To illustrate our approach, we derive two dependence structures for bit-level matrix multiplication and apply a method developed earlier [5,6,10] to design two bit-level architectures. One of these architectures is O{p) times faster than the best word-level architecture, where p is the word length. The speedup we found here is true in general because a bit in a bit-level architecture goes to the next processor for processing as soon as it is available.
Bootstrap FDA for counting positives accurately in imprecise environments
Authors: Jigang Xie, Zhengding Qiu, Zhenjiang Miao, Yanqiang Zhang
Venue: Pattern Recognition (2007)

Many real-world classification tasks involve discriminations between two unbalanced classes in imprecise environments, in which either the training data do not represent a random sample of the target population or the class distribution may shift over time in the target population. In such situations, in order to minimize the misclassification costs, the class distribution in target population must be known for selecting the optimal threshold. Forman has presented a method, based on the distribution generated on training data and the distribution on unlabeled test data, for estimating the number of positives in target population. However, when the data size is small, it is difficult to reliably generate these distributions for estimating the number of positives. This paper presents a novel algorithm to generate these distributions based on the bootstrap and Fisher discriminant analysis. Experiment results on five UCI data sets demonstrate its effectiveness.
A Gesture Interface for Radiological Workstations
Authors: Brian S. Tani, Rafael S. Maia, Aldo von Wangenheim
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

We discuss the use of glove-driven interface in radiological workstations and present a prototype that aims to integrate common functions such as virtual manipulation and navigation control, with a basic gesture interface. The fast rate of and numerical data acquired by glove-driven interfaces, allows a much broader set of functionalities to be implemented in a highly demanding tridimensional visualization application. The prototype provides the basic gesture interface using a 5DT DataGlove5 Ultra and a Flock of Birds tracker, combining independent hand posture and trajectory recognition to send command messages to the host application. Using a synchronized state machine in the host application and the prototype, the gestures can activate special menus, and call up specific function or screens.
An algorithm for distributing coalitional value calculations among cooperating agents
Authors: Talal Rahwan, Nicholas R. Jennings
Venue: Artificial Intelligence (2007)

The process of forming coalitions of software agents generally requires calculating a value for every possible coalition which indicates how beneficial that coalition would be if it was formed. Now, instead of having a single agent calculate all these values (as is typically the case), it is more efficient to distribute this calculation among the agents, thus using all the computational resources available to the system and avoiding the existence of a single point of failure. Given this, we present a novel algorithm for distributing this calculation among agents in cooperative environments. Specifically, by using our algorithm, each agent is assigned some part of the calculation such that the agents' shares are exhaustive and disjoint. Moreover, the algorithm is decentralized, requires no communication between the agents, has minimal memory requirements, and can reflect variations in the computational speeds of the agents. To evaluate the effectiveness of our algorithm, we compare it with the only other algorithm available in the literature for distributing the coalitional value calculations (due to Shehory and Kraus). This shows that for the case of 25 agents, the distribution process of our algorithm took less than 0.02% of the time, the values were calculated using 0.000006% of the memory, the calculation redundancy was reduced from 383229848 to 0, and the total number of bytes sent between the agents dropped from 1146989648 to 0 (note that for larger numbers of agents, these improvements become exponentially better).
Multitime frequency classifiers for neighboring modulations in a multiplicative noise environment
Authors: G. Gelle
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

This communication presents two new classification algorithms based on time varying higher order statistics (TVHOS). These two algorithms benefit from the advantageous localization properties provided by TVHOS4 for instantaneous frequency laws disrupted by multiplicative noise. The classification scheme used is a bank of several normalized TVHOS4 correlators. Simulations illustrate successful performance of the classification algorithms for different situations and especially if the SNR is higher than -7 dB.
Predictors of women's entry into engineering: why academic preparation is not sufficient
Authors: S. Blaisdell
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

Women and minorities continue to be underrepresented in engineering. Betz and Hackett (1981) suggested that women's socialization provides them with less exposure to the information that allows individuals to develop self-efficacy for traditionally male occupations. This social cognitive hypothesis proposes that low self-efficacy for the tasks required to enter and succeed in engineering is the primary reason women and minorities continue to be underrepresented in engineering. The present study used a social cognitive framework and structural equation modeling to determine what factors predict the intentions of male and female high school students to pursue engineering majors in college. Preliminary data indicate that in order to increase the likelihood of a high school student planning on an engineering career, efforts should be focused on the student gaining quality mathematical and science experiences, exposure to engineering role models and a special emphasis must be made with respect to recruiting women into engineering.
Quantum Computing Is Exciting and Important--Really!
Authors: Charles Day
Venue: Computing in Science and Engineering (2007)

Columnist Charles Day describes the latest in quantum computing.
Perfect reconstructing nonlinear filter banks
Authors: D. A. F. Florencio
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Perfect reconstruction (PR) filter banks have found numerous applications, and have received much attention in the literature. For linear filter banks, necessary and sufficient conditions for PR have been established for most practical situations. Recently, nonlinear filter banks have been proposed for image coding applications. These filters are generally simple, and produce better results than linear filters of same complexity. Nevertheless, the lack of general PR conditions limits these filters to cases where one of the filters is the identity. In this paper, we present a framework that allows, for the first time, the design of PR nonlinear filter banks including (non-trivial) filters on all channels. Although the framework does not include all nonlinear PR filter banks, it does include all previously published nonlinear filter banks, as well as all linear ones. This framework suggest new possibilities for the design of nonlinear PR filter banks.
Phase retrieval of images from zeros of even unwrapped signals
Authors: S. Petroudi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The 2D discrete phase retrieval problem is to reconstruct an image defined at integer coordinates and having a known finite spatial extent from the magnitude of its discrete Fourier transform. Most methods for solving this problem are iterative but not POCS, and they tend to stagnate. Recently, we developed a new approach that unwrapped the 2D problem into a 1D problem with bands of zeros in it, using the Good-Thomas FFT (see Petroudi, S. and Yagle, A.E., Proc. ICASSP, 2000). However, this approach reconstructed the even part of the image much better than the odd part, and it was sensitive to the zero locations. This paper presents a modification of this approach. New features include: (1) an overdetermined problem less sensitive to the zero locations; (2) the solution of a Toeplitz-block-Toeplitz-plus-Hankel-block-Hankel linear system; and (3) details of characteristics of images for which the approach works best.
Multiplexing for Optimal Lighting
Authors: Yoav Y. Schechner, Shree K. Nayar
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Imaging of objects under variable lighting directions is an important and frequent practice in computer vision, machine vision, and image-based rendering. Methods for such imaging have traditionally used only a single light source per acquired image. They may result in images that are too dark and noisy, e.g., due to the need to avoid saturation of highlights. We introduce an approach that can significantly improve the quality of such images, in which multiple light sources illuminate the object simultaneously from different directions. These illumination-multiplexed frames are then computationally demultiplexed. The approach is useful for imaging dim objects, as well as objects having a specular reflection component. We give the optimal scheme by which lighting should be multiplexed to obtain the highest quality output, for signal-independent noise. The scheme is based on Hadamard codes. The consequences of imperfections such as stray light, saturation, and noisy illumination sources are then studied. In addition, the paper analyzes the implications of shot noise, which is signal-dependent, to Hadamard multiplexing. The approach facilitates practical lighting setups having high directional resolution. This is shown by a setup we devise, which is flexible, scalable, and programmable. We used it to demonstrate the benefit of multiplexing in experiments.
Violation of Local Realism for Ququats
Authors: Paolo Traina
Venue: Open Systems Information Dynamics (2007)

Conclusive experimental tests of local realism deserve a minimum quantum efficiency in order to close detection loophole. This efficiency depends on the considered observables, on the specific Bell inequality chosen and on the dimension of the quantum objects observed. In this paper, we numerically analyse some quantum mechanics predictions on local realism for qubits, qutrits and ququats and we suggest a system to produce ququats maximally violating Bell-CGLMP inequality.
Optimal Crosstalk Shielding Insertion along On-Chip Interconnect Trees
Authors: Boyan Semerdjiev, Dimitrios Velenis
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Scaling of the on-chip feature size down into the deep submicron range has emphasized the importance of interconnect delay variations due to capacitive coupling. A methodology for reducing crosstalk noise on tree-structured interconnects is proposed in this paper. An algorithm is implemented to compute the optimal sequence of shielding insertion along a capacitively coupled interconnect tree. The reduction in crosstalk is verified through simulation and compared to alternative shielding schemes, considering the availability of limited shielding resources. It is demonstrated that the reduction in interconnect delay variations achieved by the proposed methodology is consistently higher. Furthermore, it is shown that delay variations between two critical nodes in a tree can also be reduced by the same shielding insertion approach.
Digitizing & providing access to contextual cultural materials: the liner notes digitization project
Authors: Megan Winget
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

This paper describes a digitization project focused on developing a metadata modeling schema for album liner notes.
Towards scalable ontology engineering patterns: lessons learned from an experiment based on W3C's part-whole guidelines
Authors: Laurent Lefort, Kerry Taylor, David Ratcliffe
Venue: Proceedings of the second Australasian workshop on Advances in ontologies - Volume 72 (2006)

This paper presents an empirical evaluation of description logic reasoners to support the selection of scalable ontology engineering patterns for TBox reasoning. Our main objective is to define the rationale behind the design decisions required for the generation of large ontologies with XSLT-based tools. We discuss here the outcomes of an experiment focusing on aircraft components and parts for which we have implemented the ontology design guidelines for part-whole relationships published by W3C's Semantic Web best practices working group. We have worked with the following reasoners, being the best state-of-the-art currently available: FaCT++, RACER, Pellet and CEL. We found considerable variation in reasoner performance and have attempted to characterise the factors that distinguish the reasoners to enable a best-practice design style to be successfully applied for the generation of very large ontologies.
Interactive presentation: Impact of description language, abstraction layer, and value representation on simulation performance
Authors: Wolfgang Ecker, Volkan Esen, Lars Schönberg, Thomas Steininger, Michael Velten, Michael Hull
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

In recent years other verification features than simulation performance such as robustness and debugging gained increasing impact on simulation language and tool selection. However, fastest model execution speed is still priority number one for many design and verification engineers. This can be seen in the continuously growing interest in virtual prototypes and transaction level modeling (TLM). As part of the ongoing re-work modeling language strategies and the world wide introduction of TLM, a detailed analysis of the impact of description languages, abstraction layers and data types on simulation performance is of high importance. For the presented analysis, we considered five designs that have been modeled in VHDL, Verilog, System Verilog, and SystemC, using different value representations and coding styles, covering the abstraction levels from functional to behavioral to RTL. This paper presents our evaluation environment and several interesting findings of our analysis. The most important results are as follows: We found that HDL tool/language/abstraction selection of RTL models impacts on the execution speed with a factor of 4.4. We found that Verilog is on average 2x faster than VHDL for RTL models. We found that SystemC results in 10x slower RTL models than HDLs and surprisingly results in 2.6x slower TLM1 PV models than System Verilog. And we found finally that on average over all analyzed aspects SystemVerilog models are executed fastest.
A formal Framework for Trust management of Service-oriented Systems
Authors: Liang Zhengping, Liu Xiaoli, Wu Guoqing, Yang Min, Zhang Fan
Venue: Proceedings of the IEEE International Conference on Service-Oriented Computing and Applications (2007)

Service oriented software development takes service, which is a well-defined function unit and can be purchased from web, as the atomic entity for building software applications. Whereas, considering the particular characteristics of service, the trustworthiness of the service and service oriented applications needs to gain more attentions. In this paper we propose a trust framework for designing trustworthy service oriented applications, including service selection and service behavior monitoring. We use quantitative trust degree model for service selection and monitoring agents for the behavior surveillance. The formalized model of the service oriented application is also described. By using the formalization the formal verification, such as integrity of the design, the correctness and consistency of the implementation and so on, can be performed. In the end, an example is illustrated to demonstrate the details of the design process and formal analysis of the trust framework.
The effect of structured uncertainty in multichannel feedforward control systems
Authors: A. Omoto
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

The algorithms used for adaptive feedforward control often require a model of the acoustic plant being controlled to update the signals driving the secondary sources. This paper describes the effect of practically realistic plant estimation errors on the stability and performance of such a control algorithm. We have considered the structured plant errors due to changes in the error sensors location, changes in the secondary sources location and drift in the excitation frequency. These errors have very different effects on the stability and performance of the control system. The characteristics of each types of plant error are examined by singular value decomposition of the transfer matrix.