{"title":"An efficient vehicle queue detection system based on image processing","authors":"M. Zanin, S. Messelodi, C. M. Modena","doi":"10.1109/ICIAP.2003.1234055","DOIUrl":"https://doi.org/10.1109/ICIAP.2003.1234055","url":null,"abstract":"This paper describes a method for the real-time measurement of vehicle queue parameters in a video-based traffic monitoring experimental system. The method proposed here is based on vehicle presence detection and movement analysis in video sequences acquired by a stationary camera. Queues are detected and characterized by a severity index. Intensive experiments show the robustness of the method under varying illumination and weather conditions. The system is presently undergoing an on-field testing phase in a double ways road near Trento, Italy, where queues frequently occur.","PeriodicalId":218076,"journal":{"name":"12th International Conference on Image Analysis and Processing, 2003.Proceedings.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125665901","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}
{"title":"Unsupervised texture segmentation by dominant sets and game dynamics","authors":"M. Pavan, M. Pelillo","doi":"10.1109/ICIAP.2003.1234067","DOIUrl":"https://doi.org/10.1109/ICIAP.2003.1234067","url":null,"abstract":"We develop a framework for the unsupervised texture segmentation problem based on dominant sets, a new graph-theoretic concept that has proven to be relevant in pairwise data clustering as well as image segmentation problems. A remarkable correspondence between dominant sets and the extrema of a quadratic form over the standard simplex allows us to use continuous optimization techniques such as replicator dynamics from evolutionary game theory. Such systems are attractive as can easily be implemented in a parallel network of locally interacting computational units, thereby motivating analog VLSI implementations. We present experimental results on various textured images which confirm the effectiveness of the approach.","PeriodicalId":218076,"journal":{"name":"12th International Conference on Image Analysis and Processing, 2003.Proceedings.","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131800881","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}
{"title":"Pathological lesion detection in 3D dynamic PET images using asymmetry","authors":"Zhe Chen, D. Feng, Weidong (Tom) Cai","doi":"10.1109/ICIAP.2003.1234066","DOIUrl":"https://doi.org/10.1109/ICIAP.2003.1234066","url":null,"abstract":"This paper describes a segment-based asymmetry feature detection approach for three-dimensional positron emission tomography (PET) brain images to automatically extract pathological lesions. The method consists of three stages: preprocessing, segmentation, and asymmetry detection. The method was tested on simulation and clinical data sets and a per-pixel asymmetry feature detection is experimentally compared with our per-segment approach and the per-segment method is shown to produce fewer false positives and better demarcation in the PET data examples presented.","PeriodicalId":218076,"journal":{"name":"12th International Conference on Image Analysis and Processing, 2003.Proceedings.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132869229","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}
{"title":"The mantis head camera (why the praying mantis is so good at catching its prey)","authors":"Igor Katsman, E. Rivlin","doi":"10.1109/ICIAP.2003.1234118","DOIUrl":"https://doi.org/10.1109/ICIAP.2003.1234118","url":null,"abstract":"Inspired by the abilities of the praying mantis to judge the distance to its prey before striking by use of motion-based visually mediated odometry, we create a miniature model for depth estimation that is similar to the head movements of the praying mantis. We develop mathematical models of the praying mantis behavior and describe our implementations and experimental environment. We investigate the structure-from-motion problem when images are taken from a camera whose focal point is translating according to the biological model. This motion is reminiscent of a praying mantis peering its head left and right, apparently to obtain depth perception, hence \"mantis head camera\". We present the performance of the mantis head camera model and provide experimental results and error analysis of the algorithm. The precision of our mathematical model and its implementation is consistent with experimental facts obtained from various biological experiments.","PeriodicalId":218076,"journal":{"name":"12th International Conference on Image Analysis and Processing, 2003.Proceedings.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121957615","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}
{"title":"A spectral analysis of perceptual shape variation","authors":"Alex Hughes, Richard C. Wilson","doi":"10.1109/ICIAP.2003.1234022","DOIUrl":"https://doi.org/10.1109/ICIAP.2003.1234022","url":null,"abstract":"Many methods of statistical shape description operate by describing shapes in terms of the variations inherent in a training set. This represents a limitation in that a training set must be assembled beforehand, and that only shapes lying within the span of the training data can be succinctly described. We develop a statistical representation that describes a shape in terms of the variations inherent in that shape, without reference to training images. Our new representation is then used to characterise a number of perceptual deformations, with the intent being to investigate how well such deformations can be captured and modelled by our description.","PeriodicalId":218076,"journal":{"name":"12th International Conference on Image Analysis and Processing, 2003.Proceedings.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116144124","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}
{"title":"Hierarchical matching of panoramic images","authors":"R. Glantz, M. Pelillo, W. Kropatsch","doi":"10.1109/ICIAP.2003.1234071","DOIUrl":"https://doi.org/10.1109/ICIAP.2003.1234071","url":null,"abstract":"When matching regions from \"similar\" images, one typically has the problem of missing counterparts due to local or even global variations of segmentation fineness. Matching segmentation hierarchies, however, not only increases the chances of finding counterparts, but also allows us to exploit the manifold constraints coming from the topological relations between the regions in a hierarchy. In this paper we match hierarchies from panoramic images by constructing an association graph G/sub A/ whose vertices represent potential matches and whose edges indicate topological consistency. Specifically, a maximal [maximum] weight clique of GA corresponds to a topologically consistent mapping with maximal [maximum] total similarity. To find \"heavy\" cliques, we adapt a greedy pivoting-based heuristic to the weighted case. Experiments on pairs of panoramic images demonstrate the reliability of the results.","PeriodicalId":218076,"journal":{"name":"12th International Conference on Image Analysis and Processing, 2003.Proceedings.","volume":"4 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120994226","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}
{"title":"A shortest path representation for video summarisation","authors":"S. Porter, M. Mirmehdi, B. Thomas","doi":"10.1109/ICIAP.2003.1234093","DOIUrl":"https://doi.org/10.1109/ICIAP.2003.1234093","url":null,"abstract":"A novel approach is presented to select multiple key frames within an isolated video shot where there is camera motion causing significant scene change. This is achieved by determining the dominant motion between frame pairs whose similarities are represented using a directed weighted graph. The shortest path in the graph, found using the A* search algorithm, designates the key frames. The overall method can be applied to extract a set of key frames which portray both the video content and camera motions, all of which are useful features for video indexing and retrieval.","PeriodicalId":218076,"journal":{"name":"12th International Conference on Image Analysis and Processing, 2003.Proceedings.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131161873","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}
{"title":"Towards automatic 3D reconstruction of urban scenes from low-altitude aerial images","authors":"Adriano B. Huguet, R. Carceroni, A. Araújo","doi":"10.1109/ICIAP.2003.1234059","DOIUrl":"https://doi.org/10.1109/ICIAP.2003.1234059","url":null,"abstract":"We propose a methodology for reconstructing large-scale architectural scenes from low-altitude aerial images, in an efficient, accurate and fully automatic way. Towards this goal, we have developed an area-based segmentation technique, called colored watershed, that is particularly suited to segmenting objects with homogeneous photometric properties, which are typical of such scenes. This technique is now being combined with a dense-stereo method biased towards depth discontinuities near the edges of the segmented objects. In a final step, parametric models of these segmented objects are instantiated and directly adjusted to the multiple images available to generate a mixed surface and elevation map for each scene.","PeriodicalId":218076,"journal":{"name":"12th International Conference on Image Analysis and Processing, 2003.Proceedings.","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131488569","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}
{"title":"A feature-based face recognition system","authors":"P. Campadelli, R. Lanzarotti, Chiara Savazzi","doi":"10.1109/ICIAP.2003.1234027","DOIUrl":"https://doi.org/10.1109/ICIAP.2003.1234027","url":null,"abstract":"A completely automatic face recognition system is presented. The method works on color and gray level images: after having localized the face and the facial features, it determines 16 facial fiducial points, and characterizes them by applying a bank of filters which extract the peculiar texture around them (jets). Recognition is realized by measuring the similarity between the different jets. The system is inspired by the elastic bunch graph method, but the fiducial point localization does not require any manual setting or operator intervention.","PeriodicalId":218076,"journal":{"name":"12th International Conference on Image Analysis and Processing, 2003.Proceedings.","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131542701","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}
{"title":"Color matching by using tuple matching","authors":"D. Balthasar","doi":"10.1109/ICIAP.2003.1234083","DOIUrl":"https://doi.org/10.1109/ICIAP.2003.1234083","url":null,"abstract":"We present a new matching method called tuple matching (TM), which is an algorithm for matching image signatures. Since signatures can contain arbitrary features like color, shape, and texture, we focus on signatures that are generated from color histograms by using graph theoretical clustering (GT-clustering). In contrast to histogram intersection (HI) (Swain, M.J. and Ballard, D.H, 1991) or similar approaches, TM defines a similarity measurement with a many to many mapping between tuples in an arbitrary neighborhood in spite of using a one to one mapping between bins as defined by HI. As a result, TM is more robust than HI when the illumination is changing. In contrast to earth mover's distance (EMD) (Rubner, L.J.G.Y. and Tomasi, C., 1998), similarity between signatures is not calculated by using a solution of the transportation problem. Thus the performance of TM is better than EMD.","PeriodicalId":218076,"journal":{"name":"12th International Conference on Image Analysis and Processing, 2003.Proceedings.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121763372","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}