Thu, 24 Jul 2008 23:11:20 BST CiteULike: Tag image http://www.citeulike.org/tag/image CiteULike.org en-gb Copyright © 2004-2008 citeulike.org http://www.citeulike.org/user/zeji/article/678806 <i>Metrology, Inspection, and Process Control for Microlithography XX, Vol. 6152, No. 1. (2006)</i><br /><br />(published online Mar. 24, 2006) Optical interference leads to errors in the determination of the location of lines and in feature dimension measurements. Multi-peaked focus plots were observed from the metrology tools when the target includes sub-resolution lines. In this paper we present a new algorithm for determining nano-scale feature dimensions of grating structures with a bright-field metrology tool. The algorithm is based on the intensity of images obtained with varying amounts of defocus. By evaluating the variations of the different captured images through analysis of the optical images intensity obtained at various off-focus positions, the through-focus curves experimentally demonstrate nanometer sensitivity with grating structure. An empirical quadratic model was developed to fit the experimental results of image intensity deviation versus critical dimension. Our model and experimental data both shows that the grating structure with critical dimension at half pitch has maximum focus measure. A quadratic symmetry distribution data were shown when the critical dimension increase or decrease with the same dimensional intervals. The results demonstrate that the sub-wavelength feature dimensions can be evaluated using regular optical microscopes with exceptional resolution by implementing this algorithm. Image-based nanoscale dimensional metrology An Liu Yi Ku Nigel Smith doi:10.1117/12.655932 Metrology, Inspection, and Process Control for Microlithography XX, Vol. 6152, No. 1. (2006) 2006-05-31T18:50:19-00:00 2006 Metrology, Inspection, and Process Control for Microlithography XX 6152 1 SPIE image http://www.citeulike.org/user/ZeAugusto/article/615469 <i>Annals of the New York Academy of Sciences, Vol. 1020, No. 1. (2004), pp. 175-189.</i><br /><br />Computer-aided detection (CAD) and diagnosis (CADx) of in vivo imaging studies are important tools based on bioinformatics. Currently, there are two diseases for which the United States Food and Drug Administration (FDA) has given premarket approval (PMA): the detection of signs consistent with lung cancer on chest radiographs and breast cancer on mammograms. There are systems for other diseases and other types of images under development; however, this process depends on the availability of an accurate database. The author helped in the development of the databases for such systems and management of the clinical trial that resulted in the FDA-PMA of the system that detects findings consistent with lung cancer. The characteristics of the database used will be described. Further, a woman's risk of developing breast cancer differs from those of other women. Risk can be high, average, or low. There are now pharmaceuticals that decrease the risk that women, as a group, will develop breast cancer and it has been suggested that dietary changes could have similar effects. The pharmaceutical agents, though, have some associated side effects, and it is clinically important to determine whether these agents have decreased an individual woman's risk of breast cancer. In vivo imaging biomarkers of risk and successful risk reduction are therefore sought, but the information on possible in vivo imaging biomarkers is less mature than activities in CAD. Bioinformatics will be an important contributor to this in vivo imaging biomarker development. Improved Small Volume Lung Cancer Detection with Computer-Aided Detection: Database Characteristics and Imaging of Response to Breast Cancer Risk Reduction Strategies Matthew Freedman doi:10.1196/annals.1310.016 Annals of the New York Academy of Sciences, Vol. 1020, No. 1. (2004), pp. 175-189. 2006-05-05T19:51:58-00:00 2004 Annals of the New York Academy of Sciences 1020 1 175 189 image http://www.citeulike.org/user/ZeAugusto/article/383081 <i>Discrete Applied Mathematics, Vol. 151, No. 1-3. (1 October 2005), pp. 55-77.</i><br /><br />Fuzzy segmentation is a technique that assigns to each element in an image (which may have been corrupted by noise and/or shading) a grade of membership in an object (which is believed to be contained in the image). In an earlier work, the first two authors extended this concept by presenting and illustrating an algorithm which simultaneously assigns to each element in an image a grade of membership in each one of a number of objects (which are believed to be contained in the image). In this paper, we prove the existence of such a fuzzy segmentation that is uniquely specified by a desirable mathematical property, show further examples of its use in medical imaging, and illustrate that on several biomedical examples a new implementation of the algorithm that produces the segmentation is approximately seven times faster than the previously used implementation. We also compare our method with two recently published related methods. Simultaneous fuzzy segmentation of multiple objects Bruno Carvalho Gabor Herman Yung Kong doi:10.1016/j.dam.2005.02.031 Discrete Applied Mathematics, Vol. 151, No. 1-3. (1 October 2005), pp. 55-77. 2005-11-07T22:26:27-00:00 2005 Discrete Applied Mathematics 151 1-3 55 77 fuzzy image pegar http://www.citeulike.org/user/y80243/article/1380714 <i>(06 November 2002)</i><br /><br />The official, fully authorized companion to the second part of Peter Jackson's award-winning trilogy, The Lord of the Rings.<BR><BR>The Two Towers Visual Companion is a full-color guide to the characters, places and landscapes of J.R.R. Tolkien's Middle-earth as depicted in the second film in The Lord of the Rings Trilogy, and features a special introduction by Viggo Mortensen, who plays Aragorn.<BR><BR>Lavishly illustrated with more than 100 full-color photographs, including exclusive images of Gollum, Treebeard and the battle of Helm's Deep, The Two Towers Visual Companion offers a privileged tour through the principal events of the second film. It begins with a recounting of The Fellowship of the Ring, and then takes the reader on the separate journeys undertaken by the Fellowship in The Two Towers.<BR><BR>The Ring Quest: in which Frodo and Sam journey alone towards Mordor, alone that is, except for the sneaking figure of Gollum, who has been dogging their footsteps since Moria.<BR><BR>The Captives' Journey: in which Merry and Pippin are carried by the fearsome Uruk-hai towards a fateful encounter with the wizard, Saruman, at the stronghold of Isengard.<BR><BR>The Companions' Journey: in which Aragorn, Legolas and Gimli pursue the abducted hobbits across the Plains of Rohan and into the eaves of Fangorn Forest.<BR><BR>Also included are a brand new map of Rohan and Gondor and a specially commissioned battle plan of the climactic events at Helm's Deep, where a brave stand will be made by the Free Peoples of Middle-earth against Saruman's horde.<BR><BR>The companion offers an unforgettable tour of the haunted swamp of the Dead Marshes and the lovely but dangerous land of Ithilien which borders Mordor, the breathtaking kingdom of Rohan, home of the Horse-lords, its seat of power, Edoras, and the ancient stronghold of Helm's Deep, and provides an invaluable introduction to Peter Jackson's The Two Towers. The Lord of the Rings: The Two Towers Visual Companion Jude Fisher (06 November 2002) 2007-06-12T07:41:36-00:00 2002 Houghton Mifflin Co. companion fisher_j image lord novel rings story two_towera http://www.citeulike.org/user/xiangang/article/1687245 <i>Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on, Vol. 2 (2005), pp. 157-162 vol. 2.</i><br /><br />We present a method for automatically learning discriminative image patches for the recognition of given object classes. The approach applies discriminative training of log-linear models to image patch histograms. We show that it works well on three tasks and performs significantly better than other methods using the same features. For example, the method decides that patches containing an eye are most important for distinguishing face from background images. The recognition performance is very competitive with error rates presented in other publications. In particular, a new best error rate for the Caltech motorbikes data of 1.5% is achieved. Discriminative training for object recognition using image patches T Deselaers D Keysers H Ney Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on, Vol. 2 (2005), pp. 157-162 vol. 2. 2007-09-23T13:51:05-00:00 2005 Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on 2 157 162 vol. 2 image object patches recognition http://www.citeulike.org/user/WomensHealthNews/article/30850 <i>Journal of Pediatric and Adolescent Gynecology, Vol. 16, No. 6. (December 2003), pp. 349-354.</i> Different shapes in different cultures: body dissatisfaction, overweight, and obesity in African-American and caucasian females J Padgett FM Biro doi:10.1016/j.jpag.2003.09.007 Journal of Pediatric and Adolescent Gynecology, Vol. 16, No. 6. (December 2003), pp. 349-354. 2004-12-28T16:45:50-00:00 2003 Journal of Pediatric and Adolescent Gynecology 1083-3188 16 6 349 354 Elsevier Science body culture image obesity overweight http://www.citeulike.org/user/wlzhu/article/508096 <i>Medical Imaging, IEEE Transactions on, Vol. 25, No. 2. (2006), pp. 177-187.</i><br /><br />We present a method for registering the position and orientation of bones across multiple computed-tomography (CT) volumes of the same subject. The method is subvoxel accurate, can operate on multiple bones within a set of volumes, and registers bones that have features commensurate in size to the voxel dimension. First, a geometric object model is extracted from a reference volume image. We use then unsupervised tissue classification to generate from each volume to be registered a super-resolution distance field—a scalar field that specifies, at each point, the signed distance from the point to a material boundary. The distance fields and the geometric bone model are finally used to register an object through the sequence of CT images. In the case of multiobject structures, we infer a motion-directed hierarchy from the distance-field information that allows us to register objects that are not within each other's capture region. We describe a validation framework and evaluate the new technique in contrast with grey-value registration. Results on human wrist data show average accuracy improvements of 74% over grey-value registration. The method is of interest to any intrasubject, same-modality registration applications where subvoxel accuracy is desired. Super-Resolution Registration Using Tissue-Classified Distance Fields GE Marai DH Laidlaw JJ Crisco Medical Imaging, IEEE Transactions on, Vol. 25, No. 2. (2006), pp. 177-187. 2006-02-18T06:06:00-00:00 2006 Medical Imaging, IEEE Transactions on 25 2 177 187 image registration http://www.citeulike.org/user/wannurwy/article/1234292 <i>Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on, Vol. 3 (2004), pp. 906-909 Vol.3.</i><br /><br />The ever increasing availability of 3D models demands for tools supporting their effective and efficient management. Among these tools, those enabling content-based retrieval play a key role. In this paper, we present a novel approach to global and local content-based retrieval of 3D objects that is based on spin images. Spin images are used to derive a view-independent description of both database and query objects. A set of spin images is first created for each object and the parts it is composed of; then, a descriptor is evaluated for each spin image in the set; clustering is performed on the set of image-based descriptors of each object to achieve a compact representation. Experimental results are presented for a test database of about 300 models, showing the effectiveness of retrieval for both object and part similarity. Spin images for retrieval of 3D objects by local and global similarity J Assfalg A Del Bimbo P Pala Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on, Vol. 3 (2004), pp. 906-909 Vol.3. 2007-04-18T15:23:27-00:00 2004 Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on 3 906 909 Vol.3 image spin http://www.citeulike.org/user/walkking/article/1593336 <i>(1996)</i><br /><br />A new information-theoretic approach is presented for finding the registration of volumetric medical images of differing modalities. Registration is achieved by adjustment of the relative pose until the mutual information between images is maximized. In our derivation of the registration procedure, few assumptions are made about the nature of the imaging process. As a result the algorithms are quite general and can foreseeably be used with a wide variety of imaging devices. This approach works ... Multi-modal volume registration by maximization of mutual information W Wells P Viola H Atsumi S Nakajima R Kikinis (1996) 2007-08-26T00:31:38-00:00 1996 image registration http://www.citeulike.org/user/vun2005/article/1509685 <i>(1996), pp. 87-98.</i><br /><br />1 We describe a highly functional prototype system for searching by visual features in an image database. The VisualSEEk system is novel in that the user forms the queries by diagramming spatial arrangements of color regions. The system finds the images that contain the most similar arrangements of similar regions. Prior to the queries, the system automatically extracts and indexes salient color regions from the images. By utilizing efficient indexing techniques for color information, region... VisualSEEk: A Fully Automated Content-Based Image Query System John Smith Shih Chang (1996), pp. 87-98. 2007-07-28T07:23:38-00:00 1996 87 98 image searching http://www.citeulike.org/user/vitorinoramos/article/407643 <i>(1999)</i><br /><br />The purpose of this paper is to present a complete methodology based on a multidisciplinary approach, that goes from the extraction of features till the classification of a set of different portuguese granites. The set of tools to extract the features that characterise polished surfaces of the granites is mainly based on mathematical morphology. The classification methodology is based on a genetic algorithm capable of search the input feature space used by the nearest neighbour rule classifier. ... From Feature Extraction to Classification: A Multidisciplinary Approach applied to Portuguese Granites V Ramos P Pina F Muge (1999) 2005-11-24T18:27:28-00:00 1999 algorithms classification evolutionary-computation genetic_algorithms image image_classification pattern_recognition http://www.citeulike.org/user/vimalthilak/article/2439517 <i>Appl. Opt., Vol. 46, No. 30. (20 October 2007), pp. 7527-7536.</i><br /><br />A passive-polarization-based imaging system records the polarization state of light reflected by objects that are illuminated with an unpolarized and generally uncontrolled source. Such systems can be useful in many remote sensing applications including target detection, object segmentation, and material classification. We present a method to jointly estimate the complex index of refraction and the reflection angle (reflected zenith angle) of a target from multiple measurements collected by a passive polarimeter. An expression for the degree of polarization is derived from the microfacet polarimetric bidirectional reflectance model for the case of scattering in the plane of incidence. Using this expression, we develop a nonlinear least-squares estimation algorithm for extracting an apparent index of refraction and the reflection angle from a set of polarization measurements collected from multiple source positions. Computer simulation results show that the estimation accuracy generally improves with an increasing number of source position measurements. Laboratory results indicate that the proposed method is effective for recovering the reflection angle and that the estimated index of refraction provides a feature vector that is robust to the reflection angle. Polarization-based index of refraction and reflection angle estimation for remote sensing applications Vimal Thilak David Voelz Charles Creusere Appl. Opt., Vol. 46, No. 30. (20 October 2007), pp. 7527-7536. 2008-02-28T03:01:13-00:00 2007 Appl. Opt. 46 30 7527 7536 OSA extraction illumination-invariant image imaging parameters passive pattern polarimetry processing recognition shape http://www.citeulike.org/user/tyler/article/388703 <i>Geoscience and Remote Sensing Symposium, 1990. IGARSS '90. 'Remote Sensing Science for the Nineties'., 10th Annual International (1990), pp. 2409-2412.</i> Maximum A Posteriori Speckle Filtering And First Order Texture Models In Sar Images A Lopes E Nezry R Touzi H Laur Geoscience and Remote Sensing Symposium, 1990. IGARSS '90. 'Remote Sensing Science for the Nineties'., 10th Annual International (1990), pp. 2409-2412. 2005-11-11T15:45:33-00:00 1990 Geoscience and Remote Sensing Symposium, 1990. IGARSS '90. 'Remote Sensing Science for the Nineties'., 10th Annual International 2409 2412 filter image map sar speckle texture http://www.citeulike.org/user/tyler/article/304566 <i>IEEE Trans. Pattern Anal. Mach. Intell., Vol. 17, No. 2. (February 1995), pp. 158-175.</i> Shape Modeling with Front Propagation: A Level Set Approach Ravikanth Malladi James Sethian Baba Vemuri doi:10.1109/34.368173 IEEE Trans. Pattern Anal. Mach. Intell., Vol. 17, No. 2. (February 1995), pp. 158-175. 2005-08-26T12:38:38-00:00 1995 IEEE Trans. Pattern Anal. Mach. Intell. 0162-8828 17 2 158 175 IEEE Computer Society image level-sets modeling segmentation shape http://www.citeulike.org/user/tyler/article/2841385 <i>Pattern Analysis and Machine Intelligence, IEEE Transactions on, Vol. 26, No. 1. (2004), pp. 19-29.</i><br /><br />The image foresting transform (IFT) is a graph-based approach to the design of image processing operators based on connectivity. It naturally leads to correct and efficient implementations and to a better understanding of how different operators relate to each other. We give here a precise definition of the IFT, and a procedure to compute it-a generalization of Dijkstra's algorithm-with a proof of correctness. We also discuss implementation issues and illustrate the use of the IFT in a few applications. The image foresting transform: theory, algorithms, and applications AX Falcao J Stolfi de Alencar doi:10.1109/TPAMI.2004.1261076 Pattern Analysis and Machine Intelligence, IEEE Transactions on, Vol. 26, No. 1. (2004), pp. 19-29. 2008-05-28T11:42:58-00:00 2004 Pattern Analysis and Machine Intelligence, IEEE Transactions on 26 1 19 29 distance foresting growing image path region segmentation shortest transform http://www.citeulike.org/user/trdillah/article/2186852 <i>(2004)</i><br /><br />We introduce a new interactive system: a game that is fun and can be used to create valuable output. When people play the game they help determine the contents of images by providing meaningful labels for them. If the game is played as much as popular online games, we estimate that most images on the Web can be labeled in a few months. Having proper labels associated with each image on the Web would allow for more accurate image search, improve the accessibility of sites (by providing... Labeling images with a computer game L von Ahn L Dabbish (2004) 2008-01-02T04:01:47-00:00 2004 games image labelling online web wide world http://www.citeulike.org/user/tq/article/149466 <i>(2004), pp. 508-511.</i> Cortina: a system for large-scale, content-based web image retrieval Till Quack Ullrich M&\#246;nich Lars Thiele BS Manjunath doi:10.1145/1027527.1027650 (2004), pp. 508-511. 2005-04-05T07:51:19-00:00 2004 508 511 ACM Press image retrieval http://www.citeulike.org/user/tomyun/article/1160207 <i>(1987), pp. 45-60.</i> Understanding image intensities Berthold Horn (1987), pp. 45-60. 2007-03-14T14:22:43-00:00 1987 45 60 Morgan Kaufmann Publishers Inc. image http://www.citeulike.org/user/tisiang/article/801032 <i>IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 18, No. 7. (1996), pp. 673-689.</i><br /><br />A methodology for evaluating range image segmentation algorithms is proposed. This methodology involves (a) a common set of 40 laser range finder images and 40 structured light scanner images that have manually specified ground truth and (b) a set of defined performance metrics for instances of correctly segmented, missed and noise regions, over- and under-segmentation, and accuracy of the recovered geometry. A tool is used to objectively compare a machine generated segmentation against the... An Experimental Comparison of Range Image Segmentation Algorithms Adam Hoover Gillian Baptiste Xiaoyi Jiang Patrick Flynn Horst Bunke Dmitry Goldgof Kevin Bowyer David Eggert Andrew Fitzgibbon Robert Fisher IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 18, No. 7. (1996), pp. 673-689. 2006-08-14T16:20:02-00:00 1996 IEEE Transactions on Pattern Analysis and Machine Intelligence 18 7 673 689 algorithms image range segmentation http://www.citeulike.org/user/tisiang/article/801030 <i></i><br /><br />This paper addresses the problem of segmenting an image into regions. We define a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an e#cient segmentation algorithm based on this predicate, and show that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties. We apply the algorithm to image segmentation using two di#erent kinds of local neighborhoods in... Ecient Graph-Based Image Segmentation Pedro Artificial 2006-08-14T16:18:01-00:00 graph-based image segmentation http://www.citeulike.org/user/tisiang/article/801029 <i>(1999)</i><br /><br />Retrieving images from large and varied collections using image content as a key is a challenging and important problem. We present a new image representation which provides a transformation from the raw pixel data to a small set of image regions which are coherent in color and texture. This "Blobworld" representation is created by clustering pixels in a joint color-texture-position feature space. The segmentation algorithm is fully automatic and has been run on a collection of 10,000 natural... Blobworld: A system for region-based image indexing and retrieval Chad Carson Megan Thomas Serge Belongie Joseph Hellerstein Jitendra Malik (1999) 2006-08-14T16:13:48-00:00 1999 Springer image segmentation http://www.citeulike.org/user/tisiang/article/801024 <i>(1997)</i><br /><br />Retrieving images from large and varied collections using image content as a key is a challenging and important problem. In this paper we present a new image representation which provides a transformation from the raw pixel data to a small set of localized coherent regions in color and texture space. This so-called "blobworld" representation is based on segmentation using the Expectation-Maximization algorithm on combined color and texture features. The texture features we use for the... Region-based image querying Chad Carson Serge Belongie Hayit Greenspan Jitendra Malik (1997) 2006-08-14T16:11:07-00:00 1997 image querying region-based http://www.citeulike.org/user/tisiang/article/801022 <i>International Journal of Computer Vision, Vol. 3, No. 1. (1989), pp. 73-102.</i><br /><br />A new formulation of the image partitioning problem is presented: construct a complete and stable description of an image, in terms of a specified descriptive language, that is simplest in the sense of being shortest. We show that a descriptive language limited to a low-order polynomial description of the intensity variation within each region and a chain-code-like description of the region boundaries yields intuitively satisfying partitions for a wide class of images. The advantage of this... Constructing Simple Stable Descriptions for Image Partitioning Yvan Leclerc International Journal of Computer Vision, Vol. 3, No. 1. (1989), pp. 73-102. 2006-08-14T16:09:47-00:00 1989 International Journal of Computer Vision 3 1 73 102 image partitioning segmentation http://www.citeulike.org/user/tisiang/article/801017 <i>(1998)</i><br /><br />Retrieving images from large and varied collections using image content as a key is a challenging and important problem. In this paper we present a new image representation which provides a transformation from the raw pixel data to a small set of image regions which are coherent in color and texture space. This so-called "blobworld" representation is based on segmentation using the Expectation-Maximization algorithm on combined color and texture features. The texture features we use for the... Color- and texture-based image segmentation using EM and its application to content-based image retrieval Serge Belongie Chad Carson Hayit Greenspan Jitendra Malik (1998) 2006-08-14T16:07:35-00:00 1998 and color- image segmentation texture-based http://www.citeulike.org/user/tisiang/article/801014 <i>IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 22, No. 8. (2000), pp. 888-905.</i><br /><br />We propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach aims at extracting the global impression of an image. We treat image segmentation as a graph partitioning problem and propose a novel global criterion, the normalized cut, for segmenting the graph. The normalized cut criterion measures both the total dissimilarity between the different groups as well as the total... Normalized Cuts and Image Segmentation Jianbo Shi Jitendra Malik IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 22, No. 8. (2000), pp. 888-905. 2006-08-14T16:04:47-00:00 2000 IEEE Transactions on Pattern Analysis and Machine Intelligence 22 8 888 905 image segmentation http://www.citeulike.org/user/tisiang/article/801009 <i>(1998)</i><br /><br />We present a new graph-theoretic approach to the problem of image segmentation. Our method uses local criteria and yet produces results that reflect global properties of the image. We develop a framework that provides specific definitions of what it means for an image to be under- or over-segmented. We then present an efficient algorithm for computing a segmentation that is neither under- nor over-segmented according to these definitions. Our segmentation criterion is based on intensity... Image segmentation using local variation P Felzenszwalb D Huttenlocher (1998) 2006-08-14T16:02:12-00:00 1998 image segmentation http://www.citeulike.org/user/thienanh/article/504071 <i>Medinfo, Vol. 11, No. Pt 2. (2004), pp. 1374-1378.</i><br /><br />This paper is focused on the development of normal MR brain atlases of intrinsic MR parameters. These parameters permit quantitative comparisons across imaging studies (as opposed to raw image intensity values) and are important markers of neurological diseases. The development includes fast sequences to generate three parameters (T1: spin-lattice relaxation, T2: spin-spin relaxation, and Diffusion Tensor) covering the whole brain with isotropic and high-resolution images. The analysis of raw data to generate the parametric images is followed by registration algorithms to bring the image studies acquired on normal subjects aligned to a common frame of reference. The registration method includes both linear and non-linear algorithms. Two atlas schemes are discussed: an average atlas and a probabilistic atlas. Initial results on sequence development and registration are presented. The atlases are envisaged as an integral part of an imaging informatics infrastructure that enables image analysis across imaging studies to perform automated image data mining. Parametric brain MR atlases: standardization for imaging informatics. U Sinha S Ardekani Medinfo, Vol. 11, No. Pt 2. (2004), pp. 1374-1378. 2006-02-13T14:16:14-00:00 2004 Medinfo 1569-6332 11 Pt 2 1374 1378 brain image http://www.citeulike.org/user/thienanh/article/1621724 <i>Pattern Recognition, 1998. Proceedings. Fourteenth International Conference on, Vol. 2 (1998), pp. 1255-1256 vol.2.</i><br /><br />Automating the analysis of multidimensional medical images is extremely promising to improve diagnosis and therapy quality of tomorrow's medical practice. This automation will require the solution of a number of challenging research problems, many of them being closely related to computer vision problems. The paper presents first the medical tasks that will benefit from automated medical image analysis. Then, it describes a selection of the associated research problems, with illustrations of recent results and advances Medical image analysis a challenge for computer vision research N Ayache Pattern Recognition, 1998. Proceedings. Fourteenth International Conference on, Vol. 2 (1998), pp. 1255-1256 vol.2. 2007-09-05T03:48:05-00:00 1998 Pattern Recognition, 1998. Proceedings. Fourteenth International Conference on 2 1255 1256 vol.2 computer image medical vision http://www.citeulike.org/user/thesis2007/article/1658539 <i>Pattern Analysis and Machine Intelligence, IEEE Transactions on, Vol. 20, No. 3. (1998), pp. 294-308.</i><br /><br />Transforming a paper document to its electronic version in a form suitable for efficient storage, retrieval, and interpretation continues to be a challenging problem. An efficient representation scheme for document images is necessary to solve this problem. Document representation involves techniques of thresholding, skew detection, geometric layout analysis, and logical layout analysis. The derived representation can then be used in document storage and retrieval. Page segmentation is an important stage in representing document images obtained by scanning journal pages. The performance of a document understanding system greatly depends on the correctness of page segmentation and labeling of different regions such as text, tables, images, drawings, and rulers. We use the traditional bottom-up approach based on the connected component extraction to efficiently implement page segmentation and region identification. A new document model which preserves top-down generation information is proposed based on which a document is logically represented for interactive editing, storage, retrieval, transfer, and logical analysis. Our algorithm has a high accuracy and takes approximately 1.4 seconds on a SGI Indy workstation for model creation, including orientation estimation, segmentation, and labeling (text, table, image, drawing, and ruler) for a 2550×3300 image of a typical journal page scanned at 300 dpi. This method is applicable to documents from various technical journals and can accommodate moderate amounts of skew and noise Document representation and its application to page decomposition AK Jain Bin Yu Pattern Analysis and Machine Intelligence, IEEE Transactions on, Vol. 20, No. 3. (1998), pp. 294-308. 2007-09-14T18:28:11-00:00 1998 Pattern Analysis and Machine Intelligence, IEEE Transactions on 20 3 294 308 analysis and document identification image model page region retrieval segmentation storage http://www.citeulike.org/user/tcon/article/1729612 <i>The International Journal of Robotics Research, Vol. 26, No. 6. (1 June 2007), pp. 561-575.</i><br /><br />This paper proposes an approach to calibrate off-the-shelf cameras and inertial sensors to have a useful integrated system to be used in static and dynamic situations. When both sensors are integrated in a system their relative pose needs to be determined. The rotation between the camera and the inertial sensor can be estimated, concurrently with camera calibration, by having both sensors observe the vertical direction in several poses. The camera relies on a vertical chequered planar target and the inertial sensor on gravity to obtain a vertical reference. Depending on the setup and system motion, the translation between the two sensors can also be important. Using a simple passive turntable and static images, the translation can be estimated. The system needs to be placed in several poses and adjusted to turn about the inertial sensor centre, so that the lever arm to the camera can be determined. Simulation and real data results are presented to show the validity and simple requirements of the proposed methods. 10.1177/0278364907079276 Relative Pose Calibration Between Visual and Inertial Sensors Jorge Lobo Jorge Dias doi:10.1177/0278364907079276 The International Journal of Robotics Research, Vol. 26, No. 6. (1 June 2007), pp. 561-575. 2007-10-05T04:37:02-00:00 2007 The International Journal of Robotics Research 26 6 561 575 camera image inertial integration processing systems vision visual http://www.citeulike.org/user/tcon/article/1729569 <i>The International Journal of Robotics Research, Vol. 26, No. 6. (1 June 2007), pp. 591-605.</i><br /><br />For mobile robotics, head gear in augmented reality (AR) applications or computer vision, it is essential to continuously estimate the egomotion and the structure of the environment. This paper presents the system developed in the SmartTracking project, which simultaneously integrates visual and inertial sensors in a combined estimation scheme. The sparse structure estimation is based on the detection of corner features in the environment. From a single known starting position, the system can move into an unknown environment. The vision and inertial data are fused, and the performance of both Unscented Kalman filter and Extended Kalman filter are compared for this task. The filters are designed to handle asynchronous input from visual and inertial sensors, which typically operate at different and possibly varying rates. Additionally, a bank of Extended Kalman filters, one per corner feature, is used to estimate the position and the quality of structure points and to include them into the structure estimation process. The system is demonstrated on a mobile robot executing known motions, such that the estimation of the egomotion in an unknown environment can be compared to ground truth. 10.1177/0278364907080058 Simultaneous Motion and Structure Estimation by Fusion of Inertial and Vision Data Peter Gemeiner Peter Einramhof Markus Vincze doi:10.1177/0278364907080058 The International Journal of Robotics Research, Vol. 26, No. 6. (1 June 2007), pp. 591-605. 2007-10-05T04:24:08-00:00 2007 The International Journal of Robotics Research 26 6 591 605 augmented_reality combination image inertial processing sensors visual http://www.citeulike.org/user/tcon/article/1729500 <i>Computer Vision and Pattern Recognition, 2004. CVPR 2004. Proceedings of the 2004 IEEE Computer Society Conference on, Vol. 1 (2004), pp. I-24-I-29 Vol.1.</i><br /><br />A new and fast way to find local image correspondences for wide baseline image matching is described. The targeted application is visual navigation, e.g. of a semi-automatic wheelchair. Such applications pose some additional requirements, like the need to work with natural landmarks rather than artificial markers, and the need to recognize locations fast. The restricted motion of the camera can be exploited to simplify the feature extraction. These features should support their identification from different, but nevertheless restricted viewing directions, and under variable illumination conditions. The paper proposes a specialization of so-called affine invariant regions for these particular conditions, which in this case simplifies to column segments. Their applicability is wider than robot navigation, and includes localization for wearable computing and scene recognition for automatic movie indexing. Fast wide baseline matching for visual navigation T Goedeme T Tuytelaars L Van Gool Computer Vision and Pattern Recognition, 2004. CVPR 2004. Proceedings of the 2004 IEEE Computer Society Conference on, Vol. 1 (2004), pp. I-24-I-29 Vol.1. 2007-10-05T03:59:49-00:00 2004 Computer Vision and Pattern Recognition, 2004. CVPR 2004. Proceedings of the 2004 IEEE Computer Society Conference on 1 I-24 I-29 Vol.1 image matching navigation processing wheelchair http://www.citeulike.org/user/tcon/article/1729488 <i>Journal of Robotic Systems, Vol. 21, No. 2. (2004), pp. 85-94.</i><br /><br />This paper describes ongoing research on vision based mobile robot navigation for wheel chairs. After a guided tour through a natural environment while taking images at regular time intervals, natural landmarks are extracted to automatically build a topological map. Later on this map can be used for place recognition and navigation. We use visual servoing on the landmarks to steer the robot. In this paper, we investigate ways to improve the performance by incorporating inertial sensors. © 2004 Wiley Periodicals, Inc. Vision Based Intelligent Wheel Chair Control: The Role of Vision and Inertial Sensing in Topological Navigation Toon Goedemé Marnix Nuttin Tinne Tuytelaars Luc Van Gool doi:10.1002/rob.10130 Journal of Robotic Systems, Vol. 21, No. 2. (2004), pp. 85-94. 2007-10-05T03:55:39-00:00 2004 Journal of Robotic Systems 21 2 85 94 image inertial navigation processing system vision wheelchair http://www.citeulike.org/user/tcon/article/1438053 <i>Image Vision Comput., Vol. 25, No. 5. (May 2007), pp. 578-596.</i> A review of recent range image registration methods with accuracy evaluation Joaquim Salvi Carles Matabosch David Fofi Josep Forest doi:10.1016/j.imavis.2006.05.012 Image Vision Comput., Vol. 25, No. 5. (May 2007), pp. 578-596. 2007-07-05T16:26:57-00:00 2007 Image Vision Comput. 0262-8856 25 5 578 596 Butterworth-Heinemann 3d image processing range registration http://www.citeulike.org/user/tcon/article/1731478 <i>Journal of Intelligent and Robotic Systems</i><br /><br />Abstract  Camera placement has an enormous impact on the performance of vision systems, but the best placement to maximize performance depends on the purpose of the system. As a result, this paper focuses largely on the problem of task-specific camera placement. We propose a new camera placement method that optimizes views to provide the highest resolution images of objects and motions in the scene that are critical for the performance of some specified task (e.g. motion recognition, visual metrology, part identification, etc.). A general analytical formulation of the observation problem is developed in terms of motion statistics of a scene and resolution of observed actions resulting in an aggregate observability measure. The goal of this system is to optimize across multiple cameras the aggregate observability of the set of actions performed in a defined area. The method considers dynamic and unpredictable environments, where the subject of interest changes in time. It does not attempt to measure or reconstruct surfaces or objects, and does not use an internal model of the subjects for reference. As a result, this method differs significantly in its core formulation from camera placement solutions applied to problems such as inspection, reconstruction or the Art Gallery class of problems. We present tests of the system’s optimized camera placement solutions using real-world data in both indoor and outdoor situations and robot-based experimentation using an all terrain robot vehicle-Jr robot in an indoor setting. Optimal Camera Placement for Automated Surveillance Tasks Robert Bodor Andrew Drenner Paul Schrater Nikolaos Papanikolopoulos doi:10.1007/s10846-007-9164-7 Journal of Intelligent and Robotic Systems 2007-10-05T17:52:34-00:00 Journal of Intelligent and Robotic Systems camera detection image motion positioning processing vision http://www.citeulike.org/user/taylkc5/article/1935212 <i>Youth Society, Vol. 29, No. 1. (1 September 1997), pp. 24-53.</i><br /><br />A reception study was employed to examine how girls and young women construct meaning in the television program Beverly Hills, 90210. Using age-segregated focus groups, the author attempted to uncover specific themes that helped to identify how meaning is created differently by girls and young women at different developmental stages. This article is divided into three sections. The first situates the problematic in historical and theoretical context. The second section discusses the methodology of this study. It contains the theoretical justification for the methods employed and grounds the research in an interpretive paradigm. In the final section, seven themes that emerged during the research are explicated. 10.1177/0044118X97029001002 Using Beverly Hills, 90210 To Explore Developmental Issues in Female Adolescents Darcy Granello doi:10.1177/0044118X97029001002 Youth Society, Vol. 29, No. 1. (1 September 1997), pp. 24-53. 2007-11-19T03:15:29-00:00 1997 Youth Society 29 1 24 53 and body image media http://www.citeulike.org/user/swachsmu/article/520154 <i>Pattern Analysis and Machine Intelligence, IEEE Transactions on, Vol. 22, No. 8. (2000), pp. 888-905.</i><br /><br />We propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach aims at extracting the global impression of an image. We treat image segmentation as a graph partitioning problem and propose a novel global criterion, the normalized cut, for segmenting the graph. The normalized cut criterion measures both the total dissimilarity between the different groups as well as the total similarity within the groups. We show that an efficient computational technique based on a generalized eigenvalue problem can be used to optimize this criterion. We applied this approach to segmenting static images, as well as motion sequences, and found the results to be very encouraging Normalized cuts and image segmentation Jianbo Shi J Malik doi:10.1109/34.868688 Pattern Analysis and Machine Intelligence, IEEE Transactions on, Vol. 22, No. 8. (2000), pp. 888-905. 2006-02-24T23:54:46-00:00 2000 Pattern Analysis and Machine Intelligence, IEEE Transactions on 22 8 888 905 image regions segmentation vision http://www.citeulike.org/user/swachsmu/article/2318853 <i>(2003), pp. 22-29.</i> Towards a framework for learning structured shape models from text-annotated images Sven Wachsmuth Suzanne Stevenson Sven Dickinson doi:10.3115/1119212.1119216 (2003), pp. 22-29. 2008-02-01T10:42:51-00:00 2003 22 29 Association for Computational Linguistics annotation image translation vision http://www.citeulike.org/user/surajitray/article/2790910 <i>Vol. 6512 (March 2007)</i><br /><br />The advancing technology for automatic segmentation of medical images should be accompanied by techniques to inform the user of the local credibility of results. To the extent that this technology produces clinically acceptable segmentations for a significant fraction of cases, there is a risk that the clinician will assume every result is acceptable. In the less frequent case where segmentation fails, we are concerned that unless the user is alerted by the computer, she would still put the result to clinical use. By alerting the user to the location of a likely segmentation failure, we allow her to apply limited validation and editing resources where they are most needed. We propose an automated method to signal suspected non-credible regions of the segmentation, triggered by statistical outliers of the local image match function. We apply this test to m-rep segmentations of the bladder and prostate in CT images using a local image match computed by PCA on regional intensity quantile functions. We validate these results by correlating the non-credible regions with regions that have surface distance greater than 5.5mm to a reference segmentation for the bladder. A 6mm surface distance was used to validate the prostate results. Varying the outlier threshold level produced a receiver operating characteristic with area under the curve of 0.89 for the bladder and 0.92 for the prostate. Based on this preliminary result, our method has been able to predict local segmentation failures and shows potential for validation in an automatic segmentation pipeline. Signaling local non-credibility in an automatic segmentation pipeline JH Levy RE Broadhurst S Ray EL Chaney SM Pizer doi:10.1117/12.709015 Vol. 6512 (March 2007) 2008-05-12T21:47:03-00:00 2007 6512 image medical midag segmentation self http://www.citeulike.org/user/sungolem/article/1698042 <i>(01 May 1984)</i><br /><br />"A ready reference aid and an inspiration to designers … All in all the best book now available on symbols." —Library Journal This unparalleled reference represents a major achievement in the field of graphic design. Famed industrial designer Henry Dreyfuss recognized the importance of symbols in communicating more quickly and effectively; for many years he and his staff collected and codified graphic symbols as they are used in all walks of life throughout the world. The result is this "dictionary" of universally used graphic symbols. Henry Dreyfuss designed this sourcebook to be as practical and easy to use as possible by arranging the symbol information within ingeniously devised sections: Basic Symbols represents a concise and highly selective grouping of symbols common to all disciplines (on-off, up-down, etc.). Disciplines provides symbols used in accommodations and travel, agriculture, architecture, business, communications, engineering, photography, sports, safety, traffic controls, and many other areas. Color lists the meanings of each of the colors in various worldwide applications and cultures. Graphic Form displays symbols from all disciplines grouped according to form (squares, circles, arrows, human figures, etc.) creating a unique way to identify a symbol out of context, as well as giving designers a frame of reference for developing new symbols. To make the sourcebook truly universal, the Table of Contents contains translations of each of the section titles and discipline areas into 17 languages in addition to English. Symbol Sourcebook: An Authoritative Guide to International Graphic Symbols Henry Dreyfuss (01 May 1984) 2007-09-26T18:46:53-00:00 1984 Wiley dictionary icon image reference http://www.citeulike.org/user/stueckle/article/2150813 <i>(1997)</i><br /><br />Our noncausal, nonparametric, multiscale, Markov random field (MRF) model is capable of synthesising and capturing the characteristics of a wide variety of textures, from the highly structured to the stochastic. We use a multiscale synthesis algorithm incorporating local annealing to obtain larger realisations of texture visually indistinguishable from the training texture. 4 Keywords Markov random fields, Nonparametric estimation, Texture synthesis, Multi-resolution, Local annealing. 1 The... Texture synthesis via a noncausal nonparametric multiscale Markov random field R Paget D Longstaff (1997) 2007-12-20T09:38:58-00:00 1997 image mrf prior synthesis texture http://www.citeulike.org/user/stueckle/article/766536 <i>Int. J. Comput. Vision, Vol. 40, No. 1. (October 2000), pp. 25-47.</i> Learning Low-Level Vision William Freeman Egon Pasztor Owen Carmichael doi:10.1023/A:1026501619075 Int. J. Comput. Vision, Vol. 40, No. 1. (October 2000), pp. 25-47. 2006-07-20T12:25:20-00:00 2000 Int. J. Comput. Vision 0920-5691 40 1 25 47 Kluwer Academic Publishers image learning low-level processing http://www.citeulike.org/user/stsaft/article/1682914 <i>Information Technology in Biomedicine, IEEE Transactions on, Vol. 11, No. 5. (2007), pp. 574-582.</i><br /><br /><para> Reliable and robust quantification of signal intensities is a critical step in microarray-based biomedical studies. However, traditional techniques for microarray image processing would face significant challenges if the number of pixels used for the quantification of the local background and the foreground decreases dramatically. We have developed a new method, ELB-Q, which, by design, is well suited for the image quantification of microarrays with very high density of spot layout (large number of spots arranged in unit area). In ELB-Q, a large extended local background (ELB) interspot region excluding those &#x201C;noise of the background&#x201D; pixels is used for estimating the local background, and the quantification of spot intensities (mean and median) in the putative target spot regions is performed after further excluding background pixels in these areas based on the cutoff values established during the ELB calculation. ELB-Q takes advantage of the abundant spatial information around each spot of interest, makes no assumption of the shape and size of the spots, and needs no sophisticated adjustment. We show results of image processing using ELB-Q on both the simulated data and real DNA microarrays, which compare favorably in robustness and accuracy against those obtained with GenePix Pro 6.0 (Axon Instruments, 1999) and the Markov random field (MRF) modeling approach (O. Demirkaya <etal/>, <emphasis emphasistype="boldital">Bioinformatics</emphasis>, vol. 21, pp. 2994&#x2013;3000, 2005). The ELB-Q software is developed in Matlab, and is available upon request. </para> ELB-Q: A New Method for Improving the Robustness in DNA Microarray Image Quantification MQ Ma K Zhang HY Wang FY Shih Information Technology in Biomedicine, IEEE Transactions on, Vol. 11, No. 5. (2007), pp. 574-582. 2007-09-21T17:01:23-00:00 2007 Information Technology in Biomedicine, IEEE Transactions on 11 5 574 582 image microarray processing http://www.citeulike.org/user/stsaft/article/828985 <i>Pattern Analysis and Machine Intelligence, IEEE Transactions on, Vol. 27, No. 10. (2005), pp. 1615-1630.</i><br /><br />In this paper, we compare the performance of descriptors computed for local interest regions, as, for example, extracted by the Harris-Affine detector [Mikolajczyk, K and Schmid, C, 2004]. Many different descriptors have been proposed in the literature. It is unclear which descriptors are more appropriate and how their performance depends on the interest region detector. The descriptors should be distinctive and at the same time robust to changes in viewing conditions as well as to errors of the detector. Our evaluation uses as criterion recall with respect to precision and is carried out for different image transformations. We compare shape context [Belongie, S, et al., April 2002], steerable filters [Freeman, W and Adelson, E, Setp. 1991], PCA-SIFT [Ke, Y and Sukthankar, R, 2004], differential invariants [Koenderink, J and van Doorn, A, 1987], spin images [Lazebnik, S, et al., 2003], SIFT [Lowe, D. G., 1999], complex filters [Schaffalitzky, F and Zisserman, A, 2002], moment invariants [Van Gool, L, et al., 1996], and cross-correlation for different types of interest regions. We also propose an extension of the SIFT descriptor and show that it outperforms the original method. Furthermore, we observe that the ranking of the descriptors is mostly independent of the interest region detector and that the SIFT-based descriptors perform best. Moments and steerable filters show the best performance among the low dimensional descriptors. A performance evaluation of local descriptors K Mikolajczyk C Schmid Pattern Analysis and Machine Intelligence, IEEE Transactions on, Vol. 27, No. 10. (2005), pp. 1615-1630. 2006-09-05T17:45:00-00:00 2005 Pattern Analysis and Machine Intelligence, IEEE Transactions on 27 10 1615 1630 descriptors drm ehsan image performance review steganography watermarking http://www.citeulike.org/user/stsaft/article/2504903 <i>Image Processing, IEEE Transactions on, Vol. 7, No. 1. (1998), pp. 27-41.</i><br /><br />We present an automatic subpixel registration algorithm that minimizes the mean square intensity difference between a reference and a test data set, which can be either images (two-dimensional) or volumes (three-dimensional). It uses an explicit spline representation of the images in conjunction with spline processing, and is based on a coarse-to-fine iterative strategy (pyramid approach). The minimization is performed according to a new variation (ML*) of the Marquardt-Levenberg algorithm for nonlinear least-square optimization. The geometric deformation model is a global three-dimensional (3-D) affine transformation that can be optionally restricted to rigid-body motion (rotation and translation), combined with isometric scaling. It also includes an optional adjustment of image contrast differences. We obtain excellent results for the registration of intramodality positron emission tomography (PET) and functional magnetic resonance imaging (fMRI) data. We conclude that the multiresolution refinement strategy is more robust than a comparable single-stage method, being less likely to be trapped into a false local optimum. In addition, our improved version of the Marquardt-Levenberg algorithm is faster A pyramid approach to subpixel registration based on intensity P Thevenaz UE Ruttimann M Unser doi:10.1109/83.650848 Image Processing, IEEE Transactions on, Vol. 7, No. 1. (1998), pp. 27-41. 2008-03-10T23:44:14-00:00 1998 Image Processing, IEEE Transactions on 7 1 27 41 heart image mri registration spline http://www.citeulike.org/user/sterovetta/article/1150924 <i>Engineering Applications of Artificial Intelligence, Vol. 10, No. 6. (December 1997), pp. 573-580.</i><br /><br />The paper describes a parallel implementation of a neural algorithm performing vector quantization for very low bit-rate video compression on toroidal-mesh multiprocessor systems. The neural model considered is a plastic version of the Neural Gas algorithm, whose features are suitable for implementations on toroidal mesh topologies. The architecture adopted, and the data-allocation strategy, enhance the method's scaling properties and remarkable efficiency. The parallel approach is supported by a theoretical analysis of the efficiency of the overall structure. Experimental results on a significant testbed and the fit between predicted and measured values confirm the validity of the parallel approach. An efficient technique for implementing an image-compression neural algorithm on concurrent multiprocessor architectures Fabio Ancona Stefano Rovetta Rodolfo Zunino doi:10.1016/S0952-1976(97)00039-0 Engineering Applications of Artificial Intelligence, Vol. 10, No. 6. (December 1997), pp. 573-580. 2007-03-09T09:47:28-00:00 1997 Engineering Applications of Artificial Intelligence 10 6 573 580 1997 image neural-networks parallel processor rjournal http://www.citeulike.org/user/sterovetta/article/1150921 <i>Fuzzy Sets and Systems, Vol. 152, No. 1. (16 May 2005), pp. 37-48.</i><br /><br />The human leukocyte antigen (HLA) region is a part of genome which spans over 4 Mbases of DNA. The HLA system is strongly connected to immunological response and its compatibility between tissues is critical in transplantation. We have developed an application of oligonucleotide microarrays to HLA typing. In this paper, we present a method based on a fuzzy system which interactively supports the user in analyzing the hybridization results, speeding-up the decision process moving from raw array data obtained from the scanner to their interpretation (genotyping). The two-level procedure starts with evaluation of spot activity, then it estimates probe hybridization levels from activity levels. The method is designed for being readily usable by the biologist, by adopting fuzzy linguistic variables which are familiar to the user and by featuring a standard and complete graphical interface. A fuzzy approach to image analysis in HLA typing using oligonucleotide microarrays GB Ferrara L Delfino F Masulli S Rovetta R Sensi doi:10.1016/j.fss.2004.10.013 Fuzzy Sets and Systems, Vol. 152, No. 1. (16 May 2005), pp. 37-48. 2007-03-09T09:43:12-00:00 2005 Fuzzy Sets and Systems 152 1 37 48 2005 application fuzzy hla image rjournal typing http://www.citeulike.org/user/sterovetta/article/1150911 <i>Image and Vision Computing, Vol. 25, No. 2. (February 2007), pp. 204-213.</i><br /><br />The problem of clustering is often addressed with techniques based on a Voronoi partition of the data space. Vector quantization is based on a similar principle, but it is a different technical problem. We analyze some approaches to the synthesis of a vector quantization codebook, and their similarities with corresponding clustering algorithms. We outline the role of fuzzy concepts in these algorithms, both in data representation and in training. Then we propose an alternative way to use fuzzy concepts as a modeling tool for physical vector quantization systems, Neural Gas with a fuzzy rank function. We apply this method to the problem of quality enhancement in lossy compression and reconstruction of images with vector quantization. Vector quantization and fuzzy ranks for image reconstruction Stefano Rovetta Francesco Masulli doi:10.1016/j.imavis.2006.01.028 Image and Vision Computing, Vol. 25, No. 2. (February 2007), pp. 204-213. 2007-03-09T09:34:58-00:00 2007 Image and Vision Computing 25 2 204 213 2007 fuzzy image neural-gas ranks rjournal vector-quantization http://www.citeulike.org/user/sterovetta/article/1150896 <i>Chemometrics and Intelligent Laboratory Systems, Vol. 77, No. 1-2. (28 May 2005), pp. 3-17.</i><br /><br />A huge number of clustering methods have been applied to many different kinds of data set including multivariate images, such as magnetic resonance images (MRI) and remote sensing images. However, not many methods include spatial information of the image data. In this tutorial, the major types of clustering techniques are summarized. Particular attention will be devoted to the extension of clustering techniques to take into account both spectral and spatial information of the multivariate image data. General guidelines for the optimal use of these algorithms are given. The application of pre- and post-processing methods is also discussed. Clustering multispectral images: a tutorial Thanh Tran Ron Wehrens Lutgarde Buydens doi:10.1016/j.chemolab.2004.07.011 Chemometrics and Intelligent Laboratory Systems, Vol. 77, No. 1-2. (28 May 2005), pp. 3-17. 2007-03-09T09:23:46-00:00 2005 Chemometrics and Intelligent Laboratory Systems 77 1-2 3 17 2005 clustering image review spectral spectral-imaging http://www.citeulike.org/user/spinaltap526/article/227115 <i>(01 May 1990)</i><br /><br />A remarkable range of examples for the idea of visual thinking, with beautifully printed pages. A real treat for all who reason and learn by means of images. -- Rudolf Arnheim Envisioning Information Edward Tufte (01 May 1990) 2005-06-14T00:58:19-00:00 1990 Graphics Press figures image information maps