中国科学院机构知识库网格系统: 检索

浏览/检索结果: 共12条，第1-10条

帮助

条数/页：排序方式：
	Novel C-17 spirost protostane-type triterpenoids from Alisma plantago-aquatica with anti-inflammatory activity in Caco-2 cells 期刊论文 OAI收割 ACTA PHARMACEUTICA SINICA B, 2019, 卷号: 9, 期号: 4, 页码: 809-818 作者: Jin, Qinghao; Zhang, Jianqing; Hou, Jinjun; Lei, Min; Liu, Chen \| 收藏 \| 浏览/下载：39/0 \| 提交时间：2020/07/01 Allow plantago-aqua ea Linn. Protostane-type triterpenoids Caco-2 cells EPS-induced NO production
	Enhancement of phase retrieval capability in ptychography by using strongly scattering property of the probe-generating device 期刊论文 OAI收割 OPTICS EXPRESS, 2018, 卷号: 26, 期号: 23, 页码: 30128-30145 作者: Zhang, JH; Fan, JD; Sun, ZB; Yao, SK; Tong, YJ \| 收藏 \| 浏览/下载：36/0 \| 提交时间：2019/12/17 X-RAY CRYSTALLOGRAPHY TOMOGRAPHY ALGORITHM ALLOW CELLS FIELD
	Rapid cell separation in double spiral microfluidic channels 会议论文 OAI收割 23rd International Congress of Theoretical and Applied Mechanics, 中国北京/Beijing, China, 2012-08-19 作者: Liu C; Sun JS; Jiang XY; Hu GQ(胡国庆) 收藏 \| 浏览/下载：33/0 \| 提交时间：2014/04/02 separation Rapid double spiral resulting micron simulation mixture Platform force beads inertial rates ental traditional validated different format allow model
	TextureGrow: Object recognition and segmentation with limit prior knowledge (EI CONFERENCE) 会议论文 OAI收割 2011 International Conference on Network Computing and Information Security, NCIS 2011, May 14, 2011 - May 15, 2011, Guilin, Guangxi, China Yao Z.; Han Q. 收藏 \| 浏览/下载：33/0 \| 提交时间：2013/03/25 In this paper we present a new method for automatically visual recognition and semantic segmentation of photographs. Our automatically and rapidly approach based on Cellular Automation. Most of the analysis and description of recognition and segmentation are based on statistical or structural properties of this attribute most of them need plenty of samples and prior Knowledge. In this paper within a few evident samples (not too many) we can first get the texture feature of each component and the structures then select the approximately location randomly of the objects or patches of them then we use the Cellular Automata algorithm to "grow" based on texture of different objects. The grow progress will stop When texture grow to the boundary. By this steps a new method is found which allow us use very few samples and low lever experience and get a rapidly and accuracy way to recognize and segment objects. We found that this new propose gives competitive results with limited experience and samples. 2011 IEEE.
	A multi-channel, area-efficient, audio sampling rate interpolator (EI CONFERENCE) 会议论文 OAI收割 2009 8th IEEE International Conference on ASIC, ASICON 2009, October 20, 2009 - October 23, 2009, Changsha, China 作者: Wang D. 收藏 \| 浏览/下载：37/0 \| 提交时间：2013/03/25 The area and power consumption of sampled rate converter are governed largely by associated digital interpolationfilters. This paper presents a novel multi-channel area-efficient audio sampling rate interpolator whose conversion ratio is 1:2 and 1:4. Several architectural and implementation features reduces the complexity of the filter and allow its realization in a die area of 0.032mm2 in 0.18 m technology meanwhile timing multiplexer scheme reduces clock frequency to minimum. Experiments show proposed methods could not only saved hardware resources but also reduce power consumption so it is very suitable for consumer electronics. 2009 IEEE.
	Integrated intensity, orientation code and spatial information for robust tracking (EI CONFERENCE) 会议论文 OAI收割 2007 2nd IEEE Conference on Industrial Electronics and Applications, ICIEA 2007, May 23, 2007 - May 25, 2007, Harbin, China 作者: Wang Y.; Wang Y.; Wang Y.; Wang Y.; Wang Y. 收藏 \| 浏览/下载：38/0 \| 提交时间：2013/03/25 real-time tracking is an important topic in computer vision. Conventional single cue algorithms typically fail outside limited tracking conditions. Integration of multimodal visual cues with complementary failure modes allows tracking to continue despite losing individual cues. In this paper we combine intensity orientation codes and special information to form a new intensity-orientation codes-special (IOS) feature to represent the target. The intensity feature is not affected by the shape variance of object and has good stability. Orientation codes matching is robust for searching object in cluttered environments even in the cases of illumination fluctuations resulting from shadowing or highlighting etc The spatial locations of the pixels are used which allow us to take into account the spatial information which is lost in traditional histogram. Histograms of intensity orientation codes and spatial information are employed for represent the target Mean shift algorithm is a nonparametric density estimation method. The fast and optimal mode matching can be achieved by this method. In order to reduce the compute time we use the mean shift procedure to reach the target localization. Experiment results show that the new method can successfully cope with clutter partial occlusions illumination change and target variations such as scale and rotation. The computational complexity is very low. If the size of the target is 3628 pixels it only needs 12ms to complete the method. 2007 IEEE.
	The compression and storage method of the same kind of medical images-DPCM (EI CONFERENCE) 会议论文 OAI收割 4th International Conference on Photonics and Imaging in Biology and Medicine, September 3, 2005 - September 6, 2005, Tianjin, China 作者: Liu H.; Liu H.; Liu H. 收藏 \| 浏览/下载：21/0 \| 提交时间：2013/03/25 Medical imaging has started to take advantage of digital technology opening the way for advanced medical imaging and teleradiology. Medical images however require large amounts of memory. At over 1 million bytes per image a typical hospital needs a staggering amount of memory storage (over one trillion bytes per year) and transmitting an image over a network (even the promised superhighway) could take minutes - too slow for interactive teleradiology. This calls for image compression to reduce significantly the amount of data needed to represent an image. Several compression techniques with different compression ratio have been developed. However the lossless techniques which allow for perfect reconstruction of the original images yield modest compression ratio while the techniques that yield higher compression ratio are lossy that is the original image is reconstructed only approximately Medical imaging poses the great challenge of having compression algorithms that are lossless (for diagnostic and legal reasons) and yet have high compression ratio for reduced storage and transmission time. To meet this challenge we are developing and studying some compression schemes which are either strictly lossless or diagnostically lossless taking advantage of the peculiarities of medical images and of the medical practice. In order to increase the Signal to-Noise Ratio (SNR) by exploitation of correlations within the source signal a method of combining differential pulse code modulation (DPCM) is presented.
	Lossless wavelet compression on medical image (EI CONFERENCE) 会议论文 OAI收割 4th International Conference on Photonics and Imaging in Biology and Medicine, September 3, 2005 - September 6, 2005, Tianjin, China 作者: Liu H.; Liu H.; Liu H. 收藏 \| 浏览/下载：59/0 \| 提交时间：2013/03/25 An increasing number of medical imagery is created directly in digital form. Such as Clinical image Archiving and Communication Systems (PACS). as well as telemedicine networks require the storage and transmission of this huge amount of medical image data. Efficient compression of these data is crucial. Several lossless and lossy techniques for the compression of the data have been proposed. Lossless techniques allow exact reconstruction of the original imagery while lossy techniques aim to achieve high compression ratios by allowing some acceptable degradation in the image. Lossless compression does not degrade the image thus facilitating accurate diagnosis of course at the expense of higher bit rates i.e. lower compression ratios. Various methods both for lossy (irreversible) and lossless (reversible) image compression are proposed in the literature. The recent advances in the lossy compression techniques include different methods such as vector quantization wavelet coding neural networks and fractal coding. Although these methods can achieve high compression ratios (of the order 50:1 or even more) they do not allow reconstructing exactly the original version of the input data. Lossless compression techniques permit the perfect reconstruction of the original image but the achievable compression ratios are only of the order 2:1 up to 4:1. In our paper we use a kind of lifting scheme to generate truly loss-less non-linear integer-to-integer wavelet transforms. At the same time we exploit the coding algorithm producing an embedded code has the property that the bits in the bit stream are generated in order of importance so that all the low rate codes are included at the beginning of the bit stream. Typically the encoding process stops when the target bit rate is met. Similarly the decoder can interrupt the decoding process at any point in the bil stream and still reconstruct the image. Therefore a compression scheme generating an embedded code can start sending over the network the coarser version of the image first and continues with the progressive transmission of the refinement details. Experimental results show that our method can get a perfect performance in compression ratio and reconstructive image.
	An algorithm for domain axiom plan recognition based on extended goal graph (EI CONFERENCE) 会议论文 OAI收割 International Conference on Machine Learning and Cybernetics, ICMLC 2005, August 18, 2005 - August 21, 2005, Guangzhou, China 作者: Chen J. 收藏 \| 浏览/下载：62/0 \| 提交时间：2013/03/25 This paper introduces a novel algorithm for domain axiom plan recognition. Using a method of domain axiom inference expansion the algorithm can reconstruct goal graph to extend and improve original algorithm to allow plan recognition with domain axiom. The algorithm based on goal graph needs no plan library so it can't be suffered from the problems in the acquisition and hand-coding of large plan libraries. It also has no problem in searching the plan space of exponential size. 2005 IEEE.