Segmentation of the bladder in computerized tomography(CT) images is an important step in radiation therapy planning of prostate cancer. We present a new segmentation scheme to automatically delineate the bladder cont...Segmentation of the bladder in computerized tomography(CT) images is an important step in radiation therapy planning of prostate cancer. We present a new segmentation scheme to automatically delineate the bladder contour in CT images with three major steps. First,we use the mean shift algorithm to obtain a clustered image containing the rough contour of the bladder,which is then extracted in the second step by applying a region-growing algorithm with the initial seed point selected from a line-by-line scanning process. The third step is to refine the bladder contour more accurately using the rolling-ball algorithm. These steps are then extended to segment the bladder volume in a slice-by-slice manner. The obtained results were compared to manual segmentation by radiation oncologists. The average values of sensitivity,specificity,positive predictive value,negative predictive value,and Hausdorff distance are 86.5%,96.3%,90.5%,96.5%,and 2.8 pixels,respectively. The results show that the bladder can be accurately segmented.展开更多
Recently, many image encryption algorithms based on chaos have been proposed. Most of the previous algorithms encrypt components R, G, and B of color images independently and neglect the high correlation between them....Recently, many image encryption algorithms based on chaos have been proposed. Most of the previous algorithms encrypt components R, G, and B of color images independently and neglect the high correlation between them. In the paper, a novel color image encryption algorithm is introduced. The 24 bit planes of components R, G, and B of the color plain image are obtained and recombined into 4 compound bit planes, and this can make the three components affect each other. A four-dimensional(4D) memristive hyperchaotic system generates the pseudorandom key streams and its initial values come from the SHA 256 hash value of the color plain image. The compound bit planes and key streams are confused according to the principles of genetic recombination, then confusion and diffusion as a union are applied to the bit planes,and the color cipher image is obtained. Experimental results and security analyses demonstrate that the proposed algorithm is secure and effective so that it may be adopted for secure communication.展开更多
In this paper,a technique based on image pyramid and Bayes rule for reducing noise effects in unsupervised change detection is proposed.By using Gaussian pyramid to process two multitemporal images respectively,two im...In this paper,a technique based on image pyramid and Bayes rule for reducing noise effects in unsupervised change detection is proposed.By using Gaussian pyramid to process two multitemporal images respectively,two image pyramids are constructed.The difference pyramid images are obtained by point-by-point subtraction between the same level images of the two image pyramids.By resizing all difference pyramid images to the size of the original multitemporal image and then making product operator among them,a map being similar to the difference image is obtained.The difference image is generated by point-by-point subtraction between the two multitemporal images directly.At last,the Bayes rule is used to distinguish the changed pixels.Both synthetic and real data sets are used to evaluate the performance of the proposed technique.Experimental results show that the map from the proposed technique is more robust to noise than the difference image.展开更多
At present, many chaos-based image encryption algorithms have proved to be unsafe, few encryption schemes permute the plain images as three-dimensional（3D） bit matrices, and thus bits cannot move to any position, th...At present, many chaos-based image encryption algorithms have proved to be unsafe, few encryption schemes permute the plain images as three-dimensional（3D） bit matrices, and thus bits cannot move to any position, the movement range of bits are limited, and based on them, in this paper we present a novel image encryption algorithm based on 3D Brownian motion and chaotic systems. The architecture of confusion and diffusion is adopted. Firstly, the plain image is converted into a 3D bit matrix and split into sub blocks. Secondly, block confusion based on 3D Brownian motion（BCB3DBM）is proposed to permute the position of the bits within the sub blocks, and the direction of particle movement is generated by logistic-tent system（LTS）. Furthermore, block confusion based on position sequence group（BCBPSG） is introduced, a four-order memristive chaotic system is utilized to give random chaotic sequences, and the chaotic sequences are sorted and a position sequence group is chosen based on the plain image, then the sub blocks are confused. The proposed confusion strategy can change the positions of the bits and modify their weights, and effectively improve the statistical performance of the algorithm. Finally, a pixel level confusion is employed to enhance the encryption effect. The initial values and parameters of chaotic systems are produced by the SHA 256 hash function of the plain image. Simulation results and security analyses illustrate that our algorithm has excellent encryption performance in terms of security and speed.展开更多
A semiautomatic segmentation method based on active contour is proposed for computed tomography (CT) image series. First, to get initial contour, one image slice was segmented exactly by C-V method based on Mumford-Sh...A semiautomatic segmentation method based on active contour is proposed for computed tomography (CT) image series. First, to get initial contour, one image slice was segmented exactly by C-V method based on Mumford-Shah model. Next, the computer will segment the nearby slice automatically using the snake model one by one. During segmenting of image slices, former slice boundary, as next slice initial contour, may cross over next slice real boundary and never return to right position. To avoid contour skipping over, the distance variance between two slices is evaluated by an threshold, which decides whether to initiate again. Moreover, a new improved marching cubes (MC) algorithm based on 2D images series segmentation boundary is given for 3D image reconstruction. Compared with the standard method, the proposed algorithm reduces detecting time and needs less storing memory. The effectiveness and capabilities of the algorithm were illustrated by experimental results.展开更多
In this paper, we introduce a novel class of coplanar conics, the pencil of which can doubly contact to calibrate camera and estimate pose. We first analyze the properties of con-axes and con-eccentricity ellipses, wh...In this paper, we introduce a novel class of coplanar conics, the pencil of which can doubly contact to calibrate camera and estimate pose. We first analyze the properties of con-axes and con-eccentricity ellipses, which consist of a naturM extending pattern of concentric circles. Then the general case that two ellipses have two repeated complex intersection points is presented. This degenerate configuration results in a one-parameter family of homographies which map the planar pattern to its image. Although it is unable to compute the complete homography, an indirect 3-degree polynomial or 5-degree polynomial constraint on intrinsic parameters from one image can also be used for camera calibration and pose estimation under the minimal conditions. Furthermore, this nonlinear problem can be treated as a polynomial optimization problem （POP） and the global optimization solution can be also obtained by using SparsePOP （a sparse semidefinite programming relaxation of POPs）, Finally, the experiments with simulated data and real images are shown to verify the correctness and robustness of the proposed technique.展开更多
Taking into account the demands of hyperspectral remote sensing(RS) image retrieval and processing, some encoding methods of spectral vector including direct encoding, feature-based encoding and tree-based encoding me...Taking into account the demands of hyperspectral remote sensing(RS) image retrieval and processing, some encoding methods of spectral vector including direct encoding, feature-based encoding and tree-based encoding methods are proposed and compared. In direct encoding, based on the analysis of binary encoding and quad-value encoding, decimal encoding is proposed. It is proved that quad-value encoding and decimal encoding are suitable to fast processing and retrieval. In absorption feature-based encoding method, five common metrics are compared. Because locations of reflection/absorption features are sensitive to noise, this method is not very effective in retrieval. In tree-based encoding methods, bitree, quadtree, octree and hextree are proposed and discussed. It is proved that 2-level octree and 2-level hextree are more effective than bitree and quadtree. Finally, quad-value encoding, decimal encoding, 2-level octree and 2-level hextree are proposed in spectral vectors encoding, similarity measure and hyperspectral RS image retrieval.展开更多
Automatic recognition of artists is very important in acoustic music indexing, browsing, and contentbased acoustic music retrieving, but synchronously it is still a challenging errand to extract the most representativ...Automatic recognition of artists is very important in acoustic music indexing, browsing, and contentbased acoustic music retrieving, but synchronously it is still a challenging errand to extract the most representative and salient attributes to depict diversiform artists. In this paper, we developed a novel system to complete the reorganization of artist automatically. The proposed system can efficiently identify the artist's voice of a raw song by analyzing substantive features extracted from both pure music and singing song mixed with accompanying music. The experiments on different genres of songs illustrate that the proposed system is possible.展开更多
This paper addresses the application of hand gesture recognition in monocular image sequences using Active Appearance Model （AAM）, For this work, the proposed algorithm is composed of constricting AAMs and fitting t...This paper addresses the application of hand gesture recognition in monocular image sequences using Active Appearance Model （AAM）, For this work, the proposed algorithm is composed of constricting AAMs and fitting the models to the interest region. In training stage, according to the manual labeled feature points, the relative AAM is constructed and the corresponding average feature is obtained. In recognition stage, the interesting hand gesture region is firstly segmented by skin and movement cues. Secondly, the models are fitted to the image that includes the hand gesture, and the relative features are extracted. Thirdly, the classification is done by comparing the extracted features and average features. 30 different gestures of Chinese sign language are applied for testing the effectiveness of the method. The Experimental results are given indicating good performance of the algorithm.展开更多
The trained Gaussian mixture model is used to make skincolour segmentation for the input image sequences. The hand gesture region is extracted, and the relative normalization images are obtained by interpolation opera...The trained Gaussian mixture model is used to make skincolour segmentation for the input image sequences. The hand gesture region is extracted, and the relative normalization images are obtained by interpolation operation. To solve the proem of hand gesture recognition, Fuzzy-Rough based nearest neighbour（RNN） algorithm is applied for classification. For avoiding the costly compute, an improved nearest neighbour classification algorithm based on fuzzy-rough set theory （FRNNC） is proposed. The algorithm employs the represented cluster points instead of the whole training samples, and takes the hand gesture data＇s fuzziness and the roughness into account, so the campute spending is decreased and the recognition rate is increased. The 30 gestures in Chinese sign language alphabet are used for approving the effectiveness of the proposed algorithm. The recognition rate is 94.96%, which is better than that of KNN （K nearest neighbor）and Fuzzy- KNN （Fuzzy K nearest neighbor）.展开更多
Pattern recognition methods were used to treat the experimentally measured data of Pitzer’s coefficients of 107 electrolytes, to find the relationships between the ionic structural parameters of these electrolytes an...Pattern recognition methods were used to treat the experimentally measured data of Pitzer’s coefficients of 107 electrolytes, to find the relationships between the ionic structural parameters of these electrolytes and Pitzer’s coefficients. It is found that these relationships can be approximately expressed as linear equations of four dimensionless numbers, (R_+/R_-), (R_++R_-)/Z_+Z_-, (Z_+/Z_-) and (R_t/R_l), where R_+ and R_- are the cationic and anionic radii respectively; Z_+ and Z_- are the cationic and anionic charge numbers respectively, and (R_t/R_l) denotes the nonsphericity of some non-spherical ions. Besides, it is found that the difference of the nuclear magnetic resonance measured rotational relaxation time of water molecules around cations and anions, |Δτ|, has good correlation with Pitzer’s coefficients. The relationships can be interpreted by the theory of corresponding states of ionic solutions. Based on the relationships, an example of application to some hydrometallurgical process was discussed.展开更多
A hierarchical retrieval scheme of the accessory image database is proposed based on textile industrial accessory contour feature and region feature. At first smallest enclosed rectangle[1] feature (degree of accessor...A hierarchical retrieval scheme of the accessory image database is proposed based on textile industrial accessory contour feature and region feature. At first smallest enclosed rectangle[1] feature (degree of accessory coordination) is used to filter the image database to decouple the image search scope. After the accessory contour information and region information are extracted, the fusion multi-feature of the centroid distance Fourier descriptor and distance distribution histogram is adopted to finish image retrieval accurately. All the features above are invariable under translation, scaling and rotation. Results from the test on the image database including 1,000 accessory images demonstrate that the method is effective and practical with high accuracy and fast speed.展开更多
An improved approach for JSEG is presented for unsupervised segmentation of homogeneous regions in gray-scale images. Instead of intensity quantization, an automatic classification method based on scale space-based cl...An improved approach for JSEG is presented for unsupervised segmentation of homogeneous regions in gray-scale images. Instead of intensity quantization, an automatic classification method based on scale space-based clustering is used for nonparametric clustering of image data set. Then EM algorithm with classification achieved by space-based classification scheme as initial data used to achieve Gaussian mixture modelling of image data set that is utilized for the calculation of soft J value. Original region growing algorithm is then used to segment the image based on the multiscale soft J-images. Experiments show that the new method can overcome the limitations of JSEG successfully.展开更多
A new trend in the development of medical image processing systems is to enhance the shar-ing of medical resources and the collaborative processing of medical specialists. This paper presents an architecture of medica...A new trend in the development of medical image processing systems is to enhance the shar-ing of medical resources and the collaborative processing of medical specialists. This paper presents an architecture of medical image dynamic collaborative processing on the distributed environment by combining the JAVA, CORBA (Common Object Request and Broker Architecture) and the MAS (Multi-Agents System) collaborative mechanism. The architecture allows medical specialists or applications to share records and cornmunicate with each other on the web by overcoming the shortcut of traditional approach using Common Gateway Interface (CGI) and client/server architecture, and can support the remote heterogeneous systems collaboration. The new approach im-proves the collaborative processing of medical data and applications and is able to enhance the in-teroperation among heterogeneous system. Research on the system will help the collaboration and cooperation among medical application systems distributed on the web, thus supply high quality medical service such as diagnosis and therapy to practicing specialists regardless of their actual geo-graphic location.展开更多
This paper discusses a new algorithm of sub-pixels image matching and analyzes the characteristics of resampling and surface fitting methods. In order to meet the matching demands and to alleviate the computation work...This paper discusses a new algorithm of sub-pixels image matching and analyzes the characteristics of resampling and surface fitting methods. In order to meet the matching demands and to alleviate the computation workload, the following improvement algorithms are used. First, resample the model n-times, putt out (2n-1) sub-models, and calculate the NCs between each sub-model and image. Then choose the maximum between the sub-model and the displacement corresponding to this sub-model which requires the sub-pixel displacement. Finally, put forward a new algorithm that combines the resampling with surface fitting methods. Experimental results show the validity of the algorithm.展开更多
This paper focuses on basic geometric and topological access methods, and computational operations implemented by various data objects. It covers such methods as inter-slices point matching, stream slices, sorting of ...This paper focuses on basic geometric and topological access methods, and computational operations implemented by various data objects. It covers such methods as inter-slices point matching, stream slices, sorting of octree blocks, cell operations and experimental results. At first, this paper discusses in detail the feature points matching of inter-slices. Then it introduces stream slices eigenfields and octree data structures theories. Next, it discusses cell operations and its data structure. Finally, it shows an experimental result. The innovations in the paper is the data structure of slices feature and cell feature, and the feature matching methods owns the properties both quickly and exactly.展开更多
Multi-modal histological image registration tasks pose significant challenges due to tissue staining operations causing partial loss and folding of tissue.Convolutional neural network(CNN)and generative adversarial ne...Multi-modal histological image registration tasks pose significant challenges due to tissue staining operations causing partial loss and folding of tissue.Convolutional neural network(CNN)and generative adversarial network(GAN)are pivotal inmedical image registration.However,existing methods often struggle with severe interference and deformation,as seen in histological images of conditions like Cushing’s disease.We argue that the failure of current approaches lies in underutilizing the feature extraction capability of the discriminator inGAN.In this study,we propose a novel multi-modal registration approach GAN-DIRNet based on GAN for deformable histological image registration.To begin with,the discriminators of two GANs are embedded as a new dual parallel feature extraction module into the unsupervised registration networks,characterized by implicitly extracting feature descriptors of specific modalities.Additionally,modal feature description layers and registration layers collaborate in unsupervised optimization,facilitating faster convergence and more precise results.Lastly,experiments and evaluations were conducted on the registration of the Mixed National Institute of Standards and Technology database(MNIST),eight publicly available datasets of histological sections and the Clustering-Registration-Classification-Segmentation(CRCS)dataset on the Cushing’s disease.Experimental results demonstrate that our proposed GAN-DIRNet method surpasses existing approaches like DIRNet in terms of both registration accuracy and time efficiency,while also exhibiting robustness across different image types.展开更多
Diagnostic ultrasound is a useful and noninvasive method in clinical medicine. Although due to its qualitative, sub- jective and experience-based nature, ultrasound image interpretation can be influenced by image cond...Diagnostic ultrasound is a useful and noninvasive method in clinical medicine. Although due to its qualitative, sub- jective and experience-based nature, ultrasound image interpretation can be influenced by image conditions such as scanning frequency and machine settings. In this paper, a novel method is proposed to extract the liver features using the joint features of fractal dimension and the entropies of texture edge co-occurrence matrix based on ultrasound images, which is not sensitive to changes in emission frequency and gain. Then, Fisher linear classifier and support vector machine are employed to test a group of 99 in-vivo liver fibrosis images from 18 patients, as well as other 273 liver images from 18 normal human volunteers.展开更多
Face recognition has attracted great interest due to its importance in many real-world applications. In this paper,we present a novel low-rank sparse representation-based classification(LRSRC) method for robust face r...Face recognition has attracted great interest due to its importance in many real-world applications. In this paper,we present a novel low-rank sparse representation-based classification(LRSRC) method for robust face recognition. Given a set of test samples, LRSRC seeks the lowest-rank and sparsest representation matrix over all training samples. Since low-rank model can reveal the subspace structures of data while sparsity helps to recognize the data class, the obtained test sample representations are both representative and discriminative. Using the representation vector of a test sample, LRSRC classifies the test sample into the class which generates minimal reconstruction error. Experimental results on several face image databases show the effectiveness and robustness of LRSRC in face image recognition.展开更多
基金Project (No. 60675023) supported by the National Natural Science Foundation of China
文摘Segmentation of the bladder in computerized tomography(CT) images is an important step in radiation therapy planning of prostate cancer. We present a new segmentation scheme to automatically delineate the bladder contour in CT images with three major steps. First,we use the mean shift algorithm to obtain a clustered image containing the rough contour of the bladder,which is then extracted in the second step by applying a region-growing algorithm with the initial seed point selected from a line-by-line scanning process. The third step is to refine the bladder contour more accurately using the rolling-ball algorithm. These steps are then extended to segment the bladder volume in a slice-by-slice manner. The obtained results were compared to manual segmentation by radiation oncologists. The average values of sensitivity,specificity,positive predictive value,negative predictive value,and Hausdorff distance are 86.5%,96.3%,90.5%,96.5%,and 2.8 pixels,respectively. The results show that the bladder can be accurately segmented.
基金supported by the National Natural Science Foundation of China(Grant Nos.61203094 and 61305042)the Natural Science Foundation of the United States(Grant Nos.CNS-1253424 and ECCS-1202225)+3 种基金the Science and Technology Foundation of Henan Province,China(Grant No.152102210048)the Foundation and Frontier Project of Henan Province,China(Grant No.162300410196)the Natural Science Foundation of Educational Committee of Henan Province,China(Grant No.14A413015)the Research Foundation of Henan University,China(Grant No.xxjc20140006)
文摘Recently, many image encryption algorithms based on chaos have been proposed. Most of the previous algorithms encrypt components R, G, and B of color images independently and neglect the high correlation between them. In the paper, a novel color image encryption algorithm is introduced. The 24 bit planes of components R, G, and B of the color plain image are obtained and recombined into 4 compound bit planes, and this can make the three components affect each other. A four-dimensional(4D) memristive hyperchaotic system generates the pseudorandom key streams and its initial values come from the SHA 256 hash value of the color plain image. The compound bit planes and key streams are confused according to the principles of genetic recombination, then confusion and diffusion as a union are applied to the bit planes,and the color cipher image is obtained. Experimental results and security analyses demonstrate that the proposed algorithm is secure and effective so that it may be adopted for secure communication.
基金the National Basic Research Program(973) of China (No. 2006CB701303)the National High Technology Research and Development Program(863) of China (No. 2006AA12Z105)
文摘In this paper,a technique based on image pyramid and Bayes rule for reducing noise effects in unsupervised change detection is proposed.By using Gaussian pyramid to process two multitemporal images respectively,two image pyramids are constructed.The difference pyramid images are obtained by point-by-point subtraction between the same level images of the two image pyramids.By resizing all difference pyramid images to the size of the original multitemporal image and then making product operator among them,a map being similar to the difference image is obtained.The difference image is generated by point-by-point subtraction between the two multitemporal images directly.At last,the Bayes rule is used to distinguish the changed pixels.Both synthetic and real data sets are used to evaluate the performance of the proposed technique.Experimental results show that the map from the proposed technique is more robust to noise than the difference image.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.41571417 and 61305042)the National Science Foundation of the United States(Grant Nos.CNS-1253424 and ECCS-1202225)+4 种基金the Science and Technology Foundation of Henan Province,China(Grant No.152102210048)the Foundation and Frontier Project of Henan Province,China(Grant No.162300410196)China Postdoctoral Science Foundation(Grant No.2016M602235)the Natural Science Foundation of Educational Committee of Henan Province,China(Grant No.14A413015)the Research Foundation of Henan University,China(Grant No.xxjc20140006)
文摘At present, many chaos-based image encryption algorithms have proved to be unsafe, few encryption schemes permute the plain images as three-dimensional（3D） bit matrices, and thus bits cannot move to any position, the movement range of bits are limited, and based on them, in this paper we present a novel image encryption algorithm based on 3D Brownian motion and chaotic systems. The architecture of confusion and diffusion is adopted. Firstly, the plain image is converted into a 3D bit matrix and split into sub blocks. Secondly, block confusion based on 3D Brownian motion（BCB3DBM）is proposed to permute the position of the bits within the sub blocks, and the direction of particle movement is generated by logistic-tent system（LTS）. Furthermore, block confusion based on position sequence group（BCBPSG） is introduced, a four-order memristive chaotic system is utilized to give random chaotic sequences, and the chaotic sequences are sorted and a position sequence group is chosen based on the plain image, then the sub blocks are confused. The proposed confusion strategy can change the positions of the bits and modify their weights, and effectively improve the statistical performance of the algorithm. Finally, a pixel level confusion is employed to enhance the encryption effect. The initial values and parameters of chaotic systems are produced by the SHA 256 hash function of the plain image. Simulation results and security analyses illustrate that our algorithm has excellent encryption performance in terms of security and speed.
文摘A semiautomatic segmentation method based on active contour is proposed for computed tomography (CT) image series. First, to get initial contour, one image slice was segmented exactly by C-V method based on Mumford-Shah model. Next, the computer will segment the nearby slice automatically using the snake model one by one. During segmenting of image slices, former slice boundary, as next slice initial contour, may cross over next slice real boundary and never return to right position. To avoid contour skipping over, the distance variance between two slices is evaluated by an threshold, which decides whether to initiate again. Moreover, a new improved marching cubes (MC) algorithm based on 2D images series segmentation boundary is given for 3D image reconstruction. Compared with the standard method, the proposed algorithm reduces detecting time and needs less storing memory. The effectiveness and capabilities of the algorithm were illustrated by experimental results.
基金the National Basic Research Program (973) of China(No.2011CB302203)the National Natural Science Foundation of China(No.60833009)
文摘In this paper, we introduce a novel class of coplanar conics, the pencil of which can doubly contact to calibrate camera and estimate pose. We first analyze the properties of con-axes and con-eccentricity ellipses, which consist of a naturM extending pattern of concentric circles. Then the general case that two ellipses have two repeated complex intersection points is presented. This degenerate configuration results in a one-parameter family of homographies which map the planar pattern to its image. Although it is unable to compute the complete homography, an indirect 3-degree polynomial or 5-degree polynomial constraint on intrinsic parameters from one image can also be used for camera calibration and pose estimation under the minimal conditions. Furthermore, this nonlinear problem can be treated as a polynomial optimization problem （POP） and the global optimization solution can be also obtained by using SparsePOP （a sparse semidefinite programming relaxation of POPs）, Finally, the experiments with simulated data and real images are shown to verify the correctness and robustness of the proposed technique.
文摘Taking into account the demands of hyperspectral remote sensing(RS) image retrieval and processing, some encoding methods of spectral vector including direct encoding, feature-based encoding and tree-based encoding methods are proposed and compared. In direct encoding, based on the analysis of binary encoding and quad-value encoding, decimal encoding is proposed. It is proved that quad-value encoding and decimal encoding are suitable to fast processing and retrieval. In absorption feature-based encoding method, five common metrics are compared. Because locations of reflection/absorption features are sensitive to noise, this method is not very effective in retrieval. In tree-based encoding methods, bitree, quadtree, octree and hextree are proposed and discussed. It is proved that 2-level octree and 2-level hextree are more effective than bitree and quadtree. Finally, quad-value encoding, decimal encoding, 2-level octree and 2-level hextree are proposed in spectral vectors encoding, similarity measure and hyperspectral RS image retrieval.
基金the National Natural Science Foundation of China (No. 60675017)the National Basic Research Program (973) of China (No. 2006CB303103)
文摘Automatic recognition of artists is very important in acoustic music indexing, browsing, and contentbased acoustic music retrieving, but synchronously it is still a challenging errand to extract the most representative and salient attributes to depict diversiform artists. In this paper, we developed a novel system to complete the reorganization of artist automatically. The proposed system can efficiently identify the artist's voice of a raw song by analyzing substantive features extracted from both pure music and singing song mixed with accompanying music. The experiments on different genres of songs illustrate that the proposed system is possible.
文摘This paper addresses the application of hand gesture recognition in monocular image sequences using Active Appearance Model （AAM）, For this work, the proposed algorithm is composed of constricting AAMs and fitting the models to the interest region. In training stage, according to the manual labeled feature points, the relative AAM is constructed and the corresponding average feature is obtained. In recognition stage, the interesting hand gesture region is firstly segmented by skin and movement cues. Secondly, the models are fitted to the image that includes the hand gesture, and the relative features are extracted. Thirdly, the classification is done by comparing the extracted features and average features. 30 different gestures of Chinese sign language are applied for testing the effectiveness of the method. The Experimental results are given indicating good performance of the algorithm.
文摘The trained Gaussian mixture model is used to make skincolour segmentation for the input image sequences. The hand gesture region is extracted, and the relative normalization images are obtained by interpolation operation. To solve the proem of hand gesture recognition, Fuzzy-Rough based nearest neighbour（RNN） algorithm is applied for classification. For avoiding the costly compute, an improved nearest neighbour classification algorithm based on fuzzy-rough set theory （FRNNC） is proposed. The algorithm employs the represented cluster points instead of the whole training samples, and takes the hand gesture data＇s fuzziness and the roughness into account, so the campute spending is decreased and the recognition rate is increased. The 30 gestures in Chinese sign language alphabet are used for approving the effectiveness of the proposed algorithm. The recognition rate is 94.96%, which is better than that of KNN （K nearest neighbor）and Fuzzy- KNN （Fuzzy K nearest neighbor）.
文摘Pattern recognition methods were used to treat the experimentally measured data of Pitzer’s coefficients of 107 electrolytes, to find the relationships between the ionic structural parameters of these electrolytes and Pitzer’s coefficients. It is found that these relationships can be approximately expressed as linear equations of four dimensionless numbers, (R_+/R_-), (R_++R_-)/Z_+Z_-, (Z_+/Z_-) and (R_t/R_l), where R_+ and R_- are the cationic and anionic radii respectively; Z_+ and Z_- are the cationic and anionic charge numbers respectively, and (R_t/R_l) denotes the nonsphericity of some non-spherical ions. Besides, it is found that the difference of the nuclear magnetic resonance measured rotational relaxation time of water molecules around cations and anions, |Δτ|, has good correlation with Pitzer’s coefficients. The relationships can be interpreted by the theory of corresponding states of ionic solutions. Based on the relationships, an example of application to some hydrometallurgical process was discussed.
文摘A hierarchical retrieval scheme of the accessory image database is proposed based on textile industrial accessory contour feature and region feature. At first smallest enclosed rectangle[1] feature (degree of accessory coordination) is used to filter the image database to decouple the image search scope. After the accessory contour information and region information are extracted, the fusion multi-feature of the centroid distance Fourier descriptor and distance distribution histogram is adopted to finish image retrieval accurately. All the features above are invariable under translation, scaling and rotation. Results from the test on the image database including 1,000 accessory images demonstrate that the method is effective and practical with high accuracy and fast speed.
文摘An improved approach for JSEG is presented for unsupervised segmentation of homogeneous regions in gray-scale images. Instead of intensity quantization, an automatic classification method based on scale space-based clustering is used for nonparametric clustering of image data set. Then EM algorithm with classification achieved by space-based classification scheme as initial data used to achieve Gaussian mixture modelling of image data set that is utilized for the calculation of soft J value. Original region growing algorithm is then used to segment the image based on the multiscale soft J-images. Experiments show that the new method can overcome the limitations of JSEG successfully.
基金the National Nature Science Foundation of China.
文摘A new trend in the development of medical image processing systems is to enhance the shar-ing of medical resources and the collaborative processing of medical specialists. This paper presents an architecture of medical image dynamic collaborative processing on the distributed environment by combining the JAVA, CORBA (Common Object Request and Broker Architecture) and the MAS (Multi-Agents System) collaborative mechanism. The architecture allows medical specialists or applications to share records and cornmunicate with each other on the web by overcoming the shortcut of traditional approach using Common Gateway Interface (CGI) and client/server architecture, and can support the remote heterogeneous systems collaboration. The new approach im-proves the collaborative processing of medical data and applications and is able to enhance the in-teroperation among heterogeneous system. Research on the system will help the collaboration and cooperation among medical application systems distributed on the web, thus supply high quality medical service such as diagnosis and therapy to practicing specialists regardless of their actual geo-graphic location.
文摘This paper discusses a new algorithm of sub-pixels image matching and analyzes the characteristics of resampling and surface fitting methods. In order to meet the matching demands and to alleviate the computation workload, the following improvement algorithms are used. First, resample the model n-times, putt out (2n-1) sub-models, and calculate the NCs between each sub-model and image. Then choose the maximum between the sub-model and the displacement corresponding to this sub-model which requires the sub-pixel displacement. Finally, put forward a new algorithm that combines the resampling with surface fitting methods. Experimental results show the validity of the algorithm.
文摘This paper focuses on basic geometric and topological access methods, and computational operations implemented by various data objects. It covers such methods as inter-slices point matching, stream slices, sorting of octree blocks, cell operations and experimental results. At first, this paper discusses in detail the feature points matching of inter-slices. Then it introduces stream slices eigenfields and octree data structures theories. Next, it discusses cell operations and its data structure. Finally, it shows an experimental result. The innovations in the paper is the data structure of slices feature and cell feature, and the feature matching methods owns the properties both quickly and exactly.
文摘Multi-modal histological image registration tasks pose significant challenges due to tissue staining operations causing partial loss and folding of tissue.Convolutional neural network(CNN)and generative adversarial network(GAN)are pivotal inmedical image registration.However,existing methods often struggle with severe interference and deformation,as seen in histological images of conditions like Cushing’s disease.We argue that the failure of current approaches lies in underutilizing the feature extraction capability of the discriminator inGAN.In this study,we propose a novel multi-modal registration approach GAN-DIRNet based on GAN for deformable histological image registration.To begin with,the discriminators of two GANs are embedded as a new dual parallel feature extraction module into the unsupervised registration networks,characterized by implicitly extracting feature descriptors of specific modalities.Additionally,modal feature description layers and registration layers collaborate in unsupervised optimization,facilitating faster convergence and more precise results.Lastly,experiments and evaluations were conducted on the registration of the Mixed National Institute of Standards and Technology database(MNIST),eight publicly available datasets of histological sections and the Clustering-Registration-Classification-Segmentation(CRCS)dataset on the Cushing’s disease.Experimental results demonstrate that our proposed GAN-DIRNet method surpasses existing approaches like DIRNet in terms of both registration accuracy and time efficiency,while also exhibiting robustness across different image types.
基金Supported by National High Technology Research and Development Program of China （863 Program） （2007AA11Z221）, International Cooperation Project of Shanghai （08210707500）, and Natural Science Foundation of Shanghai.（08ZR1420600） . _
文摘Diagnostic ultrasound is a useful and noninvasive method in clinical medicine. Although due to its qualitative, sub- jective and experience-based nature, ultrasound image interpretation can be influenced by image conditions such as scanning frequency and machine settings. In this paper, a novel method is proposed to extract the liver features using the joint features of fractal dimension and the entropies of texture edge co-occurrence matrix based on ultrasound images, which is not sensitive to changes in emission frequency and gain. Then, Fisher linear classifier and support vector machine are employed to test a group of 99 in-vivo liver fibrosis images from 18 patients, as well as other 273 liver images from 18 normal human volunteers.
基金supported by National Natural Science Foundation of China(No.61374134)the key Scientific Research Project of Universities in Henan Province,China(No.15A413009)
文摘Face recognition has attracted great interest due to its importance in many real-world applications. In this paper,we present a novel low-rank sparse representation-based classification(LRSRC) method for robust face recognition. Given a set of test samples, LRSRC seeks the lowest-rank and sparsest representation matrix over all training samples. Since low-rank model can reveal the subspace structures of data while sparsity helps to recognize the data class, the obtained test sample representations are both representative and discriminative. Using the representation vector of a test sample, LRSRC classifies the test sample into the class which generates minimal reconstruction error. Experimental results on several face image databases show the effectiveness and robustness of LRSRC in face image recognition.
