Sharif Digital Repository

Biomechanical modeling approaches require body posture to evaluate the risk of spine injury during manual material handling. The procedure to measure body posture via motion-analysis techniques as well as the subsequent calculations of lumbosacral moments and spine loads by, respectively, inverse-dynamic and musculoskeletal models are complex and time-consuming. We aim to develop easy-to-use yet accurate artificial neural networks (ANNs) that predict 3D whole-body posture (ANNposture), segmental orientations (ANNangle), and lumbosacral moments (ANNmoment) based on our measurements during load-handling activities. Fifteen individuals each performed 135 load-handling activities by reaching (0... 

Optical Coherence Optical coherence tomography is a powerful high-resolution imaging method with a broad biomedical application. Nonetheless, OCT images suffer from a multiplicative artefacts so-called speckle, a result of coherent imaging of system. Digital filters become ubiquitous means for speckle reduction. Addressing the fact that there still a room for despeckling in OCT, we proposed an intelligent speckle reduction framework based on OCT tissue morphological, textural and optical features that through a trained network selects the winner filter in which adaptively suppress the speckle noise while preserve structural information of OCT signal. These parameters are calculated for... 

In this paper, we propose a novel algorithm that combines color and texture information of skin with cellular learning automata to segment skin-like regions in color images. First, the presence of skin colors in an image is detected, using a committee structure, to make decision from several explicit boundary skin models. Detected skin-color regions are then fed to a color texture extractor that extracts the texture features of skin regions via their color statistical properties and maps them to a skin probability map. Cellular learning automatons use this map to make decision on skin-like regions. The proposed algorithm has demonstrated true positive rate of about 83.4% and false positive... 

Image segmentation is one of the fundamental problems in image processing and computer vision, since it is the first step in many image analysis systems. This paper presents a new perspective to image segmentation, namely, segmenting input images by applying efficient community detection algorithms common in social and complex networks. First, a common segmentation algorithm is used to fragment the image into small initial regions. A weighted network is then constructed. Each initial region is mapped to a vertex, and all these vertices are connected to each other. The similarity between two regions is calculated from colour information. This similarity is then used to assign weights to the... 

The goal of image segmentation is to find regions that represent objects or meaningful parts of objects. In this paper a new method is presented for color image segmentation which involves the ideas used for community detection in social networks. In the proposed method an initial segmentation is applied to partition input image into small homogeneous regions. Then a weighted network is constructed from the regions, and a community detection algorithm is applied to it. The detected communities represent segments of the image. A remarkable feature of the method is the ability to segments the image automatically by optimizing the modularity value in the constructed network. The performance of... 

This paper presents a new segmentation method for color images. It relies on soft and hard segmentation processes. In the soft segmentation process, a cellular learning automata analyzes the input image and closes together the pixels that are enclosed in each region to generate a soft segmented image. Adjacency and texture information are encountered in the soft segmentation stage. Soft segmented image is then fed to the hard segmentation process to generate the final segmentation result. As the proposed method is based on CLA it can adapt to its environment after some iterations. This adaptive behavior leads to a semi content-based segmentation process that performs well even in presence of... 

Passive finite element (FE) models of the spine are commonly used to simulate intact and various pre- and postoperative pathological conditions. Being devoid of muscles, these traditional models are driven by simplistic loading scenarios, e.g., a constant moment and compressive follower load (FL) that do not properly mimic the complex in vivo loading condition under muscle exertions. We aim to develop novel passive FE models that are driven by more realistic yet simple loading scenarios, i.e., in vivo vertebral rotations and pathological-condition dependent FLs (estimated based on detailed musculoskeletal finite element (MS-FE) models). In these novel force–displacement control FE models,... 

It is always crucial to estimate process capability index (PCI) when the quality characteristic does not follow normal distribution, however skewed distributions come about in many processes. The classical method to estimate process capability is not applicable for non-normal processes. In the existing methods for non-normal processes, probability density function (pdf) of the process or an estimate of it is required. Estimating pdf of the process is a hard work and resulted PCI by estimated pdf may be far from real value of it. In this paper an artificial neural network is proposed to estimate PCI for right skewed distributions without appeal to pdf of the process. The proposed neural... 

Let P be a rectilinear simple polygon. The stabbing number of a partition of P into rectangles is the maximum number of rectangles stabbed by any axis-parallel line segment inside P. We present a 3-approximation algorithm for the problem of finding a partition with minimum stabbing number. It is based on an algorithm that finds an optimal partition for histograms. We also study Steiner triangulations of a simple (nonrectilinear) polygon P. Here the stabbing number is defined as the maximum number of triangles that can be stabbed by any line segment inside P. We give an O(1)-approximation algorithm for the problem of computing a Steiner triangulation with minimum stabbing number  

We study two well-known planar visibility problems, namely visibility testing and visibility counting, in a model where there is uncertainty about the input data. The standard versions of these problems are defined as follows: we are given a set S of n segments in R 2 , and we would like to preprocess S so that we can quickly answer queries of the form: is the given query segment s∈S visible from the given query point q∈R 2 (for visibility testing) and how many segments in S are visible from the given query point q∈R 2 (for visibility counting). In our model of uncertainty, each segment may or may not exist, and if it does, it is located in one of finitely many possible locations, given by a... 

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...