Individual tooth segmentation from CT images using level set method with shape and intensity prior

3D visualization of teeth from CT images provides important assistance for dentists performing orthodontic surgery and treatment. However, dental CT images present several major challenges for the segmentation of tooth, which touches with adjacent teeth as well as surrounding periodontium and jaw bones. Moreover, tooth contour suffers from topological changes and splits into several branches. In this work, we focus on the segmentation of individual teeth with complete crown and root parts. To this end, we propose adaptive active contour tracking algorithms: single level set method tracking for root segmentation to handle the complex image conditions as well as the root branching problem, and coupled level set method tracking for crown segmentation in order to separate the touching teeth and create the virtual common boundaries between them. Furthermore, we improve the variational level set method in several aspects: gradient direction is introduced into the level set framework to prevent catching the surrounding object boundaries; in addition to the shape prior, intensity prior is introduced to provide adaptive shrinking or expanding forces in order to deal with the topological changes. The test results for both tooth segmentation and 3D reconstruction show that the proposed method can visualize individual teeth with high accuracy and efficiency.     

Multiphase segmentation using an implicit dual shape prior: Application to detection of left ventricle in cardiac MRI

Cardiac magnetic resonance imaging (MRI) has been extensively used in the diagnosis of cardiovascular disease and its quantitative evaluation. Cardiac MRI techniques have been progressively improved, providing high-resolution anatomical and functional information. One of the key steps in the assessment of cardiovascular disease is the quantitative analysis of the left ventricle (LV) contractile function. Thus, the accurate delineation of LV boundary is of great interest to improve diagnostic performance. In this work, we present a novel segmentation algorithm of LV from cardiac MRI incorporating an implicit shape prior without any training phase using level sets in a variational framework. The segmentation of LV still remains a challenging problem due to its subtle boundary, occlusion, and inhomogeneity. In order to overcome such difficulties, a shape prior knowledge on the anatomical constraint of LV is integrated into a region-based segmentation framework. The shape prior is introduced based on the anatomical shape similarity between endocardium and epicardium. The shape of endocardium is assumed to be mutually similar under scaling to the shape of epicardium. An implicit shape representation using signed distance function is introduced and their discrepancy is measured in a probabilistic way. Our shape constraint is imposed by a mutual similarity of shapes without any training phase that requires a collection of shapes to learn their statistical properties. The performance of the proposed method has been demonstrated on fifteen clinical datasets, showing its potential as the basis in the clinical diagnosis of cardiovascular disease.     

A shape prior constraint for implicit active contours

We present a shape prior constraint to guide the evolution of implicit active contours. Our method includes three core techniques. Firstly, a rigid registration is introduced, using a line search method within a level set framework. The method automatically finds the time step for the iterative optimization processes. The order for finding the optimal translation, rotation and scale is derived experimentally. Secondly, a single reconstructed shape is created from a shape distribution of a previously acquired learning set. The reconstructed shape is applied to guide the active contour evolution. Thirdly, our method balances the impact of the shape prior versus the image guidance of the active contour. A mixed stopping condition is defined based on the stationarity of the evolving curve and the shape prior constraint. Our method is completely non-parametric and avoids taking linear combinations of non-linear signed distance functions, which would cause problems because distance functions are not closed under linear operations. Experimental results show that our method is able to extract the desired objects in several circumstances, namely when noise is present in the image, when the objects are in slightly different poses and when parts of the object are invisible in the image.     

Text line segmentation of historical documents: a survey

There is a huge amount of historical documents in libraries and in various National Archives that have not been exploited electronically. Although automatic reading of complete pages remains, in most cases, a long-term objective, tasks such as word spotting, text/image alignment, authentication and extraction of specific fields are in use today. For all these tasks, a major step is document segmentation into text lines. Because of the low quality and the complexity of these documents (background noise, artifacts due to aging, interfering lines), automatic text line segmentation remains an open research field. The objective of this paper is to present a survey of existing methods, developed during the last decade and dedicated to documents of historical interest.     

Image segmentation with one shape prior — A template-based formulation

Image segmentation with one shape prior is an important problem in computer vision. Most algorithms not only share a similar energy definition, but also follow a similar optimization strategy. Therefore, they all suffer from the same drawbacks in practice such as slow convergence and difficult-to-tune parameters. In this paper, by reformulating the energy cost function, we establish an important connection between shape-prior based image segmentation with intensity-based image registration. This connection enables us to combine advanced shape and intensity modeling techniques from segmentation society with efficient optimization techniques from registration society. Compared with the traditional regularization-based approach, our framework is more systematic and more efficient, able to converge in a matter of seconds. We also show that user interaction (such as strokes and bounding boxes) can easily be incorporated into our algorithm if desired. Through challenging image segmentation experiments, we demonstrate the improved performance of our algorithm compared to other proposed approaches.     

Semi-supervised learning for character recognition in historical archive documents

Training recognizers for handwritten characters is still a very time consuming task involving tremendous amounts of manual annotations by experts. In this paper we present semi-supervised labeling strategies that are able to considerably reduce the human effort. We propose two different methods to label and later recognize characters in collections of historical archive documents. The first one is based on clustering of different feature representations and the second one incorporates a simultaneous retrieval on different representations. Hence, both approaches are based on multi-view learning and later apply a voting procedure for reliably propagating annotations to unlabeled data. We evaluate our methods on the MNIST database of handwritten digits and introduce a realistic application in form of a database of handwritten historical weather reports. The experiments show that our method is able to significantly reduce the human effort that is required to build a character recognizer for the data collection considered while still achieving recognition rates that are close to a supervised classification experiment.     

Circulant dissimilarity-based shape registration for object segmentation

ABSTRACT

A shape prior-based object segmentation is developed in this paper by using a shape transformation distance to constrain object contour evolution. In the proposed algorithm, the transformation distance measures the dissimilarity between two unaligned shapes by cyclic shift, which is called ‘circulant dissimilarity’. This dissimilarity with respect to transformation of the object shape is represented by circular convolution, which could be efficiently computed by using fast Fourier transform. Given a set of training shapes, the kernel density estimation is adopted to model shape prior. By integrating low-level image feature, high-level shape prior and transformation distance, a variational segmentation model is proposed to solve the transformation invariance of shape prior. Numerical experiments demonstrate that circulant dissimilarity-based shape registration outperforms the iterative optimization on explicit pose parameters, and show promising results and highlight the potential of the method for object registration and segmentation.     

Segmentation of historical machine-printed documents using Adaptive Run Length Smoothing and skeleton segmentation paths

In this paper, we strive towards the development of efficient techniques in order to segment document pages resulting from the digitization of historical machine-printed sources. This kind of documents often suffer from low quality and local skew, several degradations due to the old printing matrix quality or ink diffusion, and exhibit complex and dense layout. To face these problems, we introduce the following innovative aspects: (i) use of a novel Adaptive Run Length Smoothing Algorithm (ARLSA) in order to face the problem of complex and dense document layout, (ii) detection of noisy areas and punctuation marks that are usual in historical machine-printed documents, (iii) detection of possible obstacles formed from background areas in order to separate neighboring text columns or text lines, and (iv) use of skeleton segmentation paths in order to isolate possible connected characters. Comparative experiments using several historical machine-printed documents prove the efficiency of the proposed technique.     

Incorporating shape prior into geodesic active contours for detecting partially occluded object

A new method to incorporate shape prior knowledge into geodesic active contours for detecting partially occluded object is proposed in this paper. The level set functions of the collected shapes are used as training data. They are projected onto a low dimensional subspace using PCA and their distribution is approximated by a Gaussian function. A shape prior model is constructed and is incorporated into the geodesic active contour formulation to constrain the contour evolution process. To balance the strength between the image gradient force and the shape prior force, a weighting factor is introduced to adaptively guide the evolving curve to move under both forces. The curve converges with due consideration of both local shape variations and global shape consistency. Experimental results demonstrate that the proposed method makes object detection robust against partial occlusions.     

On-line cursive hangul recognition that uses DP matching to detect key segmentation points

As a means to perform on-line recognition of cursive Korean characters, called hanguls, we describe a structural analysis type algorithm that searches globally for key points of segmentation on a character unit level and can cope with large variations in stroke shape and position. This “segmentation points search” is systematically performed by a two-level dynamic programming (DP) matching algorithm in conjunction with syntax control of hangul composition characteristics. Fine discrimination for phonemes and characters is effectively realized using mutual information among strokes. Experiments demonstrate computational feasibility and that the proposed approach provides high recognition and segmentation ability.     

Thinning and stroke segmentation for handwritten Chinese character recognition

Firstly, a thinning technique by means of stroke tracking is proposed. The method is considered to preserve the straightness of strokes and the length, which is useful for the stroke segmentation procedure on the recognition of handwritten Chinese characters.Secondly, a method for stroke segmentation, i.c. a way of breaking down a character to a set of consecutive partial strokes, is proposed, which works well owing to the favourable properties of the proposed thinning technique. The method consists of five procedures: extraction of feature pixels, calculation of stroke directions, piecewise linear representation of strokes, unification of intersections and extraction of the consecutive partial strokes.     

Hierarchical vibrations for part-based recognition of complex objects

We propose a technique for the recognition and segmentation of complex shapes in 2D images using a hierarchy of finite element vibration modes in an evolutionary shape search. The different levels of the shape hierarchy can influence each other, which can be exploited in top-down part-based image analysis. Our method overcomes drawbacks of existing structural approaches, which cannot uniformly encode shape variation and co-variation, or rely on training. We present results demonstrating that by utilizing a quality-of-fit function the model explicitly recognizes missing parts of a complex shape, thus allowing for categorization between shape classes.     

Coupled region-edge shape priors for simultaneous localization and figure-ground segmentation

We propose a new algorithm for simultaneous localization and figure-ground segmentation where coupled region-edge shape priors are involved with two different but complementary roles. We resort to a segmentation-based hypothesis-and-test paradigm in this research, where the region prior is used to form a segmentation and the edge prior is used to evaluate the validity of the formed segmentation. Our fundamental assumption is that the optimal shape-constrained segmentation that maximizes the agreement with the edge prior occurs at the correctly hypothesized location. Essentially, the proposed algorithm addresses a mid-level vision issue that aims at producing a map image for part detection useful for high-level vision tasks. Our experiments demonstrated that this algorithm offers promising results in terms of both localization and segmentation.     

甜瓜图像分割的先验LCV模型

以甜瓜形态的微变测量为目标,提出了基于先验形状的LCV(LocalChan-Vese)模型算法。利用形态学方法获得甜瓜的局部信息图像,仿照传统CV模型的拟合形式,建立了LCV能量模型;利用形态学方法及spine插值算法获取甜瓜的先验形状,将其通过形状比较函数嵌入到LCV模型的能量函数中,形成了新的基于先验形状的LCV模型。相比传统边缘检测和图像分割算法,该算法更易于提取出理想的边缘信息。     

通用票据识别系统中的字符切分方法

在票据识别系统中,待识别区域字符的切分是整个系统较为关键的一个环节。主要论述了在一个通用票据识别系统中,针对一般类型的票据中常见的几种待识别区域的类型,采用不同方法实现对票据图像中待识别区域的字符进行较为准确、快速的切分,从而确保整个票据识别系统的识别准确率和识别速度。     

A novel adaptive morphological approach for degraded character image segmentation

This work proposes a novel adaptive approach for character segmentation and feature vector extraction from seriously degraded images. An algorithm based on the histogram automatically detects fragments and merges these fragments before segmenting the fragmented characters. A morphological thickening algorithm automatically locates reference lines for separating the overlapped characters. A morphological thinning algorithm and the segmentation cost calculation automatically determine the baseline for segmenting the connected characters. Basically, our approach can detect fragmented, overlapped, or connected character and adaptively apply for one of three algorithms without manual fine-tuning. Seriously degraded images as license plate images taken from real world are used in the experiments to evaluate the robustness, the flexibility and the effectiveness of our approach. The system approach output data as feature vectors keep useful information more accurately to be used as input data in an automatic pattern recognition system.