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

Mehran Moshfeghi

dblp:61/2278 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2004
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorComputer networks · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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.

Computer networks
1 paper
Physical-layer communications · 77% Wireless networking · 23%
Computer graphics and multimedia
2 papers
Image and video processing · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › MIMO › space-time coding
space-time block codes
0.012004
Power optimization of wireless media systems with space-time block codes · IEEE Trans. Image Process. 2004
Image and video processing › image registration
deformable image registration
0.011994
Three-dimensional elastic matching of volumes · IEEE Trans. Image Process. 1994
Image and video processing › image registration
elastic matching
0.011994
Three-dimensional elastic matching of volumes · IEEE Trans. Image Process. 1994
Image and video processing
image registration
0.011994
Three-dimensional elastic matching of volumes · IEEE Trans. Image Process. 1994

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

rayleigh fading channel model · 0.1gilbert-elliott loss model · 0.1gauss-markov source model · 0.1warping · 0.0triangular patch surface models · 0.0active contours · 0.0
YearPublicationVenuePosition
2004 Power optimization of wireless media systems with space-time block codes
abstract
We present analytical and numerical solutions to the problem of power control in wireless media systems with multiple antennas. We formulate a set of optimization problems aimed at minimizing total power consumption of wireless media systems subject to a given level of QoS and an available bit rate. Our formulation takes into consideration the power consumption related to source coding, channel coding, and transmission of multiple-transmit antennas. In our study, we consider Gauss-Markov and video source models, Rayleigh fading channels along with the Bernoulli/Gilbert-Elliott loss models, and space-time block codes.
Homayoun Yousefi'zadeh, Hamid Jafarkhani, Mehran Moshfeghi
IEEE Trans. Image Process.3
2003 Power optimization of memoryless wireless media systems with space-time block codes
abstract
In this research article, we present an analytical solution to the problem of power control in wireless media systems with multiple transmit antennas. We formulate an optimization problem aimed at minimizing total power consumption of wireless media systems subject to a given level of quality of service (QoS) and an available bit rate. Our formulation takes into consideration the power consumption related to source coding, channel coding, and transmission of multiple transmit antennas relying on the H.263 source coding standard, Rayleigh fading channels along with the Bernoulli loss model, and space-time block codes respectively.
Hamid Jafarkhani, Homayoun Yousefi'zadeh, Mehran Moshfeghi
GLOBECOM3
1994 Three-dimensional elastic matching of volumes
abstract
Registering volumes that have been deformed with respect to each other involves recovery of the deformation. A 3-D elastic matching algorithm has been developed to use surface information for registering volumes. Surface extraction is performed in two steps: extraction of contours in 2-D image planes using active contours, and forming triangular patch surface models from the stack of 2-D contours. One volume is modeled as being deformed with respect to another goal volume. Correspondences between surfaces in the two image volumes are used to warp the deformed volume towards its goal. This process of contour extraction, surface formation and matching, and warping is repeated a number of times, with decreasing image volume stiffness. As the iterations continue the stretched volume is refined towards its goal volume. Registration examples of deformed volumes are presented.
Mehran Moshfeghi, Surendra Ranganath, Ken Nawyn
IEEE Trans. Image Process.1
1993 Directional interpolation for magnetic resonance angiography data
abstract
Interpolation is a necessary step in magnetic resonance (MR) angiography when the center-to-center spacing between the MR slices is larger than the in-plane pixel size of the slices. Conventional methods interpolate normal to the slice only, causing a staircase artifact for oblique vessels. Reconstructions of these vessels demonstrate jagged structures with reduced resolution and contrast. A directional interpolation scheme is presented here, in which the orientation of interpolation is determined locally by template matching. By aligning this orientation with the vessels, the algorithm reconstructs the correct shape and contrast for oblique vessels. Simulations and application of the algorithm to clinical MR angiography data demonstrate the advantages of directional interpolation over conventional methods. Examples are shown of combining the algorithm with background suppression, where the background values in the slices are suppressed prior to projection and directional interpolation. This results in even higher vessel-to-background contrast.
Mehran Moshfeghi
IEEE Trans. Medical Imaging1
1991 Elastic matching of multimodality medical images
Mehran Moshfeghi
CVGIP Graph. Model. Image Process.1