ppxscal/embedding_network huggingface dataset:
A Dynamic Associative Processor for Machine Vision Applications
Authors: Frederick P. Herrmann, Charles G. Sodini
Venue: IEEE Micro (1992)

The use of massively parallel associative processors as coprocessors for accelerating machine vision applications is considered. They achieve very fine granularity, as every word of memory functions as a simple processing element. A dense, dynamic, content-addressable memory cell supports fully parallel operation, and pitch-matched word logic improves arithmetic performance with minimal area cost. An asynchronous reconfigurable mesh network handles interprocessor communication and image input/output, and an area-efficient pass-transistor circuit counts and prioritizes responders. Some applications are discussed.
Test-Case Generation from Prolog-Based Specifications
Authors: Richard Denney
Venue: IEEE Software (1991)

Automatic test-case generation from Prolog specifications encounters problems due to recursion, evaluable predicates, and term ordering. A metainterpreter that controls recursion by using a deterministic automaton to monitor its progress through the specification is presented. The automaton is also used to define which paths through the specification are to be used as test cases, so the metainterpreter can compare where it is, with where it needs to go. The efficacy of the approach in dealing with evaluable predicates and term ordering problems is also examined.
Optimal Algorithms on the Pipelined Hypercube and Related Networks
Authors: J. JáJá, K. W. Ryu
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Parallel algorithms for several important combinatorial problems such as the all nearest smaller values problem, triangulating a monotone polygon, and line packing are presented. These algorithms achieve linear speedups on the pipelined hypercube, and provably optimal speedups on the shuffle-exchange and the cube-connected-cycles for any number p of processors satisfying 1>or=p>or=n/((log/sup 3/n)(loglog n)/sup 2/), where n is the input size. The lower bound results are established under no restriction on how the input is mapped into the local memories of the different processors.
An HMM-Based Segmentation Method for Traffic Monitoring Movies
Authors: Jien Kato, Toyohide Watanabe, Sébastien Joga, Jens Rittscher, Andrew Blake
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

Shadows of moving objects often obstruct robust visual tracking. We propose an HMM-based segmentation method which classifies in real time each pixel or region into three categories: shadows, foreground, and background objects. In the case of traffic monitoring movies, the effectiveness of the proposed method has been proven through experimental results.
Native Data Representation: An Efficient Wire Format for High-Performance Distributed Computing
Authors: Greg Eisenhauer, Fabián E. Bustamante, Karsten Schwan
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

New trends in high-performance software development such as tool- and component-based approaches have increased the need for flexible and high-performance communication systems. When trying to reap the well-known benefits of these approaches, the question of what communication infrastructure should be used to link the various components arises. In this context, flexibility and high-performance seem to be incompatible goals. Traditional HPC-style communication libraries, such as MPI, offer good performance, but are not intended for loosely-coupled systems. Object- and metadata-based approaches like XML offer the needed plug-and-play flexibility, but with significantly lower performance. We observe that the flexibility and baseline performance of data exchange systems are strongly determined by their wire formats, or by how they represent data for transmission in heterogeneous environments. After examining the performance implications of using a number of different wire formats, we propose an alternative approach for flexible high-performance data exchange, Native Data Representation, and evaluate its current implementation in the Portable Binary I/O library.
Estimating the Intrinsic Dimension of Data with a Fractal-Based Method
Authors: Francesco Camastra, Alessandro Vinciarelli
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

In this paper, the problem of estimating the intrinsic dimension of a data set is investigated. A fractal-based approach using the Grassberger-Procaccia algorithm is proposed. Since the Grassberger-Procaccia algorithm performs badly on sets of high dimensionality, an empirical procedure that improves the original algorithm has been developed. The procedure has been tested on data sets of known dimensionality and on time series of Santa Fe competition.
Incremental Switch-Level Analysis
Authors: Derek L. Beatty, Randal E. Bryant
Venue: IEEE Design Test (1988)

An algorithm is presented for extracting a two-level subnetwork hierarchy from flat netlists. They discuss the application of this algorithm to incremental circuit analysis in the Cosmos compiled switch-level simulator. The algorithm decreases the network preprocessing time for Cosmos by nearly an order of magnitude. The file system is used as a large hash table that retains information over many executions of the incremental analyzer. The hierarchy-extraction algorithm computes a hash signature for each subnetwork by coloring vertices somewhat the way wirelist-comparison programs do. It then identifies duplicates, using standard hash-table techniques.
A Tool to Coordinate Tools
Authors: Roberto Bisiani, François Lecouat, Vincenzo Ambriola
Venue: IEEE Software (1988)

An expert-system planner is presented to automate the clerical and routine activities associated with software development using present-day environments such as Unix. The three functions of such a planner-coordination of tools, integration of tools, and representation of objects-are examined. The planner is described from both the user's and the designer's viewpoint. The functionality provided by this planner is compared with that provided by standard environments.
Object-Oriented Development at Brooklyn Union Gas
Authors: John Davis, Tom Morgan
Venue: IEEE Software (1993)

The application architecture, development environment, and performance of the object-oriented customer-related information system (CRIS-II) are discussed. It is shown that CRIS-II's implementation in a Smalltalk-like execution environment with object-oriented features lessened coupling between components, compared with other object systems. The system accommodates many traditional, non-object-oriented components such as a relational database manager, an online transaction manager, a batch report writer, and a user-interface dialog manager. A technical description of CRIS-II is presented. Experiences with CRIS-II relating to code reuse and system behavior are reviewed.
Optic Flow Field Segmentation and Motion Estimation Using a Robust Genetic Partitioning Algorithm
Authors: Yan Huang, Kannappan Palaniappan, Xinhua Zhuang, Joseph E. Cavanaugh
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

Optic flow motion analysis represents an important family of visual information processing techniques in computer vision. Segmenting an optic flow field into coherent motion groups and estimating each underlying motion is a very challenging task when the optic flow field is projected from a scene of several independently moving objects. The problem is further complicated if the optic flow data are noisy and partially incorrect. In this paper, we present a novel framework for determining such optic flow fields by combining the conventional robust estimation with a modified genetic algorithm. The baseline model used in the development is a linear optic flow motion algorithm [38] due to its computational simplicity. The statistical properties of the generalized linear regression (GLR) model are thoroughly explored and the sensitivity of the motion estimates toward data noise is quantitatively established. Conventional robust estimators are then incorporated into the linear regression model to suppress a small percentage of gross data errors or outliers. However, segmenting an optic flow field consisting of a large portion of incorrect data or multiple motion groups requires a very high robustness that is unattainable by the conventional robust estimators. To solve this problem, we propose a genetic partitioning algorithm that elegantly combines the robust estimation with the genetic algorithm by a bridging genetic operator called self-adaptation.
Multiple Cuts with a Homogeneous Analytic Center Cutting Plane Method
Authors: Olivier Péton, Jean-Philippe Vial
Venue: Computational Optimization and Applications (2003)

This paper analyzes the introduction of multiple central cuts in a conic formulation of the analytic center cutting plane method (in short ACCPM). This work extends earlier work on the homogeneous ACCPM, and parallels the analysis of the multiple cut process in the standard ACCPM. The main issue is the calculation of a direction that restores feasibility after introducing p new cutting planes at the query point. We prove that the new analytic center can be recovered in O(p log &omega;p) damped Newton iterations, where &omega; is a parameter depending of the data. We also present two special cases where the complexity can be decreased to O (p log p). Finally, we show that the number of calls to the oracle is the same as in the single cut case, up to a factor \sqrt{p}.
Motion and Structure of Four Points from One Motion of a Stereo Rig with Unknown Extrinsic Parameters
Authors: Zhengyou Zhang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

We describe an analytical method for recovering 3D motion and structure of four or more points from one motion of a stereo rig. The extrinsic parameters are unknown. The motion of the stereo rig is also unknown. Because of the exploitation of information redundancy, the approach gains over the traditional ¿motion and structure from motion¿ approach in that less features and less motions are required, and thus more robust estimation of motion and structure can be obtained. Since the constraint on the rotation matrix is not fully exploited in the analytical method, nonlinear minimization can be used to improve the result. We propose to estimate directly the motion and structure by minimizing the difference between the measured positions and the predicted ones in the image plane. Both computer simulated data and real data are used to validate the proposed algorithm, and very promising results are obtained.
Parallelizing Programs with Recursive Data Structures
Authors: L. J. Hendren, A. Nicolau
Venue: IEEE Transactions on Parallel and Distributed Systems (1990)

A study is made of the problem of estimating interference in an imperative language with dynamic data structures. The authors focus on developing efficient and implementable methods for recursive data structures. In particular, they present interference analysis tools and parallelization techniques for imperative programs that contain dynamically updatable trees and directed acyclic graphs. The analysis methods are based on a regular-expression-like representation of the relationship between accessible nodes in the data structure. They authors have implemented their analysis, and they present some concrete examples that have been processed by this system.
A FAD for Data Intensive Applications
Authors: S. Danforth, P. Valduriez
Venue: IEEE Transactions on Knowledge and Data Engineering (1992)

FAD is a strongly typed database programming language designed for uniformly manipulating transient and persistent data on Bubba, a parallel database system developed at MCC. The paper provides an overall description of FAD, and discusses the design rationale behind a number of its distinguishing features. Comparisons with other database programming languages are provided.
Stability of Phase Information
Authors: D. J. Fleet, A. D. Jepson
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1993)

This paper concerns the robustness of local phase information for measuring image velocity and binocular disparity. It addresses the dependence of phase behavior on the initial filters as well as the image variations that exist between different views of a 3D scene. We are particularly interested in the stability of phase with respect to geometric deformations, and its linearity as a function of spatial position. These properties are important to the use of phase information, and are shown to depend on the form of the filters as well as their frequency bandwidths. Phase instabilities are also discussed using the model of phase singularities described by Jepson and Fleet. In addition to phase-based methods, these results are directly relevant to differential optical flow methods and zero-crossing tracking.
Event driven simulation without loops or conditionals
Authors: Peter M. Maurer
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

The past several years have seen much research in event driven logic simulation[1]. Various logic and delay models have been explored[2]. Most simulation research has focused on improving simulation performance. New approaches to both compiled and event driven simulation have been explored[3,4,5].The internal operations of event-driven simulators can be divided into two categories, scheduling, and gate simulation. Much effort has been focused on reducing the cost of scheduling[3,4,5]. There has also been effort to reduce the cost of gate simulation[6,7]. It has also been shown that explicit computation of gate outputs is unnecessary, as long as event-propagation is computed correctly[7].Even though research has reduced the complexity of both scheduling and gate simulation, it is still necessary to test for event propagation and cancellation, and it is necessary to perform some computations during gate simulation.This paper will show that none of these computations are necessary. Most computations are devoted testing internal states and computing new internal states. In our technique, subroutine addresses are used to maintain states. This permits the elimination of all state-testing and state-computation code. Our technique is significantly faster than conventional event-driven simulation[1]. Unlike earlier methods[7], our approach can easily be extended to any logic model or any delay model.
Class-Dependent Discretization for Inductive Learning from Continuous and Mixed-Mode Data
Authors: John Y. Ching, Andrew K. C. Wong, Keith C. C. Chan
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

Inductive learning systems can be effectively used to acquire classification knowledge from examples. Many existing symbolic learning algorithms can be applied in domains with continuous attributes when integrated with a discretization algorithm to transform the continuous attributes into ordered discrete ones. In this paper, a new information theoretic discretization method optimized for supervised learning is proposed and described. This approach seeks to maximize the mutual dependence as measured by the interdependence redundancy between the discrete intervals and the class labels, and can automatically determine the most preferred number of intervals for an inductive learning application. The method has been tested in a number of inductive learning examples to show that the class-dependent discretizer can significantly improve the classification performance of many existing learning algorithms in domains containing numeric attributes.
Comments on "Comparative Analysis of Backpropagation and the Extended Kalman Filter for Training Multilayer Perceptrons"
Authors: P. Sarat Chandran
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

In this note, the connection between the backpropagation algorithm and the extended Kalman filter is analyzed using an alternate form of representation for the Kalman gain term and shown to be much simpler than that reported by Ruck et al (1992).
Design of Microcontroller-Based EMG and the Analysis of EMG Signals
Authors: Nihal Fatma Güler, Fırat Hardalaç
Venue: Journal of Medical Systems (2002)

In this work, a microcontroller-based EMG designed and tested on 40 patients. When the patients are in rest, the fast Fourier transform (FFT) analysis was applied to EMG signals recorded from right leg peroneal region. The histograms are constructed from the results of the FFT analysis. The analysis results shows that the amplitude of fibrillation potential of the muscle fiber of 30 patients measured from peroneal region is low and the duration is short. This is the reason why the motor nerves degenerated and 10 patients were found to be healthy.
Algorithms for the Decomposition of Gray-Scale Morphological Operations
Authors: R. Jones, I. Svalbe
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

The choice and detailed design of structuring elements plays a pivotal role in the morphologic processing of images. A broad class of morphological operations can be expressed as an equivalent supremum of erosions by a minimal set of basis filters. Diverse morphological operations can then be expressed in a single, comparable framework. The set of basis filters are data-like structures, each filter representing one type of local change possible under that operation. The data-level description of the basis set is a natural starting point for the design of morphological filters. This paper promotes the use of the basis decomposition of gray-scale morphological operations to design and apply morphological filters. A constructive proof is given for the basis decomposition of general gray-scale morphological operations, as are practical algorithms to find all of the basis set members for these operations.
Notice of Errata
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

In the July 2002 issue of the IEEE Transactions on Parallel and Distributed Systems (TPDS) (vol. 13, no. 7), several of the papers contain errors in the figure captions for the papers. These papers are: "Lazy Garbage Collection of Recovery State for Fault-Tolerant Distributed Shared Memory" by F. Sultan, T.D. Nguyen, and L. Iftode, "Diagnosability of Crossed Cubes under the Comparison Diagnosis Model" by J. Fan, "Boosting the Performance of Myrinet Networks" by J. Filch, P. Lopez, M.P. Malumbres, and J. Duato, "Decentralized Resource Management for a Distributed Continuous Media Server" by C. Shahabi and F. Banaei-Kashani, "An Experimental Evaluation of I/O Optimizations on Different Applications" by M.A. Kandas-wamy, M. Kandemir, A. Choudhary, and D. Bernholdt, and "Integrated Performance Models for SPMD Applications and MIMD Architectures" by P. Cremonesi and C. Gennaro. Because of the nature of the errors, TPDS will be reprinting these papers in their entirety in this and upcoming issues. "Lazy Garbage Collection of Recovery State for Fault-Tolerant Distributed Shared Memory" and "Diagnosability of Crossed Cubes under the Comparison Diagnosis Model" appear in this issue of TPDS. "Boosting the Performance of Myrinet Networks" and "Decentralized Resource Management for a Distributed Continuous Media Server" will appear in the November 2002 issue and "An Experimental Evaluation of I/O Optimizations on Different Applications" and "Integrated Performance Models for SPMD Applications and MIMD Architectures" will appear in the December 2002 issue of TPDS. We apologize to the readers of TPDS and to the authors of these papers for any inconvenience caused by these errors.Note:Links are to the corrected versions of the papers, and are available without subscription.
A unified method for optimizing linear image restoration filters
Authors: Masashi Sugiyama, Hidemitsu Ogawa
Venue: Signal Processing (2002)

Image restoration from degraded images lies at the foundation of image processing, pattern recognition, and computer vision, so it has been extensively studied. A large number of image restoration filters have been devised so far. It is known that a certain filter works excellently for a certain type of original image or degradation. However, the same filter may not be suitable for other images, so the selection of filters is exceedingly important in practice. Moreover, if a filter includes adjustable parameters such as the regularization parameter or threshold, its restoration performance relies heavily on the choice of the parameter values. In this paper, we therefore discuss the problem of optimizing the filter type and parameter values. Our method is based on the subspace information criterion (SIC), which is an unbiased estimator of the expected squared error between the restored and original images. Since SIC is applicable to any linear filters, one can optimize the filter type and parameter values in a consistent fashion. Our emphasis in this article is laid on the practical concerns of SIC, such as the noise variance estimation, computational issues, and comparison with existing methods. Specifically, We derive an analytic form of the optimal parameter values for the moving-average filter, which will greatly reduce the computational cost. Experiments with the regularization filter show that SIC is comparable to existing methods in the small degradation case, and SIC tends to outperform existing methods in the severe degradation case.
On Circuits and Numbers
Authors: J. E. Vuillemin
Venue: IEEE Transactions on Computers (1994)

We establish new, yet intimate relationships between the 2-adic integers /sub 2/Z from arithmetics and digital circuits, both finite and infinite, from electronics. 1) Rational numbers with an odd denominator correspond to output only synchronous circuits. 2) Bit-wise 2-adic mappings correspond to combinational circuits. 3) Online functions /spl forall/n/spl isin/N,x/spl isinsub 2/Z:f(x)=f(xmodd2/sup n/)mod2/sup n/), correspond to synchronous circuits. 3) Continuous functions, /sub 2/Z/spl rarrsub 2/Z, correspond to circuits with output enable. The proof is obtained by constructing synchronous decision diagrams SDDs. They generalize to sequential circuits as classical BDD constructs do for combinational circuits. From simple identities over /sub 2/Z, we derive both classical and new bit-serial circuits for computing: {+,-,/spl times/,1/(1-2x), (1+8x)}. The correctness of each circuit directly follows from the 2-adic definition of the corresponding operator. All but the adders (+,-) above are infinite. Yet the use of reset signals reduces all previously infinite operators to finite circuits. The present work lays out the semantic basis of a new language for describing synchronous circuits. Language 2Z incorporates arithmetic synthesis for some of the above bit-serial operators, and for periodic binary constants (logic from chronograms). It also provides for the powerful deeply binding synchronous enable and reset operators, whose meaning is discussed.