An interactive lung field segmentation scheme with automated capability

Feasible clinical application of any automated segmenting methodology demands more than just accuracy. Amendment to the automated delineation is necessary when the algorithm fails, however, integrated solution to such a scenario is largely absent in literature. Hence in this survey we devised an architecture that does both the automated and interactive lung field localizations using a single segmenting engine—random walker algorithm—so that intuitive amendment is only necessary when the automated generated delineation is unsatisfactory. The algorithm proceeds by first extracting 18 intensity profiles running horizontally, each of them equally spacing apart, and in each intensity profile three extreme points denoting the two lungs and the esophagus are determined through profile matching. This done, the algorithm removes profiles that do not intersect with the lung, and the rest of the extreme points are plugged into random walker algorithm to perform segmentation. The achieved accuracy in localization by the above was 0.8875 in terms of overlap measure (the maximum value for this parameter is 1) over 341 images. In the case where unsatisfactory delineation prompts amendment necessary, the user can interactively segment the lung by just a shift on some of the previous-determined points to the desired locations, and random walker algorithm is run again with the amended input. By such a fusion, the benefits of both the automated and interactive segmentation are shared in a single architecture.     

Measurement feedback control for a class of feedforward nonlinear systems

We propose a measurement feedback controller for a class of feedforward nonlinear systems under sensor noise. The sensor noise has unknown magnitude, frequency, and phase. Our proposed controller is coupled with a low‐pass filter in such a way that the sensor noise is attenuated. We show that the controlled system results in bounded states whose ultimate bounds are inversely proportional to the minimum frequency of the sensor noise. Our result is further generalized to work in a case where the sensor noise is only required to have a Fourier transform with finite energy. Moreover, if the sensor noise enters only at partial states, depending on the location of the sensor noise, the ultimate bounds of the particular states can be made arbitrarily small via the gain factor of the controller. Copyright © 2012 John Wiley & Sons, Ltd.     

Semi-online scheduling problems on a small number of machines

We consider the semi-online parallel machine scheduling problem of minimizing the makespan given a priori information: the total processing time, the largest processing time, the combination of the previous two or the optimal makespan. We propose a new algorithm that can be applied to the problem with the known total or largest processing time and prove that it has improved competitive ratios for the cases with a small number of machines. Improved lower bounds of the competitive ratio are also provided by presenting adversary lower bound examples.     

A resource allocation policy for delay minimization in fetching capacitated feeds

As social media services such as Twitter and Facebook are gaining popularity, the amount of information published from those services is explosively growing. Most of them use feeds to facilitate distribution of a huge volume of content they publish. In this context, many users subscribe to feeds to acquire up-to-date information through feed aggregation services, and recent real-time search engines also increasingly utilize feeds to promptly find recent web content when it is produced. Accordingly, it is necessary for such services to effectively fetch feeds for minimizing fetching delay, while at the same time maximizing the number of fetched entries. Fetching delay is a time lag between entry publication and retrieval, which is primarily incurred by finiteness of fetching resources. In this paper, we consider a polling-based approach among the methods applicable to fetching feeds, which bases on a specific schedule for visiting feeds. While the existing polling-based approaches have focused on the allocation of fetching resources to feeds in order to either reduce the fetching delay or increase the number of fetched entries, we propose a resource allocation policy that can optimize both objectives. Extensive experiments have been carried out to evaluate the proposed model, in comparison with the existing alternative methods.     

Biodegradation of estrogen conjugates by bacteria isolated from river sediments

The objective of this study was to investigate the ability of E. coli in river sediments to degrade estrogen conjugates. Biodegradation experiments on glucuronide estrogens (E1-GLU, E2-GLU and E3-GLU) using E. coli, non-E. coli bacteria as well as sediment crude extracts were carried out in batch mode. A pure identified E. coli strain (KCTC 2571) was used for comparison of enzyme activity. The results showed that the degradation rate of estrogen conjugates by KCTC 2571 and E. coli isolated from sediments followed a similar trend. Fecal bacteria showed a high ability to deconjugate glucuronided estrogens. Approximately 50% of glucuronide moieties were cleaved within 4 h of contact time in experiments using pure E. coli. The degradation rate was slower in experiments using crude extracts of sediments, and conjugated estrogens were not completely degraded even after 12 h of reaction. These results provide a clear understanding of the fate and behavior of estrogen by bacteria in the environment.     

Color image segmentation using adaptive unsupervised clustering approach

This paper presents the Region Splitting and Merging-Fuzzy C-means Hybrid Algorithm (RFHA), an adaptive unsupervised clustering approach for color image segmentation, which is important in image analysis and in understanding pattern recognition and computer vision field. Histogram thresholding technique is applied in the formation of all possible cells, used to split the image into multiple homogeneous regions. The merging technique is applied to merge perceptually close homogeneous regions and obtain better initialization for the Fuzzy C-means clustering approach. Experimental results have demonstrated that the proposed scheme could obtain promising segmentation results, with 12% average improvement in clustering quality and 63% reduction in classification error compared with other existing segmentation approaches.     

Flow profile measurement in microchannel using the optical feedback interferometry sensing technique

The need to accurately measure flow profiles in microfluidic channels is well recognised. In this work, we present a new optical feedback interferometry (OFI) flow sensor that accurately measures local velocity in fluids and enables reconstruction of a velocity profile inside a microchannel. OFI is a self-aligned interferometric technique that uses the laser as both the transmitter and the receiver thus offering high sensitivity, fast response, and a simple and compact optical design. The system described here is based on a commercial semiconductor laser and has been designed to achieve a micrometer-range spatial resolution. The sensor performance was validated by reconstructing the velocity profile inside a circular cross-section flow-channel with 320  $\upmu $ m internal diameter, with a relative error smaller than 1.8 %. The local flow velocity is directly measured, thus avoiding the need for model based profile calculation and uncertainties inherent to this approach. The system was validated by successfully extracting the flow profiles in both Newtonian and shear-thinning liquids.     

Retrieval of machine-printed Latin documents through Word Shape Coding

This paper reports a document retrieval technique that retrieves machine-printed Latin-based document images through word shape coding. Adopting the idea of image annotation, a word shape coding scheme is proposed, which converts each word image into a word shape code by using a few shape features. The text contents of imaged documents are thus captured by a document vector constructed with the converted word shape code and word frequency information. Similarities between different document images are then gauged based on the constructed document vectors. We divide the retrieval process into two stages. Based on the observation that documents of the same language share a large number of high-frequency language-specific stop words, the first stage retrieves documents with the same underlying language as that of the query document. The second stage then re-ranks the documents retrieved in the first stage based on the topic similarity. Experiments show that document images of different languages and topics can be retrieved properly by using the proposed word shape coding scheme.