Thyroid cancer, which is one of the top ten most prevalent cancer in Taiwan, can be diagnosed by traditional fine-needle aspiration biopsy or ultrasonic imaging technology cooperated with physicians' clinical experience. Recently, the computer aided diagnosis (CAD) system based on ultrasonic technology is well adopted by the hospitals. However, based on ultrasonic image and human experience, the cancer can only be diagnosed approximately in 80%, the rest thus have to return to invasive biopsy. What is worse, there are still remaining 20% uncertainness after biopsy. In order to increase the detection rate in CAD system, an approach based on shear wave ultrasonic image with computer vision and deep learning technology is developed. Three methods, namely, texture analysis, traditional convolutional neural network (CNN), and densely connected convolutional network (DenseNet), are used for study and comparison. With manual ROI selection, the method based on the DenseNet achieves 88% accuracy, 90.9% sensitivity as well as 96.5% specificity on our testing data, and is thus selected as the kernel used in our thyroid nodule diagnosis system for benign/malignant classification. Furthermore, a semi-automatic user interface has been built, which can diagnose thyroid nodule in real-time clinically and thus improve the physicians' diagnosis accuracy as well as reduce the probability of invasive biopsy.
Skeletonization is a quite significant technology for the shape representation in the field of image processing and pattern recognition. In order to explore its application onto the Chinese calligraphy character representation and reconstruction, a skeletal line based shape descriptor has been presented by the authors recently. Its performances evaluated by measurement of skeleton deviation (MSD), number of distorted forks (NDF), number of spurious strokes (NSS) as well as measurement of reconstructability (MR) showed that the skeleton-biased phenomenon can be greatly reduced and the pattern reconstructability near to 100% can be achieved. However, due to the use of dense skeletal line (SL) placement scheme, a lot of memory space is needed for storing the extended and dense SL information; and the computation cost is also rather expensive. Therefore, a compact strategy is presented in this paper to overcome these issues. Instead of storing all the SL information, only the sampled SL with a certain interval will be stored in the skeleton table. By performing the curve-fitting strategy derived from Vandermonde matrix onto the sampled SL information in the skeleton table, both the required skeleton and pattern contour can be readily restored, and the original pattern can thus be reconstructed. The sampling interval (SI) from 1 to 6 are used in our experiments (with 15 Chinese calligraphy characters) and the original method is regarded as the ground truth. Our experimental results show that the memory space can be approximately reduced from 54% (SI = 1) to 92% (SI = 6). The pattern reconstructability can still be maintained from 95% (SI = 1) to 92% (SI = 6). Moreover, the mean execution time of pattern reconstruction can be greatly reduced from 7.814 sec (the original method) to 0.078 sec (the improved method). The results confirm the feasibility of the proposed approach.
Chinese calligraphy is often used to perform the beauty of characters in Chinese culture and is quite suitable in the study of shape representation. The skeleton of a digital line pattern can be treated as the shape descriptor. However, the skeleton-biased and reconstruction-incomplete phenomena often exist in a skeletonization method, which results in the difficulty of using the skeleton to perform the beauty of Chinese calligraphy characters. To overcome this difficulty, skeletal line information derived from the skeletal points and indexed boundary points is defined, and its transformation is implemented by a procedure of two-phase skeletal line placement (SLP). Based on the SLP, an effective algorithm including the SLP-stroke for strokes, SLP-fork for forks, and SLP-end for the end parts of strokes is developed for constructing the skeletal line-based shape descriptor. Four indices of measurement of skeleton deviation, number of distorted forks, number of spurious strokes, and measurement of reconstructability are used to evaluate the performance of the proposed approach. Experimental results show that the skeleton-biased phenomenon can be greatly reduced and the pattern reconstructability close to 100% is achieved, thus confirming that the proposed skeletonization approach is suitable for the Chinese calligraphy character representation and reconstruction.
Color-band resistor possessing specular surface is worthy of studying in the area of color image processing and color material recognition. The specular reflection and halo effects appearing in the acquired resistor image will result in the difficulty of color band extraction and recognition. A computer vision system is proposed to detect the resistor orientation, segment the resistor’s main body, extract and identify the color bands, as well as recognize the color code sequence and read the resistor value. The effectiveness of reducing the specular reflection and halo effects are confirmed by several cheap covers, e.g., paper bowl, cup, or box inside pasted with white paper combining with a ring-type LED controlled automatically by the detected resistor orientation. The calibration of the microscope used to acquire the resistor image is described and the proper environmental light intensity is suggested. Experiments are evaluated by 200 4-band and 200 5-band resistors comprising 12 colors used on color-band resistors and show the 90% above correct rate of reading resistor. The performances reported by the failed number of horizontal alignment, color band extraction, color identification, as well as color code sequence flip over checking confirm the feasibility of the presented approach.
Light source plays a significant role to acquire a qualified image from objects for facilitating the image processing and pattern recognition. For objects possessing specular surface, the phenomena of reflection and halo appearing in the acquired image will increase the difficulty of information processing. Such a situation may be improved by the assistance of valuable diffuse light source. Consider reading resistor via computer vision, due to the resistor’s specular reflective surface it will face with a severe non-uniform luminous intensity on image yielding a higher error rate in recognition without a well-controlled light source. A measurement system including mainly a digital microscope embedded in a replaceable diffuse cover, a ring-type LED embedded onto a small pad carrying a resistor for evaluation, and Arduino microcontrollers connected with PC, is presented in this paper. Several replaceable cost-effective diffuse covers made by paper bowl, cup and box inside pasted with white paper are presented for reducing specular reflection and halo effects and compared with a commercial diffuse some. The ring-type LED can be flexibly configured to be a full or partial lighting based on the application. For each self-made diffuse cover, a set of resistors with 4 or 5 color bands are captured via digital microscope for experiments. The signal-to-noise ratio from the segmented resistor-image is used for performance evaluation. The detected principal axis of resistor body is used for the partial LED configuration to further improve the lighting condition. Experimental results confirm that the proposed mechanism can not only evaluate the cost-effective diffuse light source but also be extended as an automatic recognition system for resistor reading.
In this paper, we incorporate a set of sophisticated algorithms to implement a leaf segmentation and classification system. This system inherits the advantages of these algorithms while eliminating the difficulties each algorithm faced. Our system can segment leaves from images of live plants with arbitrary image conditions, and classify them against sketched leaf shapes or real leaves. This system can also estimate the three-dimensional (3-D) information of leaves which is not only useful for leaf segmentation but is also beneficial for further 3-D shape recovery. Although our system requires more than one image to reconstruct the 3-D structure of the scene, it has been designed so that only a few images with close viewpoints are sufficient to achieve the task, thus the system is still flexible and easy to use in image acquisition. For leaf classification, we adopt the normalized centroid-contour distance as our classification feature and employ a circular-shift comparing scheme to measure leaf similarity so that the system has the advantage of being invariant to leaf translation, rotation and scaling. We have conducted a series of experiments on many leaf images and the results are encouraging. The leaves can be well segmented and the classification results are also acceptable.
It is difficult to automatically detect tumors and extract lesion boundaries in ultrasound images due to the variance in
shape, the interference from speckle noise, and the low contrast between objects and background. The enhancement of
ultrasonic image becomes a significant task before performing lesion classification, which was usually done with
manual delineation of the tumor boundaries in the previous works. In this study, a linear support vector machine (SVM)
based algorithm is proposed for ultrasound breast image training and classification. Then a disk expansion algorithm is
applied for automatically detecting lesions boundary. A set of sub-images including smooth and irregular boundaries in
tumor objects and those in speckle-noised background are trained by the SVM algorithm to produce an optimal
classification function. Based on this classification model, each pixel within an ultrasound image is classified into either
object or background oriented pixel. This enhanced binary image can highlight the object and suppress the speckle
noise; and it can be regarded as degraded paint character (DPC) image containing closure noise, which is well known in
perceptual organization of psychology. An effective scheme of removing closure noise using iterative disk expansion
method has been successfully demonstrated in our previous works. The boundary detection of ultrasonic breast lesions
can be further equivalent to the removal of speckle noise. By applying the disk expansion method to the binary image,
we can obtain a significant radius-based image where the radius for each pixel represents the corresponding disk
covering the specific object information. Finally, a signal transmission process is used for searching the complete breast
lesion region and thus the desired lesion boundary can be effectively and automatically determined. Our algorithm can
be performed iteratively until all desired objects are detected. Simulations and clinical images were introduced to
evaluate the performance of our approach. Several types of cysts with different contours and contrast resolutions images
were simulated with speckle characteristics. Four thousand sub-images of tumor objects and speckle-noised background
were used for SVM training. Comparison with conventional algorithms such as active contouring, the proposed
algorithm does not need to position any initial seed point within the lesion and is able to detect simultaneously multiple
irregular shape lesions in a single image, thus it can be regarded as a fully automatic process. The results show that the
mean normalized true positive area overlap between true contour and contour obtained by the proposed approach is
90%.
Microcirculation volumetric flow rate is a significant index in diseases diagnosis and treatment such as diabetes and
cancer. In this study, we propose an integrated algorithm to assess microcirculation volumetric flow rate including
estimation of blood perfused area and corresponding flow velocity maps based on high frequency destruction/contrast
replenishment imaging technique. The perfused area indicates the blood flow regions including capillaries, arterioles
and venules. Due to the echo variance changes between ultrasonic contrast agents (UCAs) pre- and post-destruction two
images, the perfused area can be estimated by the correlation-based approach. The flow velocity distribution within the
perfused area can be estimated by refilling time-intensity curves (TICs) after UCAs destruction. Most studies introduced
the rising exponential model proposed by Wei (1998) to fit the TICs. Nevertheless, we found the TICs profile has a
great resemblance to sigmoid function in simulations and in vitro experiments results. Good fitting correlation reveals
that sigmoid model was more close to actual fact in describing destruction/contrast replenishment phenomenon. We
derived that the saddle point of sigmoid model is proportional to blood flow velocity. A strong linear relationship (R =
0.97) between the actual flow velocities (0.4-2.1 mm/s) and the estimated saddle constants was found in M-mode and B-mode
flow phantom experiments. Potential applications of this technique include high-resolution volumetric flow rate
assessment in small animal tumor and the evaluation of superficial vasculature in clinical studies.
Detection of circular information including drill holes and inside connection metal rings, plays a key role for the automatic inspection of a multi-layer printed circuit board (PCB). An approach is presented to automatically extract whole circular information from an x-ray image acquired from a multi-layer PCB. By analyzing the x-ray image with a series of some image processing procedures, the basic circular information can be obtained and be treated as an initial contour for further processing. An effective modular active contour is then presented to guide the initial contour to locate the circular information more precisely. Experimental analyses have shown that the proposed approach can reach at the performance of 0.5 pixel average error under 20% random noise added. Experiments on real PCB x-ray images have also confirmed the feasibility of the proposed approach.
The clustering process can be quite slow when there is a large data set to be clustered. We investigate four efficient fuzzy c-means clustering methods qFCMs, based on the quad-tree application to multispectral image feature compression and/or an aggregation process to reduce the number of exemplars for image analysis. An image is first partitioned into multiresolution blocks with variable size to extract the representative ones by homogeneity criteria. The blocks can be represented by a mean or fuzzy number to represent the image information. The first algorithm qFCMb is performed by applying only the representative blocks to a weighted FCM, which can speed up the clustering. To further improve the clustering efficiency, the reduction is done by aggregating similar examples and using a weighted exemplar in the clustering process (qFCMba). Based on the same processes used in qFCMb and qFCMba, nonhomogeneous regions including pixel information can also be supplemented to refine the clustering results, which are termed qFCMp and qFCMpa, respectively. Because of the merit of higher efficiency with the aggregation process, we recommend qFCMba and qFCMpa. A set of 14 images is used for experiments, comparison, and discussion. Performances are reported by the mean reduction rate, speedup, mean correspondence rate, and root mean square error. Results show that the mean reduction rate of both qFCMba and qFCMpa can be as high as 98% reduction in sample size. Average speedups of as much as 40 to 150 times (100 to 200 times) a traditional implementation FCM are obtained using qFCMpa (qFCMba), while producing partitions that are equivalent to those produced by FCM. On the measure of root mean square error, qFCMba is the better choice, as indicated in the experiment of clustering a noisy image.
KEYWORDS: Image segmentation, Image processing algorithms and systems, Color image segmentation, Image processing, Human vision and color perception, RGB color model, Color image processing, Color difference, Neurons, Visualization
KEYWORDS: Motion estimation, Point spread functions, Image processing, Hough transforms, Human vision and color perception, Visualization, Spatial frequencies, Electrical engineering, Data processing, Motion models
To simplify the problem of estimating the motion parameters, in this paper, based on the properties of human motion perception we present a feasible approach, which can estimate the motion direction and the motion extension for a linear motion blurred image. Two main parts are developed in our approach. Hough transform is first used to detect the angle (i.e., motion direction) of a given linear motion blurred image, and quadtree method is secondly used to estimate the extent of point spread function of the same image. Many experimental results have confirmed the feasibility of the proposed approach.
This paper presents an automatic approach for extracting a face and estimating the facial expression from a gray image. To improve the execution time and the tolerance degree, the technique of wavelet decomposition is used in our approach for feature extraction. The main steps of the proposed approach are as follows. First, each input image is preprocessed with normalization, which includes translation, rotation, scaling, and light source adjustment. Secondly, the wavelet decomposition transform is applied to making image into different levels, and the information extracted from these levels is used to estimate the face region with a template-matching method. Finally, the facial expression is estimated from the found face region by using the technique of active shape template. Experimental results have confirmed the feasibility of the proposed approach.
Extracting human body framework from images is up to now an open and significant problem in general. We propose a systematic approach which strictly follows the fundamental assumption: only one front-viewed standing human body dressing clothes with long sleeves and long trousers can be extracted from an image in this paper. Three main steps devised in our approach to extract the human body framework are face detection, segmentation of clothes and trousers regions, and positioning all human body parts. The face detection was performed by means of face skin color extraction and face template matching. Based on the determined hue quantization and color texture features, a texture similarity measure was designed for the segmentation of clothes and trousers. In accordance with the entropy concept of information theory, the homogeneous and inhomogeneous information was derived from similarity measurements of a human body image. Then the useful images transformed respectively from the found homogeneous and inhomogeneous information were combined with the defined relationships of a human body framework to locate the trunk region, arm parts, the hip region and leg parts. Experiments have confirmed the feasibility of the proposed approach.
The successful judgement of color harmony primarily depends on the determined features related to human's pleasure. In this paper, a new color feature of color linguistic distributions (CLD) is proposed upon a designed 1D image scale of 'CHEERFUL-SILENT'. This linguistic feature space is mainly designed by consisting with the color-difference of practical color vision. The CLD is described by a distance-based color linguistic quantization (DCLQ) algorithm, and is capable to indicate the fashion trends in Taiwan. Also, the grade of harmony can be measured based on the similarity of CLDs. Experiment of quantitative color harmony judgement demonstrate that the results based on CIE1976-LUV and CIE1976-LAB color spaces accomplish better consistency with those of questionnaire-based harmony judgement than the hue-dominated method.
Multi-foregrounds-backgrounds (MFsBs) images involve histogram- interlaces and space-neighboring foregrounds and backgrounds. In this paper, a concept of 'dummy background' is proposed to represent the 'perceived' background, instead of multibackgrounds. Also, the dummy background corresponds to scaling the morphological distance of foregrounds and backgrounds, which improve the space-association capability of traditional segmentation algorithm. Experimental results demonstrate that more better segmentation is accomplished by less time- consuming.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.