12575767
Universal Quadratic Lower Bounds on Source Coding Error Exponents
We consider the problem of block-size selection to achieve a desired probability of error for universal source coding. While Baron, et al. (2004; 1973) studied this question for rates in the vicinity of entropy for known distributions using central-limit-theorem techniques, we are interested in all rates for unknown distributions and use error-exponent techniques. By adapting a technique of Gallager from the exercises of Gallager (1971), we derive a universal lower bound to the source-coding error exponent that depends only on the alphabet size and is quadratic in the gap to entropy.
9272685
Genetic algorithm for affine point pattern matching
Point pattern matching (PPM) is an important topic in the fields of computer vision and pattern recognition. According to if there exists a one to one mapping between the two point sets to be matched, PPM can be divided into the case of complete matching and the case of incomplete matching. According to if utilizing information other than 2-D image coordinates, PPM can be divided into labelled point-matching case and unlabelled point-matching case. Using partial Hausdorff distance, this paper presents a genetic algorithm (GA) based method to solve the incomplete unlabelled matching problem under general affine transformation. Since it successfully reduces the solution space of GA by constructing 'feature ellipses' of point sets, the method can achieve high computing efficiency and good matching results. Theoretical analysis and simulation results show that the new algorithm is very effective.
42929157
Real-Time Digital Signal Processing of Phased Array Radars
With the advance of hardware and software technology, modern phased array radars are now built with commercial-off-the-shelf (COTS) components, and it opens up a new era in real-time resource scheduling of digital signal processing. This paper targets the essential issues in building a component-oriented signal processor (SP), which is one of the two major modules in modern phased array radars. We propose a simple but effective task allocation policy and a real-time scheduling algorithm to address the design objectives of SPs. We are able to bound the number of processing units needed for a component-oriented SP in the design time, while everything was done empirically in the past. A series of experiments was done to demonstrate the strength of our methodology.
18226410
Real-time tracking with multiple cues by set theoretic random search
Conventional treatment of visual tracking has been to optimize an objective function in a probabilistic framework. In this formulation, efficient algorithms employing simple prior distributions are usually insufficient to handle clutters (e.g., Kalman filter). On the other hand, distributions that are complex enough to incorporate all a priori knowledge can make the problem computationally intractable (e.g., particle filters (PF)). This paper proposes a new formulation of visual tracking where every piece of information, be it from a priori knowledge or observed data, is represented by a set in the solution space and the intersection of these sets, the feasibility set, represents all acceptable solutions. Based on this formulation, we propose an algorithm whose objective is to find a solution in the feasibility set. We show that this set theoretic tracking algorithm performs effective face tracking and is computationally more efficient than standard PF-based tracking.
111915458
A new model for engineering transaction
Engineering software systems, like CAD and CASE, are popular and important for today''s industry. As applications of engineering software system are getting more complex, engineering database systems, like CAD and CASE databases, which support concurrency control, access control, recovery, and versioning, are also on demand. Data modeling of engineering applications by using the object-oriented paradigm has been investigated in the past. However, a sufficient and complete transaction model to support the engineering databases is still under discussion. Transaction processing in the context of {\em traditional database} applications, such as banking and airline reservation systems, has been thoroughly studied. However, the concept of the traditional transaction can not be used in {\em engineering database} environments, such as CAD and CASE databases, because of some constraints imposed by the traditional transaction''s ACID properties. In this thesis, I thoroughly studied the requirements of engineering transactions, formally defined an engineering transaction model, and prudently showed that the proposed transaction model has the desired properties. Moreover, I designed a transaction system architecture to realize my transaction model.
16280666
Component-oriented radars with probabilistic timing guarantees
In recent years, many modern phased-array radars are built with commercial off-the-shelf components, and the functions of many hardware components are also reimplemented by software modules. In such systems, radar tasks could be modeled as distributed real-time tasks which require end-to-end deadline guarantees and have precedence constraints. Different from most previous work on either algorithms with restrictions in resource utilization or heuristics without analytical ways for schedulability guarantees, the objective of this paper is to propose a joint real-time scheduling algorithm for both transmitter/receiver and signal processor workloads with an analytical framework for offline probabilistic analysis and online admission control. The strength of our approach is verified by analysis results and a series of experiments based on a real phased-array radar for air defense frigates
6881358
Probabilistic real-time guarantees for component-oriented phased array radars
In recent years, many modern phased array radars are built with commercial-off-the-shelf components, and the functions of many hardware components are also re-implemented by software modules. In such systems, radar tasks could be modelled as distributed real-time tasks, which require end-to-end deadline guarantees and have precedence constraints. Different from most previous work on either algorithms with restrictions in resource utilization or heuristics without analytical ways for schedulability guarantees, the objective of This work is to propose a joint real-time scheduling algorithm for both transmitter/receiver and signal processor workloads with an analytical framework for off-line probabilistic analysis and online admission control. The strength of our approach is verified by analysis results and a series of experiments based on a real phased array radar for air defense frigates [A. G. Huizing et al. (1996)].