Sharif Digital Repository

Anatomical image segmentation is one of the foundations for medical planning. Recently, convolutional neural networks (CNN) have achieved much success in segmenting volumetric (3D) images when a large number of fully annotated 3D samples are available. However, rarely a volumetric medical image dataset containing a sufficient number of segmented 3D images is accessible since providing manual segmentation masks is monotonous and time-consuming. Thus, to alleviate the burden of manual annotation, we attempt to effectively train a 3D CNN using a sparse annotation where ground truth on just one 2D slice of the axial axis of each training 3D image is available. To tackle this problem, we propose... 

We present an attempt to improve the performance of multi-class image segmentation systems based on a multilevel description of segments. The multi-class image segmentation system used in this paper marks the segments in an image, describes the segments via multilevel feature vectors and passes the vectors to a multi-class object classifier. The focus of this paper is on the segment description section. We first propose a robust, scale-invariant texture feature set, named directional differences (DDs). This feature is designed by investigating the flaws of conventional texture features. The advantages of DDs are justified both analytically and experimentally. We have conducted several... 

Segmentation plays an important role in the machine vision field. Extraction of dominant segments with large number of pixels is essential for some applications such as object detection. In this paper, a new approach is proposed for color image segmentation which uses ideas behind the social science and complex networks to find dominant segments. At first, we extract the color and texture information for each pixel of input image. A network that consists of some nodes and edges is constructed based on the extracted information. The idea of community detection in social networks is used to partition a color image into disjoint segments. Community detection means partitioning vertices of a... 

In recent years, IWR (Isolated Word Recognition) was one of the main concerns of speech processing. The challenging problems in this field appear when the database become so large or when we have a lot of word with similarly pronounce in the database. This paper introduces a general solution for a traditional problem in isolated similarly pronounced word recognition, especially in large databases. One the important problem of traditional IWR is referred to their segmentation algorithm, their methods were lacking in efficiency due to the following reasons: First, using equal segmentation is not at all intelligent at all and as a result, cannot produce accurate results; besides, utilizing... 

3D scene understanding is an open challenge in the field of computer vision. Most of the focus is on 2D methods in which the semantic labeling of each RGB pixel is considered. But, in this paper, the 3D semantic labeling of RGB-D images is considered. In the proposed method, to extract some meaningful features, the superpixel generation algorithm is applied to the RGB image to segment it into a set of disjoint pixels. After that, the set of three powerful classifiers are utilized to semantically label each superpixel. In the proposed method, the probability outputs of these classifiers are concatenated as the novel feature vector for each superpixel. Consequently, to analyze the strengths... 

Image segmentation with clustering approach is widely used in biomedical application. Fuzzy c-means (FCM) clustering is able to preserve the information between tissues in image, but not taking spatial information into account, makes segmentation results of the standard FCM sensitive to noise. To overcome the above shortcoming, a modified FCM algorithm for MRI brain image segmentation is presented in this paper. The algorithm is realized by incorporating the spatial neighborhood information into the standard FCM algorithm and modifying the membership weighting of each cluster by smoothing it by Total Variation (TV) denoising. The proposed algorithm is evaluated with accuracy index in... 

Despite many advances in optical character recognition in general, there are still serious challenges remaining in recognizing Farsi text. The main reason is the cursive nature of the letters in written Farsi, i.e., depending on the position of a letter within a word, it might join to its neighboring letters, which consequently changes the shape of the character. As a result, each letter can have up to four different character shapes. In addition to the problem of segmenting the characters, the increased number of characters makes the recognition task even more challenging. This paper introduces a complete framework for character recognition, including a method for segmenting the characters... 

Color image segmentation is a primitive operation in many image processing and computer vision applications. Accordingly, there exist numerous segmentation approaches in the literature, which might be misleading for a researcher who is looking for a practical algorithm. While many researchers are still using the tools which belong to the old color space paradigm, there is evidence in the research established in the eighties that a proper descriptor of color vectors should act locally in the color domain. In this paper, these results are used to propose a new color image segmentation method. The proposed method searches for the principal colors, defined as the intersections of the cylindrical... 

Chest computed tomography (CT) has played an essential diagnostic role in assessing patients with COVID-19 by showing disease-specific image features such as ground-glass opacity and consolidation. Image segmentation methods have proven to help quantify the disease and even help predict the outcome. The availability of longitudinal CT series may also result in an efficient and effective method to reliably assess the progression of COVID-19, monitor the healing process and the response to different therapeutic strategies. In this paper, we propose a new framework to identify infection at a voxel level (identification of healthy lung, consolidation, and ground-glass opacity) and visualize the... 

Semantic segmentation is one of the basic, yet essential scene understanding tasks for an autonomous agent. The recent developments in supervised machine learning and neural networks have enjoyed great success in enhancing the performance of the state-of-the-art techniques for this task. However, their superior performance is highly reliant on the availability of a large-scale annotated dataset. In this letter, we propose a novel fully unsupervised semantic segmentation method, the so-called Information Maximization and Adversarial Regularization Segmentation (InMARS). Inspired by human perception which parses a scene into perceptual groups, rather than analyzing each pixel individually, our... 

Synthetic aperture radar (SAR) appropriate image processing in conjunction with noise reduction is crucial in proper image segmentation. The authors present a new algorithm, logarithmic adaptive soft morphological (LASM) filter, utilising collectivity and flexibility of order-statistic soft morphological filters. This method not only reduces the speckle noise of the single-look SAR imagery considerably, but it significantly enhances the segmentation results. To verify the performance, a simulated SAR image is first created by applying an imagery method to an original noiseless image. The resulting image has characteristics identical to a real SAR image. The LASM method, as well as several... 

In this paper, a polygonal finite element method is presented for large deformation frictionless dynamic contact-impact problems with non-conformal meshes. The geometry and interfaces of the problem are modeled independent of the background mesh based on the level set method to produce polygonal elements at the intersection of the interface with the regular FE mesh. Various polygonal shape functions are employed to investigate the capability of polygonal-FEM technique in modeling frictionless contact-impact problems. The contact constraints are imposed between polygonal elements produced along the contact surface through the node-to-surface contact algorithm. Several contact-impact problems... 

Segmentation of aerial images has been a challenging task in recent years. This paper introduces a simple and efficient method for segmentation and classification of aerial images based on a pixel-level classification. To this end, we use the Gabor texture features in HSV color space as our best experienced features for aerial images segmentation and classification. We test different classifiers including KNN, SVM and a classifier based on sparse representation. Comparison of our proposed method with a sample of segmentation pre-process based classification methods shows that our pixel-wise approach results in higher accuracy results with lower computation time  

Finger-Knuckle-Print (FKP) is one of the newest biometrics. In this paper, a novel approach has been proposed to segment the Region of Interest (ROI) of a FKP image using the global intensity. This method upgrades the speed and accuracy of segmentation stage, as well as the pace of other steps of the procedure. This has been achieved by employing the area with maximum intensity in ROI extraction, instead of using the creases of the knuckle image. To confirm this improvement, lots of experiments have been performed and the method has been compared with the only existing schemes for ROI extraction suggested by Zhang and Kekre. At the end, the captured ROI images obtained by three methods have... 

Isolated Word Recognition (IWR) is becoming increasingly attractive due to the improvement of speech recognition techniques. However, the accuracy of IWR suffers when large databases or words with similar pronunciation are used. The criterion for accurate speech recognition is suitable segmentation. However, the traditional method of segmentation equal segmentation does not produce the most accurate result. Furthermore, utilizing manual segmentation based on events is not possible in large databases. In this paper, we introduce an intelligent segmentation based on Hierarchical Temporal Decomposition (HTD). Based on this method, a temporal decomposition (TD) algorithm can be used to... 

Summary keywords are words that are used in the reference extracted summary, therefore can be used to discriminate between summary sentences from non-summary ones. Finding these words is important for the extractive summarization algorithms that measure the importance of a sentence based on the importance of its constituent words. This paper is focused on extracting summary keywords in the multi-party meeting domain. We test previously proposed keyword extraction algorithms and evaluate their performance to determine summary keywords. We also propose a new approach which uses discourse information to find local important keywords and show that it outperforms all the previous methods. We... 

This paper considers the problem of computing the weak visibility polygon (WVP) of any query line segment pq (or WVP(pq)) inside a given simple polygon P. We present an algorithm that preprocesses P and creates a data structure from which WVP(pq) is efficiently reported in an output sensitive manner. Our algorithm needs O(n2log n) time and O(n2) space in the preprocessing phase to report WVP(pq) of any query line segment pq in time O(|WVP(pq)|+log2 n+κlog2 (nκ)), where κ is an input and output sensitive parameter of at most |WVP(pq)|. We improve the preprocessing time and space of current results for this problem [11,6] at the expense of more query time  

In this paper we consider the problem of computing the weak visibility polygon of a query line segment pq (or (Formula presented.)) inside a given polygon (Formula presented.). Our first algorithm runs in simple polygons and needs (Formula presented.) time and (Formula presented.) space in the preprocessing phase to report (Formula presented.) of any query line segment pq in time (Formula presented.). We also give an algorithm to compute the weak visibility polygon of a query line segment in a non-simple polygon with (Formula presented.) pairwise-disjoint polygonal obstacles with a total of n vertices. Our algorithm needs (Formula presented.) time and (Formula presented.) space in the...