Pub Date : 2007-11-05DOI: 10.1109/ICSCN.2007.350787
A. Baskar, M. Prabukumar, S. Sathishkumar
Video shot boundary (VSB) detection plays an important role in modern video archiving and summarization applications. The classical linear approach towards VSB detection is basically a sequential search, however this approach is computationally very expensive for large databases. In this work we propose a non-linear approach for VSB detection, which is an improvement of existing adaptive skip. The proposed technique compares less than 10% of frames in an entire video. Our experimental result shows that the proposed technique outperforms the other existing non-linear algorithms with better accuracy and meaningful VSBs
{"title":"Improved Adaptive Skip Algorithm for Video Shot Boundary Detection","authors":"A. Baskar, M. Prabukumar, S. Sathishkumar","doi":"10.1109/ICSCN.2007.350787","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350787","url":null,"abstract":"Video shot boundary (VSB) detection plays an important role in modern video archiving and summarization applications. The classical linear approach towards VSB detection is basically a sequential search, however this approach is computationally very expensive for large databases. In this work we propose a non-linear approach for VSB detection, which is an improvement of existing adaptive skip. The proposed technique compares less than 10% of frames in an entire video. Our experimental result shows that the proposed technique outperforms the other existing non-linear algorithms with better accuracy and meaningful VSBs","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"57 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124321069","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350655
S.F. Toha, U. K. Ngah
This paper presents one of the applications of digital image processing in artificial intelligence particularly in the field of medical diagnosis system. Currently in Malaysia the traditional method for the identification of Malaria parasites requires a trained technologist to manually examine and detect the number of the parasites subsequently by reading the slides. This is a very time consuming process, causes operator fatigue and is prone to human errors and inconsistency. An automated system is therefore needed to complete as much work as possible for the identification of Malaria parasites. The integration both soft computing tools has been successfully designed with the capability to improve the quality of the image, analyze and classify the image as well as calculating the number of Malaria parasites
{"title":"Computer Aided Medical Diagnosis for the Identification of Malaria Parasites","authors":"S.F. Toha, U. K. Ngah","doi":"10.1109/ICSCN.2007.350655","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350655","url":null,"abstract":"This paper presents one of the applications of digital image processing in artificial intelligence particularly in the field of medical diagnosis system. Currently in Malaysia the traditional method for the identification of Malaria parasites requires a trained technologist to manually examine and detect the number of the parasites subsequently by reading the slides. This is a very time consuming process, causes operator fatigue and is prone to human errors and inconsistency. An automated system is therefore needed to complete as much work as possible for the identification of Malaria parasites. The integration both soft computing tools has been successfully designed with the capability to improve the quality of the image, analyze and classify the image as well as calculating the number of Malaria parasites","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"82 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130285141","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350750
L. Suresh, S. Sundaravadivelu
The optical wireless communication is the only solution to the emerging next generation wireless communication. The photonic antennas play major role in the development of optical wireless communications. This photonic antenna transfers light energy from optical waveguide to free-space with high directionality and act as a matching device between optical source and channel (atmosphere). The analysis of light propagation through waveguide structures is indispensable in designing complex photonic devices. The optical waveguide grating structures with multiple longitudinal reflecting interfaces are analyzed to form photonic antennas. The multilayer triangular grating structure is analyzed using beam propagation method for its ability and suitability to optical wireless communication. The beam propagation method (BPM), extensively used tool for computer simulation of light propagation in optical waveguide structures, has been developed for analyzing optical waveguides with discontinuities in transmission, reflection and radiations. The discontinuities comprise changes in core thickness and effective refractive index. The optical powers radiated and transmitted at an abrupt discontinuity in waveguide gratings are calculated numerically by means of BPM for TE modes, and applied to the eigen mode and propagating beam analysis of that structure. The current method achieves soaring precision and converging time is significantly abridged and it is proportional to the log of the total number of periods in the waveguide than that in the conventional time-domain method. This paper intends a novel integrated photonic antenna with snooty directional efficiency and radiation which can be tattered for protracted distance optical wireless communication. The consequences confirm that it is promising to curtail radiation loss under sturdy mode coupling conditions. This method can be used for modeling of laser beam propagation in non-homogeneous atmosphere
{"title":"Radiation Characteristics of Photonic Antenna for Optical Wireless Communication using Beam Propagation Method","authors":"L. Suresh, S. Sundaravadivelu","doi":"10.1109/ICSCN.2007.350750","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350750","url":null,"abstract":"The optical wireless communication is the only solution to the emerging next generation wireless communication. The photonic antennas play major role in the development of optical wireless communications. This photonic antenna transfers light energy from optical waveguide to free-space with high directionality and act as a matching device between optical source and channel (atmosphere). The analysis of light propagation through waveguide structures is indispensable in designing complex photonic devices. The optical waveguide grating structures with multiple longitudinal reflecting interfaces are analyzed to form photonic antennas. The multilayer triangular grating structure is analyzed using beam propagation method for its ability and suitability to optical wireless communication. The beam propagation method (BPM), extensively used tool for computer simulation of light propagation in optical waveguide structures, has been developed for analyzing optical waveguides with discontinuities in transmission, reflection and radiations. The discontinuities comprise changes in core thickness and effective refractive index. The optical powers radiated and transmitted at an abrupt discontinuity in waveguide gratings are calculated numerically by means of BPM for TE modes, and applied to the eigen mode and propagating beam analysis of that structure. The current method achieves soaring precision and converging time is significantly abridged and it is proportional to the log of the total number of periods in the waveguide than that in the conventional time-domain method. This paper intends a novel integrated photonic antenna with snooty directional efficiency and radiation which can be tattered for protracted distance optical wireless communication. The consequences confirm that it is promising to curtail radiation loss under sturdy mode coupling conditions. This method can be used for modeling of laser beam propagation in non-homogeneous atmosphere","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"154 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134124349","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350668
V. Murali Bhaskaran, A. Natarajan, S. Sivanandam
Internet protocol (IP) packet traceback system identifies the origin of the sequence of IP packets when the source addresses of these packets are spoofed. IP packet traceback is usually performed with the help of routers and gateways. Several approaches have been proposed to trace IP packets to their origin. The packet marking approach enables routers to probabilistically mark packets with partial path information and tries to reconstruct the complete path from the marked packets. In most of these approaches, routers and victims (affected systems) are considerably overloaded for marking the packet and reconstructing the trace path and requires more marked packets. This paper focuses on tracing the approximate source of attack instead of tracing the entire path in multi domain system without computation, by victim and also implementing security for authentication and confidentiality. It is assumed that Internet topology has been grouped as ISP domains
{"title":"Tracebacking the Spoofed IP Packets in Multi ISP Domains with Secured Communication","authors":"V. Murali Bhaskaran, A. Natarajan, S. Sivanandam","doi":"10.1109/ICSCN.2007.350668","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350668","url":null,"abstract":"Internet protocol (IP) packet traceback system identifies the origin of the sequence of IP packets when the source addresses of these packets are spoofed. IP packet traceback is usually performed with the help of routers and gateways. Several approaches have been proposed to trace IP packets to their origin. The packet marking approach enables routers to probabilistically mark packets with partial path information and tries to reconstruct the complete path from the marked packets. In most of these approaches, routers and victims (affected systems) are considerably overloaded for marking the packet and reconstructing the trace path and requires more marked packets. This paper focuses on tracing the approximate source of attack instead of tracing the entire path in multi domain system without computation, by victim and also implementing security for authentication and confidentiality. It is assumed that Internet topology has been grouped as ISP domains","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126278838","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350749
N. Elfadel, E. Idriss, A. Mohammed, A. Aziz, N. Saad
The need for high speed networks has motivated the telecommunication community to investigate the potential of optical code division multiple access (OCDMA) in local area networks. However, multiple access interference (MAI), which increases with the number of simultaneous users, severely limits the capacity of the system. Optical parallel interference cancellation (OPIC) has been used to reduce the effect of MAI. The drawback of OPIC is that, it increases the demand for hardware complexity, resulting into higher processing time and cost. To overcome these difficulties, an efficient method is presented in this paper called, one stage optical parallel interference cancellation (OS-OPIC) which is based mainly on OPIC. Performance analysis of the proposed design is done using optical orthogonal code (OOC) as signature sequence and new expression for error probability is demonstrated. It is shown that, the proposed method is effective to reduce the hardware complexity, processing time and cost while maintaining the same bit error probability at the cost of increasing threshold value
{"title":"Multi-user Detection for the Optical CDMA: One Stage Optical Parallel Interference Cancellation","authors":"N. Elfadel, E. Idriss, A. Mohammed, A. Aziz, N. Saad","doi":"10.1109/ICSCN.2007.350749","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350749","url":null,"abstract":"The need for high speed networks has motivated the telecommunication community to investigate the potential of optical code division multiple access (OCDMA) in local area networks. However, multiple access interference (MAI), which increases with the number of simultaneous users, severely limits the capacity of the system. Optical parallel interference cancellation (OPIC) has been used to reduce the effect of MAI. The drawback of OPIC is that, it increases the demand for hardware complexity, resulting into higher processing time and cost. To overcome these difficulties, an efficient method is presented in this paper called, one stage optical parallel interference cancellation (OS-OPIC) which is based mainly on OPIC. Performance analysis of the proposed design is done using optical orthogonal code (OOC) as signature sequence and new expression for error probability is demonstrated. It is shown that, the proposed method is effective to reduce the hardware complexity, processing time and cost while maintaining the same bit error probability at the cost of increasing threshold value","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114858105","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350675
B. Borah, D. Bhattacharyya
Finding clusters with widely differing sizes, shapes and densities in presence of noise and outliers is a challenging job. The DBSCAN algorithm is a versatile clustering algorithm that can find clusters with differing size and shape in databases containing noise and outliers. But it cannot find clusters with different densities. We extend the DBSCAN algorithm so that it can also detect clusters that differ in densities. While expanding a cluster local density is taken into consideration. Starting with a core object a cluster is extended by expanding only those density connected core objects whose neighbourhood sizes are within certain ranges as determined by their neighbours already existing in the cluster. Our algorithm detects clusters even if they are not separated by sparse regions. The computational complexity of the modified algorithm (O(n log n)) remains same as the original DBSCAN
{"title":"A Clustering Technique using Density Difference","authors":"B. Borah, D. Bhattacharyya","doi":"10.1109/ICSCN.2007.350675","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350675","url":null,"abstract":"Finding clusters with widely differing sizes, shapes and densities in presence of noise and outliers is a challenging job. The DBSCAN algorithm is a versatile clustering algorithm that can find clusters with differing size and shape in databases containing noise and outliers. But it cannot find clusters with different densities. We extend the DBSCAN algorithm so that it can also detect clusters that differ in densities. While expanding a cluster local density is taken into consideration. Starting with a core object a cluster is extended by expanding only those density connected core objects whose neighbourhood sizes are within certain ranges as determined by their neighbours already existing in the cluster. Our algorithm detects clusters even if they are not separated by sparse regions. The computational complexity of the modified algorithm (O(n log n)) remains same as the original DBSCAN","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122452967","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350762
K. Rajkumar, V. Vaidehi, S. Pradeep, N. Srinivasan, M. Vanishree
As network attacks have increased in number and severity over the past few years, intrusion detection systems have become a necessary addition to the security infrastructure of most organizations. From a security perspective, firewalls and SSL offer little protection. Web traffic often contains attacks such as cross-site scripting and SQL injection that enter through port 80 and are not blocked by the firewall. Among the Web applications HTTP holds the majority share of the traffic transported through Web. In this paper, implementation of an application level IDS has been presented which uses combination of pattern matching and protocol analysis approaches. The first method of detection relies on a multi pattern matching within the protocol fields, the second one provides an efficient decision tree adaptive to the application traffic characteristics to limit the number of patterns to be checked. The proposed IDS can be effectively implemented in a high performance semantic processor
{"title":"Application Level IDS using Protocol Analysis","authors":"K. Rajkumar, V. Vaidehi, S. Pradeep, N. Srinivasan, M. Vanishree","doi":"10.1109/ICSCN.2007.350762","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350762","url":null,"abstract":"As network attacks have increased in number and severity over the past few years, intrusion detection systems have become a necessary addition to the security infrastructure of most organizations. From a security perspective, firewalls and SSL offer little protection. Web traffic often contains attacks such as cross-site scripting and SQL injection that enter through port 80 and are not blocked by the firewall. Among the Web applications HTTP holds the majority share of the traffic transported through Web. In this paper, implementation of an application level IDS has been presented which uses combination of pattern matching and protocol analysis approaches. The first method of detection relies on a multi pattern matching within the protocol fields, the second one provides an efficient decision tree adaptive to the application traffic characteristics to limit the number of patterns to be checked. The proposed IDS can be effectively implemented in a high performance semantic processor","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123800858","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350748
A. Sangeetha, K. Anusudha
A comprehensive simulation on the optimization of the management of the non linear effects in long haul light wave systems has been carried out by chirped RZ format as the format has significant advantages over the NRZ modulation format in WDM systems We have tried to demonstrate that a system reach of long-haul light wave link could be significantly improved by optimizing the dispersion map in transmission path and pre-chirping input pulses. Input powers were reduced to provide quasi-linear regime. There is a need for the optimization of the length of compensation fiber on both terminal sides to maximize the effect for channel away from zero-dispersion wavelength
{"title":"Comprehensive Simulation of Dispersion Management in Long-Haul WDM Light Wave Systems Operating in Quasi-Linear Regime","authors":"A. Sangeetha, K. Anusudha","doi":"10.1109/ICSCN.2007.350748","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350748","url":null,"abstract":"A comprehensive simulation on the optimization of the management of the non linear effects in long haul light wave systems has been carried out by chirped RZ format as the format has significant advantages over the NRZ modulation format in WDM systems We have tried to demonstrate that a system reach of long-haul light wave link could be significantly improved by optimizing the dispersion map in transmission path and pre-chirping input pulses. Input powers were reduced to provide quasi-linear regime. There is a need for the optimization of the length of compensation fiber on both terminal sides to maximize the effect for channel away from zero-dispersion wavelength","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130136384","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350667
K. Yashwanth Reddy, N.V. Deepa Gandhi, K. Balachander
The present thrust is to develop a broadband intelligent network system which is able to sustain a large number of users and a varying amount of data while maintaining high availability of resources and acceptable performance. In such a scenario, scalability is an important aspect. In this paper we consider the impact of increasing the number of users supported by a network node and show that the network is scalable. Also congestion control is necessary to protect the broadband service control point during overload situations. Existing algorithms do not operate optimally with respect to important performance criteria such as responsiveness, efficiency and fairness. Here we try to identify their shortcomings and propose few enhancements. We also show that the proposed enhanced call-gapping algorithm performs consistently better than the existing automatic call-gapping algorithm in terms of above-mentioned criteria. The effectiveness of this analysis are shown using NS-2 simulator
{"title":"Simulation and Analysis of Performance Models of Broadband Intelligent Mobile Networks","authors":"K. Yashwanth Reddy, N.V. Deepa Gandhi, K. Balachander","doi":"10.1109/ICSCN.2007.350667","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350667","url":null,"abstract":"The present thrust is to develop a broadband intelligent network system which is able to sustain a large number of users and a varying amount of data while maintaining high availability of resources and acceptable performance. In such a scenario, scalability is an important aspect. In this paper we consider the impact of increasing the number of users supported by a network node and show that the network is scalable. Also congestion control is necessary to protect the broadband service control point during overload situations. Existing algorithms do not operate optimally with respect to important performance criteria such as responsiveness, efficiency and fairness. Here we try to identify their shortcomings and propose few enhancements. We also show that the proposed enhanced call-gapping algorithm performs consistently better than the existing automatic call-gapping algorithm in terms of above-mentioned criteria. The effectiveness of this analysis are shown using NS-2 simulator","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"359 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122760277","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 : 2007-11-05DOI: 10.1109/ICSCN.2007.350696
V. Jagannathan, A. Mahadevan, R. Hariharan, S. Srinivasan
Image compression and image encryption are pivotal to proper storage and transmission of images. Simultaneous image compression and encryption aims at achieving enhanced bandwidth utilization and security at the same time. The proposed number theory based image compression encryption (NTICE) algorithm employs number theoretic paradigm-Chinese remainder theorem, to solve congruencies and hence realize the twin ideals of compression and encryption simultaneously. The NTICE algorithm has been implemented on color images. The image coding results, calculated from actual image size and encoded image file, are comparable to the results obtained through much more sophisticated and computationally complex methods. In addition, the algorithm has been applied to the scenario of image multiplexing in order to obtain enhanced level of security along with compression
{"title":"Number Theory Based Image Compression Encryption and Application to Image Multiplexing","authors":"V. Jagannathan, A. Mahadevan, R. Hariharan, S. Srinivasan","doi":"10.1109/ICSCN.2007.350696","DOIUrl":"https://doi.org/10.1109/ICSCN.2007.350696","url":null,"abstract":"Image compression and image encryption are pivotal to proper storage and transmission of images. Simultaneous image compression and encryption aims at achieving enhanced bandwidth utilization and security at the same time. The proposed number theory based image compression encryption (NTICE) algorithm employs number theoretic paradigm-Chinese remainder theorem, to solve congruencies and hence realize the twin ideals of compression and encryption simultaneously. The NTICE algorithm has been implemented on color images. The image coding results, calculated from actual image size and encoded image file, are comparable to the results obtained through much more sophisticated and computationally complex methods. In addition, the algorithm has been applied to the scenario of image multiplexing in order to obtain enhanced level of security along with compression","PeriodicalId":257948,"journal":{"name":"2007 International Conference on Signal Processing, Communications and Networking","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123976198","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
扫码关注我们
求助内容：
应助结果提醒方式：