Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Iftekhar Hussain

dblp:28/2603 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2018
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 5 · 4 first-authorComputer networks · 1Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Segmentation and scene understanding · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › Segmentation and scene understanding
image segmentation
0.011997
A bond percolation-based model for image segmentation · IEEE Trans. Image Process. 1997
Computer vision › Segmentation and scene understanding › image segmentation › probabilistic segmentation
markov random field segmentation
0.011997
A bond percolation-based model for image segmentation · IEEE Trans. Image Process. 1997

Methods — techniques the papers use, named apart from their topics

renormalization group transformation · 0.0gibbs-markov model · 0.0
YearPublicationVenuePosition
2018 Multicasting in software defined networks: A comprehensive survey
Zainab AlSaeed, Iftekhar Hussain
J. Netw. Comput. Appl.3
1997 A bond percolation-based model for image segmentation
abstract
This work presents a novel bond percolation-based approach to determine the clique potential parameters of a Gibbs-Markov model as a function of local characteristics of the underlying image. Using the renormalization group transformation, a multiscale description of the clique potential parameters is formed and used to obtain multiresolution image segmentation.
Iftekhar Hussain, Todd R. Reed
IEEE Trans. Image Process.1
1996 Correction to "Bond Percolation-Based Gibbs-Markov Random Fields for Image Segmentation"
Iftekhar Hussain, Todd R. Reed
IEEE Signal Process. Lett.1
1995 Bond percolation-based Gibbs-Markow random fields for image segmentation
abstract
A new bond percolation-based approach is presented to determine the clique potential parameters of a Gibbs-Markov random field (GMRF) model used in image segmentation. Previously, experimentally determined fixed values were used for these parameters independent of the underlying image. Using the proposed approach, these parameters are now derived as a function of local characteristics of the image under consideration. An additional salient feature of this method is its suitability for a renormalization group approach to multi-scale description of the clique potential parameters.>
Iftekhar Hussain, Todd R. Reed
IEEE Signal Process. Lett.1
1994 Segmentation-Based Nonlinear Image Smoothing
abstract
One of the most commonly used image enhancement techniques is noise removal. The goal of a noise removal method is to remove noise while preserving the image structure. In this paper a segmentation-based image enhancement method is presented which confines image smoothing to the region interiors. Since the structure in the image is captured by segmentation, confining image smoothing to the region interiors does not cause any significant loss of this structure. In fact, region confined averaging enhances the contrast between boundaries, and hence sharpens the image at these boundaries. The result is an image with reduced noise, but that appears sharper than the original.>
Iftekhar Hussain, Todd R. Reed
ICIP (2)1
1992 Perceptually Based Coding of Monochrome and Color Still Images
abstract
The authors describe a human visual perception approach and report some results for this problem. The approach is based on the differential quantization of images, in which smooth approximations are subtracted from the image prior to quantization. They consider two such approximations. The first one is an approximation by splines obtained from a sparse and fixed subsampled array of the image. The second one segments the image into piecewise constant regions on the basis of the local activity of the image. Both these approximations result in remainders of residual images where large errors are localized in portions of the image of high activity. Because of visual masking the remainder image can now be coarsely quantized without visual impairment to the reconstructed image. The coarsely quantized remainder is now encoded in an error free manner. In such a perceptually based encoding method the mean square error is now dependent on the activity of the image.>
Todd R. Reed, V. Ralph Algazi, Gary E. Ford, Iftekhar Hussain
Data Compression Conference4