Pub Date : 2005-10-09DOI: 10.1109/SIBGRAPI.2005.45
A. Marana, Anil K. Jain
Despite the efficacy of minutia-based fingerprint matching techniques for good-quality images captured by optical sensors, minutia-based techniques do not often perform so well on poor-quality images or fingerprint images captured by small solid-state sensors. Solid-state fingerprint sensors are being increasingly deployed in a wide range of applications for user authentication purposes. Therefore, it is necessary to develop new fingerprint-matching techniques that utilize other features to deal with fingerprint images captured by solid-state sensors. This paper presents a new fingerprint matching technique based on fingerprint ridge features. This technique was assessed on the MSU-VERIDICOM database, which consists of fingerprint impressions obtained from 160 users (4 impressions per finger) using a solid-state sensor. The combination of ridge-based matching scores computed by the proposed ridge-based technique with minutia-based matching scores leads to a reduction of the false non-match rate by approximately 1.7% at a false match rate of 0.1%.
{"title":"Ridge-Based Fingerprint Matching Using Hough Transform","authors":"A. Marana, Anil K. Jain","doi":"10.1109/SIBGRAPI.2005.45","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2005.45","url":null,"abstract":"Despite the efficacy of minutia-based fingerprint matching techniques for good-quality images captured by optical sensors, minutia-based techniques do not often perform so well on poor-quality images or fingerprint images captured by small solid-state sensors. Solid-state fingerprint sensors are being increasingly deployed in a wide range of applications for user authentication purposes. Therefore, it is necessary to develop new fingerprint-matching techniques that utilize other features to deal with fingerprint images captured by solid-state sensors. This paper presents a new fingerprint matching technique based on fingerprint ridge features. This technique was assessed on the MSU-VERIDICOM database, which consists of fingerprint impressions obtained from 160 users (4 impressions per finger) using a solid-state sensor. The combination of ridge-based matching scores computed by the proposed ridge-based technique with minutia-based matching scores leads to a reduction of the false non-match rate by approximately 1.7% at a false match rate of 0.1%.","PeriodicalId":193103,"journal":{"name":"XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122740900","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}
We present in this work a new method for the tomographic reconstruction with Poisson noise corrupted projections. The reconstruction method is a hybrid estimation theoretic-POCS (Projection Onto Convex Sets) method performed by first estimating the noisy projections using Anscombe Transformation, Discrete Wavelet Transform and pointwise Wiener filter and subsequently reconstructing the images through a parallel POCS method. The use of a previous filtering of the projections imposes a tighter restriction on the observation of the POCS method, allowing a better reconstruction, with a very little increase in computational cost.
{"title":"A Hybrid Estimation Theoretic-POCS Method for Tomographic Image Reconstruction","authors":"F. V. Salina, N. Mascarenhas","doi":"10.1109/SIBGRAPI.2005.4","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2005.4","url":null,"abstract":"We present in this work a new method for the tomographic reconstruction with Poisson noise corrupted projections. The reconstruction method is a hybrid estimation theoretic-POCS (Projection Onto Convex Sets) method performed by first estimating the noisy projections using Anscombe Transformation, Discrete Wavelet Transform and pointwise Wiener filter and subsequently reconstructing the images through a parallel POCS method. The use of a previous filtering of the projections imposes a tighter restriction on the observation of the POCS method, allowing a better reconstruction, with a very little increase in computational cost.","PeriodicalId":193103,"journal":{"name":"XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115943804","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 : 2005-10-09DOI: 10.1109/SIBGRAPI.2005.46
G. M. Faustino, L. H. Figueiredo
We present an algorithm that creates a mosaic effect for an image in an adaptive and automatic fashion. The algorithm is automatic because it does not need user intervention, except for the choice of a couple of parameters. The algorithm is adaptive because it creates tiles whose sizes are adapted to the features of the image. This is achieved by using a centroidal Voronoi diagram with a density function that emphasizes image features.
{"title":"Simple Adaptive Mosaic Effects","authors":"G. M. Faustino, L. H. Figueiredo","doi":"10.1109/SIBGRAPI.2005.46","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2005.46","url":null,"abstract":"We present an algorithm that creates a mosaic effect for an image in an adaptive and automatic fashion. The algorithm is automatic because it does not need user intervention, except for the choice of a couple of parameters. The algorithm is adaptive because it creates tiles whose sizes are adapted to the features of the image. This is achieved by using a centroidal Voronoi diagram with a density function that emphasizes image features.","PeriodicalId":193103,"journal":{"name":"XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123415569","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 : 2005-10-09DOI: 10.1109/SIBGRAPI.2005.14
C. Morimoto, T. T. Santos, Adriano S. Muniz
This paper introduces a fast, robust and accurate iris segmentation technique based on active lighting. The geometry of the light sources, a single camera and the eye facilitates the detection of the pupil and the automatic selection of the most appropriate image for biometric identification from the video stream, minimizing the effects of noise, distortion and occlusion during the image acquisition process. Two near infrared (NIR) light sources (that are invisible to the human eye) are synchronized with the video signal. One of the light sources is placed near the optical axis of the camera, and generates a bright pupil image. The second light is placed off-axis, generating dark pupil images. These two images can be easily combined to segment the pupil region, and the corneal reflection of the light sources can be used to select best quality images. The pupil position is then used to segment the iris and eyelids using a coarse-to-fine strategy. Experimental results with a real-time prototype show the quality of the iris segmentation.
{"title":"Automatic Iris Segmentation Using Active Near Infra Red Lighting","authors":"C. Morimoto, T. T. Santos, Adriano S. Muniz","doi":"10.1109/SIBGRAPI.2005.14","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2005.14","url":null,"abstract":"This paper introduces a fast, robust and accurate iris segmentation technique based on active lighting. The geometry of the light sources, a single camera and the eye facilitates the detection of the pupil and the automatic selection of the most appropriate image for biometric identification from the video stream, minimizing the effects of noise, distortion and occlusion during the image acquisition process. Two near infrared (NIR) light sources (that are invisible to the human eye) are synchronized with the video signal. One of the light sources is placed near the optical axis of the camera, and generates a bright pupil image. The second light is placed off-axis, generating dark pupil images. These two images can be easily combined to segment the pupil region, and the corneal reflection of the light sources can be used to select best quality images. The pupil position is then used to segment the iris and eyelids using a coarse-to-fine strategy. Experimental results with a real-time prototype show the quality of the iris segmentation.","PeriodicalId":193103,"journal":{"name":"XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)","volume":"246 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123010986","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 : 2005-10-09DOI: 10.1109/SIBGRAPI.2005.24
T. Lewiner, Cynthia O. L. Ferreira, M. Craizer, Ralph Teixeira
This work proposes a scheme for multi-resolution representation of union of balls in the plane. This representation is inspired by curvature motion for smooth curves. More precisely, the proposed evolution of centres and radii of the balls are based on equations of evolution of the medial axis of a curve that performs curvature motion. The results obtained are very close to the pixel approximation of curvature motion.
{"title":"Curvature Motion for Union of Balls","authors":"T. Lewiner, Cynthia O. L. Ferreira, M. Craizer, Ralph Teixeira","doi":"10.1109/SIBGRAPI.2005.24","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2005.24","url":null,"abstract":"This work proposes a scheme for multi-resolution representation of union of balls in the plane. This representation is inspired by curvature motion for smooth curves. More precisely, the proposed evolution of centres and radii of the balls are based on equations of evolution of the medial axis of a curve that performs curvature motion. The results obtained are very close to the pixel approximation of curvature motion.","PeriodicalId":193103,"journal":{"name":"XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132188953","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 : 2005-10-09DOI: 10.1109/SIBGRAPI.2005.28
C. Hofsetz, N. Max
This paper presents a method to accelerate algorithms that need a correct and complete visibility ordering of their data for rendering. The technique works by first pre-sorting primitives using three lists - one for each axis, and then combining them using graphics hardware, by either clipping the projected primitives while rendering, according to the current list being processed, or by rendering each list to a texture and merging the textures in the end. We show that our algorithm works by applying it to the splatting technique using several types of rendering, including classic splatting and volume rendering.
{"title":"Hardware-Assisted Visibility Ordering for Point-Based and Volume Rendering","authors":"C. Hofsetz, N. Max","doi":"10.1109/SIBGRAPI.2005.28","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2005.28","url":null,"abstract":"This paper presents a method to accelerate algorithms that need a correct and complete visibility ordering of their data for rendering. The technique works by first pre-sorting primitives using three lists - one for each axis, and then combining them using graphics hardware, by either clipping the projected primitives while rendering, according to the current list being processed, or by rendering each list to a texture and merging the textures in the end. We show that our algorithm works by applying it to the splatting technique using several types of rendering, including classic splatting and volume rendering.","PeriodicalId":193103,"journal":{"name":"XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116042667","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 : 2005-10-09DOI: 10.1109/SIBGRAPI.2005.36
E. F. Morais, M. Campos, F. Pádua, R. Carceroni
In this paper we study the use of computer vision techniques for for underwater visual tracking and counting of fishes in vivo. The methodology is based on the application of a Bayesian filtering technique that enables tracking of objects whose number may vary over time. Unlike existing fish-counting methods, this approach provides adequate means for the acquisition of relevant information about characteristics of different fish species such as swimming ability, time of migration and peak flow rates. The system is also able to estimate fish trajectories over time, which can be further used to study their behaviors when swimming in regions of interest. Our experiments demonstrate that the proposed method can operate reliably under severe environmental changes (e.g. variations in water turbidity) and handle problems such as occlusions or large inter-frame motions. The proposed approach was successfully validated with real-world video streams, achieving overall accuracy as high as 81%.
{"title":"Particle Filter-Based Predictive Tracking for Robust Fish Counting","authors":"E. F. Morais, M. Campos, F. Pádua, R. Carceroni","doi":"10.1109/SIBGRAPI.2005.36","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2005.36","url":null,"abstract":"In this paper we study the use of computer vision techniques for for underwater visual tracking and counting of fishes in vivo. The methodology is based on the application of a Bayesian filtering technique that enables tracking of objects whose number may vary over time. Unlike existing fish-counting methods, this approach provides adequate means for the acquisition of relevant information about characteristics of different fish species such as swimming ability, time of migration and peak flow rates. The system is also able to estimate fish trajectories over time, which can be further used to study their behaviors when swimming in regions of interest. Our experiments demonstrate that the proposed method can operate reliably under severe environmental changes (e.g. variations in water turbidity) and handle problems such as occlusions or large inter-frame motions. The proposed approach was successfully validated with real-world video streams, achieving overall accuracy as high as 81%.","PeriodicalId":193103,"journal":{"name":"XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125153939","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 : 2005-10-09DOI: 10.1109/SIBGRAPI.2005.10
C. Jung, C. Kelber
In this paper, we propose a new model for lane tracking and curve detection. We use a linear-parabolic model for each lane boundary, and apply constraints to link both lane boundaries based on the expected geometry of the road. The parabolic part of the model, which fits the far field, is then used to analyze the geometry of the road ahead (straight, right curve or left curve), with applications in driver’s assistance systems and road inspection. Experimental results indicate that introduced geometric constraints result in a more consistent fit if compared to the individual fitting of each lane boundary, and that the parabolic part of the model can be effectively used to keep the driver informed about the geometry of the road in front of him/her.
{"title":"An Improved Linear-Parabolic Model for Lane Following and Curve Detection","authors":"C. Jung, C. Kelber","doi":"10.1109/SIBGRAPI.2005.10","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2005.10","url":null,"abstract":"In this paper, we propose a new model for lane tracking and curve detection. We use a linear-parabolic model for each lane boundary, and apply constraints to link both lane boundaries based on the expected geometry of the road. The parabolic part of the model, which fits the far field, is then used to analyze the geometry of the road ahead (straight, right curve or left curve), with applications in driver’s assistance systems and road inspection. Experimental results indicate that introduced geometric constraints result in a more consistent fit if compared to the individual fitting of each lane boundary, and that the parabolic part of the model can be effectively used to keep the driver informed about the geometry of the road in front of him/her.","PeriodicalId":193103,"journal":{"name":"XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121343432","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 : 2005-10-09DOI: 10.1109/SIBGRAPI.2005.25
M. S. Nery, A.M.C. Machado, M. Campos, F. Pádua, R. Carceroni, J. P. Queiroz-Neto
We present a novel fish classification methodology based on a robust feature selection technique. Unlike existing works for fish classification, which propose descriptors and do not analyze their individual impacts in the whole classification task, we propose a general set of features and their correspondent weights that should be used as a priori information by the classifier. In this sense, instead of studying techniques for improving the classifiers structure itself, we consider it as a "black box" and focus our research in the determination of which input information must bring a robust fish discrimination. All the experiments were performed with fish species of Rio Grande river in Minas Gerais, Brazil. This work has been developed as part of a wider research [3], which has as main goal the development of effective fish ladders for the Brazilian dams.
{"title":"Determining the Appropriate Feature Set for Fish Classification Tasks","authors":"M. S. Nery, A.M.C. Machado, M. Campos, F. Pádua, R. Carceroni, J. P. Queiroz-Neto","doi":"10.1109/SIBGRAPI.2005.25","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2005.25","url":null,"abstract":"We present a novel fish classification methodology based on a robust feature selection technique. Unlike existing works for fish classification, which propose descriptors and do not analyze their individual impacts in the whole classification task, we propose a general set of features and their correspondent weights that should be used as a priori information by the classifier. In this sense, instead of studying techniques for improving the classifiers structure itself, we consider it as a \"black box\" and focus our research in the determination of which input information must bring a robust fish discrimination. All the experiments were performed with fish species of Rio Grande river in Minas Gerais, Brazil. This work has been developed as part of a wider research [3], which has as main goal the development of effective fish ladders for the Brazilian dams.","PeriodicalId":193103,"journal":{"name":"XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)","volume":"352 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116675064","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 : 2005-10-09DOI: 10.1109/SIBGRAPI.2005.31
A. Cuadros-Vargas, L. G. Nonato, R. Minghim, Tiago Etiene
Generating triangular meshes from images is a task important to many applications. Usually, techniques that can do that either take as starting point a segmented image or generate a mesh without distinguishing different structures contained in the image. In both cases the results can be satisfactory for a number of applications, but the pre-segmentation and the absence of well defined structures imply in difficulties using the resulting mesh for simulations. Furthermore, guarantee of good quality meshes is also a common problem in previous results. In this work we present a new technique for mesh generation that handles these problems well. First, it eliminates the need for pre-processing by building the segmentation into the mesh generation process. Second, the mesh generation process takes into acount the quality of the mesh elements, producing as result meshes of better quality than previous techniques.
{"title":"Imesh: An Image Based Quality Mesh Generation Technique","authors":"A. Cuadros-Vargas, L. G. Nonato, R. Minghim, Tiago Etiene","doi":"10.1109/SIBGRAPI.2005.31","DOIUrl":"https://doi.org/10.1109/SIBGRAPI.2005.31","url":null,"abstract":"Generating triangular meshes from images is a task important to many applications. Usually, techniques that can do that either take as starting point a segmented image or generate a mesh without distinguishing different structures contained in the image. In both cases the results can be satisfactory for a number of applications, but the pre-segmentation and the absence of well defined structures imply in difficulties using the resulting mesh for simulations. Furthermore, guarantee of good quality meshes is also a common problem in previous results. In this work we present a new technique for mesh generation that handles these problems well. First, it eliminates the need for pre-processing by building the segmentation into the mesh generation process. Second, the mesh generation process takes into acount the quality of the mesh elements, producing as result meshes of better quality than previous techniques.","PeriodicalId":193103,"journal":{"name":"XVIII Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI'05)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129153219","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}