1
|
Abualigah L, Habash M, Hanandeh ES, Hussein AM, Shinwan MA, Zitar RA, Jia H. Improved Reptile Search Algorithm by Salp Swarm Algorithm for Medical Image Segmentation. JOURNAL OF BIONIC ENGINEERING 2023; 20:1-25. [PMID: 36777369 PMCID: PMC9902839 DOI: 10.1007/s42235-023-00332-2] [Citation(s) in RCA: 3] [Impact Index Per Article: 3.0] [Reference Citation Analysis] [Abstract] [Key Words] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 10/21/2022] [Revised: 12/24/2022] [Accepted: 01/04/2023] [Indexed: 06/18/2023]
Abstract
This study proposes a novel nature-inspired meta-heuristic optimizer based on the Reptile Search Algorithm combed with Salp Swarm Algorithm for image segmentation using gray-scale multi-level thresholding, called RSA-SSA. The proposed method introduces a better search space to find the optimal solution at each iteration. However, we proposed RSA-SSA to avoid the searching problem in the same area and determine the optimal multi-level thresholds. The obtained solutions by the proposed method are represented using the image histogram. The proposed RSA-SSA employed Otsu's variance class function to get the best threshold values at each level. The performance measure for the proposed method is valid by detecting fitness function, structural similarity index, peak signal-to-noise ratio, and Friedman ranking test. Several benchmark images of COVID-19 validate the performance of the proposed RSA-SSA. The results showed that the proposed RSA-SSA outperformed other metaheuristics optimization algorithms published in the literature.
Collapse
Affiliation(s)
- Laith Abualigah
- Computer Science Department, Prince Hussein Bin Abdullah Faculty for Information Technology, Al Al-Bayt University, Mafraq, 25113 Jordan
- Hourani Center for Applied Scientific Research, Al-Ahliyya Amman University, Amman, 19328 Jordan
- Faculty of Information Technology, Middle East University, Amman, 11831 Jordan
- Applied Science Research Center, Applied Science Private University, Amman, 11931 Jordan
- School of Computer Sciences, Universiti Sains Malaysia, 11800 Pulau Pinang, Malaysia
| | | | - Essam Said Hanandeh
- Department of Computer Information System, Zarqa University, P.O. Box 13132, Zarqa, Jordan
| | - Ahmad MohdAziz Hussein
- Deanship of E-Learning and Distance Education, Umm Al-Qura University, Makkah, 21955 Saudi Arabia
| | - Mohammad Al Shinwan
- Faculty of Information Technology, Applied Science Private University, Amman, 11931 Jordan
| | - Raed Abu Zitar
- Sorbonne Center of Artificial Intelligence, Sorbonne University-Abu Dhabi, Abu Dhabi, United Arab Emirates
| | - Heming Jia
- School of Information Engineering, Sanming University, Sanming, 365004 China
| |
Collapse
|
2
|
Mittal M, Arora M, Pandey T, Goyal LM. Image Segmentation Using Deep Learning Techniques in Medical Images. ACTA ACUST UNITED AC 2019. [DOI: 10.1007/978-981-15-1100-4_3] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 02/16/2023]
|
3
|
Chen LC, Papandreou G, Kokkinos I, Murphy K, Yuille AL. DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFs. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2018; 40:834-848. [PMID: 28463186 DOI: 10.1109/tpami.2017.2699184] [Citation(s) in RCA: 3336] [Impact Index Per Article: 556.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/20/2023]
Abstract
In this work we address the task of semantic image segmentation with Deep Learning and make three main contributions that are experimentally shown to have substantial practical merit. First, we highlight convolution with upsampled filters, or 'atrous convolution', as a powerful tool in dense prediction tasks. Atrous convolution allows us to explicitly control the resolution at which feature responses are computed within Deep Convolutional Neural Networks. It also allows us to effectively enlarge the field of view of filters to incorporate larger context without increasing the number of parameters or the amount of computation. Second, we propose atrous spatial pyramid pooling (ASPP) to robustly segment objects at multiple scales. ASPP probes an incoming convolutional feature layer with filters at multiple sampling rates and effective fields-of-views, thus capturing objects as well as image context at multiple scales. Third, we improve the localization of object boundaries by combining methods from DCNNs and probabilistic graphical models. The commonly deployed combination of max-pooling and downsampling in DCNNs achieves invariance but has a toll on localization accuracy. We overcome this by combining the responses at the final DCNN layer with a fully connected Conditional Random Field (CRF), which is shown both qualitatively and quantitatively to improve localization performance. Our proposed "DeepLab" system sets the new state-of-art at the PASCAL VOC-2012 semantic image segmentation task, reaching 79.7 percent mIOU in the test set, and advances the results on three other datasets: PASCAL-Context, PASCAL-Person-Part, and Cityscapes. All of our code is made publicly available online.
Collapse
|
4
|
Automatic System for Plasmodium Species Identification from Microscopic Images of Blood-Smear Samples. JOURNAL OF HEALTHCARE INFORMATICS RESEARCH 2017; 1:231-259. [DOI: 10.1007/s41666-017-0009-2] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/29/2016] [Revised: 02/11/2017] [Accepted: 10/10/2017] [Indexed: 12/19/2022]
|
5
|
Yuille AL. Robust point matching via vector field consensus. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2014; 23:1706-1721. [PMID: 24808341 PMCID: PMC5748387 DOI: 10.1109/tip.2014.2307478] [Citation(s) in RCA: 79] [Impact Index Per Article: 7.9] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 06/01/2023]
Abstract
In this paper, we propose an efficient algorithm, called vector field consensus, for establishing robust point correspondences between two sets of points. Our algorithm starts by creating a set of putative correspondences which can contain a very large number of false correspondences, or outliers, in addition to a limited number of true correspondences (inliers). Next, we solve for correspondence by interpolating a vector field between the two point sets, which involves estimating a consensus of inlier points whose matching follows a nonparametric geometrical constraint. We formulate this a maximum a posteriori (MAP) estimation of a Bayesian model with hidden/latent variables indicating whether matches in the putative set are outliers or inliers. We impose nonparametric geometrical constraints on the correspondence, as a prior distribution, using Tikhonov regularizers in a reproducing kernel Hilbert space. MAP estimation is performed by the EM algorithm which by also estimating the variance of the prior model (initialized to a large value) is able to obtain good estimates very quickly (e.g., avoiding many of the local minima inherent in this formulation). We illustrate this method on data sets in 2D and 3D and demonstrate that it is robust to a very large number of outliers (even up to 90%). We also show that in the special case where there is an underlying parametric geometrical model (e.g., the epipolar line constraint) that we obtain better results than standard alternatives like RANSAC if a large number of outliers are present. This suggests a two-stage strategy, where we use our nonparametric model to reduce the size of the putative set and then apply a parametric variant of our approach to estimate the geometric parameters. Our algorithm is computationally efficient and we provide code for others to use it. In addition, our approach is general and can be applied to other problems, such as learning with a badly corrupted training data set.
Collapse
|
6
|
Liu ZY, Qiao H, Yang X, Hoi SCH. Graph Matching by Simplified Convex-Concave Relaxation Procedure. Int J Comput Vis 2014. [DOI: 10.1007/s11263-014-0707-7] [Citation(s) in RCA: 17] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/25/2022]
|
7
|
Paul G, Cardinale J, Sbalzarini IF. Coupling Image Restoration and Segmentation: A Generalized Linear Model/Bregman Perspective. Int J Comput Vis 2013. [DOI: 10.1007/s11263-013-0615-2] [Citation(s) in RCA: 15] [Impact Index Per Article: 1.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/27/2022]
Abstract
Abstract
We introduce a new class of data-fitting energies that couple image segmentation with image restoration. These functionals model the image intensity using the statistical framework of generalized linear models. By duality, we establish an information-theoretic interpretation using Bregman divergences. We demonstrate how this formulation couples in a principled way image restoration tasks such as denoising, deblurring (deconvolution), and inpainting with segmentation. We present an alternating minimization algorithm to solve the resulting composite photometric/geometric inverse problem. We use Fisher scoring to solve the photometric problem and to provide asymptotic uncertainty estimates. We derive the shape gradient of our data-fitting energy and investigate convex relaxation for the geometric problem. We introduce a new alternating split-Bregman strategy to solve the resulting convex problem and present experiments and comparisons on both synthetic and real-world images.
Collapse
|
8
|
Xu L, Yuille AL. Robust principal component analysis by self-organizing rules based on statistical physics approach. ACTA ACUST UNITED AC 2012; 6:131-43. [PMID: 18263293 DOI: 10.1109/72.363442] [Citation(s) in RCA: 135] [Impact Index Per Article: 11.3] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/08/2022]
Abstract
This paper applies statistical physics to the problem of robust principal component analysis (PCA). The commonly used PCA learning rules are first related to energy functions. These functions are generalized by adding a binary decision field with a given prior distribution so that outliers in the data are dealt with explicitly in order to make PCA robust. Each of the generalized energy functions is then used to define a Gibbs distribution from which a marginal distribution is obtained by summing over the binary decision field. The marginal distribution defines an effective energy function, from which self-organizing rules have been developed for robust PCA. Under the presence of outliers, both the standard PCA methods and the existing self-organizing PCA rules studied in the literature of neural networks perform quite poorly. By contrast, the robust rules proposed here resist outliers well and perform excellently for fulfilling various PCA-like tasks such as obtaining the first principal component vector, the first k principal component vectors, and directly finding the subspace spanned by the first k vector principal component vectors without solving for each vector individually. Comparative experiments have been made, and the results show that the authors' robust rules improve the performances of the existing PCA algorithms significantly when outliers are present.
Collapse
Affiliation(s)
- L Xu
- Dept. of Comput. Sci., Chinese Univ. of Hong Kong, Shatin
| | | |
Collapse
|
9
|
Zhu LL, Chen Y, Lin Y, Lin C, Yuille A. Recursive segmentation and recognition templates for image parsing. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2012; 34:359-371. [PMID: 22193662 DOI: 10.1109/tpami.2011.160] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/31/2023]
Abstract
In this paper, we propose a Hierarchical Image Model (HIM) which parses images to perform segmentation and object recognition. The HIM represents the image recursively by segmentation and recognition templates at multiple levels of the hierarchy. This has advantages for representation, inference, and learning. First, the HIM has a coarse-to-fine representation which is capable of capturing long-range dependency and exploiting different levels of contextual information (similar to how natural language models represent sentence structure in terms of hierarchical representations such as verb and noun phrases). Second, the structure of the HIM allows us to design a rapid inference algorithm, based on dynamic programming, which yields the first polynomial time algorithm for image labeling. Third, we learn the HIM efficiently using machine learning methods from a labeled data set. We demonstrate that the HIM is comparable with the state-of-the-art methods by evaluation on the challenging public MSRC and PASCAL VOC 2007 image data sets.
Collapse
Affiliation(s)
- Long Leo Zhu
- University of California, Los Angeles, 8125 Math Science Bldg., Los Angeles, CA 90095, USA.
| | | | | | | | | |
Collapse
|
10
|
MEZARIS VASILEIOS, KOMPATSIARIS IOANNIS, STRINTZIS MICHAELG. STILL IMAGE SEGMENTATION TOOLS FOR OBJECT-BASED MULTIMEDIA APPLICATIONS. INT J PATTERN RECOGN 2011. [DOI: 10.1142/s0218001404003393] [Citation(s) in RCA: 48] [Impact Index Per Article: 3.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/18/2022]
Abstract
In this paper, a color image segmentation algorithm and an approach to large-format image segmentation are presented, both focused on breaking down images to semantic objects for object-based multimedia applications. The proposed color image segmentation algorithm performs the segmentation in the combined intensity–texture–position feature space in order to produce connected regions that correspond to the real-life objects shown in the image. A preprocessing stage of conditional image filtering and a modified K-Means-with-connectivity-constraint pixel classification algorithm are used to allow for seamless integration of the different pixel features. Unsupervised operation of the segmentation algorithm is enabled by means of an initial clustering procedure. The large-format image segmentation scheme employs the aforementioned segmentation algorithm, providing an elegant framework for the fast segmentation of relatively large images. In this framework, the segmentation algorithm is applied to reduced versions of the original images, in order to speed-up the completion of the segmentation, resulting in a coarse-grained segmentation mask. The final fine-grained segmentation mask is produced with partial reclassification of the pixels of the original image to the already formed regions, using a Bayes classifier. As shown by experimental evaluation, this novel scheme provides fast segmentation with high perceptual segmentation quality.
Collapse
Affiliation(s)
- VASILEIOS MEZARIS
- Informatics and Telematics Institute, Centre for Research and Technology Hellas, 1st Km Thermi-Panorama Road, Thessaloniki 57001, Greece
- Information Processing Laboratory, Electrical and Computer Engineering Department, Aristotle University of Thessaloniki, Thessaloniki 54124, Greece
| | - IOANNIS KOMPATSIARIS
- Informatics and Telematics Institute, Centre for Research and Technology Hellas, 1st Km Thermi-Panorama Road, Thessaloniki 57001, Greece
| | - MICHAEL G. STRINTZIS
- Informatics and Telematics Institute, Centre for Research and Technology Hellas, 1st Km Thermi-Panorama Road, Thessaloniki 57001, Greece
- Information Processing Laboratory, Electrical and Computer Engineering Department, Aristotle University of Thessaloniki, Thessaloniki 54124, Greece
| |
Collapse
|
11
|
Li D, Zhang G, Wu Z, Yi L. An edge embedded marker-based watershed algorithm for high spatial resolution remote sensing image segmentation. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2010; 19:2781-2787. [PMID: 20442049 DOI: 10.1109/tip.2010.2049528] [Citation(s) in RCA: 17] [Impact Index Per Article: 1.2] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/29/2023]
Abstract
This correspondence proposes an edge embedded marker-based watershed algorithm for high spatial resolution remote sensing image segmentation. Two improvement techniques are proposed for the two key steps of maker extraction and pixel labeling, respectively, to make it more effective and efficient for high spatial resolution image segmentation. Moreover, the edge information, detected by the edge detector embedded with confidence, is used to direct the two key steps for detecting objects with weak boundary and improving the positional accuracy of the objects boundary. Experiments on different images show that the proposed method has a good generality in producing good segmentation results. It performs well both in retaining the weak boundary and reducing the undesired over-segmentation.
Collapse
|
12
|
Kokkinos I, Deriche R, Faugeras O, Maragos P. Computational analysis and learning for a biologically motivated model of boundary detection. Neurocomputing 2008. [DOI: 10.1016/j.neucom.2007.11.031] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/22/2022]
|
13
|
Tu Z, Zheng S, Yuille A. Shape Matching and Registration by Data-driven EM. COMPUTER VISION AND IMAGE UNDERSTANDING : CVIU 2008; 109:290-304. [PMID: 29269996 PMCID: PMC5735840 DOI: 10.1016/j.cviu.2007.04.004] [Citation(s) in RCA: 4] [Impact Index Per Article: 0.3] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/08/2023]
Abstract
In this paper, we present an efficient and robust algorithm for shape matching, registration, and detection. The task is to geometrically transform a source shape to fit a target shape. The measure of similarity is defined in terms of the amount of transformation required. The shapes are represented by sparse-point or continuous-contour representations depending on the form of the data. We formulate the problem as probabilistic inference using a generative model and the EM algorithm. But this algorithm has problems with initialization and computing the E-step. To address these problems, we define a discriminative model which makes use of shape features. This gives a hybrid algorithm which combines the generative and discriminative models. The resulting algorithm is very fast, due to the effectiveness of shape-features for solving correspondence requiring typically only four iterations. The convergence time of the algorithm is under a second. We demonstrate the effectiveness of the algorithm by testing it on standard datasets, such as MPEG7, for shape matching and by applying it to a range of matching, registration, and foreground/background segmentation problems.
Collapse
Affiliation(s)
- Zhuowen Tu
- Lab of Neuro Imaging (LONI), Department of Neurology, UCLA, 635 Charles E. Young Drive South, Los Angeles, CA 90095, USA
| | - Songfeng Zheng
- Department of Statistics, UCLA, 8125 Math Sciences Bldg, Los Angeles, CA 90095, USA
| | - Alan Yuille
- Department of Statistics, UCLA, 8967 Math Sciences Bldg, Los Angeles, CA 90095, USA
| |
Collapse
|
14
|
Kiranyaz S, Ferreira M, Gabbouj M. A generic shape/texture descriptor over multiscale edge field: 2-D walking ant histogram. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2008; 17:377-391. [PMID: 18270126 DOI: 10.1109/tip.2007.915562] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/25/2023]
Abstract
A novel shape descriptor, which can be extracted from the major object edges automatically and used for the multimedia content-based retrieval in multimedia databases, is presented. By adopting a multiscale approach over the edge field where the scale represents the amount of simplification, the most relevant edge segments, referred to as subsegments, which eventually represent the major object boundaries, are extracted from a scale-map. Similar to the process of a walking ant with a limited line of sight over the boundary of a particular object, we traverse through each subsegment and describe a certain line of sight, whether it is a continuous branch or a corner, using individual 2-D histograms. Furthermore, the proposed method can also be tuned to be an efficient texture descriptor, which achieves a superior performance especially for directional textures. Finally, integrating the whole process as feature extraction module into MUVIS framework allows us to test the mutual performance of the proposed shape descriptor in the context of multimedia indexing and retrieval.
Collapse
Affiliation(s)
- Serkan Kiranyaz
- Institute of Signal Processing, Tampere University of Technology, Tampere, Finland.
| | | | | |
Collapse
|
15
|
Kiranyaz S, Ferreira M, Gabbouj M. Automatic object extraction over multiscale edge field for multimedia retrieval. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 2006; 15:3759-72. [PMID: 17153949 DOI: 10.1109/tip.2006.881966] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/12/2023]
Abstract
In this work, we focus on automatic extraction of object boundaries from Canny edge field for the purpose of content-based indexing and retrieval over image and video databases. A multiscale approach is adopted where each successive scale provides further simplification of the image by removing more details, such as texture and noise, while keeping major edges. At each stage of the simplification, edges are extracted from the image and gathered in a scale-map, over which a perceptual subsegment analysis is performed in order to extract true object boundaries. The analysis is mainly motivated by Gestalt laws and our experimental results suggest a promising performance for main objects extraction, even for images with crowded textural edges and objects with color, texture, and illumination variations. Finally, integrating the whole process as feature extraction module into MUVIS framework allows us to test the mutual performance of the proposed object extraction method and subsequent shape description in the context of multimedia indexing and retrieval. A promising retrieval performance is achieved, and especially in some particular examples, the experimental results show that the proposed method presents such a retrieval performance that cannot be achieved by using other features such as color or texture.
Collapse
Affiliation(s)
- Serkan Kiranyaz
- Institute of Signal Processing, Tampere University of Technology, FIN-33101 Tampere, Finland.
| | | | | |
Collapse
|
16
|
Boccignone G, Napoletano P, Caggiano V, Ferraro M. A multiresolution diffused expectation-maximization algorithm for medical image segmentation. Comput Biol Med 2005; 37:83-96. [PMID: 16352300 DOI: 10.1016/j.compbiomed.2005.10.002] [Citation(s) in RCA: 10] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/03/2005] [Accepted: 10/03/2005] [Indexed: 10/25/2022]
Abstract
In this paper a new method for segmenting medical images is presented, the multiresolution diffused expectation-maximization (MDEM) algorithm. The algorithm operates within a multiscale framework, thus taking advantage of the fact that objects/regions to be segmented usually reside at different scales. At each scale segmentation is carried out via the expectation-maximization algorithm, coupled with anisotropic diffusion on classes, in order to account for the spatial dependencies among pixels. This new approach is validated via experiments on a variety of medical images and its performance is compared with more standard methods.
Collapse
Affiliation(s)
- Giuseppe Boccignone
- Natural Computation Lab, DIIIE-Universitá di Salerno, via Ponte Don Melillo, 1, 84084 Fisciano (SA), Italy.
| | | | | | | |
Collapse
|
17
|
Abstract
One of the major obstacles in using neural networks to solve combinatorial optimization problems is the convergence toward one of the many local minima instead of the global minima. In this letter, we propose a technique that enables a self-organizing neural network to escape from local minima by virtue of the intermittency phenomenon. It gives rise to novel search dynamics that allow the system to visit multiple global minima as meta-stable states. Numerical experiments performed suggest that the phenomenon is a combined effect of Kohonen-type competitive learning and the iterated softmax function operating near bifurcation. The resultant intermittent search exhibits fractal characteristics when the optimization performance is at its peak in the form of 1/f signals in the time evolution of the cost, as well as power law distributions in the meta-stable solution states. The N-Queens problem is used as an example to illustrate the meta-stable convergence process that sequentially generates, in a single run, 92 solutions to the 8-Queens problem and 4024 solutions to the 17-Queens problem.
Collapse
Affiliation(s)
- Terence Kwok
- School of Business Systems, Faculty of Information Technology, Monash University, Clayton, Victoria 3168, Australia.
| | | |
Collapse
|
18
|
Visual organization of illusory surfaces. ACTA ACUST UNITED AC 2005. [DOI: 10.1007/bfb0015554] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register]
|
19
|
|
20
|
|
21
|
Tasdizen T, Whitaker R. Higher-order nonlinear priors for surface reconstruction. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2004; 26:878-891. [PMID: 18579946 DOI: 10.1109/tpami.2004.31] [Citation(s) in RCA: 1] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/26/2023]
Abstract
For surface reconstruction problems with noisy and incomplete range data, a Bayesian estimation approach can improve the overall quality of the surfaces. The Bayesian approach to surface estimation relies on a likelihood term, which ties the surface estimate to the input data, and the prior, which ensures surface smoothness or continuity. This paper introduces a new high-order, nonlinear prior for surface reconstruction. The proposed prior can smooth complex, noisy surfaces, while preserving sharp, geometric features, and it is a natural generalization of edge-preserving methods in image processing, such as anisotropic diffusion. An exact solution would require solving a fourth-order partial differential equation (PDE), which can be difficult with conventional numerical techniques. Our approach is to solve a cascade system of two second-order PDEs, which resembles the original fourth-order system. This strategy is based on the observation that the generalization of image processing to surfaces entails filtering the surface normals. We solve one PDE for processing the normals and one for refitting the surface to the normals. Furthermore, we implement the associated surface deformations using level sets. Hence, the algorithm can accommodate very complex shapes with arbitrary and changing topologies. This paper gives the mathematical formulation and describes the numerical algorithms. We also show results using range and medical data.
Collapse
Affiliation(s)
- Tolga Tasdizen
- School of Computing, University of Utah, Salt Lake City, UT 84112-9205, USA
| | | |
Collapse
|
22
|
David P, DeMenthon D, Duraiswami R, Samet H. SoftPOSIT: Simultaneous Pose and Correspondence Determination. COMPUTER VISION — ECCV 2002 2002. [DOI: 10.1007/3-540-47977-5_46] [Citation(s) in RCA: 27] [Impact Index Per Article: 1.2] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/09/2023]
|
23
|
A One-Dimensional Analog VLSI Implementation for Nonlinear Real-Time Signal Preprocessing. ACTA ACUST UNITED AC 2001. [DOI: 10.1006/rtim.1999.0218] [Citation(s) in RCA: 5] [Impact Index Per Article: 0.2] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/06/2023]
|
24
|
Weickert J, Heers J, Schnörr C, Zuiderveld KJ, Scherzer O, Siegfried Stiehl H. Fast Parallel Algorithms for a Broad Class of Nonlinear Variational Diffusion Approaches. ACTA ACUST UNITED AC 2001. [DOI: 10.1006/rtim.2000.0221] [Citation(s) in RCA: 11] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/22/2022]
|
25
|
Coupled Geodesic Active Regions for Image Segmentation: A Level Set Approach. LECTURE NOTES IN COMPUTER SCIENCE 2000. [DOI: 10.1007/3-540-45053-x_15] [Citation(s) in RCA: 46] [Impact Index Per Article: 1.9] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/07/2023]
|
26
|
Black MJ, Sapiro G, Marimont DH, Heeger D. Robust anisotropic diffusion. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 1998; 7:421-432. [PMID: 18276262 DOI: 10.1109/83.661192] [Citation(s) in RCA: 200] [Impact Index Per Article: 7.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/25/2023]
Abstract
Relations between anisotropic diffusion and robust statistics are described in this paper. Specifically, we show that anisotropic diffusion can be seen as a robust estimation procedure that estimates a piecewise smooth image from a noisy input image. The "edge-stopping" function in the anisotropic diffusion equation is closely related to the error norm and influence function in the robust estimation framework. This connection leads to a new "edge-stopping" function based on Tukey's biweight robust estimator that preserves sharper boundaries than previous formulations and improves the automatic stopping of the diffusion. The robust statistical interpretation also provides a means for detecting the boundaries (edges) between the piecewise smooth regions in an image that has been smoothed with anisotropic diffusion. Additionally, we derive a relationship between anisotropic diffusion and regularization with line processes. Adding constraints on the spatial organization of the line processes allows us to develop new anisotropic diffusion equations that result in a qualitative improvement in the continuity of edges.
Collapse
Affiliation(s)
- M J Black
- Xerox Palo Alto Res. Center, CA 94304, USA
| | | | | | | |
Collapse
|
27
|
Nikolova M, Idier J, Mohammad-Djafari A. Inversion of large-support ill-posed linear operators using a piecewise Gaussian MRF. IEEE TRANSACTIONS ON IMAGE PROCESSING : A PUBLICATION OF THE IEEE SIGNAL PROCESSING SOCIETY 1998; 7:571-585. [PMID: 18276274 DOI: 10.1109/83.663502] [Citation(s) in RCA: 11] [Impact Index Per Article: 0.4] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/25/2023]
Abstract
We propose a method for the reconstruction of signals and images observed partially through a linear operator with a large support (e.g., a Fourier transform on a sparse set). This inverse problem is ill-posed and we resolve it by incorporating the prior information that the reconstructed objects are composed of smooth regions separated by sharp transitions. This feature is modeled by a piecewise Gaussian (PG) Markov random field (MRF), known also as the weak-string in one dimension and the weak-membrane in two dimensions. The reconstruction is defined as the maximum a posteriori estimate. The prerequisite for the use of such a prior is the success of the optimization stage. The posterior energy corresponding to a PG MRF is generally multimodal and its minimization is particularly problematic. In this context, general forms of simulated annealing rapidly become intractable when the observation operator extends over a large support. In this paper, global optimization is dealt with by extending the graduated nonconvexity (GNC) algorithm to ill-posed linear inverse problems. GNC has been pioneered by Blake and Zisserman in the field of image segmentation. The resulting algorithm is mathematically suboptimal but it is seen to be very efficient in practice. We show that the original GNC does not correctly apply to ill-posed problems. Our extension is based on a proper theoretical analysis, which provides further insight into the GNC. The performance of the proposed algorithm is corroborated by a synthetic example in the area of diffraction tomography.
Collapse
Affiliation(s)
- M Nikolova
- Lab. des Signaux et Syst., CNRS, Gif-sur-Yvette, France.
| | | | | |
Collapse
|
28
|
On Digital Mammogram Segmentation and Microcalcification Detection Using Multiresolution Wavelet Analysis. ACTA ACUST UNITED AC 1997. [DOI: 10.1006/gmip.1997.0443] [Citation(s) in RCA: 47] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/22/2022]
|
29
|
|
30
|
Rangarajan A, Mjolsness E. A Lagrangian relaxation network for graph matching. ACTA ACUST UNITED AC 1996; 7:1365-81. [DOI: 10.1109/72.548165] [Citation(s) in RCA: 26] [Impact Index Per Article: 0.9] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/06/2022]
|
31
|
Black MJ, Rangarajan A. On the unification of line processes, outlier rejection, and robust statistics with applications in early vision. Int J Comput Vis 1996. [DOI: 10.1007/bf00131148] [Citation(s) in RCA: 156] [Impact Index Per Article: 5.6] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/26/2022]
|
32
|
A Variational Approach to the Design of Early Vision Algorithms. ACTA ACUST UNITED AC 1996. [DOI: 10.1007/978-3-7091-6586-7_9] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register]
|
33
|
Chakraborty A, Staib LH, Duncan JS. Deformable boundary finding in medical images by integrating gradient and region information. IEEE TRANSACTIONS ON MEDICAL IMAGING 1996; 15:859-870. [PMID: 18215965 DOI: 10.1109/42.544503] [Citation(s) in RCA: 81] [Impact Index Per Article: 2.9] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/25/2023]
Abstract
Accurately segmenting and quantifying structures is a key issue in biomedical image analysis. The two conventional methods of image segmentation, region-based segmentation, and boundary finding, often suffer from a variety of limitations. Here the authors propose a method which endeavors to integrate the two approaches in an effort to form a unified approach that is robust to noise and poor initialization. The authors' approach uses Green's theorem to derive the boundary of a homogeneous region-classified area in the image and integrates this with a gray level gradient-based boundary finder. This combines the perceptual notions of edge/shape information with gray level homogeneity. A number of experiments were performed both on synthetic and real medical images of the brain and heart to evaluate the new approach, and it is shown that the integrated method typically performs better when compared to conventional gradient-based deformable boundary finding. Further, this method yields these improvements with little increase in computational overhead, an advantage derived from the application of the Green's theorem.
Collapse
|
34
|
Grzywacz NM, Watamaniuk SN, McKee SP. Temporal coherence theory for the detection and measurement of visual motion. Vision Res 1995; 35:3183-203. [PMID: 8533352 DOI: 10.1016/0042-6989(95)00102-6] [Citation(s) in RCA: 57] [Impact Index Per Article: 2.0] [Reference Citation Analysis] [Abstract] [MESH Headings] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 01/31/2023]
Abstract
A recent challenge to the completeness of some influential models of local-motion detection has come from experiments in which subjects had to detect a single dot moving along a trajectory amidst noise dots undergoing Brownian motion. We propose and test a new theory of the detection and measurement of visual motion, which can account for these signal-in-Brownian-noise experiments. The theory postulates that the signals from local-motion detectors are made coherent in space and time by a special purpose network, and that this coherence boosts signals of features moving along non-random trajectories over time. Two experiments were performed to estimate parameters and test the theory. These experiments showed that detection is impaired with increasing eccentricity, an effect that varies inversely with step size. They also showed that detection improves over durations extending to at least 600 msec. An implementation of the theory accounts for these psychophysical detection measurements.
Collapse
Affiliation(s)
- N M Grzywacz
- Smith-Kettlewell Eye Research Institute, San Francisco, CA 94115, USA
| | | | | |
Collapse
|
35
|
Abstract
This paper presents a mathematical theory for understanding the computations involved in texture segmentation in the primary visual cortex. We propose that texture segmentation is a part of the early visual system's overall strategy to infer surfaces of objects in a visual scene. Based on this insight, we use the Bayesian inference paradigm to formulate the texture segmentation problem into a maximum a posteriori surface inference problem. The dynamical system for finding the optimal solution of this problem can be characterized by two concurrent and interactive processes: a gradual sharpening of the boundary signals and a simultaneous smoothing of the surface signals. The behavior of these dynamical processes was studied using both analytical and computational methods. We present some computational results and mathematical predictions. This theory suggests a novel framework for understanding the functional roles of the complex cells in the primary visual cortex.
Collapse
Affiliation(s)
- T S Lee
- Division of Applied Sciences, Harvard University, Cambridge, MA 02138, USA
| |
Collapse
|
36
|
Schnörr C, Sprengel R. A nonlinear regularization approach to early vision. BIOLOGICAL CYBERNETICS 1994; 72:141-149. [PMID: 7880918 DOI: 10.1007/bf00205978] [Citation(s) in RCA: 3] [Impact Index Per Article: 0.1] [Reference Citation Analysis] [Abstract] [MESH Headings] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/22/2023]
Abstract
We propose a new class of approaches to smooth visual data while preserving significant transitions of these data as clues for segmentation. Formally, the given visual data are represented as a noisy (image) function g, and we present a class of continuously formulated global minimization problems to smooth g. The resulting function u can be characterized as the minimizer of a specific nonquadratic functional or, equivalently, as the result of an associated nonlinear diffusion process. Our approach generalizes the well-known quadratic regularization principle while retaining its attractive properties: For any given g, the solution u to the proposed minimization problem is unique and depends continuously on the data g. Furthermore, convergence of approximate solutions obtained by finite element discretization holds true. We show that the nodal variables of any chosen finite element subspace can be interpreted as computational units whose activation dynamics due to the nonlinear smoothing process evolve like a globally asymptotically stable network. A corresponding analogue implementation is thus feasible and would provide a real time processing stage for the transition preserving smoothing of visual data. Using artificial as well as real data we illustrate our approach by numerical examples. We demonstrate that solutions to our approach improve those obtained by quadratic minimization and show the influence of global parameters which allow for a continuous, scale-dependent, and selective control of the smoothing process.
Collapse
Affiliation(s)
- C Schnörr
- Universität Hamburg, FB Informatik, AB Kognitive Systeme, Germany
| | | |
Collapse
|
37
|
Waugh FR, Westervelt RM. Analog neural networks with local competition. I. Dynamics and stability. PHYSICAL REVIEW. E, STATISTICAL PHYSICS, PLASMAS, FLUIDS, AND RELATED INTERDISCIPLINARY TOPICS 1993; 47:4524-4536. [PMID: 9960528 DOI: 10.1103/physreve.47.4524] [Citation(s) in RCA: 15] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 05/22/2023]
|
38
|
Bouthemy P, Francois E. Motion segmentation and qualitative dynamic scene analysis from an image sequence. Int J Comput Vis 1993. [DOI: 10.1007/bf01420735] [Citation(s) in RCA: 139] [Impact Index Per Article: 4.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 11/29/2022]
|