This paper deals with the computation of a single super-resolution image from a set of low-resolution images, where the motion fields are not constrained to be parametric. In our approach, the inversion process, in wh...
详细信息
This paper deals with the computation of a single super-resolution image from a set of low-resolution images, where the motion fields are not constrained to be parametric. In our approach, the inversion process, in which the super-resolved image is inferred from the input data, is interleaved with the computation of a set of dense optical flow fields. The case of arbitrary motion presents several significant challenges. First of all, the super-resolution setting dictates that the optic flow computations must be very precise. Furthermore, we have to consider the possibility that certain parts of the scene, which are visible in the super-resolved image, are occluded in some of the input images. Such occlusions must be identified and dealt with in the restoration process. We propose a Bayesian approach to tackle these problems. In this framework, the input images are regarded as sub-sampled and noisy versions of the unknown high-quality image. Also, the input data is considered incomplete, in the sense that we do not know which pixels from the evolving super-resolution image are occluded in particular images from the input set. This will be modeled by introducing so-called visibility maps, which are treated as hidden variables. We describe an EM-algorithm, which iterates between estimating values for the hidden quantities, and optimizing the flow-fields and the super-resolution image. The approach is illustrated with a synthetic and a challenging real-world example.
A graph G = (V, E) is said to be pancyclic if it contains cycles of all lengths from 4 to |V| in G. Let F/sub e/ be the set of faulty edges. In this paper, we show that an n-dimensional Mobius cube, n /spl ges/ 1, con...
详细信息
ISBN:
(纸本)0769521355
A graph G = (V, E) is said to be pancyclic if it contains cycles of all lengths from 4 to |V| in G. Let F/sub e/ be the set of faulty edges. In this paper, we show that an n-dimensional Mobius cube, n /spl ges/ 1, contains a fault-free Hamiltonian path when |F/sub e/| /spl les/ n-1. We also show that an n-dimensional Mobius cube, n /spl ges/ 2, is pancyclic when |F/sub e/| /spl les/ n-2. Since an n-dimensional Mobius cube is regular of degree n, both results are optimal in the worst case.
In the field of embedded systems, reconfigurable processors, composed of a standard processor core coupled with a reconfigurable device, are gaining more and more importance. Algorithm developers are facing the issue ...
详细信息
In the field of embedded systems, reconfigurable processors, composed of a standard processor core coupled with a reconfigurable device, are gaining more and more importance. Algorithm developers are facing the issue of mapping applications on configurable hardware, without a specific knowledge of the underlying architecture. In this paper, we present a modular dataflow control unit for a reconfigurable datapath, which can be easily programmed starting from the C description of the required functionality.
In view of defects of tradition chips used for conference systems, such as poor performance and higher prices, this paper proposes the technical solution to use DSP technology to design and realize the multi-party con...
详细信息
In view of defects of tradition chips used for conference systems, such as poor performance and higher prices, this paper proposes the technical solution to use DSP technology to design and realize the multi-party conference system, and describes detailed designs and specified realization methods. With stable performance and requiring much lower costs, the product is now being extensively applied in Chinese railway and military systems and achieving favorable economic and social benefits.
Heterogeneity issues in Web services composition are discussed and classified into heterogeneity between semantic equivalent Web services and heterogeneity between sequent Web services in a process flow, we induce the...
详细信息
Heterogeneity issues in Web services composition are discussed and classified into heterogeneity between semantic equivalent Web services and heterogeneity between sequent Web services in a process flow, we induce these heterogeneity issues into six types of conflicts, namely semantic conflict, data type conflict, Structure conflict, parameter number conflict, data unit conflict and data precision conflict. Then, an ontology based conflict resolution is designed, including the definition of domain ontology knowledge for business specification, the definition of domain and industry terms ontology knowledge for describing the profile information of Web services and the definition of meta-ontology knowledge for transformation. Furthermore, the implementation issues are presented
Noninterference requires that there is no information flow from sensitive to public data in a given system. However, many systems perform intentional release of sensitive information as part of their correct functioni...
详细信息
Noninterference requires that there is no information flow from sensitive to public data in a given system. However, many systems perform intentional release of sensitive information as part of their correct functioning and therefore violate noninterference. To control information flow while permitting intentional information release, some systems have a downgrading or declassification mechanism. A major danger of such a mechanism is that it may cause unintentional information release. This paper shows that a robustness property can be used to characterize programs in which declassification mechanisms cannot be exploited by attackers to release more information than intended. It describes a simple way to provably enforce this robustness property through a type-based compile-time program analysis. The paper also presents a generalization of robustness that supports upgrading (endorsing) data integrity.
Sharing the resources among various users and the lack of a centralized control are two key characteristics of many distributed heterogeneous computing systems. A critical challenge for designing applications in such ...
详细信息
Sharing the resources among various users and the lack of a centralized control are two key characteristics of many distributed heterogeneous computing systems. A critical challenge for designing applications in such systems is to coordinate the resources in a decentralized fashion while adapting to the changes in the system. In this paper, we consider the computation of a large set of equal-sized independent tasks. This represents the computation paradigm for a variety of large scale applications such as SETI@home and Monte Carlo simulations. We focus on the performance optimization for a decentralized adaptive task allocation protocol. We develop a bandwidth allocation strategy based on our decentralized task allocation algorithm, and a simple task buffer management policy. Simulation results show that our task allocation protocol achieves close to the optimal system throughput.
We report on the computation of 3D volumetric optical flow on gated MRI datasets. We extend the 2D least squares and regularization approaches of Lucas and Kanade [4] and Horn and Schunck [3] and show flow fields (as ...
详细信息
We report on the computation of 3D volumetric optical flow on gated MRI datasets. We extend the 2D least squares and regularization approaches of Lucas and Kanade [4] and Horn and Schunck [3] and show flow fields (as XY and XZ 2D flows) for a beating heart. The flow not only can capture the expansion and contraction of various parts of the heart motion but also can capture the twisting motion of the heart.
Summary form only given. One of the most difficult tasks, since the invention of the computer, has been the solution of nonlinear wave equations. Now, the broader problem is to make a computer operating on image flows...
详细信息
Summary form only given. One of the most difficult tasks, since the invention of the computer, has been the solution of nonlinear wave equations. Now, the broader problem is to make a computer operating on image flows as data and having elementary instructions as solving nonlinear wave equations. Interestingly, almost all of the living sensory systems have similar anatomies and physiology models. The cellular wave computer is doing this exactly. Their implementation is presently mostly 2D. A major challenge is a way to make it in 3D, and how to make it in nanoscale or by using non-electronic materials. These could lead to a new understanding of the complexity of computing, as well.
Continuous Function Charts are a diagrammatical language for the specification of mixed discrete-continuous embedded systems, similar to the languages of Matlab/Simulink, and often used in the domain of transportation...
详细信息
Continuous Function Charts are a diagrammatical language for the specification of mixed discrete-continuous embedded systems, similar to the languages of Matlab/Simulink, and often used in the domain of transportation systems. Both control and dataflows are explicitly specified when atomic units of computation are composed. The obvious way to assess the quality of integration test suites is to compute known coverage metrics for the generated code. This production code does not exhibit those structures that would make it amenable to "relevant" coverage measurements. We define a translation scheme that results in structures relevant for such measurements, apply coverage criteria for both control and dataflows at the level of composition of atomic computational units, and argue for their usefulness on the grounds of detected errors.
暂无评论