ppxscal/embedding_network huggingface dataset:
Spectral rounding and image segmentation
Authors: Gary L. Miller, Robert T. Collins
Venue:  (2006)

The task of assigning labels to pixels is central to computer vision. In automatic segmentation an algorithm assigns a label to each pixel where labels connote a shared property across pixels (e.g. color, bounding contour, texture). Recent approaches to image segmentation have formulated this labeling task as partitioning a graph derived from the image. We use spectral segmentation to denote the family of algorithms that seek a partitioning by processing the eigenstructure associated with image graphs. In this thesis we analyze current spectral segmentation algorithms and explain their performance, both practically and theoretically, on the Normalized Cuts (NCut) criterion. Further, we introduce a novel family of spectral graph partitioning methods, spectral rounding, and apply them to image segmentation tasks. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the prescribed number of components. At each iteration a small number of eigenvectors with small eigenvalue are computed and used to determine the reweighting. In this way spectral rounding directly produces discrete solutions where as current spectral algorithms must map the continuous eigenvectors to discrete solutions by employing a heuristic geometric separator (e.g. k-means). We show that spectral rounding compares favorably to current spectral approximations on the NCut criterion in natural image segmentation. Quantitative evaluations are performed on multiple image databases including the Berkeley Segmentation Database. These experiments demonstrate that segmentations with improved NCut value (obtained using the SR-Algorithm) are more highly correlated with human hand-segmentations.
Implementation and Performance of a M-ary PSK and QAM-OFDM System in a TMS320VC5416 Digital Signal Processor
Authors: Hen-Geul Yeh, Victor R. Ramirez
Venue: Proceedings of the Second International Conference on Digital Telecommunications (2007)

This paper presents the implementation results of an M-ary PSK and QAM OFDM system via algorithms and simulations. It shows how an OFDM system performance can be affected and/or improved based on the algorithms used. Furthermore, it illustrates that the DSP software-based system is flexible and interoperable for different modulation with different data rate. The performance of the implemented OFDM system is evaluated in three areas: the Bit Error Rate (BER) versus Eb/No, the processing speed versus data transmitted per OFDM symbol length, and the processing speed versus the M-ary PSK or QAM modulation scheme. This is done by using several types of FFT (radix-2 and split-radix) algorithms and modulation schemes (BPSK, QPSK, 16-QAM, and 64-QAM). The implementation is done in Matlab and in the DSP TMS320VC5416 Code Composer Studio (CCS).
An Event-Driven Architecture for Fine Grained Intrusion Detection and Attack Aftermath Mitigation
Authors: Jianfeng Peng, Chuan Feng, Haiyan Qiao, Jerzy Rozenblit
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

In today's computing environment, unauthorized accesses and misuse of critical data can be catastrophic to personal users, businesses, emergency services, and even national defense and security. To protect computers from the ever-increasing threat of intrusion, we propose an event-driven architecture that provides fine grained intrusion detection and decision support capability. Within this architecture, an incoming event is scrutinized by the Subject-Verb- Object multipoint monitors. Deviations from normal behavior detected by SVO monitors will trigger different alarms, which are sent to subsequent fusion and verification modules to reduce the false positive rate. The system then performs impact analysis by studying real-time system metrics, collected through the Windows Management Instrumentation interface. We add to the system the capability to assist the administrator in taking effective actions to mitigate the aftermath of an intrusion.
Orientation histogram-based matching for region tracking
Authors: David Marimon, Touradj Ebrahimi
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

A region tracking technique with particular emphasis on rotation robustness is presented. It is based on region matching divided in two consecutive steps, gradient orientation histogram matching and template matching through Normalised Cross Correlation (NCC). Given the orientation histograms of two image patches, a novel technique is used to estimate the rotation between them together with the similarity. This estimation enhances the performance and speeds-up the process of patch recognition. Fast computation of histograms using the integral histogram approach [9] is exploited. Experiments show a high accuracy in the estimation of location and orientation.
Feature extraction using non-linear transformation for robust speech recognition on the Aurora database
Authors: S. Sharma
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

We evaluate the performance of several feature sets on the Aurora task as defined by ETSI. We show that after a non-linear transformation, a number of features can be effectively used in a HMM-based recognition system. The non-linear transformation is computed using a neural network which is discriminatively trained on the phonetically labeled (forcibly aligned) training data. A combination of the non-linearly transformed PLP (perceptive linear predictive coefficients), MSG (modulation filtered spectrogram) and TRAP (temporal pattern) features yields a 63% improvement in error rate as compared to baseline me frequency cepstral coefficients features. The use of the non-linearly transformed RASTA-like features, with system parameters scaled down to take into account the ETSI imposed memory and latency constraints, still yields a 40% improvement in error rate.
Assessment of student understanding using on-line discussion groups
Authors: T. L. Hein
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

The computer and other technologies (i.e. the Internet, the World Wide Web, and various types of groupware) are currently being aggressively used by many educators as a tool in the learning process. As a result, a critical question has emerged. How can student understanding be effectively assessed when learning occurs using these new technological venues? This paper presents a critical look at how one technology, specifically online discussion groups, can be utilized to assess student understanding. This paper summarizes the results from a pilot study conducted at American University during the spring 1998 semester using an online discussion group with students in an introductory physics class. Finally, the results of a survey given to participating students are presented.
A System to Test the Performance of RFID-Tagged Objects
Authors: Hugo Mallinson, Steve Hodges, Alan Thorne
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

A system is described which has been developed to assess how well RFID-tagged products can be read with various positionings of the tag on the product face. The system can search the entire product surface and provide a measure of tag performance in any location, allowing also for variation in the position of the reader antenna. Simulation of moving products is also possible. Results are shown.
Vendors Fight Spam's Sudden Rise
Authors: Neal Leavitt
Venue: Computer (2007)

As spam levels continue to rise at unprecedented rates, antispam vendors have increased their efforts to offer ways to recognize and filter out, quarantine, or mark unsolicited e-mail as a potential problem.
Hip2Norm: An object-oriented cross-platform program for 3D analysis of hip joint morphology using 2D pelvic radiographs
Authors: G. Zheng, M. Tannast, C. Anderegg, K. A. Siebenrock, F. Langlotz
Venue: Computer Methods and Programs in Biomedicine (2007)

We developed an object-oriented cross-platform program to perform three-dimensional (3D) analysis of hip joint morphology using two-dimensional (2D) anteroposterior (AP) pelvic radiographs. Landmarks extracted from 2D AP pelvic radiographs and optionally an additional lateral pelvic X-ray were combined with a cone beam projection model to reconstruct 3D hip joints. Since individual pelvic orientation can vary considerably, a method for standardizing pelvic orientation was implemented to determine the absolute tilt/rotation. The evaluation of anatomically morphologic differences was achieved by reconstructing the projected acetabular rim and the measured hip parameters as if obtained in a standardized neutral orientation. The program had been successfully used to interactively objectify acetabular version in hips with femoro-acetabular impingement or developmental dysplasia. Hip^2Norm is written in object-oriented programming language C++ using cross-platform software Qt (TrollTech, Oslo, Norway) for graphical user interface (GUI) and is transportable to any platform.
Empirical Performance Evaluation of Adaptive Routing in Necklace Hypercubes: A Comparative Study
Authors: S. Meraji, A. Nayebi, H. Sarbazi-Azad
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

The necklace hypercube network has recently been introduced as an attractive alternative to the well-known hypercube. Previous research on this network topology has mainly focused on topological properties and VLSI aspects of this network. In this paper, we propose some adaptive routing algorithm for the necklace hypercubes. The performance of necklace hypercubes using the proposed routing algorithm is then evaluated by means of simulation experiments. Experiments are realized under different working loads and for different network factors. Moreover, a comparison between the necklace hypercube and the well-known hypercube network is conducted. The comparison has been done considering implementation constraints including constant pin-out and constant bisection band-width constraints.
HVS based wavelet watermarking with bit data embedded in color images
Authors: M. Saito, M. Kino, S. Wada
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

In this paper, a wavelet-based perceptual watermarking considering human visual system (HVS) that is proposed by Barni et al. (see IEEE Trans. Image Processing., vol.10, no.5, p.783-791, 2001) for monotone images without embedding bit data is extended. In our method, an arbitrary length of bit data (binary pattern) can be embedded in brightness component of color images still keeping the perceptual quality of image. Pseudo random number (PN) sequence is introduced as a key to produce a watermarking code. The availability increases compared with the conventional methods. The robustness of our computationally efficient watermark extraction method to the attacks such as JPEG compression, cropping and color tone modification is shown in simulations.
The Fractal Nature of Web Services
Authors: Christoph Bussler
Venue: Computer (2007)

Applying SOA concepts to the runtime structure can be problematic.
Understanding Execution Traces Using Massive Sequence and Circular Bundle Views
Authors: Bas Cornelissen, Danny Holten, Andy Zaidman, Leon Moonen, Jarke J. van Wijk, Arie van Deursen
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

The use of dynamic information to aid in software understanding is a common practice nowadays. One of the many approaches concerns the comprehension of execution traces. A major issue in this context is scalability: due to the vast amounts of information, it is a very difficult task to successfully find your way through such traces without getting lost. In this paper, we propose the use of a novel trace visualization method based on a massive sequence and circular bundle view, constructed with scalability in mind. By means of three usage scenarios that were conducted on three different software systems, we show how our approach, implemented in a tool called EXTRAVIS, is applicable to the areas of trace exploration, feature location, and feature comprehension.
Minitrack Introduction: Human-Computer Interaction (HCI) Minitrack
Authors: Joseph S. Valacich, John D. Wells
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The Human-Computer Interaction (HCI) minitrack provides a forum for HCI researchers to exchange a broad and comprehensive range of issues related to the design, development, and assessment of human-computer interaction. Papers selected for the HCI minitrack draw on a broad range of research methodologies including developmental, conceptualization, theorization, and experimentation to name a few. Given the fast pace of change within the HCI arena (e.g., new applications, new types of users, new types of devices, and so on), it is our hope that the papers presented in this minitrack will prove interesting and relevant to both the academic and practitioner communities.
An Adaptive and Efficient Design and Implementation for Meteorology Data Grid Using Grid Technology
Authors: Imran Rao, EuiNam Huh, SangBoem Lim
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Grid technologies not only provide the infrastructure to collaborate among virtual organizations to share heterogeneous resources but also provide a service oriented paradigm for business and social software development. In this paper, we present an agent based efficient and adaptive design for our meteorological data portal system, called Meteo-Data Grid and its implementation using Grid technology. Our adaptive agent based approach analyzes the workload and then invoke or revoke agents using factory design pattern to process the data files of gigabyte scale. We also investigated the suitability of Grid technologies for a portal based data management system in comparison with currently available Web technologies, namely Web services and Java servlets and evaluated their performance in terms of response time to retrieve varying amount of data from database and serve to GridSphere portlet. Our experiments results show that to serve large scale of data, Grid services are much faster as compared to Web services and Java servlets.
Non-conventional application of robust matched-field localization: small aperture array and mid-frequency signals
Authors: B. F. Harrison
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

Conventional applications of matched-field processing (MFP) use large aperture vertical arrays and low frequency signals. It is well known that MFP's sensitivity to environmental mismatch is proportional to the frequency. Thus, real-world application of MFP to mid-frequency signals, e.g., 800/spl sim/3000 Hz, is generally regarded a very difficult problem. Using small aperture vertical arrays can also compromise the performance of MFP. However, small aperture vertical arrays are more practical for real-world scenarios. In this paper, we propose the broadband L/sub /spl infin//-norm estimator for robust broadband matched-field localization of mid-frequency signals received on extremely small aperture vertical arrays. Results using a simulated Gulf of Mexico environment for broadband signals (1000-3000 Hz) received on a 3-meter vertical array demonstrate the significant performance gains in using the L/sub /spl infin//-norm estimator over the asymptotically-optimal maximum a posteriori estimator in the presence of finite environmental sampling.
RF Digital Signal Generation Beyond Nyquist
Authors: Marcelo Negreiros, Adao Souza Jr., Luigi Carro, Altamiro Amadeu Susin
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

This paper discusses low cost RF signal generation for BIST, using only digital circuits. One major problem is the range of frequencies that can be achieved by any digital signal generator, since the Nyquist limit is the clock frequency divided by 2 (FS/2). The proposed method uses the images of the signal in order to reach frequencies beyond FS/2. Different digital signal generation techniques for RF and their limitations are addressed as well as their impact in the framework of analog RF BIST. Experimental results and comparisons are provided using a gigabit transceiver.
Tagging video: conventions and strategies of the YouTube community
Authors: Gary Geisler, Sam Burns
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

This poster summarizes the results from a quantitative analysis of the tags and associated metadata used to describe more than one million videos by 537,246 contributors at the YouTube video sharing site. Results from this work suggest methodological and design considerations that could enhance the effectiveness of sharing within communities devoted to online video.
Mentor programme in digital creativity
Authors: H. Andersson
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

In 1999, Chalmers Medialab initiated a voluntary mentor programme for students with a special interest in digital media. The purpose of the programme is to enhance the students' skills within the field, to recognize the value of student competencies, and to identify and promote good ideas. The students work in interdisciplinary projects and have access to high-end research equipment. Thorough documentation ensures process tracking and side-effect management. Participation in the programme is a strong additional qualification, and interest from industry is great.
WCTAnalyze--Collecting, Indexing, Accessing and Visualizing Temporally Indexed Textual Resources
Authors: Sebastian Gottwald, Gerhard Heyer, Matthias Richter, Peter Walde
Venue: Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (2007)

We present WCTAnalyze, a novel tool for accessing and visually analyzing huge collections of temporally indexed textual data. It is motivated by applications such as media resonance analysis, business intelligence etc. that need to perform high level analytics on top of linguistically and statistically processed unstructured textual data.
Content-based video indexing of TV broadcast news using hidden Markov models
Authors: S. Eickeler
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

This paper presents a new approach to content-based video indexing using hidden Markov models (HMMs). In this approach one feature vector is calculated for each image of the video sequence. These feature vectors are modeled and classified using HMMs. This approach has many advantages compared to other video indexing approaches. The system has automatic learning capabilities. It is trained by presenting manually indexed video sequences. To improve the system we use a video model, that allows the classification of complex video sequences. The presented approach works three times faster than real-time. We tested our system on TV broadcast news. The rate of 97.3% correctly classified frames shows the efficiency of our system.
A new real-zero conversion algorithm
Authors: R. Kumaresan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The odd-order real zeros of a real-valued signal, s(t), correspond to its conventional or overt zero-crossings. The overt zero-crossings can be easily determined. But the complex zeros of s(t) are not easy to determine. This suggests the possibility of converting s(t) by using some invertible transformation, into a different signal, whose real zero-crossings alone determine s(t) completely. This process is known as real-zero conversion. The real zero-crossings of the transformed signal are termed covert zero-crossings (CoZeCs). Currently known real-zero conversion algorithms are impractical. In this paper we present a new adaptive algorithm for converting a band-pass signal into a pair of signals whose real zero-crossings essentially determine its envelope (up to a scale factor) and phase (up to a frequency translation).
Wideband speech coding with toll quality based on IA-model
Authors: R. V. Cox
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We propose an instantaneous amplitude (IA) based model for speech signal representation. This can avoid the difficulty in dealing with the time-varying phases and allows us to perform an optimization procedure easily such that the synthetic signal can be made as close to the original one as possible. A simplified frequency picking algorithm is derived to shorten the processing time while still maintaining the quality of the synthetic speech. Experiments show that the synthetic speech with the developed technique is of toll quality and almost perceptually indistinguishable from the original speech. Initial work on the coding of the parameters, for a 16 kHz sampled speech, for the IA model is done and a toll quality synthesized speech at a bit rate of 40 kbps is achieved.
A MATLAB software tool for the introduction of speech coding fundamentals in a DSP course
Authors: E. Painter
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

A MATLAB educational simulation program was developed to explore and understand standardized speech coding algorithms such as the FS-1015 LPC-10e, the FS-1016 CELP, the ETSI GSM, the IS-54 VSELP, the G.721 ADPCM, and the G.728 LD-CELP algorithms. The simulation software provides an interactive environment that allows users to display time- and frequency-domain representations of input and reconstructed speech on an IBM PC compatible equipped with a standard sound card. Scores associated with subjective and objective performance measures are computed using simulation tools. This tool is used in undergraduate and graduate DSP courses to introduce speech coding fundamentals.
Variably interprocedural program analysis for runtime error detection
Authors: Aaron Tomb, Guillaume Brat, Willem Visser
Venue: Proceedings of the 2007 international symposium on Software testing and analysis (2007)

This paper describes an analysis approach based on a of static and dynamic techniques to ?nd run-time errors in Java code. It uses symbolic execution to ?nd constraints under which an error (e.g. a null pointer dereference, array out of bounds access, or assertion violation) may occur and then solves these constraints to ?nd test inputs that may expose the error. It only alerts the user to the possibility of a real error when it detects the expected exception during a program run. The analysis is customizable in two important ways. First, we can adjust how deeply to follow calls from each top-level method. Second, we can adjust the path termination tion for the symbolic execution engine to be either a bound on the path condition length or a bound on the number of times each instruction can be revisited. We evaluated the tool on a set of benchmarks from the literature as well as a number of real-world systems that range in size from a few thousand to 50,000 lines of code. The tool discovered all known errors in the benchmarks (as well as some not previously known) and reported on average 8 errors per 1000 lines of code for the industrial examples. In both cases the interprocedural call depth played little role in the error detection. That is, an intraprocedural analysis seems adequate for the class of errors we detect.