- Full text PDF available (39)
- This year (0)
- Last 5 years (13)
- Last 10 years (25)
Journals and Conferences
Data Set Used
Moment invariants have been frequently used as features for shape recognition. They are computed based on the information provided by both the shape boundary and its interior region. Although several fast algorithms for computing traditional moment invariants have been proposed, none has ever shown the theoretical results of moment invariants computed based… (More)
Recurrence after hepatocellular carcinoma (HCC) resection is the major obstacle to improved survival. The presence of vascular invasion (VI) in pathology specimens is a well-known unfavorable prognostic factor for HCC recurrence. Though some VI-related genes have been reported, their association with recurrence-free survival is not known. We hypothesized… (More)
The design of a pattern recognition system requires careful attention to error estimation. The error rate is the most important descriptor of a classifier's performance. The commonly used estimates of error rate are based on the holdout method, the resubstitution method, and the leave-one-out method. All suffer either from large bias or large variance and… (More)
A new hybrid method is presented that combines the scale space filter (SSF) and Markov random field (MRF) for color image segmentation. The fundamental idea of the SSF is to use the convolution of Gaussian functions and image-histogram to generate a scale space image and then find the proper interval bounded by the local extrema of the derivatives. The… (More)
Textures have been used in various applications, such as carpet quality control, region recognition in satellite images, and body painting control in the vehicle industry. This paper studies texture synthesis. We survey the algorithms for synthesizing textures that have proposed over the past two decades. A variety of algorithms associated with synthesized… (More)
Before rendering 2D or 3D fractals with iterated function systems, it is necessary to calculate the bounding extent of fractals. We develop a new algorithm to compute the bounding box which closely contains the entire attractor of an iterated function system.
A new steganographic method for data hiding in jig swap puzzle images is proposed. First, a color image is taken as input and divided into blocks. Second, each block is rearranged to a new position according to the secret data and a stegokey. The resulting image is a perfect jig swap puzzle. The original image is needed for extracting the secret data. Under… (More)
This paper attempts to give a recipe for selecting one of the popular image compression algorithms based on (a) Wavelet, (b) JPEG/DCT, (c) VQ, and (d) Fractal approaches. We review and discuss the advantages and disadvantages of these algorithms for compressing gray-scale images, give an experimental comparison on four 256×256 commonly used images, Jet,… (More)
Experimental results of applying two similarity measurements , Euclidean distance and chord distance, to test a set of six Brodatz's textures are reported. Experiments show that in addition to feature extraction, A similarity measurement between images should be simultaneously considered, We also review some other similarity measurements.