Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673306
J. Rose, M. Shah
Content-based image retrieval (CBIR) enables a user to extract an image, based on a query, from a database containing a vast amount of pictures. This concept may be applied to many fields of interest including forensic science and image archiving. Current CBIR systems, however, are inaccurate. The purpose of this research project was to improve the accuracy of CBIR. The image's structural properties were examined to distinguish one image from another. By examining the specific gray level of an image, a gradient can be computed at each pixel. Pixels with a magnitude larger than the thresholds are assigned a value of 1. These binary digits are added across the horizontal, vertical, and diagonal directions to compute three projections. These vectors are then compared with the vectors of the image to be matched using the Euclidean distance formula. These numbers are then stored in a bookmark so that the image needs only be examined once. A program has been developed for Matlab on a Sun Sparc Computer with Unix Open Windows that performs this method of projecting gradients. Three databases were amassed for the testing of the proposed system's accuracy: 82 digital camera pictures, 1000 photographic images, and a set of object orientated photos. The program was tested with 100% accuracy with all submitted images to the database, and was able to distinguish between pictures that fooled previous CBIR engines. More importantly, though, was the program's ability to find certain similar scenarios in the database. This CBIR approach has significantly increased the accuracy in obtaining results for image retrieval.
基于内容的图像检索(CBIR)使用户能够根据查询从包含大量图片的数据库中提取图像。这个概念可以应用于许多感兴趣的领域，包括法医学和图像存档。然而，目前的CBIR系统并不准确。本研究项目的目的是提高CBIR的准确性。检查图像的结构属性以区分不同的图像。通过检查图像的特定灰度级，可以在每个像素处计算梯度。大小大于阈值的像素被赋值为1。这些二进制数字在水平、垂直和对角线方向上相加，以计算三个投影。然后将这些矢量与使用欧几里得距离公式进行匹配的图像的矢量进行比较。然后将这些数字存储在书签中，这样图像只需要检查一次。在Sun Sparc计算机和Unix Open Windows上用Matlab编写了一个程序，实现了这种投影梯度的方法。为了测试系统的准确性，收集了三个数据库:82张数码相机照片、1000张摄影图像和一组面向对象的照片。该程序对所有提交到数据库的图像进行了100%的准确率测试，并且能够区分那些欺骗了以前的CBIR引擎的图片。不过，更重要的是，该程序能够在数据库中找到某些类似的场景。该方法显著提高了图像检索结果的准确性。
{"title":"Content-based image retrieval using gradient projections","authors":"J. Rose, M. Shah","doi":"10.1109/SECON.1998.673306","DOIUrl":"https://doi.org/10.1109/SECON.1998.673306","url":null,"abstract":"Content-based image retrieval (CBIR) enables a user to extract an image, based on a query, from a database containing a vast amount of pictures. This concept may be applied to many fields of interest including forensic science and image archiving. Current CBIR systems, however, are inaccurate. The purpose of this research project was to improve the accuracy of CBIR. The image's structural properties were examined to distinguish one image from another. By examining the specific gray level of an image, a gradient can be computed at each pixel. Pixels with a magnitude larger than the thresholds are assigned a value of 1. These binary digits are added across the horizontal, vertical, and diagonal directions to compute three projections. These vectors are then compared with the vectors of the image to be matched using the Euclidean distance formula. These numbers are then stored in a bookmark so that the image needs only be examined once. A program has been developed for Matlab on a Sun Sparc Computer with Unix Open Windows that performs this method of projecting gradients. Three databases were amassed for the testing of the proposed system's accuracy: 82 digital camera pictures, 1000 photographic images, and a set of object orientated photos. The program was tested with 100% accuracy with all submitted images to the database, and was able to distinguish between pictures that fooled previous CBIR engines. More importantly, though, was the program's ability to find certain similar scenarios in the database. This CBIR approach has significantly increased the accuracy in obtaining results for image retrieval.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130986185","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673321
Wen Whe Sue, Zhi-Ming Lin, C. H. Huang
The architecture of folded-cascode op-amp is commonly used in many analog applications. The cascode arrangement has high open-loop voltage gain in the low frequency range that make it easy to be designed as a high-speed operational amplifier. In this paper, we present the design of a fully differential folded-cascode operational amplifier that improves the limitation on the swing of the output signal of a common cascode architecture. The DC open-loop gain of the circuit is 4.7 K.
{"title":"A high DC-gain folded-cascode CMOS operational amplifier","authors":"Wen Whe Sue, Zhi-Ming Lin, C. H. Huang","doi":"10.1109/SECON.1998.673321","DOIUrl":"https://doi.org/10.1109/SECON.1998.673321","url":null,"abstract":"The architecture of folded-cascode op-amp is commonly used in many analog applications. The cascode arrangement has high open-loop voltage gain in the low frequency range that make it easy to be designed as a high-speed operational amplifier. In this paper, we present the design of a fully differential folded-cascode operational amplifier that improves the limitation on the swing of the output signal of a common cascode architecture. The DC open-loop gain of the circuit is 4.7 K.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131221298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673368
Huai Wei, Issa Batarseh
Basic types of DC-DC converters, when operating in discontinuous conduction mode, have self power factor correction (PFC) property, that is, if these converters are connected to the rectified AC line, they have the capability to give higher power factor by the nature of their topologies. Input current feedback is unnecessary when these converters are employed to improve power factor. In this paper, basic types of DC-DC converter topologies are studied to investigate their self-PFC capabilities. Their input characteristics are compared and their input line current waveforms are predicted.
{"title":"Comparison of basic converter topologies for power factor correction","authors":"Huai Wei, Issa Batarseh","doi":"10.1109/SECON.1998.673368","DOIUrl":"https://doi.org/10.1109/SECON.1998.673368","url":null,"abstract":"Basic types of DC-DC converters, when operating in discontinuous conduction mode, have self power factor correction (PFC) property, that is, if these converters are connected to the rectified AC line, they have the capability to give higher power factor by the nature of their topologies. Input current feedback is unnecessary when these converters are employed to improve power factor. In this paper, basic types of DC-DC converter topologies are studied to investigate their self-PFC capabilities. Their input characteristics are compared and their input line current waveforms are predicted.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130537242","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673291
J. Ten Eyck, G. Sampath
This paper utilizes the notion of design patterns to provide a description of problem solving. The description provides an object-oriented reference frame for discussing a general problem-solving approach. A design pattern description for the domain of problem solving is presented and the model is developed and explained in terms of an example. The architecture of a reading tool for studying algorithm design is developed from the class model for the problem-solving pattern. This tool is presented as a distributed Web-based application that would allow students to explore design strategies for particular problem sets, and for contributors to expand the capabilities and function of the system in a timely manner.
{"title":"An object model for problem solving and its applications","authors":"J. Ten Eyck, G. Sampath","doi":"10.1109/SECON.1998.673291","DOIUrl":"https://doi.org/10.1109/SECON.1998.673291","url":null,"abstract":"This paper utilizes the notion of design patterns to provide a description of problem solving. The description provides an object-oriented reference frame for discussing a general problem-solving approach. A design pattern description for the domain of problem solving is presented and the model is developed and explained in terms of an example. The architecture of a reading tool for studying algorithm design is developed from the class model for the problem-solving pattern. This tool is presented as a distributed Web-based application that would allow students to explore design strategies for particular problem sets, and for contributors to expand the capabilities and function of the system in a timely manner.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126023904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673317
Jiling Song, J. Yuan
The excess electron barrier height at high current densities is examined. The barrier effects on the collector current, transconductance as well as base-collector junction capacitance are calculated. The analytical results are compared with the experimental data and device simulation results. Temperature-dependent characteristics are also evaluated.
{"title":"Base-collector heterojunction barrier effects at high current densities of Si/SiGe/Si heterojunction bipolar transistors","authors":"Jiling Song, J. Yuan","doi":"10.1109/SECON.1998.673317","DOIUrl":"https://doi.org/10.1109/SECON.1998.673317","url":null,"abstract":"The excess electron barrier height at high current densities is examined. The barrier effects on the collector current, transconductance as well as base-collector junction capacitance are calculated. The analytical results are compared with the experimental data and device simulation results. Temperature-dependent characteristics are also evaluated.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123816613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673350
R. Garcia, M. Sadiku
Summary form only given. This paper illustrates the combination of a fuzzy inference system with a Monte Carlo method to solve Laplace's equation. Fuzzy inference systems are found to be widely used in the area of control systems. As a general remark, fuzzy system applications can occur where expert knowledge can be translated into a cognitive set of rules. This tool along with a Monte Carlo method which employs Markov Chains is considered as an effective technique in whole field computation of boundary-value problems.
{"title":"Two-part solution of Laplace's equation: an adaptive fuzzy system front-end with a Markov chain back-end","authors":"R. Garcia, M. Sadiku","doi":"10.1109/SECON.1998.673350","DOIUrl":"https://doi.org/10.1109/SECON.1998.673350","url":null,"abstract":"Summary form only given. This paper illustrates the combination of a fuzzy inference system with a Monte Carlo method to solve Laplace's equation. Fuzzy inference systems are found to be widely used in the area of control systems. As a general remark, fuzzy system applications can occur where expert knowledge can be translated into a cognitive set of rules. This tool along with a Monte Carlo method which employs Markov Chains is considered as an effective technique in whole field computation of boundary-value problems.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121832661","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673311
B. S. Motlagh, R. Demara
Analytical models were developed and simulations of memory latency were performed for Uniform Memory Access (UMA), Non-Uniform Memory Access (NUMA), Local-Remote-Global (LRG), and Replicated Concurrent-Read (RCR) architectures for hit rates from 0.1 to 0.9 in steps of 0.1, memory access times of 10 nsec to 100 nsec, proportions of read/write access from 0.01 to 0.1, and block sizes of 8 to 64 words. The RCR architecture based on redundant inexpensive DRAM is shown to provide favourable performance over UMA and NUMA architectures for application and system parameters in the range evaluated. RCR outperforms LRG architectures when the hit rates of the processor cache exceed 80% and hit rates of replicated memory exceed 25%. Inclusion of a small replicated memory at each processor significantly reduces expected access time since all replicated memory READ access hits become independent of global traffic. For configurations of up to 32 processors, results show that latency is further reduced by distinguishing burst-mode transfers between isolated memory accesses and those which are incrementally outside the working set.
{"title":"Memory latency in distributed shared-memory multiprocessors","authors":"B. S. Motlagh, R. Demara","doi":"10.1109/SECON.1998.673311","DOIUrl":"https://doi.org/10.1109/SECON.1998.673311","url":null,"abstract":"Analytical models were developed and simulations of memory latency were performed for Uniform Memory Access (UMA), Non-Uniform Memory Access (NUMA), Local-Remote-Global (LRG), and Replicated Concurrent-Read (RCR) architectures for hit rates from 0.1 to 0.9 in steps of 0.1, memory access times of 10 nsec to 100 nsec, proportions of read/write access from 0.01 to 0.1, and block sizes of 8 to 64 words. The RCR architecture based on redundant inexpensive DRAM is shown to provide favourable performance over UMA and NUMA architectures for application and system parameters in the range evaluated. RCR outperforms LRG architectures when the hit rates of the processor cache exceed 80% and hit rates of replicated memory exceed 25%. Inclusion of a small replicated memory at each processor significantly reduces expected access time since all replicated memory READ access hits become independent of global traffic. For configurations of up to 32 processors, results show that latency is further reduced by distinguishing burst-mode transfers between isolated memory accesses and those which are incrementally outside the working set.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117081719","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673354
M. Sadiku, S. Subramanian, A. Bhadra
Although Gigabit Ethernet has been wrongly perceived as a competitor to asynchronous transfer mode (ATM), each has its own place in the grand scheme. This perceived competition has caused users to hesitate in their migration to ATM. This study presents a reality check on the two technologies. It addresses the pros and cons of selecting each network based on some criteria.
{"title":"Gigabit Ethernet and ATM in high speed arena","authors":"M. Sadiku, S. Subramanian, A. Bhadra","doi":"10.1109/SECON.1998.673354","DOIUrl":"https://doi.org/10.1109/SECON.1998.673354","url":null,"abstract":"Although Gigabit Ethernet has been wrongly perceived as a competitor to asynchronous transfer mode (ATM), each has its own place in the grand scheme. This perceived competition has caused users to hesitate in their migration to ATM. This study presents a reality check on the two technologies. It addresses the pros and cons of selecting each network based on some criteria.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"53 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128049786","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673332
A. Zooghby, Y.G. Christodoulou, M. Georgiopoulos
A neural network approach to the problem of finding the weights of one and two-dimensional adaptive arrays is presented. In modern cellular, satellite mobile communications systems, and in GPS systems, both the desired and interfering signals change their directions continuously. Therefore, a fast tracking system is needed to constantly track the users, and then adapt the radiation pattern of the antenna to direct multiple narrow beams to the desired users and nulls to the sources of interference. In the approach suggested in this paper, the computation of the optimum weights is viewed as a mapping problem which can be modeled using a suitable artificial neural network trained with input output pairs. Three-layer radial basis function neural networks (RBFNN) are used in the design of one and two-dimensional array antennas. The results obtained from this network are in excellent agreement with the Wiener solution. The networks implementing these functions are successful in tracking mobile users as they move across the antenna's field of view.
{"title":"A novel approach to adaptive nulling with neural networks","authors":"A. Zooghby, Y.G. Christodoulou, M. Georgiopoulos","doi":"10.1109/SECON.1998.673332","DOIUrl":"https://doi.org/10.1109/SECON.1998.673332","url":null,"abstract":"A neural network approach to the problem of finding the weights of one and two-dimensional adaptive arrays is presented. In modern cellular, satellite mobile communications systems, and in GPS systems, both the desired and interfering signals change their directions continuously. Therefore, a fast tracking system is needed to constantly track the users, and then adapt the radiation pattern of the antenna to direct multiple narrow beams to the desired users and nulls to the sources of interference. In the approach suggested in this paper, the computation of the optimum weights is viewed as a mapping problem which can be modeled using a suitable artificial neural network trained with input output pairs. Three-layer radial basis function neural networks (RBFNN) are used in the design of one and two-dimensional array antennas. The results obtained from this network are in excellent agreement with the Wiener solution. The networks implementing these functions are successful in tracking mobile users as they move across the antenna's field of view.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127621602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1998-04-24DOI: 10.1109/SECON.1998.673352
Y.F. Chen, N. Warsi
In recent years, researchers from knowledge-based system (KBS) fields have pushed toward rapidly develop a reusable knowledge base with a greater flexibility and adaptability to empower domain experts developing their own domain-oriented high performance knowledge-based systems. We develop a strategic-reuse system that takes as input a declarative description of a domain, and then automatically generates as output an efficient, domain-specific KBS development environment along with a reusable knowledge base library. A test plan can be further developed based on the relationships between the specific KBS performance requirement and the KB components' strategic characteristics. This paper focuses on developing such a strategic-reuse framework to characterize KB components in terms of four generic strategic features: computational efficiency, interactive capability, modeling flexibility, and knowledge usability.
{"title":"A strategic reuse framework for high-performance knowledge bases development","authors":"Y.F. Chen, N. Warsi","doi":"10.1109/SECON.1998.673352","DOIUrl":"https://doi.org/10.1109/SECON.1998.673352","url":null,"abstract":"In recent years, researchers from knowledge-based system (KBS) fields have pushed toward rapidly develop a reusable knowledge base with a greater flexibility and adaptability to empower domain experts developing their own domain-oriented high performance knowledge-based systems. We develop a strategic-reuse system that takes as input a declarative description of a domain, and then automatically generates as output an efficient, domain-specific KBS development environment along with a reusable knowledge base library. A test plan can be further developed based on the relationships between the specific KBS performance requirement and the KB components' strategic characteristics. This paper focuses on developing such a strategic-reuse framework to characterize KB components in terms of four generic strategic features: computational efficiency, interactive capability, modeling flexibility, and knowledge usability.","PeriodicalId":281991,"journal":{"name":"Proceedings IEEE Southeastcon '98 'Engineering for a New Era'","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133679039","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：