ppxscal/embedding_network huggingface dataset:
Query by Image and Video Content: The QBIC System
Authors: Myron Flickner, Harpreet Sawhney, Wayne Niblack, Jonathan Ashley, Qian Huang, Byron Dom, Monika Gorkani, Jim Hafner, Denis Lee, Dragutin Petkovic, David Steele, Peter Yanker
Venue: Computer (1995)

Advances in scanning, networking, compression and video technology--and the proliferation of multimedia computers--have led to the generation of large on-line collections of images and videos. These collections have created a need for new methods to locate specific images or video clips. The Query by Image Content (QBIC) project is studying methods to extend and complement text-based retrievals by querying and retrieving images and videos by content. Queries can be performed using attributes such as colors, textures, shapes, and object position. Video-specific queries include those on camera motion parameters like zoom, pan, and object motion. The project has resulted in a prototype system with two major steps: database population and query. In population, methods identify objects in still images, segment videos into short sequences called shots, and compute features describing color, texture, shape, position, or motion information. In database query, images and shots can be retrieved by example ("Show me images similar to this image") or by selecting properties from pickers such as a color wheel, a sketched shape, a list of camera motions, or a combination of these. Key QBIC technical issues include a visual query language and a graphical user interface that lets users form a query by painting, sketching, or selecting graphical elements. Key also are indexing techniques for high-dimensional features describing image and video content, automatic segmentation techniques for images (to identify interesting objects), and videos (to identify shots and interesting moving and static objects), and similarity retrieval (to match human perception). QBIC technology has moved into the Ultimedia and Digital Library commercial IBM products.
Object-Oriented Systems
Authors: C. V. Ramamoorthy, Phillip C. Sheu
Venue: IEEE Expert: Intelligent Systems and Their Applications (1988)

The authors review object-oriented systems from the user's point of view and discuss problems that need solving. They describe how characteristic features of object-oriented systems can provide a foundation for various computational tasks. In particular, they address the impact of object models on programming environments, expert systems and databases. Although they use a relatively simple example for illustration, they believe that the same concepts and techniques can be applied to general applications. The authors also discuss related problems and highlight important research directions.
Analytic PCA Construction for Theoretical Analysis of Lighting Variability in Images of a Lambertian Object
Authors: Ravi Ramamoorthi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

We analyze theoretically the subspace best approximating images of a convex Lambertian object taken from the same viewpoint, but under different distant illumination conditions. Since the lighting is an arbitrary function, the space of all possible images is formally infinite-dimensional. However, previous empirical work has shown that images of largely diffuse objects actually lie very close to a five-dimensional subspace. In this paper, we analytically construct the principal component analysis for images of a convex Lambertian object, explicitly taking attached shadows into account, and find the principal eigenmodes and eigenvalues with respect to lighting variability. Our analysis makes use of an analytic formula for the irradiance in terms of spherical-harmonic coefficients of the illumination and shows, under appropriate assumptions, that the principal components or eigenvectors are identical to the spherical harmonic basis functions evaluated at the surface normal vectors. Our main contribution is in extending these results to the single-viewpoint case, showing how the principal eigenmodes and eigenvalues are affected when only a limited subset (the upper hemisphere) of normals is available and the spherical harmonics are no longer orthonormal over the restricted domain. Our results are very close, both qualitatively and quantitatively, to previous empirical observations and represent the first essentially complete theoretical explanation of these observations. Our analysis is also likely to be of interest in other areas of computer vision and image-based rendering. In particular, our results indicate that using complex illumination for photometric problems in computer vision is not significantly more difficult than using directional sources.
Digitized Circular Arcs: Characterization and Parameter Estimation
Authors: Marcel Worring, Arnold W. M. Smeulders
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

The digitization of a circular arc causes an inherent loss of geometrical information. Arcs with slightly different local curvature or position may lead to exactly the same digital pattern. In this paper we give a characterization of all centers and radii of circular arcs yielding the same digitization pattern. The radius of the arcs varies over the set. However, only one curvature or radius estimate can be assigned to the digital pattern. We derive an optimal estimator and give expressions for the bound on the precision of estimation. This bound due to digitization is the deterministic equivalent of the Cramér/Rao bound known from parameter estimation theory.Consider the estimation of the local curvature and local radius of a smooth object. Typically such parameters are estimated by moving a window along the digital boundary. Methods in literature show a poor precision in estimating curvature values, relative errors of over 40% are often found [34]. From the definition of curvature it follows that locally the curve can be considered a circular arc and hence the method presented in this paper can be applied to the pattern in the window giving estimates with optimal precision and a measure for the remaining error.On the practical side we present examples of the residual error due to the discrete grid. The estimation of the radius or curvature of a circular arc at random position with an estimation window containing 10 points (coded with nine Freemancodes) has a relative deviation exceeding 2%. For a full disk the deviation is below 1% when the radius r exceeds four grid units.The presented method is particularly useful for problems where some prior knowledge on the distribution of radii is known and where there is a noise-free sampling.
On Reducible Monodromies Realized by Reducible Fuchsian Systems
Authors: M. Stephane
Venue: Journal of Dynamical and Control Systems (1999)

It is shown that under the conditions of Theorems 1 and 2 in &lsqb;2&rsqb;, the Fuchsian systems realizing the reducible monodromy are in fact reducible systems. On the other hand, when the reducible monodromy is realized by a Fuchsian system, sufficient conditions on the monodromy matrices under which the final Fuchsian system can be chosen reducible are given.
Schottky-barrier height inhomogeneities controlled by buried Ge/Si quantum dots
Authors: A. Hattab, V. Aubry-Fortuna, F. Meyer, Vy Yam, Vinh Le Thanh, D. Bouchier, C. Clerc
Venue: Microelectronic Engineering (2002)

In this work, we investigated W/p-type Si Schottky contacts with intentional inhomogeneities beneath the interface. These inhomogeneities are related to the presence of Ge-dots located just below the contact. The size and the density of the inhomogeneities can be controlled either through the deposition conditions (Ge-coverage, here) er the thickness of the Si-cap layer. Electrical characterizations of contacts were achieved through current-voltage measurements in a temperature range 100-300 K. These experimental results are compared to numerical simulations using the Atlas-Silvaco package. To describe the contact, we have chosen a cylindrical geometry. The Schottky current takes into account the contributions of small circular patches of lower Schottky barrier height (SBH) embedded in a large area of uniform higher SBH. Our results evidence a correlation between the parameters of the Ge-dots (size, density, distance to the interface) and those of the patches introduced in the model The well-known linear correlation between SBHs and ideality factors, ΦB(n), is observed for all the samples.
Estimation of amplitude and phase of a weak signal by using the property of sensitive dependence on initial conditions of a nonlinear oscillator
Authors: Guanyu Wang, Wei Zheng, Sailing He
Venue: Signal Processing (2002)

A new method is presented to determine the amplitude and phase of a weak signal by using a fundamental property of a nonlinear dynamical system, namely, the sensitive dependence on initial conditions (SDIC), given that some a priori knowledge about the signal order of magnitude is available. The corresponding bifurcation process for the Duffing oscillator is discussed in detail, and the Floquet exponents are employed to represent SDIC quantitatively. To show the efficiency of the present method, simulation results for the reconstruction are given and compared with those obtained by the maximum likelihood (ML) method. The robustness of the present method against variations of some experimental conditions is addressed.
New Software-Quality Metrics Methodology Standard Fills Measurement Need
Venue: Computer (1993)

The IEEE 1061, IEEE standard for a software-quality metrics methodology, which is the first IEEE-issued standard that deals with quality metrics, is discussed. The philosophy behind the standard, the scope of the standard, and the standard's intended audience are described. Several aspects of the standard, including the methodology of metrics and validity criteria, are reviewed.
Combining relational and network retrieval methods
Authors: Huei-huang Chen, Sharon McCure Kuck
Venue: Proceedings of the 1984 ACM SIGMOD international conference on Management of data (1984)

New methods for retrieving records from a database with links are given so that records are retrieved only once and not multiple times as happens when using the traditional method of retrieval Improvements as great as 50 percent are expected for queries over databases containing only many-to-one relationships and much greater improvements are expected when many-to-many relationships are embedded in the database Furthermore, it is shown how to combine relational and network retrieval methods Relations, containing many tuples, are created during the evaluation of a network query Each relation is either joined with other relations or is used to continue the evaluation of the network query The methods given show how to optimize data retrieval from a relational database that is implemented using links, where each link represents a many-to-one relationship
An Efficient Parallel Algorithm for the Efficient Domination Problem on Distance-Hereditary Graphs
Authors: Sun-yuan Hsieh
Venue: IEEE Transactions on Parallel and Distributed Systems (2002)

In the literature, there are quite a few sequential and parallel algorithms for solving problems on distance-hereditary graphs. With an n-vertex and m-edge distance-hereditary graph G, we show that the efficient domination problem on G can be solved in \big. O(\log^{2} n)\bigr. time using \big. O(n+m)\bigr. processors on a CREW PRAM. Moreover, if a binary tree representation of G is given, the problem can be optimally solved in \big. O(\log n)\bigr. time using \big. O(n/\log n)\bigr. procssors on an EREW PRAM.
Itsy: Stretching the Bounds of Mobile Computing
Authors: William R. Hamburgen, Deborah A. Wallach, Marc A. Viredaz, Lawrence S. Brakmo, Carl A. Waldspurger, Joel F. Bartlett, Timothy Mann, Keith I. Farkas
Venue: Computer (2001)

Built to explore the possibilities, demands, and limitations of mobile computing, Compaq's Itsy pocket computer research prototype strives to attain high performance with minimal power consumption, size, and weight. Itsy's design incorporates a rich feature set to support user-interface and applications research and the flexibility to add new capabilities. Daughtercards provide comprehensive expansion capability, and Itsy supports the Linux operating system with extensions for a flash file system, resource sharing, and power management. Itsy has sufficient processing power and memory capacity to run cycle-hungry applications such as continuous speech recognition, a full-fledged Java virtual machine, and real-time MPEG-1 movie decoding.A useful tool for exploring the bounds of mobile computing, Itsy is powerful and flexible enough for applications, systems work, and power studies. Designers inside and outside Compaq have built daughtercards for the pocket computer, including CMOS cameras, a PCM-CIA adapter with a large battery, a low-powered radio, and memory expansion cards.
On a Parameter Estimation Method for Gibbs-Markov Random Fields
Authors: M. I. Gürelli, L. Onural
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

This correspondence is about a Gibbs-Markov random field (GMRF) parameter estimation technique proposed by Derin and Elliott (1987). We will refer to this technique as the histogramming (H) method. First, the relation of the H method to the (conditional) maximum likelihood method is considered. Second, a bias-reduction based modification of the H method is proposed to improve its performance, especially in the case of small amounts of image data.
A Model for the High-Level Description and Simulation of VLSI Networks
Authors: A. J. van der Hoeven, A. A. J. de Lange, E. F. Deprettere, P. M. Dewilde
Venue: IEEE Micro (1990)

An applicative state transition (AST) model for the description and analysis of synchronous and asynchronous VLSI networks at the top levels of abstraction is presented. The model, which uses two powerful paradigms that provide an elegant, fast method for the high-level description and simulation of VLSI networks, explicitly represents the flow of information through a network. This is done by embedding the AST concept into the theory of Petri nets and using Petri net theory to define the communication protocol between nodes. It allows the description of both synchronous and asynchronous designs from the level of abstract functional or algorithmic behaviour down to the register-transfer level. In design descriptions, the model logically separates state, function, and function control, increasing the clearness of the description and simplifying the development and application of silicon compilers. As an application the design of a simple priority queue as both a real-time systolic (synchronous) system and a real-time wavefront (asynchronous) system is explored. This example demonstrates the capability of the AST graph model to handle loops in the design. The model has been embedded in an interactive design system called HIFI (Hierarchical Interactive Flowgraph Integration).
Optimal Simulation of Linear Multiprocessor Architectures on Multiply-Twisted Cube Using Generalized Gray Codes
Authors: S. q. Zheng, Shahram Latifi
Venue: IEEE Transactions on Parallel and Distributed Systems (1996)

In this article, we consider the problem of simulating linear arrays and rings on the multiply-twisted cube. We introduce a new concept, the reflected link label sequence, and use it to define a generalized Gray Code (GGC). We show that GGCs can be easily used to identify Hamiltonian paths and cycles in the multiply-twisted cube. We also give a method for embedding a ring of arbitrary number of nodes into the multiply-twisted cube.
High-Order Differentiation Filters that Work
Authors: I. Weiss
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1994)

Reliable derivatives of digital images have always been hard to obtain, especially (but not only) at high orders. We analyze the sources of errors in traditional filters, such as derivatives of the Gaussian, that are used for differentiation. We then study a class of filters which is much more suitable for our purpose, namely filters that preserve polynomials up to a given order. We show that the errors in differentiation can be corrected using these filters. We derive a condition for the validity domain of these filters, involving some characteristics of the filter and of the shape. Our experiments show a very good performance for smooth functions.
Effect of random permutations applied to random sequences and related applications
Authors: B. Lacaze, D. Roviras
Venue: Signal Processing (2002)

This paper presents random permutations and their effects when they are applied to a random sequence. Random permutations are the digital implementation of continuous time "Periodic Clock Changes". Continuous periodic clock changes have been already applied for multiple access and modulation purposes. It is shown that a random permutation applied to an input sequence with band-limited power spectrum can give a spreaded sequence with white power spectrum. Closed forms of the power spectral density of the interleaved sequences are given and simulations are presented. When the length of the permutation is large, it is shown that the new interleaved sequence power spectrum converges towards a white noise except for the null frequency, where the power spectrum remains the same as the input sequence. These results have an application to interleaving (random or deterministic), chip interleaving and more generally in spread spectrum techniques.
A Survey of Encryption Standards
Authors: Burt Kaliski
Venue: IEEE Micro (1993)

The author reviews encryption algorithms and standards, how they compare, how they differ, and where they are headed. Attention is given to secret-key cryptosystems, public-key cryptosystems, digital signature schemes, key-agreement algorithms, cryptographic hash functions, and authentication codes. Applications considered are secure electronic mail, secure communications, directory authentication and network management, banking, and escrowed encryption.
Who Cares About Software Construction?
Authors: Steve Mcconnell
Venue: IEEE Software (1996)

Prospecting for programmer's gold.Software practitioners are subjected to a barrage of advice about effective development practices. The search for effective practices ¿ programmers' gold ¿ can be almost as chancey as the search for the precious yellow metal itself. Some mediocre practices are overhyped and don't pan out; many valuable practices are buried under the hype heaped on other practices. This column aims to separate the gold from the ore by providing a practitioner's appraisal of past and present development practices. Future columns will take up practitioner-oriented topics ranging from "Whatever happened to information hiding?" to "The estimation story ¿ defending unpopular estimates."¿Steve McConnell
Service differentiation for delay-sensitive applications: an optimisation-based approach
Authors: Peter Key, Laurent Massoulié, Jonathan K. Shapiro
Venue: Performance Evaluation (2002)

This paper deals with the performance of delay-sensitive applications running over a network that offers multiple classes of service, where the adaption of application rates in response to network feedback is the primary mechanism available for controlling quality of service. We first evaluate the gain in utilisation allowed by the introduction of several classes of service. To this end we compare the pairs of achievable rates, or schedulable regions, for two types of applications with two distinct delay requirements that make use of a single resource, with either no differentiation, simple priority-based differentiation, or earliest-deadline-first (EDF) scheduling-based differentiation. The main observations are that the gain achieved by differentiation is essentially affected by traffic burstiness, and that the two differentiation schemes yield very similar performance.We then consider what feedback information should be sent to traffic sources from different classes, casting the problem in the framework of optimisation-based congestion control. We establish a connection between the sample-path shadow price rationale for feedback synthesis and the rare perturbation analysis technique for gradient estimation in discrete event systems theory. Based on this connection, we propose several marking schemes, for simple priority-based differentiation with a measure of cost based on loss or delay, and also for EDF-based differentiation with loss-based cost. The interaction of these marking algorithms with simple congestion control algorithms is studied via simulations.
One-to-One Dependencies in Database Design
Authors: P. Shoval
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

The author focuses on the 1:1 dependency type and shows its significance in database design. Various situations involving 1:1 dependencies are analyzed and classified, and proper treatment of the dependency in those situations is suggested. These dependencies are treated at both the conceptual and the logical design levels. Decision rules are provided for the conversion of 1:1 dependencies into 1:n or n:1 dependencies. These are implemented with the system ADDS for automated database design.
Behavioral synthesis of field programmable analog array circuits
Authors: Haibo Wang, Sarma B. K. Vrudhula
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2002)

This article presents methods to translate a behavioral-level analog description into a Field Programmable Analog Array (FPAA) implementation. The methods consist of several steps that are referred to as function decomposition, macrocell synthesis, placement and routing, and postplacement simulation. The focus of this article is on the first three steps. The function decomposition step deals with decomposing a high-order system function into a set of lower-order functions. We present an efficient procedure for searching for an optimal solution. This procedure is based on first formally demonstrating the equivalence of two previously used optimization criteria. The objective of the macrocell synthesis step is to generate a hardware realization. A modified signal flow graph is introduced to represent FPAA circuits and graph transformations are used to identify the realizations that comply with the FPAA hardware constraints. The modified signal flow graph also allows scaling of capacitor values due to the limited set of allowable values in an FPAA. For the placement and routing step, an efficient method to estimate the circuit performance degradation due to parasitic effects is given. Using performance degradation as the cost function, an algorithm for finding an optimal FPAA placement and routing configuration is given. The efficacy of the methods developed is demonstrated by direct measurements on a set of filters.
Visibility-guided simplification
Authors: Eugene Zhang, Greg Turk
Venue: Proceedings of the conference on Visualization '02 (2002)

For some graphics applications, object interiors and hard-to-see regions contribute little to the final images and need not be processed. In this paper, we define a view-independent visibility measure on mesh surfaces based on the visibility function between the surfaces and a surrounding sphere of cameras. We demonstrate the usefulness of this measure with a visibility-guided simplification algorithm.Mesh simplification reduces the polygon counts of 3D models and speeds up the rendering process. Many mesh simplification algorithms are based on sequences of edge collapses that minimize geometric and attribute errors. By combining the surface visibility measure with a geometric error measure, we obtain simplified models with improvement proportional to the amount of low visibility regions in the original models.
Table servers protect confidentiality in tabular data releases
Authors: Alan F. Karr, Adrian Dobra, Ashish P. Sanil
Venue: Communications of the ACM (2003)

Federal statistical agencies must balance concern over confidentiality of data with their obligation to report information to the public. Advances in IT threaten privacy, but new technologies can also protect confidentiality while meeting user needs in innovative ways.