A. Hassan, A. Al-Hamadi, B. Michaelis, Y. Hasan, Mohamed A. A. Wahab
The great advance in image processing demands a guarantee for assuring integrity of images. In this paper, a semi-fragile image authentication technique is proposed, which can detect and localize the malicious alteration distinguishing the content-preserving manipulations, such as JPEG compression, from the content alterations. The original image is divided into large blocks (sub-images) that are also divided into 8x8 blocks. Secure image hashing is utilized to generate the sub-image hash (signature) that may slightly change when the content-preserving manipulations are applied. Then, two sub-image hash copies are embedded into relatively-distant sub-images using a doubly linked chain, which prevents the vector quantization (VQ) attack. The hash bits are robustly embedded in chosen discrete cosine transform (DCT) coefficients exploiting a property of DCT coefficients that is invariant before and after JPEG compression. The experimental results show that the proposed technique successfully detects and localizes the content alterations only. Furthermore, It can effectively resist many attacks such as vector quantization attacks.
{"title":"Semi-fragile Image Authentication Using Robust Image Hashing with Localization","authors":"A. Hassan, A. Al-Hamadi, B. Michaelis, Y. Hasan, Mohamed A. A. Wahab","doi":"10.1109/ICMV.2009.66","DOIUrl":"https://doi.org/10.1109/ICMV.2009.66","url":null,"abstract":"The great advance in image processing demands a guarantee for assuring integrity of images. In this paper, a semi-fragile image authentication technique is proposed, which can detect and localize the malicious alteration distinguishing the content-preserving manipulations, such as JPEG compression, from the content alterations. The original image is divided into large blocks (sub-images) that are also divided into 8x8 blocks. Secure image hashing is utilized to generate the sub-image hash (signature) that may slightly change when the content-preserving manipulations are applied. Then, two sub-image hash copies are embedded into relatively-distant sub-images using a doubly linked chain, which prevents the vector quantization (VQ) attack. The hash bits are robustly embedded in chosen discrete cosine transform (DCT) coefficients exploiting a property of DCT coefficients that is invariant before and after JPEG compression. The experimental results show that the proposed technique successfully detects and localizes the content alterations only. Furthermore, It can effectively resist many attacks such as vector quantization attacks.","PeriodicalId":315778,"journal":{"name":"2009 Second International Conference on Machine Vision","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128830091","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}
This paper analyzes the composition of the system video signal sampling frequency and the image acquisition system, designs the hardware structure and work processes of the image acquisition system, and specifies the system design direction and work principle. Finally it describes smoothing filter, edge detection image processing algorithms, and analyzes the experimental results to select the image processing algorithms the system needed, to apply it to the DSP in this system.
{"title":"Frame Design and Algorithm Research on A New Image Acquisition System","authors":"L. Bo, Cheng Ping-guang","doi":"10.1109/ICMV.2009.75","DOIUrl":"https://doi.org/10.1109/ICMV.2009.75","url":null,"abstract":"This paper analyzes the composition of the system video signal sampling frequency and the image acquisition system, designs the hardware structure and work processes of the image acquisition system, and specifies the system design direction and work principle. Finally it describes smoothing filter, edge detection image processing algorithms, and analyzes the experimental results to select the image processing algorithms the system needed, to apply it to the DSP in this system.","PeriodicalId":315778,"journal":{"name":"2009 Second International Conference on Machine Vision","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133954734","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}
Today's high speed, complex manufacturing systems require the development of automation technologies that can be efficiently integrated into the systems and used in manufacture floors. This article presents a successful industrial application of machine vision technology for medical syringe assembly. The developed vision inspection station with ten cameras that was integrated into an assembly line has a capability of inspecting 5 syringes per 250 million seconds for a total production rate of ranging from 300 to 600 parts per minute.
{"title":"A Machine Vision Application for Industrial Assembly Inspection","authors":"J. Jia","doi":"10.1109/ICMV.2009.51","DOIUrl":"https://doi.org/10.1109/ICMV.2009.51","url":null,"abstract":"Today's high speed, complex manufacturing systems require the development of automation technologies that can be efficiently integrated into the systems and used in manufacture floors. This article presents a successful industrial application of machine vision technology for medical syringe assembly. The developed vision inspection station with ten cameras that was integrated into an assembly line has a capability of inspecting 5 syringes per 250 million seconds for a total production rate of ranging from 300 to 600 parts per minute.","PeriodicalId":315778,"journal":{"name":"2009 Second International Conference on Machine Vision","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131002471","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}
Quality of a software component can be measured in terms of fault proneness of data. Quality estimations are made using fault proneness data available from previously developed similar type of projects and the training data consisting of software measurements. To predict faulty modules in software data different techniques have been proposed which includes statistical method, machine learning methods, neural network techniques and clustering techniques. The aim of proposed approach is to investigate that whether metrics available in the early lifecycle (i.e. requirement metrics), metrics available in the late lifecycle (i.e. code metrics) and metrics available in the early lifecycle (i.e. requirement metrics) combined with metrics available in the late lifecycle (i.e. code metrics) can be used to identify fault prone modules by using clustering techniques. This approach has been tested with three real time defect datasets of NASA software projects, JM1, PC1 and CM1. Predicting faults early in the software life cycle can be used to improve software process control and achieve high software reliability. The results show that when all the prediction techniques are evaluated, the best prediction model is found to be the fusion of requirement and code metric model.
{"title":"Early Software Fault Prediction Using Real Time Defect Data","authors":"A. Kaur, P. Sandhu, Amanpreet Singh Bra","doi":"10.1109/ICMV.2009.54","DOIUrl":"https://doi.org/10.1109/ICMV.2009.54","url":null,"abstract":"Quality of a software component can be measured in terms of fault proneness of data. Quality estimations are made using fault proneness data available from previously developed similar type of projects and the training data consisting of software measurements. To predict faulty modules in software data different techniques have been proposed which includes statistical method, machine learning methods, neural network techniques and clustering techniques. The aim of proposed approach is to investigate that whether metrics available in the early lifecycle (i.e. requirement metrics), metrics available in the late lifecycle (i.e. code metrics) and metrics available in the early lifecycle (i.e. requirement metrics) combined with metrics available in the late lifecycle (i.e. code metrics) can be used to identify fault prone modules by using clustering techniques. This approach has been tested with three real time defect datasets of NASA software projects, JM1, PC1 and CM1. Predicting faults early in the software life cycle can be used to improve software process control and achieve high software reliability. The results show that when all the prediction techniques are evaluated, the best prediction model is found to be the fusion of requirement and code metric model.","PeriodicalId":315778,"journal":{"name":"2009 Second International Conference on Machine Vision","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114460473","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}
The current seat adjustment mechanism in automobiles is quite tedious and outdated and has its toll on the body of the person while adjusting the seat to his/her comfortable position. Every person has his/her comfortable seat position, so every time a person sits in an automobile, adjustment of the seat has to be done according to the comfort of the individual, this is tiresome and at times annoying. This paper deals with automating the seat of an automobile through the use of a microcontroller and image processing toolkit of Matlab thereby reducing manual effort in adjusting the seat. The adjustment of the seat can be done horizontally, vertically as well as the inclination of the seat can be changed by controlling the direction of rotation and speed of the motors provided in the seat. The parameters of the comfortable position for different individuals are stored in the database and the seat is adjusted to a person’s comfortable position by using face recognition algorithm which is used to link the parameters of a person’s comfortable position stored in the database to his/her face.
{"title":"Automation in Automobiles: Power Seat","authors":"Akshay Lahiry, Samarth Chanana, Sourabh Kanwar","doi":"10.1109/ICMV.2009.58","DOIUrl":"https://doi.org/10.1109/ICMV.2009.58","url":null,"abstract":"The current seat adjustment mechanism in automobiles is quite tedious and outdated and has its toll on the body of the person while adjusting the seat to his/her comfortable position. Every person has his/her comfortable seat position, so every time a person sits in an automobile, adjustment of the seat has to be done according to the comfort of the individual, this is tiresome and at times annoying. This paper deals with automating the seat of an automobile through the use of a microcontroller and image processing toolkit of Matlab thereby reducing manual effort in adjusting the seat. The adjustment of the seat can be done horizontally, vertically as well as the inclination of the seat can be changed by controlling the direction of rotation and speed of the motors provided in the seat. The parameters of the comfortable position for different individuals are stored in the database and the seat is adjusted to a person’s comfortable position by using face recognition algorithm which is used to link the parameters of a person’s comfortable position stored in the database to his/her face.","PeriodicalId":315778,"journal":{"name":"2009 Second International Conference on Machine Vision","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117141622","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}
In this paper, a new approach to fingerprint ridge orientation estimation smoothing by a conditional selection of orthogonal polynomials is proposed. This method can smooth the low coherence and consistency areas of fingerprint OF. Also, it is able to estimate the Orientation Field (OF) for fingerprint areas of no ridge information This method does not need any basis information of Singular Points (SPs). The algorithm uses a consecutive application of filtering-based and model-based orientation smoothing methods. A Gaussian filter has been employed for the former. The latter conditionally employs one of the orthogonal polynomials such as Legendre and Chebyshev type I or II, based on the results of the filtering based stage. The experiments have been conducted on the fingerprint images of FVC2000 DB2_A, FVC2004 DB3_A and DB4_A. The results show coarse ridge orientation estimation improvement even in very poor quality images where the orientation information cannot be clearly extracted.
{"title":"A Conditional Selection of Orthogonal Legendre/Chebyshev Polynomials as a Novel Fingerprint Orientation Estimation Smoothing Method","authors":"A. Tashk, M. Helfroush, M. Dehghani","doi":"10.1109/ICMV.2009.49","DOIUrl":"https://doi.org/10.1109/ICMV.2009.49","url":null,"abstract":"In this paper, a new approach to fingerprint ridge orientation estimation smoothing by a conditional selection of orthogonal polynomials is proposed. This method can smooth the low coherence and consistency areas of fingerprint OF. Also, it is able to estimate the Orientation Field (OF) for fingerprint areas of no ridge information This method does not need any basis information of Singular Points (SPs). The algorithm uses a consecutive application of filtering-based and model-based orientation smoothing methods. A Gaussian filter has been employed for the former. The latter conditionally employs one of the orthogonal polynomials such as Legendre and Chebyshev type I or II, based on the results of the filtering based stage. The experiments have been conducted on the fingerprint images of FVC2000 DB2_A, FVC2004 DB3_A and DB4_A. The results show coarse ridge orientation estimation improvement even in very poor quality images where the orientation information cannot be clearly extracted.","PeriodicalId":315778,"journal":{"name":"2009 Second International Conference on Machine Vision","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116435040","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}
The aim of this paper is to introduce the application of an S-shaped transition curve in designing and generating a spur gear. In engineering field, the spur gear usually designed by using an involute curve where this curve needs to use a tracing point method to obtain a curve while an S-shaped curve can obtain a curve directly. The comparative study between an S-shaped method and direct method in Computer Aided Design (CAD) tool also covered.
{"title":"Spur Gear Design With an S-shaped Transition Curve Application Using MATHEMATICA and CAD Tools","authors":"S. H. Yahaya, M. S. Salleh, J. Ali","doi":"10.1109/ICMV.2009.19","DOIUrl":"https://doi.org/10.1109/ICMV.2009.19","url":null,"abstract":"The aim of this paper is to introduce the application of an S-shaped transition curve in designing and generating a spur gear. In engineering field, the spur gear usually designed by using an involute curve where this curve needs to use a tracing point method to obtain a curve while an S-shaped curve can obtain a curve directly. The comparative study between an S-shaped method and direct method in Computer Aided Design (CAD) tool also covered.","PeriodicalId":315778,"journal":{"name":"2009 Second International Conference on Machine Vision","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133417375","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
扫码关注我们
求助内容：
应助结果提醒方式：