A Data Abstraction Alternative to Data Structure/Algorithm Modularization

Author(s):  
Murali Sitaraman ◽  
Bruce W. Weide ◽  
Timothy J. Long ◽  
William F. Ogden
2011 ◽  
Vol 48-49 ◽  
pp. 21-24 ◽  
Author(s):  
Xian Ping Fu ◽  
Sheng Long Liao

As the electronic industry advances rapidly toward automatic manufacturing smaller, faster, and cheaper products, computer vision play more important role in IC packaging technology than before. One of the important tasks of computer vision is finding target position through similarity matching. Similarity matching requires distance computation of feature vectors for each target image. In this paper we propose a projection transform of wavelet coefficient based multi resolution data-structure algorithm for faster template matching, a position sequence of local sharp variation points in such signals is recorded as features. The proposed approach reduces the number of computation by around 70% over multi resolution data structure algorithm. We use the proposed approach to match similarity between wavelet parameters histograms for image matching. It is noticeable that the proposed fast algorithm provides not only the same retrieval results as the exhaustive search, but also a faster searching ability than existing fast algorithms. The proposed approach can be easily combined with existing algorithms for further performance enhancement.


Author(s):  
PAWAN JAIN ◽  
S. N. MERCHANT

Most of the content-based image retrieval systems require a distance computation of feature vectors for each candidate image in the image database. This exhaustive search is highly time-consuming and inefficient. This limits the usefulness of such system. Thus there is a growing need for a fast image retrieval system. Multiresolution data-structure algorithm provides a good solution to the above problem. In this paper we propose a wavelet-based multiresolution data-structure algorithm. Wavelet-based multiresolution data-structure further reduce the number of computation by around 50%. In the proposed approach we reuse the information obtained at lower resolution levels to calculate the distance at a higher resolution level. Apart from this, the proposed structure saves memory overheads by about 50% over multiresolution data-structure algorithm. The proposed algorithm can be easily combined with other algorithms for performance enhancement.4 In this paper we use the proposed technique to match luminance histogram for image retrieval. Fuzzy histograms enhances performance by considering the similarity between neighboring bins. We have extended the proposed approach to fuzzy histograms for better performance.


Author(s):  
Rwan F. Al-Rashed ◽  
Atheer S. Al-Mutiri ◽  
Wadha M. Al-Marrai ◽  
Badriayh G. Al-Mutiri ◽  
Hanan F. Al-Qahtani ◽  
...  

1994 ◽  
Vol 33 (01) ◽  
pp. 60-63 ◽  
Author(s):  
E. J. Manders ◽  
D. P. Lindstrom ◽  
B. M. Dawant

Abstract:On-line intelligent monitoring, diagnosis, and control of dynamic systems such as patients in intensive care units necessitates the context-dependent acquisition, processing, analysis, and interpretation of large amounts of possibly noisy and incomplete data. The dynamic nature of the process also requires a continuous evaluation and adaptation of the monitoring strategy to respond to changes both in the monitored patient and in the monitoring equipment. Moreover, real-time constraints may imply data losses, the importance of which has to be minimized. This paper presents a computer architecture designed to accomplish these tasks. Its main components are a model and a data abstraction module. The model provides the system with a monitoring context related to the patient status. The data abstraction module relies on that information to adapt the monitoring strategy and provide the model with the necessary information. This paper focuses on the data abstraction module and its interaction with the model.


This article describes the proposed approaches to creating distributed models that can, with given accuracy under given restrictions, replace classical physical models for construction objects. The ability to implement the proposed approaches is a consequence of the cyber-physical integration of building systems. The principles of forming the data structure of designed objects and distributed models, which make it possible to uniquely identify the elements and increase the level of detail of such a model, are presented. The data structure diagram of distributed modeling includes, among other things, the level of formation and transmission of signals about physical processes inside cyber-physical building systems. An enlarged algorithm for creating the structure of the distributed model which describes the process of developing a data structure, formalizing requirements for the parameters of a design object and its operating modes (including normal operating conditions and extreme conditions, including natural disasters) and selecting objects for a complete group that provides distributed modeling is presented. The article formulates the main approaches to the implementation of an important practical application of the cyber-physical integration of building systems - the possibility of forming distributed physical models of designed construction objects and the directions of further research are outlined.


Sign in / Sign up

Export Citation Format

Share Document